/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml --traceabstraction.assert.codeblocks.term.scoring.heuristic BIGGEST_EQUIVALENCE_CLASS --traceabstraction.assert.codeblocks.term.scoring.heuristic.partitioning.strategy FIXED_NUM_PARTITIONS --traceabstraction.assert.codeblocks.term.scoring.heuristic.number.of.partitions 4 --traceabstraction.trace.refinement.strategy CAMEL_SMT_AM -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/verifythis/tree_del_iter.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-79ed534 [2020-07-20 06:12:57,432 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-20 06:12:57,435 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-20 06:12:57,454 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-20 06:12:57,454 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-20 06:12:57,457 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-20 06:12:57,459 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-20 06:12:57,474 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-20 06:12:57,476 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-20 06:12:57,477 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-20 06:12:57,478 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-20 06:12:57,482 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-20 06:12:57,482 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-20 06:12:57,483 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-20 06:12:57,488 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-20 06:12:57,490 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-20 06:12:57,493 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-20 06:12:57,496 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-20 06:12:57,498 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-20 06:12:57,504 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-20 06:12:57,509 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-20 06:12:57,513 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-20 06:12:57,514 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-20 06:12:57,515 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-20 06:12:57,522 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-20 06:12:57,522 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-20 06:12:57,523 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-20 06:12:57,526 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-20 06:12:57,527 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-20 06:12:57,528 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-20 06:12:57,528 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-20 06:12:57,530 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-20 06:12:57,531 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-20 06:12:57,532 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-20 06:12:57,533 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-20 06:12:57,533 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-20 06:12:57,534 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-20 06:12:57,534 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-20 06:12:57,535 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-20 06:12:57,535 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-20 06:12:57,537 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-20 06:12:57,538 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-20 06:12:57,567 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-20 06:12:57,567 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-20 06:12:57,572 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-20 06:12:57,573 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-20 06:12:57,573 INFO L138 SettingsManager]: * Use SBE=true [2020-07-20 06:12:57,573 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-20 06:12:57,574 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-20 06:12:57,574 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-20 06:12:57,574 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-20 06:12:57,574 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-20 06:12:57,576 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-20 06:12:57,576 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-20 06:12:57,576 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-20 06:12:57,577 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-20 06:12:57,577 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-20 06:12:57,577 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-20 06:12:57,577 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-20 06:12:57,578 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-20 06:12:57,578 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-20 06:12:57,578 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-20 06:12:57,578 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-20 06:12:57,578 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-20 06:12:57,579 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-20 06:12:57,579 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-20 06:12:57,579 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-20 06:12:57,579 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-20 06:12:57,579 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 06:12:57,579 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-20 06:12:57,580 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-20 06:12:57,580 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Assert CodeBlocks Term Scoring Heuristic -> BIGGEST_EQUIVALENCE_CLASS Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Assert CodeBlocks Term Scoring Heuristic Partitioning Strategy -> FIXED_NUM_PARTITIONS Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Assert CodeBlocks Term Scoring Heuristic number of partitions -> 4 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> CAMEL_SMT_AM [2020-07-20 06:12:57,923 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-20 06:12:57,936 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-20 06:12:57,942 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-20 06:12:57,943 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-20 06:12:57,943 INFO L275 PluginConnector]: CDTParser initialized [2020-07-20 06:12:57,944 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/verifythis/tree_del_iter.c [2020-07-20 06:12:58,023 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/681ab68f7/b81a79df2354412d8af390e8511f7c99/FLAG2cadec036 [2020-07-20 06:12:58,562 INFO L306 CDTParser]: Found 1 translation units. [2020-07-20 06:12:58,565 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/verifythis/tree_del_iter.c [2020-07-20 06:12:58,574 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/681ab68f7/b81a79df2354412d8af390e8511f7c99/FLAG2cadec036 [2020-07-20 06:12:58,900 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/681ab68f7/b81a79df2354412d8af390e8511f7c99 [2020-07-20 06:12:58,910 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-20 06:12:58,913 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-20 06:12:58,914 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-20 06:12:58,915 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-20 06:12:58,918 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-20 06:12:58,919 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 06:12:58" (1/1) ... [2020-07-20 06:12:58,923 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@267c9c8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:12:58, skipping insertion in model container [2020-07-20 06:12:58,923 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 06:12:58" (1/1) ... [2020-07-20 06:12:58,931 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-20 06:12:58,952 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-20 06:12:59,162 WARN L1484 CHandler]: Possible shadowing of function min [2020-07-20 06:12:59,179 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-20 06:12:59,196 INFO L203 MainTranslator]: Completed pre-run [2020-07-20 06:12:59,319 WARN L1484 CHandler]: Possible shadowing of function min [2020-07-20 06:12:59,331 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-20 06:12:59,354 INFO L208 MainTranslator]: Completed translation [2020-07-20 06:12:59,355 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:12:59 WrapperNode [2020-07-20 06:12:59,355 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-20 06:12:59,356 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-20 06:12:59,356 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-20 06:12:59,356 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-20 06:12:59,369 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:12:59" (1/1) ... [2020-07-20 06:12:59,369 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:12:59" (1/1) ... [2020-07-20 06:12:59,381 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:12:59" (1/1) ... [2020-07-20 06:12:59,382 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:12:59" (1/1) ... [2020-07-20 06:12:59,401 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:12:59" (1/1) ... [2020-07-20 06:12:59,412 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:12:59" (1/1) ... [2020-07-20 06:12:59,416 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:12:59" (1/1) ... [2020-07-20 06:12:59,420 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-20 06:12:59,426 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-20 06:12:59,427 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-20 06:12:59,427 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-20 06:12:59,428 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:12:59" (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:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-20 06:12:59,494 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-20 06:12:59,494 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-20 06:12:59,494 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_cycle_if_not [2020-07-20 06:12:59,494 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-20 06:12:59,494 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_tree [2020-07-20 06:12:59,495 INFO L138 BoogieDeclarations]: Found implementation of procedure min [2020-07-20 06:12:59,495 INFO L138 BoogieDeclarations]: Found implementation of procedure tree_del [2020-07-20 06:12:59,495 INFO L138 BoogieDeclarations]: Found implementation of procedure tree_inorder [2020-07-20 06:12:59,495 INFO L138 BoogieDeclarations]: Found implementation of procedure size [2020-07-20 06:12:59,495 INFO L138 BoogieDeclarations]: Found implementation of procedure task [2020-07-20 06:12:59,495 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-20 06:12:59,495 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2020-07-20 06:12:59,496 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2020-07-20 06:12:59,496 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-20 06:12:59,496 INFO L130 BoogieDeclarations]: Found specification of procedure free [2020-07-20 06:12:59,496 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-20 06:12:59,496 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2020-07-20 06:12:59,496 INFO L130 BoogieDeclarations]: Found specification of procedure assume_cycle_if_not [2020-07-20 06:12:59,497 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-20 06:12:59,497 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-20 06:12:59,497 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_tree [2020-07-20 06:12:59,497 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-20 06:12:59,497 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-20 06:12:59,497 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-07-20 06:12:59,497 INFO L130 BoogieDeclarations]: Found specification of procedure min [2020-07-20 06:12:59,498 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-20 06:12:59,498 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-07-20 06:12:59,498 INFO L130 BoogieDeclarations]: Found specification of procedure tree_del [2020-07-20 06:12:59,498 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-20 06:12:59,498 INFO L130 BoogieDeclarations]: Found specification of procedure tree_inorder [2020-07-20 06:12:59,498 INFO L130 BoogieDeclarations]: Found specification of procedure size [2020-07-20 06:12:59,498 INFO L130 BoogieDeclarations]: Found specification of procedure task [2020-07-20 06:12:59,499 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-20 06:12:59,499 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2020-07-20 06:12:59,499 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-20 06:12:59,499 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-20 06:12:59,499 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-20 06:13:00,074 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-20 06:13:00,074 INFO L295 CfgBuilder]: Removed 3 assume(true) statements. [2020-07-20 06:13:00,086 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 06:13:00 BoogieIcfgContainer [2020-07-20 06:13:00,088 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-20 06:13:00,090 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-20 06:13:00,090 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-20 06:13:00,094 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-20 06:13:00,094 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.07 06:12:58" (1/3) ... [2020-07-20 06:13:00,096 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4848a6cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 06:13:00, skipping insertion in model container [2020-07-20 06:13:00,097 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:12:59" (2/3) ... [2020-07-20 06:13:00,098 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4848a6cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 06:13:00, skipping insertion in model container [2020-07-20 06:13:00,098 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 06:13:00" (3/3) ... [2020-07-20 06:13:00,101 INFO L109 eAbstractionObserver]: Analyzing ICFG tree_del_iter.c [2020-07-20 06:13:00,113 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-20 06:13:00,126 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-20 06:13:00,143 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-20 06:13:00,179 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-20 06:13:00,180 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-20 06:13:00,180 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-20 06:13:00,180 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-20 06:13:00,180 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-20 06:13:00,180 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-20 06:13:00,181 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-20 06:13:00,181 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-20 06:13:00,205 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states. [2020-07-20 06:13:00,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2020-07-20 06:13:00,215 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 06:13:00,217 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 06:13:00,218 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 06:13:00,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 06:13:00,225 INFO L82 PathProgramCache]: Analyzing trace with hash 806421993, now seen corresponding path program 1 times [2020-07-20 06:13:00,235 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 06:13:00,236 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849973319] [2020-07-20 06:13:00,237 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@55bffc35 [2020-07-20 06:13:00,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:13:00,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:13:00,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:13:00,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:13:00,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:13:00,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:13:00,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:13:00,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:13:00,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 06:13:00,772 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849973319] [2020-07-20 06:13:00,773 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 06:13:00,773 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-07-20 06:13:00,774 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138486843] [2020-07-20 06:13:00,781 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-20 06:13:00,781 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 06:13:00,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-20 06:13:00,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2020-07-20 06:13:00,802 INFO L87 Difference]: Start difference. First operand 98 states. Second operand 11 states. [2020-07-20 06:13:01,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 06:13:01,659 INFO L93 Difference]: Finished difference Result 174 states and 235 transitions. [2020-07-20 06:13:01,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-20 06:13:01,661 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 44 [2020-07-20 06:13:01,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 06:13:01,678 INFO L225 Difference]: With dead ends: 174 [2020-07-20 06:13:01,678 INFO L226 Difference]: Without dead ends: 98 [2020-07-20 06:13:01,683 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2020-07-20 06:13:01,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2020-07-20 06:13:01,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 91. [2020-07-20 06:13:01,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2020-07-20 06:13:01,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 115 transitions. [2020-07-20 06:13:01,756 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 115 transitions. Word has length 44 [2020-07-20 06:13:01,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 06:13:01,757 INFO L479 AbstractCegarLoop]: Abstraction has 91 states and 115 transitions. [2020-07-20 06:13:01,757 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-20 06:13:01,757 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 115 transitions. [2020-07-20 06:13:01,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2020-07-20 06:13:01,762 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 06:13:01,762 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 06:13:01,762 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-20 06:13:01,763 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 06:13:01,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 06:13:01,763 INFO L82 PathProgramCache]: Analyzing trace with hash -1561052270, now seen corresponding path program 1 times [2020-07-20 06:13:01,764 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 06:13:01,764 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107783060] [2020-07-20 06:13:01,764 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@55bffc35 [2020-07-20 06:13:01,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:13:01,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:13:01,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:13:02,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:13:02,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:13:02,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:13:02,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:13:02,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:13:02,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:13:02,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:13:02,171 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-07-20 06:13:02,173 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107783060] [2020-07-20 06:13:02,173 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1776669228] [2020-07-20 06:13:02,174 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@155ee0f6 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-20 06:13:02,346 INFO L228 tOrderPrioritization]: Assert order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@155ee0f6 issued 2 check-sat command(s) [2020-07-20 06:13:02,347 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 06:13:02,350 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 21 conjunts are in the unsatisfiable core [2020-07-20 06:13:02,360 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 06:13:02,455 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-07-20 06:13:02,456 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 06:13:02,456 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7] total 15 [2020-07-20 06:13:02,457 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77105941] [2020-07-20 06:13:02,459 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-07-20 06:13:02,459 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 06:13:02,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-07-20 06:13:02,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2020-07-20 06:13:02,460 INFO L87 Difference]: Start difference. First operand 91 states and 115 transitions. Second operand 15 states. [2020-07-20 06:13:03,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 06:13:03,664 INFO L93 Difference]: Finished difference Result 167 states and 214 transitions. [2020-07-20 06:13:03,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-07-20 06:13:03,665 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 56 [2020-07-20 06:13:03,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 06:13:03,668 INFO L225 Difference]: With dead ends: 167 [2020-07-20 06:13:03,669 INFO L226 Difference]: Without dead ends: 99 [2020-07-20 06:13:03,671 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=133, Invalid=623, Unknown=0, NotChecked=0, Total=756 [2020-07-20 06:13:03,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2020-07-20 06:13:03,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 97. [2020-07-20 06:13:03,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2020-07-20 06:13:03,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 123 transitions. [2020-07-20 06:13:03,690 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 123 transitions. Word has length 56 [2020-07-20 06:13:03,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 06:13:03,690 INFO L479 AbstractCegarLoop]: Abstraction has 97 states and 123 transitions. [2020-07-20 06:13:03,690 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-07-20 06:13:03,691 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 123 transitions. [2020-07-20 06:13:03,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2020-07-20 06:13:03,694 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 06:13:03,694 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 06:13:03,910 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2020-07-20 06:13:03,910 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 06:13:03,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 06:13:03,910 INFO L82 PathProgramCache]: Analyzing trace with hash 504983834, now seen corresponding path program 1 times [2020-07-20 06:13:03,911 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 06:13:03,911 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146571845] [2020-07-20 06:13:03,911 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@55bffc35 [2020-07-20 06:13:03,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:13:04,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:13:04,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:13:04,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:13:04,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:13:04,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:13:04,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:13:04,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:13:04,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:13:04,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:13:04,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:13:04,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:13:04,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:13:04,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 06:13:04,194 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2020-07-20 06:13:04,194 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146571845] [2020-07-20 06:13:04,195 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 06:13:04,195 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-07-20 06:13:04,195 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106016239] [2020-07-20 06:13:04,196 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-07-20 06:13:04,196 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 06:13:04,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-07-20 06:13:04,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2020-07-20 06:13:04,197 INFO L87 Difference]: Start difference. First operand 97 states and 123 transitions. Second operand 13 states. [2020-07-20 06:13:05,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 06:13:05,031 INFO L93 Difference]: Finished difference Result 170 states and 215 transitions. [2020-07-20 06:13:05,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-07-20 06:13:05,031 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 78 [2020-07-20 06:13:05,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 06:13:05,033 INFO L225 Difference]: With dead ends: 170 [2020-07-20 06:13:05,034 INFO L226 Difference]: Without dead ends: 101 [2020-07-20 06:13:05,036 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=335, Unknown=0, NotChecked=0, Total=420 [2020-07-20 06:13:05,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2020-07-20 06:13:05,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 99. [2020-07-20 06:13:05,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2020-07-20 06:13:05,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 126 transitions. [2020-07-20 06:13:05,053 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 126 transitions. Word has length 78 [2020-07-20 06:13:05,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 06:13:05,053 INFO L479 AbstractCegarLoop]: Abstraction has 99 states and 126 transitions. [2020-07-20 06:13:05,053 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-07-20 06:13:05,053 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 126 transitions. [2020-07-20 06:13:05,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2020-07-20 06:13:05,057 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 06:13:05,058 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 06:13:05,058 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-20 06:13:05,058 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 06:13:05,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 06:13:05,059 INFO L82 PathProgramCache]: Analyzing trace with hash -708508396, now seen corresponding path program 1 times [2020-07-20 06:13:05,059 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 06:13:05,059 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866665326] [2020-07-20 06:13:05,059 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@55bffc35 [2020-07-20 06:13:05,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-20 06:13:05,124 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-20 06:13:05,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-20 06:13:05,208 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-20 06:13:05,262 INFO L174 FreeRefinementEngine]: Strategy CAMEL_SMT_AM found a feasible trace [2020-07-20 06:13:05,263 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-20 06:13:05,263 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-20 06:13:05,386 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.07 06:13:05 BoogieIcfgContainer [2020-07-20 06:13:05,386 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-20 06:13:05,393 INFO L168 Benchmark]: Toolchain (without parser) took 6478.32 ms. Allocated memory was 149.4 MB in the beginning and 275.3 MB in the end (delta: 125.8 MB). Free memory was 106.0 MB in the beginning and 223.2 MB in the end (delta: -117.3 MB). Peak memory consumption was 8.6 MB. Max. memory is 7.1 GB. [2020-07-20 06:13:05,395 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 149.4 MB. Free memory was 125.5 MB in the beginning and 125.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-20 06:13:05,399 INFO L168 Benchmark]: CACSL2BoogieTranslator took 441.37 ms. Allocated memory was 149.4 MB in the beginning and 205.5 MB in the end (delta: 56.1 MB). Free memory was 105.5 MB in the beginning and 181.6 MB in the end (delta: -76.0 MB). Peak memory consumption was 19.7 MB. Max. memory is 7.1 GB. [2020-07-20 06:13:05,400 INFO L168 Benchmark]: Boogie Preprocessor took 64.66 ms. Allocated memory is still 205.5 MB. Free memory was 181.6 MB in the beginning and 179.1 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. [2020-07-20 06:13:05,402 INFO L168 Benchmark]: RCFGBuilder took 662.40 ms. Allocated memory is still 205.5 MB. Free memory was 179.1 MB in the beginning and 144.0 MB in the end (delta: 35.2 MB). Peak memory consumption was 35.2 MB. Max. memory is 7.1 GB. [2020-07-20 06:13:05,406 INFO L168 Benchmark]: TraceAbstraction took 5296.58 ms. Allocated memory was 205.5 MB in the beginning and 275.3 MB in the end (delta: 69.7 MB). Free memory was 143.3 MB in the beginning and 223.2 MB in the end (delta: -79.9 MB). There was no memory consumed. Max. memory is 7.1 GB. [2020-07-20 06:13:05,413 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25 ms. Allocated memory is still 149.4 MB. Free memory was 125.5 MB in the beginning and 125.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 441.37 ms. Allocated memory was 149.4 MB in the beginning and 205.5 MB in the end (delta: 56.1 MB). Free memory was 105.5 MB in the beginning and 181.6 MB in the end (delta: -76.0 MB). Peak memory consumption was 19.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 64.66 ms. Allocated memory is still 205.5 MB. Free memory was 181.6 MB in the beginning and 179.1 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 662.40 ms. Allocated memory is still 205.5 MB. Free memory was 179.1 MB in the beginning and 144.0 MB in the end (delta: 35.2 MB). Peak memory consumption was 35.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 5296.58 ms. Allocated memory was 205.5 MB in the beginning and 275.3 MB in the end (delta: 69.7 MB). Free memory was 143.3 MB in the beginning and 223.2 MB in the end (delta: -79.9 MB). There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 14]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L108] CALL, EXPR nondet_tree() [L23] COND FALSE !(__VERIFIER_nondet_bool()) [L26] struct node *n = (struct node *)malloc(sizeof(struct node)); [L27] n->data = __VERIFIER_nondet_int() [L28] CALL, EXPR nondet_tree() [L23] COND TRUE __VERIFIER_nondet_bool() [L24] return 0; VAL [\result={0:0}] [L28] RET, EXPR nondet_tree() VAL [malloc(sizeof(struct node))={-1:0}, n={-1:0}, nondet_tree()={0:0}] [L28] n->left = nondet_tree() [L29] CALL, EXPR nondet_tree() [L23] COND TRUE __VERIFIER_nondet_bool() [L24] return 0; VAL [\result={0:0}] [L29] RET, EXPR nondet_tree() VAL [malloc(sizeof(struct node))={-1:0}, n={-1:0}, nondet_tree()={0:0}] [L29] n->right = nondet_tree() [L30] return n; VAL [\result={-1:0}, malloc(sizeof(struct node))={-1:0}, n={-1:0}] [L108] RET, EXPR nondet_tree() VAL [nondet_tree()={-1:0}] [L108] CALL task(nondet_tree()) VAL [t={-1:0}] [L84] CALL, EXPR min(t) VAL [n={-1:0}] [L35] COND FALSE !(!n) [L38] EXPR n->data [L38] int a = n->data; [L39] EXPR n->left VAL [a=2147483647, n={-1:0}, n={-1:0}, n->left={0:0}] [L39] CALL, EXPR min(n->left) VAL [n={0:0}] [L35] COND TRUE !n [L36] return 2147483647; VAL [\result=2147483647, n={0:0}, n={0:0}] [L39] RET, EXPR min(n->left) VAL [a=2147483647, min(n->left)=2147483647, n={-1:0}, n={-1:0}, n->left={0:0}] [L39] int b = min(n->left); [L40] EXPR n->right VAL [a=2147483647, b=2147483647, n={-1:0}, n={-1:0}, n->right={0:0}] [L40] CALL, EXPR min(n->right) VAL [n={0:0}] [L35] COND TRUE !n [L36] return 2147483647; VAL [\result=2147483647, n={0:0}, n={0:0}] [L40] RET, EXPR min(n->right) VAL [a=2147483647, b=2147483647, min(n->right)=2147483647, n={-1:0}, n={-1:0}, n->right={0:0}] [L40] int c = min(n->right); [L41] COND TRUE b <= a && b <= c [L41] return b; VAL [\result=2147483647, a=2147483647, b=2147483647, c=2147483647, n={-1:0}, n={-1:0}] [L84] RET, EXPR min(t) VAL [min(t)=2147483647, t={-1:0}, t={-1:0}] [L84] int a = min(t); [L85] int b; VAL [a=2147483647, b={2:0}, t={-1:0}, t={-1:0}] [L87] CALL, EXPR size(t) VAL [t={-1:0}] [L79] COND FALSE !(!t) [L80] EXPR t->left VAL [t={-1:0}, t={-1:0}, t->left={0:0}] [L80] CALL, EXPR size(t->left) VAL [t={0:0}] [L79] COND TRUE !t [L79] return 0; VAL [\result=0, t={0:0}, t={0:0}] [L80] RET, EXPR size(t->left) VAL [size(t->left)=0, t={-1:0}, t={-1:0}, t->left={0:0}] [L80] EXPR t->right VAL [size(t->left)=0, t={-1:0}, t={-1:0}, t->left={0:0}, t->right={0:0}] [L80] CALL, EXPR size(t->right) VAL [t={0:0}] [L79] COND TRUE !t [L79] return 0; VAL [\result=0, t={0:0}, t={0:0}] [L80] RET, EXPR size(t->right) VAL [size(t->left)=0, size(t->right)=0, t={-1:0}, t={-1:0}, t->left={0:0}, t->right={0:0}] [L80] return size(t->left) + size(t->right) + 1; [L87] RET, EXPR size(t) VAL [a=2147483647, b={2:0}, size(t)=1, t={-1:0}, t={-1:0}] [L87] int n = size(t); [L88] CALL assume_cycle_if_not(n != 0) VAL [\old(cond)=1] [L9] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L88] RET assume_cycle_if_not(n != 0) VAL [a=2147483647, b={2:0}, n=1, t={-1:0}, t={-1:0}] [L89] EXPR, FCALL calloc(n, sizeof(int)) VAL [a=2147483647, b={2:0}, calloc(n, sizeof(int))={-2:0}, n=1, t={-1:0}, t={-1:0}] [L89] int *x = calloc(n, sizeof(int)); VAL [a=2147483647, b={2:0}, calloc(n, sizeof(int))={-2:0}, n=1, t={-1:0}, t={-1:0}, x={-2:0}] [L90] CALL tree_inorder(t, x, n) VAL [\old(i)=1, a={-2:0}, t={-1:0}] [L68] COND FALSE !(!t) [L71] EXPR t->left VAL [\old(i)=1, a={-2:0}, a={-2:0}, i=1, t={-1:0}, t={-1:0}, t->left={0:0}] [L71] CALL, EXPR tree_inorder(t->left, a, i) VAL [\old(i)=1, a={-2:0}, t={0:0}] [L68] COND TRUE !t [L69] return i; VAL [\old(i)=1, \result=1, a={-2:0}, a={-2:0}, i=1, t={0:0}, t={0:0}] [L71] RET, EXPR tree_inorder(t->left, a, i) VAL [\old(i)=1, a={-2:0}, a={-2:0}, i=1, t={-1:0}, t={-1:0}, t->left={0:0}, tree_inorder(t->left, a, i)=1] [L71] i = tree_inorder(t->left, a, i) [L72] EXPR i++ [L72] EXPR t->data [L72] a[i++] = t->data [L73] EXPR t->right VAL [\old(i)=1, a={-2:0}, a={-2:0}, i=2, t={-1:0}, t={-1:0}, t->right={0:0}] [L73] CALL, EXPR tree_inorder(t->right, a, i) VAL [\old(i)=2, a={-2:0}, t={0:0}] [L68] COND TRUE !t [L69] return i; VAL [\old(i)=2, \result=2, a={-2:0}, a={-2:0}, i=2, t={0:0}, t={0:0}] [L73] RET, EXPR tree_inorder(t->right, a, i) VAL [\old(i)=1, a={-2:0}, a={-2:0}, i=2, t={-1:0}, t={-1:0}, t->right={0:0}, tree_inorder(t->right, a, i)=2] [L73] i = tree_inorder(t->right, a, i) [L74] return i; VAL [\old(i)=1, \result=2, a={-2:0}, a={-2:0}, i=2, t={-1:0}, t={-1:0}] [L90] RET tree_inorder(t, x, n) VAL [a=2147483647, b={2:0}, calloc(n, sizeof(int))={-2:0}, n=1, t={-1:0}, t={-1:0}, tree_inorder(t, x, n)=2, x={-2:0}] [L91] EXPR x[0] VAL [a=2147483647, b={2:0}, calloc(n, sizeof(int))={-2:0}, n=1, t={-1:0}, t={-1:0}, x={-2:0}, x[0]=0] [L91] CALL __VERIFIER_assert(a == x[0]) VAL [\old(cond)=0] [L14] COND TRUE !cond VAL [\old(cond)=0, cond=0] [L14] __VERIFIER_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 12 procedures, 98 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 5.0s, OverallIterations: 4, TraceHistogramMax: 3, AutomataDifference: 2.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 258 SDtfs, 319 SDslu, 1136 SDs, 0 SdLazy, 1687 SolverSat, 300 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 166 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=99occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 11 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 325 NumberOfCodeBlocks, 297 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 230 ConstructedInterpolants, 0 QuantifiedInterpolants, 41728 SizeOfPredicates, 6 NumberOfNonLiveVariables, 184 ConjunctsInSsa, 21 ConjunctsInUnsatCore, 4 InterpolantComputations, 2 PerfectInterpolantSequences, 53/57 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...