./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 a4ecdabc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_b5aff993-3549-44c4-8c83-c474c4775a30/bin/uautomizer/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_b5aff993-3549-44c4-8c83-c474c4775a30/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_b5aff993-3549-44c4-8c83-c474c4775a30/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_b5aff993-3549-44c4-8c83-c474c4775a30/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/verifythis/tree_del_rec_incorrect.c -s /tmp/vcloud-vcloud-master/worker/run_dir_b5aff993-3549-44c4-8c83-c474c4775a30/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_b5aff993-3549-44c4-8c83-c474c4775a30/bin/uautomizer --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-a4ecdab [2020-11-30 00:52:17,746 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-30 00:52:17,750 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-30 00:52:17,806 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-30 00:52:17,823 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-30 00:52:17,825 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-30 00:52:17,826 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-30 00:52:17,829 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-30 00:52:17,832 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-30 00:52:17,833 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-30 00:52:17,834 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-30 00:52:17,836 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-30 00:52:17,836 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-30 00:52:17,837 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-30 00:52:17,839 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-30 00:52:17,840 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-30 00:52:17,841 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-30 00:52:17,842 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-30 00:52:17,844 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-30 00:52:17,847 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-30 00:52:17,849 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-30 00:52:17,854 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-30 00:52:17,856 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-30 00:52:17,857 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-30 00:52:17,861 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-30 00:52:17,865 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-30 00:52:17,866 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-30 00:52:17,870 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-30 00:52:17,870 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-30 00:52:17,871 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-30 00:52:17,872 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-30 00:52:17,873 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-30 00:52:17,875 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-30 00:52:17,876 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-30 00:52:17,877 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-30 00:52:17,877 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-30 00:52:17,878 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-30 00:52:17,879 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-30 00:52:17,879 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-30 00:52:17,880 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-30 00:52:17,880 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-30 00:52:17,883 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_b5aff993-3549-44c4-8c83-c474c4775a30/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-11-30 00:52:17,925 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-30 00:52:17,925 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-30 00:52:17,927 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-30 00:52:17,927 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-30 00:52:17,928 INFO L138 SettingsManager]: * Use SBE=true [2020-11-30 00:52:17,928 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-30 00:52:17,928 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-30 00:52:17,928 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-30 00:52:17,929 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-30 00:52:17,929 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-30 00:52:17,930 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-30 00:52:17,930 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-30 00:52:17,930 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-30 00:52:17,931 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-30 00:52:17,931 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-30 00:52:17,931 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-30 00:52:17,931 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-30 00:52:17,931 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-30 00:52:17,932 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-30 00:52:17,932 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-30 00:52:17,932 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-30 00:52:17,932 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-30 00:52:17,933 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-30 00:52:17,933 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-30 00:52:17,933 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-30 00:52:17,933 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-30 00:52:17,934 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-30 00:52:17,934 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-30 00:52:17,934 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-30 00:52:17,934 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:/tmp/vcloud-vcloud-master/worker/run_dir_b5aff993-3549-44c4-8c83-c474c4775a30/bin/uautomizer/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 -> /tmp/vcloud-vcloud-master/worker/run_dir_b5aff993-3549-44c4-8c83-c474c4775a30/bin/uautomizer 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-11-30 00:52:18,212 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-30 00:52:18,248 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-30 00:52:18,251 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-30 00:52:18,252 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-30 00:52:18,253 INFO L275 PluginConnector]: CDTParser initialized [2020-11-30 00:52:18,254 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_b5aff993-3549-44c4-8c83-c474c4775a30/bin/uautomizer/../../sv-benchmarks/c/verifythis/tree_del_rec_incorrect.c [2020-11-30 00:52:18,343 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_b5aff993-3549-44c4-8c83-c474c4775a30/bin/uautomizer/data/0ec709386/0740e29333314fcca79f5d220c95072b/FLAGfeb9f1e01 [2020-11-30 00:52:18,802 INFO L306 CDTParser]: Found 1 translation units. [2020-11-30 00:52:18,802 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_b5aff993-3549-44c4-8c83-c474c4775a30/sv-benchmarks/c/verifythis/tree_del_rec_incorrect.c [2020-11-30 00:52:18,809 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_b5aff993-3549-44c4-8c83-c474c4775a30/bin/uautomizer/data/0ec709386/0740e29333314fcca79f5d220c95072b/FLAGfeb9f1e01 [2020-11-30 00:52:19,182 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_b5aff993-3549-44c4-8c83-c474c4775a30/bin/uautomizer/data/0ec709386/0740e29333314fcca79f5d220c95072b [2020-11-30 00:52:19,184 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-30 00:52:19,185 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-11-30 00:52:19,187 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-30 00:52:19,187 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-30 00:52:19,190 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-30 00:52:19,191 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 12:52:19" (1/1) ... [2020-11-30 00:52:19,193 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d48e66d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:52:19, skipping insertion in model container [2020-11-30 00:52:19,193 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 12:52:19" (1/1) ... [2020-11-30 00:52:19,203 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-30 00:52:19,221 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-30 00:52:19,397 WARN L1500 CHandler]: Possible shadowing of function min [2020-11-30 00:52:19,399 WARN L1500 CHandler]: Possible shadowing of function min [2020-11-30 00:52:19,416 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-30 00:52:19,429 INFO L203 MainTranslator]: Completed pre-run [2020-11-30 00:52:19,446 WARN L1500 CHandler]: Possible shadowing of function min [2020-11-30 00:52:19,447 WARN L1500 CHandler]: Possible shadowing of function min [2020-11-30 00:52:19,458 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-30 00:52:19,477 INFO L208 MainTranslator]: Completed translation [2020-11-30 00:52:19,478 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:52:19 WrapperNode [2020-11-30 00:52:19,478 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-30 00:52:19,479 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-30 00:52:19,479 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-30 00:52:19,479 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-30 00:52:19,487 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:52:19" (1/1) ... [2020-11-30 00:52:19,498 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:52:19" (1/1) ... [2020-11-30 00:52:19,521 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-30 00:52:19,522 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-30 00:52:19,522 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-30 00:52:19,523 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-30 00:52:19,531 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:52:19" (1/1) ... [2020-11-30 00:52:19,531 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:52:19" (1/1) ... [2020-11-30 00:52:19,536 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:52:19" (1/1) ... [2020-11-30 00:52:19,537 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:52:19" (1/1) ... [2020-11-30 00:52:19,551 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:52:19" (1/1) ... [2020-11-30 00:52:19,556 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:52:19" (1/1) ... [2020-11-30 00:52:19,558 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:52:19" (1/1) ... [2020-11-30 00:52:19,563 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-30 00:52:19,564 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-30 00:52:19,564 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-30 00:52:19,564 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-30 00:52:19,565 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:52:19" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b5aff993-3549-44c4-8c83-c474c4775a30/bin/uautomizer/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-11-30 00:52:19,632 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-11-30 00:52:19,632 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-30 00:52:19,632 INFO L130 BoogieDeclarations]: Found specification of procedure tree_del [2020-11-30 00:52:19,633 INFO L138 BoogieDeclarations]: Found implementation of procedure tree_del [2020-11-30 00:52:19,633 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-30 00:52:19,633 INFO L130 BoogieDeclarations]: Found specification of procedure min [2020-11-30 00:52:19,633 INFO L138 BoogieDeclarations]: Found implementation of procedure min [2020-11-30 00:52:19,634 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-11-30 00:52:19,634 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-11-30 00:52:19,634 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_tree [2020-11-30 00:52:19,634 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_tree [2020-11-30 00:52:19,635 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-30 00:52:19,635 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-11-30 00:52:19,635 INFO L130 BoogieDeclarations]: Found specification of procedure size [2020-11-30 00:52:19,635 INFO L138 BoogieDeclarations]: Found implementation of procedure size [2020-11-30 00:52:19,636 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-30 00:52:19,636 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-30 00:52:19,636 INFO L130 BoogieDeclarations]: Found specification of procedure tree_inorder [2020-11-30 00:52:19,636 INFO L138 BoogieDeclarations]: Found implementation of procedure tree_inorder [2020-11-30 00:52:19,636 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-30 00:52:20,266 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-30 00:52:20,267 INFO L298 CfgBuilder]: Removed 29 assume(true) statements. [2020-11-30 00:52:20,269 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 12:52:20 BoogieIcfgContainer [2020-11-30 00:52:20,270 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-30 00:52:20,280 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-30 00:52:20,281 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-30 00:52:20,284 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-30 00:52:20,285 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.11 12:52:19" (1/3) ... [2020-11-30 00:52:20,285 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f952dbf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 12:52:20, skipping insertion in model container [2020-11-30 00:52:20,286 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:52:19" (2/3) ... [2020-11-30 00:52:20,286 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f952dbf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 12:52:20, skipping insertion in model container [2020-11-30 00:52:20,286 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 12:52:20" (3/3) ... [2020-11-30 00:52:20,293 INFO L111 eAbstractionObserver]: Analyzing ICFG tree_del_rec_incorrect.c [2020-11-30 00:52:20,304 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-11-30 00:52:20,308 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2020-11-30 00:52:20,320 INFO L253 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2020-11-30 00:52:20,349 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-30 00:52:20,349 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-30 00:52:20,349 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-11-30 00:52:20,349 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-30 00:52:20,349 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-30 00:52:20,350 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-30 00:52:20,350 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-30 00:52:20,350 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-30 00:52:20,365 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states. [2020-11-30 00:52:20,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-11-30 00:52:20,371 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:52:20,372 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-11-30 00:52:20,372 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:52:20,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:52:20,378 INFO L82 PathProgramCache]: Analyzing trace with hash 325126343, now seen corresponding path program 1 times [2020-11-30 00:52:20,387 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:52:20,387 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456440583] [2020-11-30 00:52:20,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:52:20,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:52:20,618 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-30 00:52:20,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:52:20,628 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-11-30 00:52:20,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:52:20,638 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-30 00:52:20,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:52:20,654 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-11-30 00:52:20,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:52:20,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:52:20,669 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456440583] [2020-11-30 00:52:20,670 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:52:20,670 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-30 00:52:20,671 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400655366] [2020-11-30 00:52:20,675 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 00:52:20,676 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:52:20,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 00:52:20,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-11-30 00:52:20,690 INFO L87 Difference]: Start difference. First operand 85 states. Second operand 4 states. [2020-11-30 00:52:21,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:52:21,050 INFO L93 Difference]: Finished difference Result 146 states and 188 transitions. [2020-11-30 00:52:21,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 00:52:21,053 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 30 [2020-11-30 00:52:21,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:52:21,067 INFO L225 Difference]: With dead ends: 146 [2020-11-30 00:52:21,067 INFO L226 Difference]: Without dead ends: 81 [2020-11-30 00:52:21,070 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-11-30 00:52:21,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2020-11-30 00:52:21,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 76. [2020-11-30 00:52:21,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2020-11-30 00:52:21,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 93 transitions. [2020-11-30 00:52:21,113 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 93 transitions. Word has length 30 [2020-11-30 00:52:21,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:52:21,114 INFO L481 AbstractCegarLoop]: Abstraction has 76 states and 93 transitions. [2020-11-30 00:52:21,114 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 00:52:21,114 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 93 transitions. [2020-11-30 00:52:21,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-11-30 00:52:21,117 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:52:21,117 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-11-30 00:52:21,117 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-30 00:52:21,117 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:52:21,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:52:21,118 INFO L82 PathProgramCache]: Analyzing trace with hash 1026190921, now seen corresponding path program 1 times [2020-11-30 00:52:21,118 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:52:21,119 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84840810] [2020-11-30 00:52:21,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:52:21,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:52:21,235 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-30 00:52:21,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:52:21,241 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-11-30 00:52:21,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:52:21,247 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-30 00:52:21,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:52:21,294 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-11-30 00:52:21,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:52:21,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:52:21,307 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84840810] [2020-11-30 00:52:21,307 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:52:21,307 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-11-30 00:52:21,307 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33260054] [2020-11-30 00:52:21,309 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-30 00:52:21,309 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:52:21,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-30 00:52:21,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-11-30 00:52:21,310 INFO L87 Difference]: Start difference. First operand 76 states and 93 transitions. Second operand 7 states. [2020-11-30 00:52:21,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:52:21,655 INFO L93 Difference]: Finished difference Result 136 states and 170 transitions. [2020-11-30 00:52:21,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-30 00:52:21,659 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 30 [2020-11-30 00:52:21,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:52:21,662 INFO L225 Difference]: With dead ends: 136 [2020-11-30 00:52:21,662 INFO L226 Difference]: Without dead ends: 83 [2020-11-30 00:52:21,663 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-11-30 00:52:21,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2020-11-30 00:52:21,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 78. [2020-11-30 00:52:21,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2020-11-30 00:52:21,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 97 transitions. [2020-11-30 00:52:21,683 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 97 transitions. Word has length 30 [2020-11-30 00:52:21,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:52:21,684 INFO L481 AbstractCegarLoop]: Abstraction has 78 states and 97 transitions. [2020-11-30 00:52:21,684 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-30 00:52:21,684 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 97 transitions. [2020-11-30 00:52:21,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2020-11-30 00:52:21,687 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:52:21,687 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-11-30 00:52:21,687 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-30 00:52:21,687 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:52:21,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:52:21,688 INFO L82 PathProgramCache]: Analyzing trace with hash -448564166, now seen corresponding path program 1 times [2020-11-30 00:52:21,688 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:52:21,688 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905637194] [2020-11-30 00:52:21,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:52:21,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:52:21,774 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-30 00:52:21,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:52:21,812 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-11-30 00:52:21,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:52:21,817 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-30 00:52:21,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:52:21,866 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-30 00:52:21,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:52:21,872 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-11-30 00:52:21,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:52:21,894 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2020-11-30 00:52:21,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:52:21,918 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-11-30 00:52:21,919 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905637194] [2020-11-30 00:52:21,919 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [644464680] [2020-11-30 00:52:21,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b5aff993-3549-44c4-8c83-c474c4775a30/bin/uautomizer/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-11-30 00:52:22,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:52:22,057 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 25 conjunts are in the unsatisfiable core [2020-11-30 00:52:22,064 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:52:22,189 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-11-30 00:52:22,189 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-30 00:52:22,189 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 9 [2020-11-30 00:52:22,189 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543888022] [2020-11-30 00:52:22,190 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-30 00:52:22,190 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:52:22,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-30 00:52:22,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2020-11-30 00:52:22,191 INFO L87 Difference]: Start difference. First operand 78 states and 97 transitions. Second operand 9 states. [2020-11-30 00:52:22,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:52:22,836 INFO L93 Difference]: Finished difference Result 142 states and 179 transitions. [2020-11-30 00:52:22,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-30 00:52:22,837 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 42 [2020-11-30 00:52:22,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:52:22,839 INFO L225 Difference]: With dead ends: 142 [2020-11-30 00:52:22,839 INFO L226 Difference]: Without dead ends: 83 [2020-11-30 00:52:22,841 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-11-30 00:52:22,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2020-11-30 00:52:22,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 80. [2020-11-30 00:52:22,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2020-11-30 00:52:22,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 100 transitions. [2020-11-30 00:52:22,865 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 100 transitions. Word has length 42 [2020-11-30 00:52:22,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:52:22,865 INFO L481 AbstractCegarLoop]: Abstraction has 80 states and 100 transitions. [2020-11-30 00:52:22,866 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-30 00:52:22,866 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 100 transitions. [2020-11-30 00:52:22,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2020-11-30 00:52:22,874 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:52:22,875 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-11-30 00:52:23,088 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2020-11-30 00:52:23,089 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:52:23,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:52:23,089 INFO L82 PathProgramCache]: Analyzing trace with hash 1006862077, now seen corresponding path program 1 times [2020-11-30 00:52:23,089 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:52:23,090 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814690430] [2020-11-30 00:52:23,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:52:23,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:52:23,162 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-30 00:52:23,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:52:23,246 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-30 00:52:23,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:52:23,252 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-30 00:52:23,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:52:23,266 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2020-11-30 00:52:23,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:52:23,298 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-11-30 00:52:23,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:52:23,305 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-30 00:52:23,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:52:23,307 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-11-30 00:52:23,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:52:23,346 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2020-11-30 00:52:23,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:52:23,354 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2020-11-30 00:52:23,355 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814690430] [2020-11-30 00:52:23,355 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:52:23,355 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-11-30 00:52:23,355 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707886603] [2020-11-30 00:52:23,356 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-30 00:52:23,356 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:52:23,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-30 00:52:23,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2020-11-30 00:52:23,360 INFO L87 Difference]: Start difference. First operand 80 states and 100 transitions. Second operand 10 states. [2020-11-30 00:52:23,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:52:23,891 INFO L93 Difference]: Finished difference Result 142 states and 179 transitions. [2020-11-30 00:52:23,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-30 00:52:23,892 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 52 [2020-11-30 00:52:23,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:52:23,895 INFO L225 Difference]: With dead ends: 142 [2020-11-30 00:52:23,895 INFO L226 Difference]: Without dead ends: 85 [2020-11-30 00:52:23,896 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2020-11-30 00:52:23,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2020-11-30 00:52:23,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 82. [2020-11-30 00:52:23,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2020-11-30 00:52:23,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 103 transitions. [2020-11-30 00:52:23,923 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 103 transitions. Word has length 52 [2020-11-30 00:52:23,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:52:23,924 INFO L481 AbstractCegarLoop]: Abstraction has 82 states and 103 transitions. [2020-11-30 00:52:23,924 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-30 00:52:23,925 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 103 transitions. [2020-11-30 00:52:23,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2020-11-30 00:52:23,931 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:52:23,931 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-11-30 00:52:23,931 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-30 00:52:23,932 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:52:23,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:52:23,932 INFO L82 PathProgramCache]: Analyzing trace with hash -363294050, now seen corresponding path program 1 times [2020-11-30 00:52:23,933 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:52:23,934 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008114719] [2020-11-30 00:52:23,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:52:23,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:52:24,057 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-30 00:52:24,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:52:24,120 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-30 00:52:24,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:52:24,124 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-30 00:52:24,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:52:24,130 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2020-11-30 00:52:24,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:52:24,214 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-30 00:52:24,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:52:24,217 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-11-30 00:52:24,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:52:24,220 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-11-30 00:52:24,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:52:24,230 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-30 00:52:24,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:52:24,235 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-11-30 00:52:24,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:52:24,258 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2020-11-30 00:52:24,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:52:24,310 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2020-11-30 00:52:24,311 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008114719] [2020-11-30 00:52:24,311 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [426596056] [2020-11-30 00:52:24,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b5aff993-3549-44c4-8c83-c474c4775a30/bin/uautomizer/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-11-30 00:52:24,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:52:24,453 INFO L263 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 21 conjunts are in the unsatisfiable core [2020-11-30 00:52:24,457 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:52:24,674 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2020-11-30 00:52:24,674 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-11-30 00:52:24,674 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [13] total 16 [2020-11-30 00:52:24,675 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777936807] [2020-11-30 00:52:24,675 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-30 00:52:24,675 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:52:24,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-30 00:52:24,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=210, Unknown=0, NotChecked=0, Total=240 [2020-11-30 00:52:24,676 INFO L87 Difference]: Start difference. First operand 82 states and 103 transitions. Second operand 8 states. [2020-11-30 00:52:24,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:52:24,843 INFO L93 Difference]: Finished difference Result 134 states and 168 transitions. [2020-11-30 00:52:24,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-30 00:52:24,844 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 65 [2020-11-30 00:52:24,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:52:24,846 INFO L225 Difference]: With dead ends: 134 [2020-11-30 00:52:24,846 INFO L226 Difference]: Without dead ends: 84 [2020-11-30 00:52:24,847 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=42, Invalid=300, Unknown=0, NotChecked=0, Total=342 [2020-11-30 00:52:24,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2020-11-30 00:52:24,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2020-11-30 00:52:24,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2020-11-30 00:52:24,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 106 transitions. [2020-11-30 00:52:24,871 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 106 transitions. Word has length 65 [2020-11-30 00:52:24,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:52:24,873 INFO L481 AbstractCegarLoop]: Abstraction has 84 states and 106 transitions. [2020-11-30 00:52:24,873 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-30 00:52:24,873 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 106 transitions. [2020-11-30 00:52:24,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2020-11-30 00:52:24,876 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:52:24,876 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-11-30 00:52:25,092 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 00:52:25,093 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:52:25,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:52:25,093 INFO L82 PathProgramCache]: Analyzing trace with hash -996061183, now seen corresponding path program 1 times [2020-11-30 00:52:25,093 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:52:25,094 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139756383] [2020-11-30 00:52:25,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:52:25,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:52:25,154 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:52:25,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:52:25,197 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:52:25,246 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:52:25,246 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-11-30 00:52:25,246 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-30 00:52:25,282 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-11-30 00:52:25,286 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-11-30 00:52:25,287 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-11-30 00:52:25,287 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-11-30 00:52:25,288 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-11-30 00:52:25,289 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-11-30 00:52:25,289 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-11-30 00:52:25,289 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-11-30 00:52:25,289 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-11-30 00:52:25,290 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-11-30 00:52:25,290 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-11-30 00:52:25,290 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-11-30 00:52:25,343 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.11 12:52:25 BoogieIcfgContainer [2020-11-30 00:52:25,344 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-30 00:52:25,344 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-11-30 00:52:25,344 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-11-30 00:52:25,344 INFO L275 PluginConnector]: Witness Printer initialized [2020-11-30 00:52:25,345 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 12:52:20" (3/4) ... [2020-11-30 00:52:25,347 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-11-30 00:52:25,353 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-11-30 00:52:25,353 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-11-30 00:52:25,354 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-11-30 00:52:25,354 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-11-30 00:52:25,355 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-11-30 00:52:25,355 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-11-30 00:52:25,355 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-11-30 00:52:25,355 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-11-30 00:52:25,356 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-11-30 00:52:25,356 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-11-30 00:52:25,356 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-11-30 00:52:25,356 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr : $Pointer$ not handled [2020-11-30 00:52:25,450 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_b5aff993-3549-44c4-8c83-c474c4775a30/bin/uautomizer/witness.graphml [2020-11-30 00:52:25,454 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-11-30 00:52:25,456 INFO L168 Benchmark]: Toolchain (without parser) took 6269.60 ms. Allocated memory was 94.4 MB in the beginning and 136.3 MB in the end (delta: 41.9 MB). Free memory was 62.5 MB in the beginning and 77.4 MB in the end (delta: -14.9 MB). Peak memory consumption was 27.4 MB. Max. memory is 16.1 GB. [2020-11-30 00:52:25,457 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 73.4 MB. Free memory was 35.8 MB in the beginning and 35.7 MB in the end (delta: 67.1 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-30 00:52:25,457 INFO L168 Benchmark]: CACSL2BoogieTranslator took 291.38 ms. Allocated memory is still 94.4 MB. Free memory was 62.3 MB in the beginning and 69.6 MB in the end (delta: -7.3 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2020-11-30 00:52:25,458 INFO L168 Benchmark]: Boogie Procedure Inliner took 42.68 ms. Allocated memory is still 94.4 MB. Free memory was 69.6 MB in the beginning and 67.9 MB in the end (delta: 1.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-30 00:52:25,458 INFO L168 Benchmark]: Boogie Preprocessor took 40.79 ms. Allocated memory is still 94.4 MB. Free memory was 67.9 MB in the beginning and 66.3 MB in the end (delta: 1.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-30 00:52:25,459 INFO L168 Benchmark]: RCFGBuilder took 706.46 ms. Allocated memory is still 94.4 MB. Free memory was 65.9 MB in the beginning and 35.6 MB in the end (delta: 30.3 MB). Peak memory consumption was 29.4 MB. Max. memory is 16.1 GB. [2020-11-30 00:52:25,459 INFO L168 Benchmark]: TraceAbstraction took 5063.20 ms. Allocated memory was 94.4 MB in the beginning and 136.3 MB in the end (delta: 41.9 MB). Free memory was 72.2 MB in the beginning and 84.8 MB in the end (delta: -12.5 MB). Peak memory consumption was 27.9 MB. Max. memory is 16.1 GB. [2020-11-30 00:52:25,460 INFO L168 Benchmark]: Witness Printer took 109.92 ms. Allocated memory is still 136.3 MB. Free memory was 83.7 MB in the beginning and 77.4 MB in the end (delta: 6.3 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. [2020-11-30 00:52:25,462 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.21 ms. Allocated memory is still 73.4 MB. Free memory was 35.8 MB in the beginning and 35.7 MB in the end (delta: 67.1 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 291.38 ms. Allocated memory is still 94.4 MB. Free memory was 62.3 MB in the beginning and 69.6 MB in the end (delta: -7.3 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 42.68 ms. Allocated memory is still 94.4 MB. Free memory was 69.6 MB in the beginning and 67.9 MB in the end (delta: 1.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 40.79 ms. Allocated memory is still 94.4 MB. Free memory was 67.9 MB in the beginning and 66.3 MB in the end (delta: 1.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 706.46 ms. Allocated memory is still 94.4 MB. Free memory was 65.9 MB in the beginning and 35.6 MB in the end (delta: 30.3 MB). Peak memory consumption was 29.4 MB. Max. memory is 16.1 GB. * TraceAbstraction took 5063.20 ms. Allocated memory was 94.4 MB in the beginning and 136.3 MB in the end (delta: 41.9 MB). Free memory was 72.2 MB in the beginning and 84.8 MB in the end (delta: -12.5 MB). Peak memory consumption was 27.9 MB. Max. memory is 16.1 GB. * Witness Printer took 109.92 ms. Allocated memory is still 136.3 MB. Free memory was 83.7 MB in the beginning and 77.4 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.9s, OverallIterations: 6, TraceHistogramMax: 3, AutomataDifference: 2.1s, 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.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 210 GetRequests, 160 SyntacticMatches, 2 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.9s 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.3s SatisfiabilityAnalysisTime, 1.4s 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...