./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/verifythis/tree_del_rec_incorrect.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 54858612 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/verifythis/tree_del_rec_incorrect.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f1439388ab0e0331a25110b61c93eea2b0d4bab5 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.2.0-5485861 [2020-10-25 23:12:44,654 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-25 23:12:44,657 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-25 23:12:44,691 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-25 23:12:44,691 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-25 23:12:44,693 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-25 23:12:44,695 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-25 23:12:44,697 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-25 23:12:44,699 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-25 23:12:44,700 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-25 23:12:44,701 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-25 23:12:44,703 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-25 23:12:44,703 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-25 23:12:44,704 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-25 23:12:44,706 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-25 23:12:44,707 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-25 23:12:44,708 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-25 23:12:44,709 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-25 23:12:44,711 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-25 23:12:44,713 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-25 23:12:44,715 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-25 23:12:44,717 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-25 23:12:44,719 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-25 23:12:44,720 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-25 23:12:44,723 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-25 23:12:44,723 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-25 23:12:44,723 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-25 23:12:44,724 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-25 23:12:44,725 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-25 23:12:44,726 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-25 23:12:44,727 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-25 23:12:44,728 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-25 23:12:44,729 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-25 23:12:44,729 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-25 23:12:44,731 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-25 23:12:44,731 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-25 23:12:44,732 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-25 23:12:44,732 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-25 23:12:44,733 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-25 23:12:44,734 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-25 23:12:44,735 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-25 23:12:44,737 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-10-25 23:12:44,770 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-25 23:12:44,770 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-25 23:12:44,772 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-25 23:12:44,772 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-25 23:12:44,772 INFO L138 SettingsManager]: * Use SBE=true [2020-10-25 23:12:44,773 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-25 23:12:44,773 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-25 23:12:44,773 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-25 23:12:44,773 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-25 23:12:44,774 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-25 23:12:44,774 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-25 23:12:44,774 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-25 23:12:44,774 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-25 23:12:44,775 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-25 23:12:44,775 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-25 23:12:44,775 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-25 23:12:44,775 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-25 23:12:44,776 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-25 23:12:44,776 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-25 23:12:44,776 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-25 23:12:44,777 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-25 23:12:44,777 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-25 23:12:44,777 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-25 23:12:44,777 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-25 23:12:44,778 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-25 23:12:44,778 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-25 23:12:44,778 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-25 23:12:44,778 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-25 23:12:44,779 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-25 23:12:44,779 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f1439388ab0e0331a25110b61c93eea2b0d4bab5 [2020-10-25 23:12:45,181 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-25 23:12:45,219 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-25 23:12:45,223 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-25 23:12:45,224 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-25 23:12:45,225 INFO L275 PluginConnector]: CDTParser initialized [2020-10-25 23:12:45,226 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/verifythis/tree_del_rec_incorrect.c [2020-10-25 23:12:45,310 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/be19c6b0a/159ef5b516ef4019acc016a823dc0011/FLAG046826bab [2020-10-25 23:12:45,979 INFO L306 CDTParser]: Found 1 translation units. [2020-10-25 23:12:45,980 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/tree_del_rec_incorrect.c [2020-10-25 23:12:45,988 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/be19c6b0a/159ef5b516ef4019acc016a823dc0011/FLAG046826bab [2020-10-25 23:12:46,320 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/be19c6b0a/159ef5b516ef4019acc016a823dc0011 [2020-10-25 23:12:46,323 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-25 23:12:46,331 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-25 23:12:46,333 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-25 23:12:46,333 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-25 23:12:46,340 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-25 23:12:46,342 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 11:12:46" (1/1) ... [2020-10-25 23:12:46,345 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28ef1410 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 11:12:46, skipping insertion in model container [2020-10-25 23:12:46,345 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 11:12:46" (1/1) ... [2020-10-25 23:12:46,354 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-25 23:12:46,374 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-25 23:12:46,597 WARN L1500 CHandler]: Possible shadowing of function min [2020-10-25 23:12:46,599 WARN L1500 CHandler]: Possible shadowing of function min [2020-10-25 23:12:46,619 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-25 23:12:46,636 INFO L203 MainTranslator]: Completed pre-run [2020-10-25 23:12:46,656 WARN L1500 CHandler]: Possible shadowing of function min [2020-10-25 23:12:46,658 WARN L1500 CHandler]: Possible shadowing of function min [2020-10-25 23:12:46,673 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-25 23:12:46,695 INFO L208 MainTranslator]: Completed translation [2020-10-25 23:12:46,696 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 11:12:46 WrapperNode [2020-10-25 23:12:46,696 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-25 23:12:46,698 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-25 23:12:46,698 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-25 23:12:46,698 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-25 23:12:46,707 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 11:12:46" (1/1) ... [2020-10-25 23:12:46,719 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 11:12:46" (1/1) ... [2020-10-25 23:12:46,745 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-25 23:12:46,746 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-25 23:12:46,747 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-25 23:12:46,747 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-25 23:12:46,757 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 11:12:46" (1/1) ... [2020-10-25 23:12:46,757 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 11:12:46" (1/1) ... [2020-10-25 23:12:46,762 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 11:12:46" (1/1) ... [2020-10-25 23:12:46,762 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 11:12:46" (1/1) ... [2020-10-25 23:12:46,775 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 11:12:46" (1/1) ... [2020-10-25 23:12:46,780 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 11:12:46" (1/1) ... [2020-10-25 23:12:46,783 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 11:12:46" (1/1) ... [2020-10-25 23:12:46,790 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-25 23:12:46,791 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-25 23:12:46,792 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-25 23:12:46,792 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-25 23:12:46,793 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 11:12:46" (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-10-25 23:12:46,876 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-10-25 23:12:46,876 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-25 23:12:46,876 INFO L130 BoogieDeclarations]: Found specification of procedure tree_del [2020-10-25 23:12:46,876 INFO L138 BoogieDeclarations]: Found implementation of procedure tree_del [2020-10-25 23:12:46,876 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-25 23:12:46,879 INFO L130 BoogieDeclarations]: Found specification of procedure min [2020-10-25 23:12:46,879 INFO L138 BoogieDeclarations]: Found implementation of procedure min [2020-10-25 23:12:46,879 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-25 23:12:46,880 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-10-25 23:12:46,880 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_tree [2020-10-25 23:12:46,880 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_tree [2020-10-25 23:12:46,880 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-25 23:12:46,880 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-10-25 23:12:46,880 INFO L130 BoogieDeclarations]: Found specification of procedure size [2020-10-25 23:12:46,880 INFO L138 BoogieDeclarations]: Found implementation of procedure size [2020-10-25 23:12:46,881 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-25 23:12:46,881 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-25 23:12:46,881 INFO L130 BoogieDeclarations]: Found specification of procedure tree_inorder [2020-10-25 23:12:46,881 INFO L138 BoogieDeclarations]: Found implementation of procedure tree_inorder [2020-10-25 23:12:46,881 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-25 23:12:47,702 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-25 23:12:47,703 INFO L298 CfgBuilder]: Removed 29 assume(true) statements. [2020-10-25 23:12:47,705 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 11:12:47 BoogieIcfgContainer [2020-10-25 23:12:47,705 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-25 23:12:47,710 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-25 23:12:47,710 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-25 23:12:47,714 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-25 23:12:47,714 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.10 11:12:46" (1/3) ... [2020-10-25 23:12:47,716 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@515c6232 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 11:12:47, skipping insertion in model container [2020-10-25 23:12:47,716 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 11:12:46" (2/3) ... [2020-10-25 23:12:47,716 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@515c6232 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 11:12:47, skipping insertion in model container [2020-10-25 23:12:47,717 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 11:12:47" (3/3) ... [2020-10-25 23:12:47,718 INFO L111 eAbstractionObserver]: Analyzing ICFG tree_del_rec_incorrect.c [2020-10-25 23:12:47,732 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-25 23:12:47,738 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2020-10-25 23:12:47,755 INFO L253 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2020-10-25 23:12:47,788 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-25 23:12:47,789 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-25 23:12:47,789 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-25 23:12:47,789 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-25 23:12:47,789 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-25 23:12:47,789 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-25 23:12:47,789 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-25 23:12:47,790 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-25 23:12:47,810 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states. [2020-10-25 23:12:47,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-10-25 23:12:47,819 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:12:47,820 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-10-25 23:12:47,820 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:12:47,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:12:47,827 INFO L82 PathProgramCache]: Analyzing trace with hash 325126343, now seen corresponding path program 1 times [2020-10-25 23:12:47,837 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:12:47,838 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584177848] [2020-10-25 23:12:47,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:12:47,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:12:48,079 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-25 23:12:48,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:12:48,098 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-10-25 23:12:48,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:12:48,117 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-25 23:12:48,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:12:48,152 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-10-25 23:12:48,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:12:48,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 23:12:48,180 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584177848] [2020-10-25 23:12:48,181 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 23:12:48,182 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-25 23:12:48,182 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267815348] [2020-10-25 23:12:48,188 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-25 23:12:48,188 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:12:48,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-25 23:12:48,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-25 23:12:48,202 INFO L87 Difference]: Start difference. First operand 85 states. Second operand 4 states. [2020-10-25 23:12:48,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:12:48,441 INFO L93 Difference]: Finished difference Result 146 states and 188 transitions. [2020-10-25 23:12:48,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 23:12:48,443 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 30 [2020-10-25 23:12:48,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:12:48,454 INFO L225 Difference]: With dead ends: 146 [2020-10-25 23:12:48,455 INFO L226 Difference]: Without dead ends: 81 [2020-10-25 23:12:48,459 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-10-25 23:12:48,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2020-10-25 23:12:48,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 76. [2020-10-25 23:12:48,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2020-10-25 23:12:48,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 93 transitions. [2020-10-25 23:12:48,555 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 93 transitions. Word has length 30 [2020-10-25 23:12:48,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:12:48,557 INFO L481 AbstractCegarLoop]: Abstraction has 76 states and 93 transitions. [2020-10-25 23:12:48,557 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-25 23:12:48,557 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 93 transitions. [2020-10-25 23:12:48,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-10-25 23:12:48,564 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:12:48,564 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-10-25 23:12:48,564 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-25 23:12:48,565 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:12:48,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:12:48,566 INFO L82 PathProgramCache]: Analyzing trace with hash 1026190921, now seen corresponding path program 1 times [2020-10-25 23:12:48,567 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:12:48,567 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126824545] [2020-10-25 23:12:48,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:12:48,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:12:48,679 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-25 23:12:48,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:12:48,686 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-10-25 23:12:48,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:12:48,691 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-25 23:12:48,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:12:48,720 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-10-25 23:12:48,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:12:48,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 23:12:48,730 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126824545] [2020-10-25 23:12:48,730 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 23:12:48,730 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-25 23:12:48,731 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89136515] [2020-10-25 23:12:48,732 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-25 23:12:48,733 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:12:48,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-25 23:12:48,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-10-25 23:12:48,734 INFO L87 Difference]: Start difference. First operand 76 states and 93 transitions. Second operand 7 states. [2020-10-25 23:12:49,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:12:49,035 INFO L93 Difference]: Finished difference Result 136 states and 170 transitions. [2020-10-25 23:12:49,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-25 23:12:49,036 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 30 [2020-10-25 23:12:49,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:12:49,039 INFO L225 Difference]: With dead ends: 136 [2020-10-25 23:12:49,039 INFO L226 Difference]: Without dead ends: 83 [2020-10-25 23:12:49,041 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-10-25 23:12:49,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2020-10-25 23:12:49,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 78. [2020-10-25 23:12:49,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2020-10-25 23:12:49,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 97 transitions. [2020-10-25 23:12:49,057 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 97 transitions. Word has length 30 [2020-10-25 23:12:49,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:12:49,058 INFO L481 AbstractCegarLoop]: Abstraction has 78 states and 97 transitions. [2020-10-25 23:12:49,058 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-25 23:12:49,058 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 97 transitions. [2020-10-25 23:12:49,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2020-10-25 23:12:49,060 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:12:49,060 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-10-25 23:12:49,061 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-25 23:12:49,061 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:12:49,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:12:49,062 INFO L82 PathProgramCache]: Analyzing trace with hash -448564166, now seen corresponding path program 1 times [2020-10-25 23:12:49,062 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:12:49,062 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328052900] [2020-10-25 23:12:49,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:12:49,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:12:49,146 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-25 23:12:49,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:12:49,178 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-10-25 23:12:49,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:12:49,185 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-25 23:12:49,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:12:49,226 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-25 23:12:49,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:12:49,233 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-25 23:12:49,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:12:49,269 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2020-10-25 23:12:49,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:12:49,280 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-10-25 23:12:49,281 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328052900] [2020-10-25 23:12:49,281 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2048612829] [2020-10-25 23:12:49,281 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-10-25 23:12:49,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:12:49,405 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 25 conjunts are in the unsatisfiable core [2020-10-25 23:12:49,422 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-25 23:12:49,503 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-10-25 23:12:49,504 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-25 23:12:49,504 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 9 [2020-10-25 23:12:49,505 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64352395] [2020-10-25 23:12:49,505 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-25 23:12:49,505 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:12:49,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-25 23:12:49,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2020-10-25 23:12:49,507 INFO L87 Difference]: Start difference. First operand 78 states and 97 transitions. Second operand 9 states. [2020-10-25 23:12:50,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:12:50,034 INFO L93 Difference]: Finished difference Result 142 states and 179 transitions. [2020-10-25 23:12:50,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-25 23:12:50,035 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 42 [2020-10-25 23:12:50,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:12:50,037 INFO L225 Difference]: With dead ends: 142 [2020-10-25 23:12:50,037 INFO L226 Difference]: Without dead ends: 83 [2020-10-25 23:12:50,039 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 50 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2020-10-25 23:12:50,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2020-10-25 23:12:50,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 80. [2020-10-25 23:12:50,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2020-10-25 23:12:50,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 100 transitions. [2020-10-25 23:12:50,052 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 100 transitions. Word has length 42 [2020-10-25 23:12:50,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:12:50,053 INFO L481 AbstractCegarLoop]: Abstraction has 80 states and 100 transitions. [2020-10-25 23:12:50,053 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-25 23:12:50,053 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 100 transitions. [2020-10-25 23:12:50,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2020-10-25 23:12:50,056 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:12:50,056 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-10-25 23:12:50,270 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2020-10-25 23:12:50,272 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:12:50,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:12:50,273 INFO L82 PathProgramCache]: Analyzing trace with hash 1006862077, now seen corresponding path program 1 times [2020-10-25 23:12:50,273 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:12:50,274 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218290010] [2020-10-25 23:12:50,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:12:50,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:12:50,392 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-25 23:12:50,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:12:50,498 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-25 23:12:50,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:12:50,505 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-25 23:12:50,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:12:50,512 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2020-10-25 23:12:50,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:12:50,540 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-25 23:12:50,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:12:50,547 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-25 23:12:50,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:12:50,550 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-25 23:12:50,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:12:50,572 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-10-25 23:12:50,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:12:50,581 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2020-10-25 23:12:50,581 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218290010] [2020-10-25 23:12:50,581 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 23:12:50,582 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-25 23:12:50,582 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545044388] [2020-10-25 23:12:50,582 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-25 23:12:50,583 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:12:50,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-25 23:12:50,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2020-10-25 23:12:50,584 INFO L87 Difference]: Start difference. First operand 80 states and 100 transitions. Second operand 10 states. [2020-10-25 23:12:51,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:12:51,046 INFO L93 Difference]: Finished difference Result 142 states and 179 transitions. [2020-10-25 23:12:51,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-25 23:12:51,047 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 52 [2020-10-25 23:12:51,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:12:51,049 INFO L225 Difference]: With dead ends: 142 [2020-10-25 23:12:51,049 INFO L226 Difference]: Without dead ends: 85 [2020-10-25 23:12:51,051 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-10-25 23:12:51,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2020-10-25 23:12:51,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 82. [2020-10-25 23:12:51,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2020-10-25 23:12:51,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 103 transitions. [2020-10-25 23:12:51,065 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 103 transitions. Word has length 52 [2020-10-25 23:12:51,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:12:51,065 INFO L481 AbstractCegarLoop]: Abstraction has 82 states and 103 transitions. [2020-10-25 23:12:51,065 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-25 23:12:51,065 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 103 transitions. [2020-10-25 23:12:51,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2020-10-25 23:12:51,068 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:12:51,068 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-10-25 23:12:51,068 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-25 23:12:51,069 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:12:51,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:12:51,069 INFO L82 PathProgramCache]: Analyzing trace with hash -363294050, now seen corresponding path program 1 times [2020-10-25 23:12:51,070 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:12:51,070 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687798310] [2020-10-25 23:12:51,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:12:51,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:12:51,179 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-25 23:12:51,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:12:51,222 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-25 23:12:51,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:12:51,228 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-25 23:12:51,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:12:51,234 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2020-10-25 23:12:51,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:12:51,301 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-25 23:12:51,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:12:51,305 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-25 23:12:51,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:12:51,310 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-10-25 23:12:51,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:12:51,319 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-25 23:12:51,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:12:51,322 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-25 23:12:51,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:12:51,345 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2020-10-25 23:12:51,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:12:51,404 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2020-10-25 23:12:51,405 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687798310] [2020-10-25 23:12:51,405 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [454341454] [2020-10-25 23:12:51,406 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-10-25 23:12:51,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:12:51,540 INFO L263 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 21 conjunts are in the unsatisfiable core [2020-10-25 23:12:51,556 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-25 23:12:51,657 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2020-10-25 23:12:51,657 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-10-25 23:12:51,658 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [13] total 16 [2020-10-25 23:12:51,658 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006862488] [2020-10-25 23:12:51,659 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-25 23:12:51,659 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:12:51,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-25 23:12:51,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=210, Unknown=0, NotChecked=0, Total=240 [2020-10-25 23:12:51,660 INFO L87 Difference]: Start difference. First operand 82 states and 103 transitions. Second operand 8 states. [2020-10-25 23:12:51,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:12:51,814 INFO L93 Difference]: Finished difference Result 134 states and 168 transitions. [2020-10-25 23:12:51,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-25 23:12:51,815 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 65 [2020-10-25 23:12:51,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:12:51,817 INFO L225 Difference]: With dead ends: 134 [2020-10-25 23:12:51,817 INFO L226 Difference]: Without dead ends: 84 [2020-10-25 23:12:51,818 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=300, Unknown=0, NotChecked=0, Total=342 [2020-10-25 23:12:51,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2020-10-25 23:12:51,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2020-10-25 23:12:51,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2020-10-25 23:12:51,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 106 transitions. [2020-10-25 23:12:51,831 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 106 transitions. Word has length 65 [2020-10-25 23:12:51,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:12:51,831 INFO L481 AbstractCegarLoop]: Abstraction has 84 states and 106 transitions. [2020-10-25 23:12:51,832 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-25 23:12:51,832 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 106 transitions. [2020-10-25 23:12:51,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2020-10-25 23:12:51,835 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:12:51,835 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-10-25 23:12:52,050 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-25 23:12:52,051 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:12:52,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:12:52,052 INFO L82 PathProgramCache]: Analyzing trace with hash -996061183, now seen corresponding path program 1 times [2020-10-25 23:12:52,053 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:12:52,053 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233204759] [2020-10-25 23:12:52,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:12:52,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-25 23:12:52,098 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-25 23:12:52,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-25 23:12:52,147 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-25 23:12:52,200 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-25 23:12:52,200 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-25 23:12:52,201 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-25 23:12:52,246 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-10-25 23:12:52,247 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-10-25 23:12:52,247 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-10-25 23:12:52,248 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-10-25 23:12:52,249 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-10-25 23:12:52,249 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-10-25 23:12:52,249 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-10-25 23:12:52,249 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-10-25 23:12:52,250 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-10-25 23:12:52,250 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-10-25 23:12:52,250 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-10-25 23:12:52,250 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-10-25 23:12:52,313 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.10 11:12:52 BoogieIcfgContainer [2020-10-25 23:12:52,314 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-25 23:12:52,314 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-25 23:12:52,315 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-25 23:12:52,315 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-25 23:12:52,315 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 11:12:47" (3/4) ... [2020-10-25 23:12:52,318 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-10-25 23:12:52,322 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-10-25 23:12:52,322 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-10-25 23:12:52,323 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-10-25 23:12:52,323 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-10-25 23:12:52,324 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-10-25 23:12:52,324 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-10-25 23:12:52,325 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-10-25 23:12:52,325 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-10-25 23:12:52,325 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-10-25 23:12:52,325 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-10-25 23:12:52,326 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-10-25 23:12:52,326 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-10-25 23:12:52,391 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-10-25 23:12:52,392 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-25 23:12:52,394 INFO L168 Benchmark]: Toolchain (without parser) took 6067.49 ms. Allocated memory was 54.5 MB in the beginning and 98.6 MB in the end (delta: 44.0 MB). Free memory was 31.3 MB in the beginning and 42.2 MB in the end (delta: -10.9 MB). Peak memory consumption was 35.8 MB. Max. memory is 16.1 GB. [2020-10-25 23:12:52,395 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 41.9 MB. Free memory was 19.9 MB in the beginning and 19.8 MB in the end (delta: 70.0 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-10-25 23:12:52,395 INFO L168 Benchmark]: CACSL2BoogieTranslator took 363.68 ms. Allocated memory is still 54.5 MB. Free memory was 30.8 MB in the beginning and 32.1 MB in the end (delta: -1.4 MB). Peak memory consumption was 5.6 MB. Max. memory is 16.1 GB. [2020-10-25 23:12:52,396 INFO L168 Benchmark]: Boogie Procedure Inliner took 48.06 ms. Allocated memory is still 54.5 MB. Free memory was 32.1 MB in the beginning and 30.3 MB in the end (delta: 1.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-10-25 23:12:52,397 INFO L168 Benchmark]: Boogie Preprocessor took 44.28 ms. Allocated memory is still 54.5 MB. Free memory was 30.3 MB in the beginning and 28.6 MB in the end (delta: 1.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-10-25 23:12:52,398 INFO L168 Benchmark]: RCFGBuilder took 914.17 ms. Allocated memory is still 54.5 MB. Free memory was 28.4 MB in the beginning and 25.1 MB in the end (delta: 3.3 MB). Peak memory consumption was 8.5 MB. Max. memory is 16.1 GB. [2020-10-25 23:12:52,399 INFO L168 Benchmark]: TraceAbstraction took 4603.97 ms. Allocated memory was 54.5 MB in the beginning and 98.6 MB in the end (delta: 44.0 MB). Free memory was 24.6 MB in the beginning and 49.6 MB in the end (delta: -24.9 MB). Peak memory consumption was 17.5 MB. Max. memory is 16.1 GB. [2020-10-25 23:12:52,399 INFO L168 Benchmark]: Witness Printer took 77.31 ms. Allocated memory is still 98.6 MB. Free memory was 48.5 MB in the beginning and 42.2 MB in the end (delta: 6.3 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. [2020-10-25 23:12:52,403 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.25 ms. Allocated memory is still 41.9 MB. Free memory was 19.9 MB in the beginning and 19.8 MB in the end (delta: 70.0 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 363.68 ms. Allocated memory is still 54.5 MB. Free memory was 30.8 MB in the beginning and 32.1 MB in the end (delta: -1.4 MB). Peak memory consumption was 5.6 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 48.06 ms. Allocated memory is still 54.5 MB. Free memory was 32.1 MB in the beginning and 30.3 MB in the end (delta: 1.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 44.28 ms. Allocated memory is still 54.5 MB. Free memory was 30.3 MB in the beginning and 28.6 MB in the end (delta: 1.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 914.17 ms. Allocated memory is still 54.5 MB. Free memory was 28.4 MB in the beginning and 25.1 MB in the end (delta: 3.3 MB). Peak memory consumption was 8.5 MB. Max. memory is 16.1 GB. * TraceAbstraction took 4603.97 ms. Allocated memory was 54.5 MB in the beginning and 98.6 MB in the end (delta: 44.0 MB). Free memory was 24.6 MB in the beginning and 49.6 MB in the end (delta: -24.9 MB). Peak memory consumption was 17.5 MB. Max. memory is 16.1 GB. * Witness Printer took 77.31 ms. Allocated memory is still 98.6 MB. Free memory was 48.5 MB in the beginning and 42.2 MB in the end (delta: 6.3 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 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: 14]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L98] 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}] [L98] RET nondet_tree() [L76] 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}] [L76] RET, EXPR min(t) [L76] int a = min(t); [L77] int b; [L79] CALL, EXPR size(t) VAL [t={-2:0}] [L71] COND FALSE !(!t) [L72] EXPR t->left VAL [t={-2:0}, t={-2: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={-2:0}, t={-2:0}, t->left={0:0}] [L72] EXPR t->right VAL [size(t->left)=0, t={-2:0}, t={-2: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={-2:0}, t={-2:0}, t->left={0:0}, t->right={0:0}] [L72] return size(t->left) + size(t->right) + 1; [L79] RET, EXPR size(t) [L79] int n = size(t); [L10] COND FALSE !(!cond) [L81] int *x = calloc(n, sizeof(int)); [L82] CALL tree_inorder(t, x, n) VAL [\old(i)=1, a={-3:0}, t={-2:0}] [L60] COND FALSE !(!t) [L63] 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}] [L63] CALL, EXPR tree_inorder(t->left, a, i) VAL [\old(i)=1, a={-3:0}, t={0:0}] [L60] COND TRUE !t [L61] return i; VAL [\old(i)=1, \result=1, a={-3:0}, a={-3:0}, i=1, t={0:0}, t={0:0}] [L63] 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] [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={-3:0}, a={-3:0}, i=2, t={-2:0}, t={-2:0}, t->right={0:0}] [L65] CALL, EXPR tree_inorder(t->right, a, i) VAL [\old(i)=2, a={-3:0}, t={0:0}] [L60] COND TRUE !t [L61] return i; VAL [\old(i)=2, \result=2, a={-3:0}, a={-3:0}, i=2, t={0:0}, t={0:0}] [L65] 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] [L65] i = tree_inorder(t->right, a, i) [L66] return i; VAL [\old(i)=1, \result=2, a={-3:0}, a={-3:0}, i=2, t={-2:0}, t={-2:0}] [L82] RET tree_inorder(t, x, n) [L83] x[0] [L16] COND TRUE !cond [L14] __assert_fail("0", "tree_del_rec_incorrect.c", 14, "reach_error") - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 85 locations, 4 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 4.4s, OverallIterations: 6, TraceHistogramMax: 3, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 398 SDtfs, 246 SDslu, 1411 SDs, 0 SdLazy, 775 SolverSat, 132 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 210 GetRequests, 160 SyntacticMatches, 2 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=85occurred in iteration=0, 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.2s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 403 NumberOfCodeBlocks, 403 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 319 ConstructedInterpolants, 0 QuantifiedInterpolants, 46575 SizeOfPredicates, 14 NumberOfNonLiveVariables, 590 ConjunctsInSsa, 46 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...