/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 NUM_VARIABLES --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_rec.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-79ed534 [2020-07-20 01:27:01,540 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-20 01:27:01,543 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-20 01:27:01,562 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-20 01:27:01,563 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-20 01:27:01,565 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-20 01:27:01,567 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-20 01:27:01,576 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-20 01:27:01,578 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-20 01:27:01,582 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-20 01:27:01,583 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-20 01:27:01,585 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-20 01:27:01,586 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-20 01:27:01,588 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-20 01:27:01,590 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-20 01:27:01,592 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-20 01:27:01,593 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-20 01:27:01,594 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-20 01:27:01,595 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-20 01:27:01,601 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-20 01:27:01,607 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-20 01:27:01,611 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-20 01:27:01,612 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-20 01:27:01,613 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-20 01:27:01,616 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-20 01:27:01,616 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-20 01:27:01,616 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-20 01:27:01,619 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-20 01:27:01,619 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-20 01:27:01,620 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-20 01:27:01,620 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-20 01:27:01,622 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-20 01:27:01,624 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-20 01:27:01,625 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-20 01:27:01,626 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-20 01:27:01,626 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-20 01:27:01,627 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-20 01:27:01,627 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-20 01:27:01,627 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-20 01:27:01,628 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-20 01:27:01,630 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-20 01:27:01,630 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 01:27:01,669 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-20 01:27:01,669 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-20 01:27:01,670 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-20 01:27:01,671 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-20 01:27:01,671 INFO L138 SettingsManager]: * Use SBE=true [2020-07-20 01:27:01,674 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-20 01:27:01,674 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-20 01:27:01,674 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-20 01:27:01,674 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-20 01:27:01,674 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-20 01:27:01,675 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-20 01:27:01,675 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-20 01:27:01,675 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-20 01:27:01,675 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-20 01:27:01,675 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-20 01:27:01,676 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-20 01:27:01,676 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-20 01:27:01,676 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-20 01:27:01,677 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-20 01:27:01,678 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-20 01:27:01,678 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-20 01:27:01,678 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-20 01:27:01,678 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-20 01:27:01,678 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-20 01:27:01,679 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-20 01:27:01,679 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-20 01:27:01,679 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 01:27:01,680 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-20 01:27:01,680 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-20 01:27:01,680 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Assert CodeBlocks Term Scoring Heuristic -> NUM_VARIABLES 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 01:27:01,986 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-20 01:27:01,999 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-20 01:27:02,003 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-20 01:27:02,004 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-20 01:27:02,005 INFO L275 PluginConnector]: CDTParser initialized [2020-07-20 01:27:02,005 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/verifythis/tree_del_rec.c [2020-07-20 01:27:02,069 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc5d2b707/412cca140b9948d29f6f375b0e19bb93/FLAG922fea802 [2020-07-20 01:27:02,584 INFO L306 CDTParser]: Found 1 translation units. [2020-07-20 01:27:02,585 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/verifythis/tree_del_rec.c [2020-07-20 01:27:02,593 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc5d2b707/412cca140b9948d29f6f375b0e19bb93/FLAG922fea802 [2020-07-20 01:27:02,917 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc5d2b707/412cca140b9948d29f6f375b0e19bb93 [2020-07-20 01:27:02,926 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-20 01:27:02,929 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-20 01:27:02,930 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-20 01:27:02,930 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-20 01:27:02,934 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-20 01:27:02,936 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 01:27:02" (1/1) ... [2020-07-20 01:27:02,938 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1392555e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 01:27:02, skipping insertion in model container [2020-07-20 01:27:02,939 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 01:27:02" (1/1) ... [2020-07-20 01:27:02,947 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-20 01:27:02,978 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-20 01:27:03,200 WARN L1484 CHandler]: Possible shadowing of function min [2020-07-20 01:27:03,203 WARN L1484 CHandler]: Possible shadowing of function min [2020-07-20 01:27:03,218 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-20 01:27:03,233 INFO L203 MainTranslator]: Completed pre-run [2020-07-20 01:27:03,340 WARN L1484 CHandler]: Possible shadowing of function min [2020-07-20 01:27:03,342 WARN L1484 CHandler]: Possible shadowing of function min [2020-07-20 01:27:03,354 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-20 01:27:03,381 INFO L208 MainTranslator]: Completed translation [2020-07-20 01:27:03,381 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 01:27:03 WrapperNode [2020-07-20 01:27:03,381 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-20 01:27:03,382 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-20 01:27:03,382 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-20 01:27:03,383 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-20 01:27:03,399 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 01:27:03" (1/1) ... [2020-07-20 01:27:03,400 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 01:27:03" (1/1) ... [2020-07-20 01:27:03,430 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 01:27:03" (1/1) ... [2020-07-20 01:27:03,430 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 01:27:03" (1/1) ... [2020-07-20 01:27:03,454 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 01:27:03" (1/1) ... [2020-07-20 01:27:03,462 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 01:27:03" (1/1) ... [2020-07-20 01:27:03,468 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 01:27:03" (1/1) ... [2020-07-20 01:27:03,472 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-20 01:27:03,477 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-20 01:27:03,478 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-20 01:27:03,478 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-20 01:27:03,479 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 01:27:03" (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 01:27:03,542 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-20 01:27:03,542 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-20 01:27:03,542 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_cycle_if_not [2020-07-20 01:27:03,543 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-20 01:27:03,543 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_tree [2020-07-20 01:27:03,543 INFO L138 BoogieDeclarations]: Found implementation of procedure min [2020-07-20 01:27:03,544 INFO L138 BoogieDeclarations]: Found implementation of procedure tree_del [2020-07-20 01:27:03,544 INFO L138 BoogieDeclarations]: Found implementation of procedure tree_inorder [2020-07-20 01:27:03,545 INFO L138 BoogieDeclarations]: Found implementation of procedure size [2020-07-20 01:27:03,545 INFO L138 BoogieDeclarations]: Found implementation of procedure task [2020-07-20 01:27:03,545 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-20 01:27:03,548 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2020-07-20 01:27:03,548 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2020-07-20 01:27:03,548 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-20 01:27:03,549 INFO L130 BoogieDeclarations]: Found specification of procedure free [2020-07-20 01:27:03,549 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-20 01:27:03,549 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2020-07-20 01:27:03,549 INFO L130 BoogieDeclarations]: Found specification of procedure assume_cycle_if_not [2020-07-20 01:27:03,551 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-20 01:27:03,551 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-20 01:27:03,551 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_tree [2020-07-20 01:27:03,551 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-20 01:27:03,551 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-20 01:27:03,552 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-07-20 01:27:03,552 INFO L130 BoogieDeclarations]: Found specification of procedure min [2020-07-20 01:27:03,552 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-20 01:27:03,552 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-07-20 01:27:03,552 INFO L130 BoogieDeclarations]: Found specification of procedure tree_del [2020-07-20 01:27:03,552 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-20 01:27:03,553 INFO L130 BoogieDeclarations]: Found specification of procedure tree_inorder [2020-07-20 01:27:03,553 INFO L130 BoogieDeclarations]: Found specification of procedure size [2020-07-20 01:27:03,553 INFO L130 BoogieDeclarations]: Found specification of procedure task [2020-07-20 01:27:03,553 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-20 01:27:03,554 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2020-07-20 01:27:03,554 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-20 01:27:03,554 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-20 01:27:03,554 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-20 01:27:04,113 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-20 01:27:04,114 INFO L295 CfgBuilder]: Removed 2 assume(true) statements. [2020-07-20 01:27:04,119 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 01:27:04 BoogieIcfgContainer [2020-07-20 01:27:04,119 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-20 01:27:04,121 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-20 01:27:04,121 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-20 01:27:04,124 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-20 01:27:04,124 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.07 01:27:02" (1/3) ... [2020-07-20 01:27:04,125 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@403116c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 01:27:04, skipping insertion in model container [2020-07-20 01:27:04,125 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 01:27:03" (2/3) ... [2020-07-20 01:27:04,126 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@403116c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 01:27:04, skipping insertion in model container [2020-07-20 01:27:04,126 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 01:27:04" (3/3) ... [2020-07-20 01:27:04,129 INFO L109 eAbstractionObserver]: Analyzing ICFG tree_del_rec.c [2020-07-20 01:27:04,140 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-20 01:27:04,148 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-20 01:27:04,162 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-20 01:27:04,188 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-20 01:27:04,188 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-20 01:27:04,188 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-20 01:27:04,188 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-20 01:27:04,188 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-20 01:27:04,189 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-20 01:27:04,189 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-20 01:27:04,189 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-20 01:27:04,210 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states. [2020-07-20 01:27:04,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2020-07-20 01:27:04,219 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 01:27:04,220 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 01:27:04,220 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 01:27:04,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 01:27:04,226 INFO L82 PathProgramCache]: Analyzing trace with hash -1057238675, now seen corresponding path program 1 times [2020-07-20 01:27:04,234 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 01:27:04,234 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654845711] [2020-07-20 01:27:04,235 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@711a5e12 [2020-07-20 01:27:04,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 01:27:04,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 01:27:04,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 01:27:04,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 01:27:04,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 01:27:04,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 01:27:04,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 01:27:04,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 01:27:04,690 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 01:27:04,691 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654845711] [2020-07-20 01:27:04,692 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 01:27:04,693 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-07-20 01:27:04,694 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205663620] [2020-07-20 01:27:04,699 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-20 01:27:04,700 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 01:27:04,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-20 01:27:04,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2020-07-20 01:27:04,720 INFO L87 Difference]: Start difference. First operand 97 states. Second operand 11 states. [2020-07-20 01:27:05,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 01:27:05,554 INFO L93 Difference]: Finished difference Result 171 states and 229 transitions. [2020-07-20 01:27:05,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-20 01:27:05,556 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 44 [2020-07-20 01:27:05,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 01:27:05,571 INFO L225 Difference]: With dead ends: 171 [2020-07-20 01:27:05,571 INFO L226 Difference]: Without dead ends: 96 [2020-07-20 01:27:05,576 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 01:27:05,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2020-07-20 01:27:05,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 90. [2020-07-20 01:27:05,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2020-07-20 01:27:05,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 114 transitions. [2020-07-20 01:27:05,651 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 114 transitions. Word has length 44 [2020-07-20 01:27:05,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 01:27:05,652 INFO L479 AbstractCegarLoop]: Abstraction has 90 states and 114 transitions. [2020-07-20 01:27:05,652 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-20 01:27:05,652 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 114 transitions. [2020-07-20 01:27:05,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2020-07-20 01:27:05,656 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 01:27:05,657 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 01:27:05,657 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-20 01:27:05,657 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 01:27:05,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 01:27:05,658 INFO L82 PathProgramCache]: Analyzing trace with hash 1861604494, now seen corresponding path program 1 times [2020-07-20 01:27:05,658 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 01:27:05,658 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193079410] [2020-07-20 01:27:05,659 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@711a5e12 [2020-07-20 01:27:05,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 01:27:05,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 01:27:05,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 01:27:05,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 01:27:05,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 01:27:05,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 01:27:06,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 01:27:06,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 01:27:06,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 01:27:06,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 01:27:06,058 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 01:27:06,059 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193079410] [2020-07-20 01:27:06,059 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1348254201] [2020-07-20 01:27:06,060 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@49ed1aae 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 01:27:06,194 INFO L228 tOrderPrioritization]: Assert order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@49ed1aae issued 2 check-sat command(s) [2020-07-20 01:27:06,195 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 01:27:06,198 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 21 conjunts are in the unsatisfiable core [2020-07-20 01:27:06,208 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 01:27:06,327 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 01:27:06,328 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 01:27:06,328 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7] total 16 [2020-07-20 01:27:06,330 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845454272] [2020-07-20 01:27:06,331 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-07-20 01:27:06,331 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 01:27:06,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-07-20 01:27:06,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2020-07-20 01:27:06,332 INFO L87 Difference]: Start difference. First operand 90 states and 114 transitions. Second operand 16 states. [2020-07-20 01:27:07,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 01:27:07,464 INFO L93 Difference]: Finished difference Result 164 states and 211 transitions. [2020-07-20 01:27:07,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-07-20 01:27:07,465 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 56 [2020-07-20 01:27:07,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 01:27:07,469 INFO L225 Difference]: With dead ends: 164 [2020-07-20 01:27:07,469 INFO L226 Difference]: Without dead ends: 97 [2020-07-20 01:27:07,471 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=138, Invalid=674, Unknown=0, NotChecked=0, Total=812 [2020-07-20 01:27:07,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2020-07-20 01:27:07,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 96. [2020-07-20 01:27:07,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2020-07-20 01:27:07,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 121 transitions. [2020-07-20 01:27:07,489 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 121 transitions. Word has length 56 [2020-07-20 01:27:07,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 01:27:07,490 INFO L479 AbstractCegarLoop]: Abstraction has 96 states and 121 transitions. [2020-07-20 01:27:07,490 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-07-20 01:27:07,490 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 121 transitions. [2020-07-20 01:27:07,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2020-07-20 01:27:07,493 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 01:27:07,493 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 01:27:07,707 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2020-07-20 01:27:07,708 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 01:27:07,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 01:27:07,709 INFO L82 PathProgramCache]: Analyzing trace with hash -1958691746, now seen corresponding path program 1 times [2020-07-20 01:27:07,710 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 01:27:07,710 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833767606] [2020-07-20 01:27:07,711 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@711a5e12 [2020-07-20 01:27:07,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 01:27:07,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 01:27:07,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 01:27:07,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 01:27:07,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 01:27:07,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 01:27:07,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 01:27:07,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 01:27:07,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 01:27:07,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 01:27:07,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 01:27:08,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 01:27:08,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 01:27:08,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 01:27:08,027 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 01:27:08,027 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833767606] [2020-07-20 01:27:08,027 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 01:27:08,028 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-07-20 01:27:08,028 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442266672] [2020-07-20 01:27:08,029 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-07-20 01:27:08,029 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 01:27:08,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-07-20 01:27:08,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2020-07-20 01:27:08,030 INFO L87 Difference]: Start difference. First operand 96 states and 121 transitions. Second operand 13 states. [2020-07-20 01:27:08,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 01:27:08,801 INFO L93 Difference]: Finished difference Result 167 states and 210 transitions. [2020-07-20 01:27:08,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-07-20 01:27:08,802 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 78 [2020-07-20 01:27:08,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 01:27:08,805 INFO L225 Difference]: With dead ends: 167 [2020-07-20 01:27:08,806 INFO L226 Difference]: Without dead ends: 99 [2020-07-20 01:27:08,808 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 01:27:08,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2020-07-20 01:27:08,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 98. [2020-07-20 01:27:08,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2020-07-20 01:27:08,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 124 transitions. [2020-07-20 01:27:08,824 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 124 transitions. Word has length 78 [2020-07-20 01:27:08,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 01:27:08,825 INFO L479 AbstractCegarLoop]: Abstraction has 98 states and 124 transitions. [2020-07-20 01:27:08,825 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-07-20 01:27:08,825 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 124 transitions. [2020-07-20 01:27:08,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2020-07-20 01:27:08,828 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 01:27:08,828 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 01:27:08,828 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-20 01:27:08,829 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 01:27:08,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 01:27:08,829 INFO L82 PathProgramCache]: Analyzing trace with hash -299285422, now seen corresponding path program 1 times [2020-07-20 01:27:08,829 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 01:27:08,830 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571242951] [2020-07-20 01:27:08,830 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@711a5e12 [2020-07-20 01:27:08,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-20 01:27:08,880 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-20 01:27:08,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-20 01:27:08,918 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-20 01:27:08,953 INFO L174 FreeRefinementEngine]: Strategy CAMEL_SMT_AM found a feasible trace [2020-07-20 01:27:08,953 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-20 01:27:08,953 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-20 01:27:09,016 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.07 01:27:09 BoogieIcfgContainer [2020-07-20 01:27:09,017 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-20 01:27:09,020 INFO L168 Benchmark]: Toolchain (without parser) took 6091.40 ms. Allocated memory was 145.8 MB in the beginning and 281.5 MB in the end (delta: 135.8 MB). Free memory was 102.2 MB in the beginning and 130.5 MB in the end (delta: -28.3 MB). Peak memory consumption was 107.5 MB. Max. memory is 7.1 GB. [2020-07-20 01:27:09,021 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 145.8 MB. Free memory was 120.6 MB in the beginning and 120.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-20 01:27:09,022 INFO L168 Benchmark]: CACSL2BoogieTranslator took 451.52 ms. Allocated memory was 145.8 MB in the beginning and 202.4 MB in the end (delta: 56.6 MB). Free memory was 102.0 MB in the beginning and 179.0 MB in the end (delta: -77.0 MB). Peak memory consumption was 19.8 MB. Max. memory is 7.1 GB. [2020-07-20 01:27:09,023 INFO L168 Benchmark]: Boogie Preprocessor took 90.25 ms. Allocated memory is still 202.4 MB. Free memory was 179.0 MB in the beginning and 176.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2020-07-20 01:27:09,024 INFO L168 Benchmark]: RCFGBuilder took 642.16 ms. Allocated memory is still 202.4 MB. Free memory was 176.4 MB in the beginning and 142.0 MB in the end (delta: 34.4 MB). Peak memory consumption was 34.4 MB. Max. memory is 7.1 GB. [2020-07-20 01:27:09,025 INFO L168 Benchmark]: TraceAbstraction took 4896.21 ms. Allocated memory was 202.4 MB in the beginning and 281.5 MB in the end (delta: 79.2 MB). Free memory was 141.4 MB in the beginning and 130.5 MB in the end (delta: 10.9 MB). Peak memory consumption was 90.1 MB. Max. memory is 7.1 GB. [2020-07-20 01:27:09,029 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.21 ms. Allocated memory is still 145.8 MB. Free memory was 120.6 MB in the beginning and 120.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 451.52 ms. Allocated memory was 145.8 MB in the beginning and 202.4 MB in the end (delta: 56.6 MB). Free memory was 102.0 MB in the beginning and 179.0 MB in the end (delta: -77.0 MB). Peak memory consumption was 19.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 90.25 ms. Allocated memory is still 202.4 MB. Free memory was 179.0 MB in the beginning and 176.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 642.16 ms. Allocated memory is still 202.4 MB. Free memory was 176.4 MB in the beginning and 142.0 MB in the end (delta: 34.4 MB). Peak memory consumption was 34.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 4896.21 ms. Allocated memory was 202.4 MB in the beginning and 281.5 MB in the end (delta: 79.2 MB). Free memory was 141.4 MB in the beginning and 130.5 MB in the end (delta: 10.9 MB). Peak memory consumption was 90.1 MB. 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: [L100] 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}] [L100] RET, EXPR nondet_tree() VAL [nondet_tree()={-1:0}] [L100] CALL task(nondet_tree()) VAL [t={-1:0}] [L76] 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}] [L76] RET, EXPR min(t) VAL [min(t)=2147483647, t={-1:0}, t={-1:0}] [L76] int a = min(t); [L77] int b; VAL [a=2147483647, b={2:0}, t={-1:0}, t={-1:0}] [L79] CALL, EXPR size(t) VAL [t={-1:0}] [L71] COND FALSE !(!t) [L72] EXPR t->left VAL [t={-1:0}, t={-1:0}, t->left={0:0}] [L72] CALL, EXPR size(t->left) VAL [t={0:0}] [L71] COND TRUE !t [L71] return 0; VAL [\result=0, t={0:0}, t={0:0}] [L72] RET, EXPR size(t->left) VAL [size(t->left)=0, t={-1:0}, t={-1:0}, t->left={0:0}] [L72] EXPR t->right VAL [size(t->left)=0, t={-1:0}, t={-1:0}, t->left={0:0}, t->right={0:0}] [L72] CALL, EXPR size(t->right) VAL [t={0:0}] [L71] COND TRUE !t [L71] return 0; VAL [\result=0, t={0:0}, t={0:0}] [L72] 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}] [L72] return size(t->left) + size(t->right) + 1; [L79] RET, EXPR size(t) VAL [a=2147483647, b={2:0}, size(t)=1, t={-1:0}, t={-1:0}] [L79] int n = size(t); [L80] CALL assume_cycle_if_not(n != 0) VAL [\old(cond)=1] [L9] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L80] RET assume_cycle_if_not(n != 0) VAL [a=2147483647, b={2:0}, n=1, t={-1:0}, t={-1:0}] [L81] 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}] [L81] 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}] [L82] CALL tree_inorder(t, x, n) VAL [\old(i)=1, a={-2:0}, t={-1:0}] [L60] COND FALSE !(!t) [L63] 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}] [L63] CALL, EXPR tree_inorder(t->left, a, i) VAL [\old(i)=1, a={-2:0}, t={0:0}] [L60] COND TRUE !t [L61] return i; VAL [\old(i)=1, \result=1, a={-2:0}, a={-2:0}, i=1, t={0:0}, t={0:0}] [L63] 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] [L63] i = tree_inorder(t->left, a, i) [L64] EXPR i++ [L64] EXPR t->data [L64] a[i++] = t->data [L65] 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}] [L65] CALL, EXPR tree_inorder(t->right, a, i) VAL [\old(i)=2, a={-2:0}, t={0:0}] [L60] COND TRUE !t [L61] return i; VAL [\old(i)=2, \result=2, a={-2:0}, a={-2:0}, i=2, t={0:0}, t={0:0}] [L65] 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] [L65] i = tree_inorder(t->right, a, i) [L66] return i; VAL [\old(i)=1, \result=2, a={-2:0}, a={-2:0}, i=2, t={-1:0}, t={-1:0}] [L82] 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}] [L83] 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] [L83] 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, 97 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 4.7s, OverallIterations: 4, TraceHistogramMax: 3, AutomataDifference: 2.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 264 SDtfs, 312 SDslu, 1200 SDs, 0 SdLazy, 1596 SolverSat, 301 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 166 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=98occurred 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, 8 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, 41948 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...