/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc config/AutomizerReach.xml -s config/svcomp-Reach-64bit-Automizer_Default.epf -i ../sv-benchmarks/c/verifythis/tree_del_iter_incorrect.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-dev-4f750a8 [2020-12-22 04:51:48,158 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-22 04:51:48,162 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-22 04:51:48,233 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-22 04:51:48,234 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-22 04:51:48,239 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-22 04:51:48,245 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-22 04:51:48,255 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-22 04:51:48,259 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-22 04:51:48,267 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-22 04:51:48,268 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-22 04:51:48,270 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-22 04:51:48,271 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-22 04:51:48,274 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-22 04:51:48,277 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-22 04:51:48,279 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-22 04:51:48,281 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-22 04:51:48,286 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-22 04:51:48,295 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-22 04:51:48,306 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-22 04:51:48,311 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-22 04:51:48,314 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-22 04:51:48,316 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-22 04:51:48,319 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-22 04:51:48,329 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-22 04:51:48,330 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-22 04:51:48,330 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-22 04:51:48,333 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-22 04:51:48,334 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-22 04:51:48,336 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-22 04:51:48,336 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-22 04:51:48,337 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-22 04:51:48,340 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-22 04:51:48,341 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-22 04:51:48,343 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-22 04:51:48,343 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-22 04:51:48,344 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-22 04:51:48,344 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-22 04:51:48,345 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-22 04:51:48,346 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-22 04:51:48,347 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-22 04:51:48,348 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2020-12-22 04:51:48,411 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-22 04:51:48,412 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-22 04:51:48,418 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-22 04:51:48,418 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-22 04:51:48,419 INFO L138 SettingsManager]: * Use SBE=true [2020-12-22 04:51:48,419 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-22 04:51:48,419 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-22 04:51:48,419 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-22 04:51:48,420 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-22 04:51:48,420 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-22 04:51:48,421 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-22 04:51:48,422 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-22 04:51:48,422 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-22 04:51:48,422 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-22 04:51:48,422 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-22 04:51:48,423 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-22 04:51:48,423 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-22 04:51:48,423 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-22 04:51:48,424 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-22 04:51:48,424 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-22 04:51:48,424 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-22 04:51:48,425 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-12-22 04:51:48,425 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-22 04:51:48,425 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-22 04:51:48,425 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-22 04:51:48,426 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2020-12-22 04:51:48,953 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-22 04:51:49,001 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-22 04:51:49,005 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-22 04:51:49,006 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-22 04:51:49,007 INFO L275 PluginConnector]: CDTParser initialized [2020-12-22 04:51:49,008 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/verifythis/tree_del_iter_incorrect.c [2020-12-22 04:51:49,100 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0e861fad0/e30417cd56cc46f0856c866763710588/FLAG5868ca336 [2020-12-22 04:51:49,874 INFO L306 CDTParser]: Found 1 translation units. [2020-12-22 04:51:49,875 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/tree_del_iter_incorrect.c [2020-12-22 04:51:49,887 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0e861fad0/e30417cd56cc46f0856c866763710588/FLAG5868ca336 [2020-12-22 04:51:50,161 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0e861fad0/e30417cd56cc46f0856c866763710588 [2020-12-22 04:51:50,165 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-22 04:51:50,167 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-22 04:51:50,173 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-22 04:51:50,173 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-22 04:51:50,178 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-22 04:51:50,180 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.12 04:51:50" (1/1) ... [2020-12-22 04:51:50,182 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f147e7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:51:50, skipping insertion in model container [2020-12-22 04:51:50,183 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.12 04:51:50" (1/1) ... [2020-12-22 04:51:50,193 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-22 04:51:50,227 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-22 04:51:50,426 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/tree_del_iter_incorrect.c[619,632] [2020-12-22 04:51:50,453 WARN L1501 CHandler]: Possible shadowing of function min [2020-12-22 04:51:50,472 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-22 04:51:50,492 INFO L203 MainTranslator]: Completed pre-run [2020-12-22 04:51:50,508 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/tree_del_iter_incorrect.c[619,632] [2020-12-22 04:51:50,519 WARN L1501 CHandler]: Possible shadowing of function min [2020-12-22 04:51:50,534 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-22 04:51:50,576 INFO L208 MainTranslator]: Completed translation [2020-12-22 04:51:50,578 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:51:50 WrapperNode [2020-12-22 04:51:50,578 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-22 04:51:50,582 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-22 04:51:50,582 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-22 04:51:50,585 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-22 04:51:50,595 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:51:50" (1/1) ... [2020-12-22 04:51:50,615 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:51:50" (1/1) ... [2020-12-22 04:51:50,650 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-22 04:51:50,651 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-22 04:51:50,651 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-22 04:51:50,651 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-22 04:51:50,663 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:51:50" (1/1) ... [2020-12-22 04:51:50,664 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:51:50" (1/1) ... [2020-12-22 04:51:50,673 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:51:50" (1/1) ... [2020-12-22 04:51:50,674 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:51:50" (1/1) ... [2020-12-22 04:51:50,705 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:51:50" (1/1) ... [2020-12-22 04:51:50,715 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:51:50" (1/1) ... [2020-12-22 04:51:50,718 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:51:50" (1/1) ... [2020-12-22 04:51:50,723 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-22 04:51:50,724 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-22 04:51:50,724 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-22 04:51:50,725 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-22 04:51:50,726 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:51:50" (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-12-22 04:51:50,835 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-12-22 04:51:50,836 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-22 04:51:50,836 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-12-22 04:51:50,836 INFO L130 BoogieDeclarations]: Found specification of procedure min [2020-12-22 04:51:50,836 INFO L138 BoogieDeclarations]: Found implementation of procedure min [2020-12-22 04:51:50,836 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-12-22 04:51:50,837 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-12-22 04:51:50,837 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_tree [2020-12-22 04:51:50,837 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_tree [2020-12-22 04:51:50,837 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-22 04:51:50,837 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-12-22 04:51:50,838 INFO L130 BoogieDeclarations]: Found specification of procedure size [2020-12-22 04:51:50,838 INFO L138 BoogieDeclarations]: Found implementation of procedure size [2020-12-22 04:51:50,838 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-22 04:51:50,838 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-22 04:51:50,838 INFO L130 BoogieDeclarations]: Found specification of procedure tree_inorder [2020-12-22 04:51:50,839 INFO L138 BoogieDeclarations]: Found implementation of procedure tree_inorder [2020-12-22 04:51:50,839 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-12-22 04:51:51,657 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-22 04:51:51,657 INFO L299 CfgBuilder]: Removed 24 assume(true) statements. [2020-12-22 04:51:51,659 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 04:51:51 BoogieIcfgContainer [2020-12-22 04:51:51,659 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-22 04:51:51,661 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-22 04:51:51,661 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-22 04:51:51,665 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-22 04:51:51,665 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.12 04:51:50" (1/3) ... [2020-12-22 04:51:51,666 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2171c348 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.12 04:51:51, skipping insertion in model container [2020-12-22 04:51:51,666 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:51:50" (2/3) ... [2020-12-22 04:51:51,667 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2171c348 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.12 04:51:51, skipping insertion in model container [2020-12-22 04:51:51,667 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 04:51:51" (3/3) ... [2020-12-22 04:51:51,669 INFO L111 eAbstractionObserver]: Analyzing ICFG tree_del_iter_incorrect.c [2020-12-22 04:51:51,676 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-22 04:51:51,681 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2020-12-22 04:51:51,701 INFO L253 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2020-12-22 04:51:51,729 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-22 04:51:51,729 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-22 04:51:51,729 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-22 04:51:51,729 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-22 04:51:51,730 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-22 04:51:51,730 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-22 04:51:51,730 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-22 04:51:51,730 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-22 04:51:51,750 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states. [2020-12-22 04:51:51,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-12-22 04:51:51,758 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 04:51:51,759 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] [2020-12-22 04:51:51,760 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 04:51:51,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 04:51:51,767 INFO L82 PathProgramCache]: Analyzing trace with hash 400471207, now seen corresponding path program 1 times [2020-12-22 04:51:51,777 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 04:51:51,778 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203116392] [2020-12-22 04:51:51,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 04:51:51,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 04:51:52,102 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-12-22 04:51:52,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 04:51:52,138 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-12-22 04:51:52,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 04:51:52,146 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-12-22 04:51:52,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 04:51:52,173 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-12-22 04:51:52,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 04:51:52,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 04:51:52,197 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203116392] [2020-12-22 04:51:52,201 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 04:51:52,202 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-22 04:51:52,203 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920458850] [2020-12-22 04:51:52,220 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-22 04:51:52,221 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 04:51:52,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-22 04:51:52,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-22 04:51:52,266 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 4 states. [2020-12-22 04:51:52,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 04:51:52,698 INFO L93 Difference]: Finished difference Result 136 states and 180 transitions. [2020-12-22 04:51:52,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-22 04:51:52,701 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 30 [2020-12-22 04:51:52,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 04:51:52,715 INFO L225 Difference]: With dead ends: 136 [2020-12-22 04:51:52,716 INFO L226 Difference]: Without dead ends: 78 [2020-12-22 04:51:52,721 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-22 04:51:52,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2020-12-22 04:51:52,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 73. [2020-12-22 04:51:52,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2020-12-22 04:51:52,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 90 transitions. [2020-12-22 04:51:52,823 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 90 transitions. Word has length 30 [2020-12-22 04:51:52,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 04:51:52,824 INFO L481 AbstractCegarLoop]: Abstraction has 73 states and 90 transitions. [2020-12-22 04:51:52,827 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-22 04:51:52,827 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 90 transitions. [2020-12-22 04:51:52,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-12-22 04:51:52,831 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 04:51:52,832 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] [2020-12-22 04:51:52,834 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-22 04:51:52,834 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 04:51:52,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 04:51:52,836 INFO L82 PathProgramCache]: Analyzing trace with hash 1101535785, now seen corresponding path program 1 times [2020-12-22 04:51:52,836 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 04:51:52,837 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826197977] [2020-12-22 04:51:52,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 04:51:52,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 04:51:53,093 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-12-22 04:51:53,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 04:51:53,118 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-12-22 04:51:53,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 04:51:53,131 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-12-22 04:51:53,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 04:51:53,201 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-12-22 04:51:53,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 04:51:53,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 04:51:53,225 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826197977] [2020-12-22 04:51:53,228 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 04:51:53,228 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-12-22 04:51:53,228 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554614374] [2020-12-22 04:51:53,230 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-22 04:51:53,231 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 04:51:53,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-22 04:51:53,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-12-22 04:51:53,234 INFO L87 Difference]: Start difference. First operand 73 states and 90 transitions. Second operand 7 states. [2020-12-22 04:51:53,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 04:51:53,526 INFO L93 Difference]: Finished difference Result 130 states and 164 transitions. [2020-12-22 04:51:53,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-22 04:51:53,527 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 30 [2020-12-22 04:51:53,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 04:51:53,530 INFO L225 Difference]: With dead ends: 130 [2020-12-22 04:51:53,530 INFO L226 Difference]: Without dead ends: 80 [2020-12-22 04:51:53,532 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-12-22 04:51:53,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2020-12-22 04:51:53,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 75. [2020-12-22 04:51:53,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2020-12-22 04:51:53,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 94 transitions. [2020-12-22 04:51:53,549 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 94 transitions. Word has length 30 [2020-12-22 04:51:53,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 04:51:53,550 INFO L481 AbstractCegarLoop]: Abstraction has 75 states and 94 transitions. [2020-12-22 04:51:53,550 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-22 04:51:53,550 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 94 transitions. [2020-12-22 04:51:53,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2020-12-22 04:51:53,553 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 04:51:53,553 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] [2020-12-22 04:51:53,553 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-22 04:51:53,554 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 04:51:53,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 04:51:53,554 INFO L82 PathProgramCache]: Analyzing trace with hash -1481862926, now seen corresponding path program 1 times [2020-12-22 04:51:53,555 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 04:51:53,555 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425046105] [2020-12-22 04:51:53,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 04:51:53,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 04:51:53,627 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-12-22 04:51:53,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 04:51:53,656 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-12-22 04:51:53,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 04:51:53,662 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-12-22 04:51:53,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 04:51:53,727 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-12-22 04:51:53,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 04:51:53,735 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-12-22 04:51:53,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 04:51:53,758 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2020-12-22 04:51:53,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 04:51:53,768 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-12-22 04:51:53,768 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425046105] [2020-12-22 04:51:53,768 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2138139423] [2020-12-22 04:51:53,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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-12-22 04:51:53,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 04:51:53,877 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 25 conjunts are in the unsatisfiable core [2020-12-22 04:51:53,887 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-22 04:51:54,075 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-12-22 04:51:54,076 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-22 04:51:54,076 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 11 [2020-12-22 04:51:54,076 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262106036] [2020-12-22 04:51:54,077 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-12-22 04:51:54,078 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 04:51:54,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-12-22 04:51:54,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2020-12-22 04:51:54,079 INFO L87 Difference]: Start difference. First operand 75 states and 94 transitions. Second operand 11 states. [2020-12-22 04:51:54,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 04:51:54,588 INFO L93 Difference]: Finished difference Result 136 states and 173 transitions. [2020-12-22 04:51:54,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-22 04:51:54,589 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 42 [2020-12-22 04:51:54,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 04:51:54,591 INFO L225 Difference]: With dead ends: 136 [2020-12-22 04:51:54,591 INFO L226 Difference]: Without dead ends: 80 [2020-12-22 04:51:54,593 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 49 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2020-12-22 04:51:54,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2020-12-22 04:51:54,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 77. [2020-12-22 04:51:54,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2020-12-22 04:51:54,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 97 transitions. [2020-12-22 04:51:54,608 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 97 transitions. Word has length 42 [2020-12-22 04:51:54,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 04:51:54,609 INFO L481 AbstractCegarLoop]: Abstraction has 77 states and 97 transitions. [2020-12-22 04:51:54,609 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-12-22 04:51:54,609 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 97 transitions. [2020-12-22 04:51:54,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2020-12-22 04:51:54,612 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 04:51:54,612 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 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] [2020-12-22 04:51:54,826 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2020-12-22 04:51:54,827 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 04:51:54,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 04:51:54,828 INFO L82 PathProgramCache]: Analyzing trace with hash -1950591435, now seen corresponding path program 1 times [2020-12-22 04:51:54,829 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 04:51:54,829 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516494993] [2020-12-22 04:51:54,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 04:51:54,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 04:51:54,906 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-12-22 04:51:54,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 04:51:55,010 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-12-22 04:51:55,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 04:51:55,018 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-12-22 04:51:55,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 04:51:55,027 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2020-12-22 04:51:55,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 04:51:55,056 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-12-22 04:51:55,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 04:51:55,066 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-12-22 04:51:55,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 04:51:55,070 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-12-22 04:51:55,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 04:51:55,095 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-12-22 04:51:55,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 04:51:55,107 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2020-12-22 04:51:55,108 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516494993] [2020-12-22 04:51:55,108 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 04:51:55,109 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-12-22 04:51:55,109 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805683464] [2020-12-22 04:51:55,110 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-12-22 04:51:55,110 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 04:51:55,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-12-22 04:51:55,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2020-12-22 04:51:55,111 INFO L87 Difference]: Start difference. First operand 77 states and 97 transitions. Second operand 10 states. [2020-12-22 04:51:55,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 04:51:55,586 INFO L93 Difference]: Finished difference Result 136 states and 173 transitions. [2020-12-22 04:51:55,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-22 04:51:55,587 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 52 [2020-12-22 04:51:55,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 04:51:55,589 INFO L225 Difference]: With dead ends: 136 [2020-12-22 04:51:55,589 INFO L226 Difference]: Without dead ends: 82 [2020-12-22 04:51:55,591 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2020-12-22 04:51:55,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2020-12-22 04:51:55,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 79. [2020-12-22 04:51:55,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2020-12-22 04:51:55,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 100 transitions. [2020-12-22 04:51:55,607 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 100 transitions. Word has length 52 [2020-12-22 04:51:55,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 04:51:55,608 INFO L481 AbstractCegarLoop]: Abstraction has 79 states and 100 transitions. [2020-12-22 04:51:55,608 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-12-22 04:51:55,608 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 100 transitions. [2020-12-22 04:51:55,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2020-12-22 04:51:55,613 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 04:51:55,614 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] [2020-12-22 04:51:55,614 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-12-22 04:51:55,614 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 04:51:55,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 04:51:55,615 INFO L82 PathProgramCache]: Analyzing trace with hash 989968802, now seen corresponding path program 1 times [2020-12-22 04:51:55,615 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 04:51:55,616 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924608420] [2020-12-22 04:51:55,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 04:51:55,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 04:51:55,709 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-12-22 04:51:55,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 04:51:55,755 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-12-22 04:51:55,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 04:51:55,762 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-12-22 04:51:55,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 04:51:55,769 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2020-12-22 04:51:55,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 04:51:55,872 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-12-22 04:51:55,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 04:51:55,881 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-12-22 04:51:55,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 04:51:55,887 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-12-22 04:51:55,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 04:51:55,898 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-12-22 04:51:55,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 04:51:55,901 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-12-22 04:51:55,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 04:51:55,928 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2020-12-22 04:51:55,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 04:51:55,977 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2020-12-22 04:51:55,978 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924608420] [2020-12-22 04:51:55,978 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1888314612] [2020-12-22 04:51:55,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-22 04:51:56,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 04:51:56,152 INFO L263 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 17 conjunts are in the unsatisfiable core [2020-12-22 04:51:56,157 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-22 04:51:56,329 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2020-12-22 04:51:56,329 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-12-22 04:51:56,330 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [14] total 17 [2020-12-22 04:51:56,330 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393409939] [2020-12-22 04:51:56,331 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-22 04:51:56,331 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 04:51:56,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-22 04:51:56,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=239, Unknown=0, NotChecked=0, Total=272 [2020-12-22 04:51:56,333 INFO L87 Difference]: Start difference. First operand 79 states and 100 transitions. Second operand 8 states. [2020-12-22 04:51:56,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 04:51:56,489 INFO L93 Difference]: Finished difference Result 128 states and 162 transitions. [2020-12-22 04:51:56,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-22 04:51:56,490 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 65 [2020-12-22 04:51:56,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 04:51:56,492 INFO L225 Difference]: With dead ends: 128 [2020-12-22 04:51:56,492 INFO L226 Difference]: Without dead ends: 81 [2020-12-22 04:51:56,494 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=335, Unknown=0, NotChecked=0, Total=380 [2020-12-22 04:51:56,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2020-12-22 04:51:56,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2020-12-22 04:51:56,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2020-12-22 04:51:56,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 104 transitions. [2020-12-22 04:51:56,508 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 104 transitions. Word has length 65 [2020-12-22 04:51:56,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 04:51:56,509 INFO L481 AbstractCegarLoop]: Abstraction has 81 states and 104 transitions. [2020-12-22 04:51:56,509 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-22 04:51:56,509 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 104 transitions. [2020-12-22 04:51:56,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2020-12-22 04:51:56,512 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 04:51:56,512 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] [2020-12-22 04:51:56,725 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-22 04:51:56,726 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 04:51:56,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 04:51:56,728 INFO L82 PathProgramCache]: Analyzing trace with hash -1197061387, now seen corresponding path program 1 times [2020-12-22 04:51:56,729 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 04:51:56,729 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858356697] [2020-12-22 04:51:56,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 04:51:56,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-22 04:51:56,789 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-22 04:51:56,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-22 04:51:56,832 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-22 04:51:56,888 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-12-22 04:51:56,888 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-12-22 04:51:56,888 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-12-22 04:51:56,919 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-12-22 04:51:56,921 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-12-22 04:51:56,921 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-12-22 04:51:56,921 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-12-22 04:51:56,925 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-12-22 04:51:56,926 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-12-22 04:51:56,926 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-12-22 04:51:56,926 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-12-22 04:51:56,927 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-12-22 04:51:56,927 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-12-22 04:51:56,927 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-12-22 04:51:56,928 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-12-22 04:51:57,013 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.12 04:51:57 BoogieIcfgContainer [2020-12-22 04:51:57,014 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-12-22 04:51:57,015 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-22 04:51:57,015 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-22 04:51:57,015 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-22 04:51:57,016 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 04:51:51" (3/4) ... [2020-12-22 04:51:57,018 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-12-22 04:51:57,030 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-12-22 04:51:57,031 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-12-22 04:51:57,031 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-12-22 04:51:57,031 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-12-22 04:51:57,032 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-12-22 04:51:57,032 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-12-22 04:51:57,033 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-12-22 04:51:57,033 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-12-22 04:51:57,033 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-12-22 04:51:57,033 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-12-22 04:51:57,033 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-12-22 04:51:57,034 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-12-22 04:51:57,134 INFO L141 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/verifythis/tree_del_iter_incorrect.c-witness.graphml [2020-12-22 04:51:57,134 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-22 04:51:57,137 INFO L168 Benchmark]: Toolchain (without parser) took 6968.96 ms. Allocated memory was 154.1 MB in the beginning and 203.4 MB in the end (delta: 49.3 MB). Free memory was 129.5 MB in the beginning and 105.7 MB in the end (delta: 23.8 MB). Peak memory consumption was 73.5 MB. Max. memory is 8.0 GB. [2020-12-22 04:51:57,138 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 154.1 MB. Free memory is still 124.9 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-12-22 04:51:57,138 INFO L168 Benchmark]: CACSL2BoogieTranslator took 406.54 ms. Allocated memory is still 154.1 MB. Free memory was 129.3 MB in the beginning and 117.6 MB in the end (delta: 11.7 MB). Peak memory consumption was 11.5 MB. Max. memory is 8.0 GB. [2020-12-22 04:51:57,139 INFO L168 Benchmark]: Boogie Procedure Inliner took 68.34 ms. Allocated memory is still 154.1 MB. Free memory was 117.4 MB in the beginning and 115.5 MB in the end (delta: 1.9 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2020-12-22 04:51:57,140 INFO L168 Benchmark]: Boogie Preprocessor took 72.62 ms. Allocated memory is still 154.1 MB. Free memory was 115.5 MB in the beginning and 113.6 MB in the end (delta: 1.9 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2020-12-22 04:51:57,141 INFO L168 Benchmark]: RCFGBuilder took 935.43 ms. Allocated memory is still 154.1 MB. Free memory was 113.4 MB in the beginning and 116.2 MB in the end (delta: -2.8 MB). Peak memory consumption was 14.7 MB. Max. memory is 8.0 GB. [2020-12-22 04:51:57,141 INFO L168 Benchmark]: TraceAbstraction took 5352.50 ms. Allocated memory was 154.1 MB in the beginning and 203.4 MB in the end (delta: 49.3 MB). Free memory was 115.7 MB in the beginning and 112.0 MB in the end (delta: 3.7 MB). Peak memory consumption was 53.5 MB. Max. memory is 8.0 GB. [2020-12-22 04:51:57,142 INFO L168 Benchmark]: Witness Printer took 119.96 ms. Allocated memory is still 203.4 MB. Free memory was 112.0 MB in the beginning and 105.7 MB in the end (delta: 6.3 MB). Peak memory consumption was 6.3 MB. Max. memory is 8.0 GB. [2020-12-22 04:51:57,146 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 154.1 MB. Free memory is still 124.9 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 406.54 ms. Allocated memory is still 154.1 MB. Free memory was 129.3 MB in the beginning and 117.6 MB in the end (delta: 11.7 MB). Peak memory consumption was 11.5 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 68.34 ms. Allocated memory is still 154.1 MB. Free memory was 117.4 MB in the beginning and 115.5 MB in the end (delta: 1.9 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 72.62 ms. Allocated memory is still 154.1 MB. Free memory was 115.5 MB in the beginning and 113.6 MB in the end (delta: 1.9 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 935.43 ms. Allocated memory is still 154.1 MB. Free memory was 113.4 MB in the beginning and 116.2 MB in the end (delta: -2.8 MB). Peak memory consumption was 14.7 MB. Max. memory is 8.0 GB. * TraceAbstraction took 5352.50 ms. Allocated memory was 154.1 MB in the beginning and 203.4 MB in the end (delta: 49.3 MB). Free memory was 115.7 MB in the beginning and 112.0 MB in the end (delta: 3.7 MB). Peak memory consumption was 53.5 MB. Max. memory is 8.0 GB. * Witness Printer took 119.96 ms. Allocated memory is still 203.4 MB. Free memory was 112.0 MB in the beginning and 105.7 MB in the end (delta: 6.3 MB). Peak memory consumption was 6.3 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 16]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L105] CALL nondet_tree() [L25] COND FALSE !(__VERIFIER_nondet_bool()) [L28] struct node *n = (struct node *)malloc(sizeof(struct node)); [L29] n->data = __VERIFIER_nondet_int() [L30] CALL, EXPR nondet_tree() [L25] COND TRUE __VERIFIER_nondet_bool() [L26] return 0; VAL [\result={0:0}] [L30] RET, EXPR nondet_tree() VAL [malloc(sizeof(struct node))={-2:0}, n={-2:0}, nondet_tree()={0:0}] [L30] n->left = nondet_tree() [L31] CALL, EXPR nondet_tree() [L25] COND TRUE __VERIFIER_nondet_bool() [L26] return 0; VAL [\result={0:0}] [L31] RET, EXPR nondet_tree() VAL [malloc(sizeof(struct node))={-2:0}, n={-2:0}, nondet_tree()={0:0}] [L31] n->right = nondet_tree() [L32] return n; VAL [\result={-2:0}, malloc(sizeof(struct node))={-2:0}, n={-2:0}] [L105] RET nondet_tree() [L83] CALL, EXPR min(t) VAL [n={-2:0}] [L37] COND FALSE !(!n) [L40] EXPR n->left VAL [n={-2:0}, n={-2:0}, n->left={0:0}] [L40] CALL, EXPR min(n->left) VAL [n={0:0}] [L37] COND TRUE !n [L38] return 2147483647; VAL [\result=2147483647, n={0:0}, n={0:0}] [L40] RET, EXPR min(n->left) VAL [min(n->left)=2147483647, n={-2:0}, n={-2:0}, n->left={0:0}] [L40] int a = min(n->left); [L41] EXPR n->right VAL [a=2147483647, n={-2:0}, n={-2:0}, n->right={0:0}] [L41] CALL, EXPR min(n->right) VAL [n={0:0}] [L37] COND TRUE !n [L38] return 2147483647; VAL [\result=2147483647, n={0:0}, n={0:0}] [L41] RET, EXPR min(n->right) VAL [a=2147483647, min(n->right)=2147483647, n={-2:0}, n={-2:0}, n->right={0:0}] [L41] int b = min(n->right); [L42] COND TRUE a <= b [L42] return a; VAL [\result=2147483647, a=2147483647, b=2147483647, n={-2:0}, n={-2:0}] [L83] RET, EXPR min(t) [L83] int a = min(t); [L84] int b; [L86] CALL, EXPR size(t) VAL [t={-2:0}] [L78] COND FALSE !(!t) [L79] EXPR t->left VAL [t={-2:0}, t={-2:0}, t->left={0:0}] [L79] CALL, EXPR size(t->left) VAL [t={0:0}] [L78] COND TRUE !t [L78] return 0; VAL [\result=0, t={0:0}, t={0:0}] [L79] RET, EXPR size(t->left) VAL [size(t->left)=0, t={-2:0}, t={-2:0}, t->left={0:0}] [L79] EXPR t->right VAL [size(t->left)=0, t={-2:0}, t={-2:0}, t->left={0:0}, t->right={0:0}] [L79] CALL, EXPR size(t->right) VAL [t={0:0}] [L78] COND TRUE !t [L78] return 0; VAL [\result=0, t={0:0}, t={0:0}] [L79] RET, EXPR size(t->right) VAL [size(t->left)=0, size(t->right)=0, t={-2:0}, t={-2:0}, t->left={0:0}, t->right={0:0}] [L79] return size(t->left) + size(t->right) + 1; [L86] RET, EXPR size(t) [L86] int n = size(t); [L10] COND FALSE !(!cond) [L88] int *x = calloc(n, sizeof(int)); [L89] CALL tree_inorder(t, x, n) VAL [\old(i)=1, a={-3:0}, t={-2:0}] [L67] COND FALSE !(!t) [L70] EXPR t->left VAL [\old(i)=1, a={-3:0}, a={-3:0}, i=1, t={-2:0}, t={-2:0}, t->left={0:0}] [L70] CALL, EXPR tree_inorder(t->left, a, i) VAL [\old(i)=1, a={-3:0}, t={0:0}] [L67] COND TRUE !t [L68] return i; VAL [\old(i)=1, \result=1, a={-3:0}, a={-3:0}, i=1, t={0:0}, t={0:0}] [L70] RET, EXPR tree_inorder(t->left, a, i) VAL [\old(i)=1, a={-3:0}, a={-3:0}, i=1, t={-2:0}, t={-2:0}, t->left={0:0}, tree_inorder(t->left, a, i)=1] [L70] i = tree_inorder(t->left, a, i) [L71] EXPR i++ [L71] EXPR t->data [L71] a[i++] = t->data [L72] EXPR t->right VAL [\old(i)=1, a={-3:0}, a={-3:0}, i=2, t={-2:0}, t={-2:0}, t->right={0:0}] [L72] CALL, EXPR tree_inorder(t->right, a, i) VAL [\old(i)=2, a={-3:0}, t={0:0}] [L67] COND TRUE !t [L68] return i; VAL [\old(i)=2, \result=2, a={-3:0}, a={-3:0}, i=2, t={0:0}, t={0:0}] [L72] RET, EXPR tree_inorder(t->right, a, i) VAL [\old(i)=1, a={-3:0}, a={-3:0}, i=2, t={-2:0}, t={-2:0}, t->right={0:0}, tree_inorder(t->right, a, i)=2] [L72] i = tree_inorder(t->right, a, i) [L73] return i; VAL [\old(i)=1, \result=2, a={-3:0}, a={-3:0}, i=2, t={-2:0}, t={-2:0}] [L89] RET tree_inorder(t, x, n) [L90] x[0] [L16] COND TRUE !cond [L16] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 78 locations, 4 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 5.1s, OverallIterations: 6, TraceHistogramMax: 3, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 393 SDtfs, 305 SDslu, 1416 SDs, 0 SdLazy, 748 SolverSat, 158 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 212 GetRequests, 159 SyntacticMatches, 2 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=81occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 16 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 403 NumberOfCodeBlocks, 403 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 319 ConstructedInterpolants, 0 QuantifiedInterpolants, 48439 SizeOfPredicates, 13 NumberOfNonLiveVariables, 590 ConjunctsInSsa, 42 ConjunctsInUnsatCore, 7 InterpolantComputations, 4 PerfectInterpolantSequences, 105/111 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...