./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../../sv-benchmarks/c/verifythis/tree_del_iter.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version a0165632 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd89bf24-5288-44fd-8334-33a26ea77ae9/bin/utaipan-verify-YMUCfTKeje/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd89bf24-5288-44fd-8334-33a26ea77ae9/bin/utaipan-verify-YMUCfTKeje/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd89bf24-5288-44fd-8334-33a26ea77ae9/bin/utaipan-verify-YMUCfTKeje/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd89bf24-5288-44fd-8334-33a26ea77ae9/bin/utaipan-verify-YMUCfTKeje/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/verifythis/tree_del_iter.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd89bf24-5288-44fd-8334-33a26ea77ae9/bin/utaipan-verify-YMUCfTKeje/config/svcomp-MemCleanup-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd89bf24-5288-44fd-8334-33a26ea77ae9/bin/utaipan-verify-YMUCfTKeje --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash cce1bb7a06b9dd56fbf663e182ffe801720ee05ee19a126a08070f1616bc4afe --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-09 06:50:18,951 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 06:50:19,063 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd89bf24-5288-44fd-8334-33a26ea77ae9/bin/utaipan-verify-YMUCfTKeje/config/svcomp-MemCleanup-32bit-Taipan_Default.epf [2024-11-09 06:50:19,073 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 06:50:19,074 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 06:50:19,119 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 06:50:19,120 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 06:50:19,120 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 06:50:19,123 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 06:50:19,126 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 06:50:19,127 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-09 06:50:19,128 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-09 06:50:19,128 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-09 06:50:19,129 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-09 06:50:19,129 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-09 06:50:19,130 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-09 06:50:19,130 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-09 06:50:19,131 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-09 06:50:19,131 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-09 06:50:19,136 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-09 06:50:19,136 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-09 06:50:19,137 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-09 06:50:19,138 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 06:50:19,138 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 06:50:19,139 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 06:50:19,139 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 06:50:19,140 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 06:50:19,140 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 06:50:19,141 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 06:50:19,141 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 06:50:19,142 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 06:50:19,142 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 06:50:19,142 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 06:50:19,143 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 06:50:19,143 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 06:50:19,144 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 06:50:19,144 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 06:50:19,144 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 06:50:19,145 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 06:50:19,145 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 06:50:19,146 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 06:50:19,146 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 06:50:19,147 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 06:50:19,147 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 06:50:19,147 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 06:50:19,148 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 06:50:19,148 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 06:50:19,149 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-09 06:50:19,149 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 06:50:19,149 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 06:50:19,150 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-09 06:50:19,150 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 06:50:19,151 INFO L153 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_worker_vcloud-master_on_vcloud-master/run_dir_dd89bf24-5288-44fd-8334-33a26ea77ae9/bin/utaipan-verify-YMUCfTKeje/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_worker_vcloud-master_on_vcloud-master/run_dir_dd89bf24-5288-44fd-8334-33a26ea77ae9/bin/utaipan-verify-YMUCfTKeje Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 valid-memcleanup) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan 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 -> cce1bb7a06b9dd56fbf663e182ffe801720ee05ee19a126a08070f1616bc4afe [2024-11-09 06:50:19,531 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 06:50:19,566 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 06:50:19,570 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 06:50:19,571 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 06:50:19,572 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 06:50:19,574 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd89bf24-5288-44fd-8334-33a26ea77ae9/bin/utaipan-verify-YMUCfTKeje/../../sv-benchmarks/c/verifythis/tree_del_iter.c Unable to find full path for "g++" [2024-11-09 06:50:21,999 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 06:50:22,331 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 06:50:22,332 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd89bf24-5288-44fd-8334-33a26ea77ae9/sv-benchmarks/c/verifythis/tree_del_iter.c [2024-11-09 06:50:22,341 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd89bf24-5288-44fd-8334-33a26ea77ae9/bin/utaipan-verify-YMUCfTKeje/data/5949832ae/4ef7b68aa9de411b8a7afc3fe400edc7/FLAG8d2948128 [2024-11-09 06:50:22,360 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd89bf24-5288-44fd-8334-33a26ea77ae9/bin/utaipan-verify-YMUCfTKeje/data/5949832ae/4ef7b68aa9de411b8a7afc3fe400edc7 [2024-11-09 06:50:22,364 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 06:50:22,366 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 06:50:22,368 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 06:50:22,368 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 06:50:22,378 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 06:50:22,379 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 06:50:22" (1/1) ... [2024-11-09 06:50:22,381 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c80fe50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:50:22, skipping insertion in model container [2024-11-09 06:50:22,381 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 06:50:22" (1/1) ... [2024-11-09 06:50:22,427 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 06:50:22,693 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 06:50:22,710 WARN L1698 CHandler]: Possible shadowing of function min [2024-11-09 06:50:22,731 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 06:50:22,756 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 06:50:22,788 WARN L1698 CHandler]: Possible shadowing of function min [2024-11-09 06:50:22,803 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 06:50:22,830 INFO L204 MainTranslator]: Completed translation [2024-11-09 06:50:22,830 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:50:22 WrapperNode [2024-11-09 06:50:22,831 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 06:50:22,832 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 06:50:22,832 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 06:50:22,832 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 06:50:22,841 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:50:22" (1/1) ... [2024-11-09 06:50:22,854 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:50:22" (1/1) ... [2024-11-09 06:50:22,888 INFO L138 Inliner]: procedures = 29, calls = 65, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 116 [2024-11-09 06:50:22,889 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 06:50:22,894 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 06:50:22,894 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 06:50:22,895 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 06:50:22,905 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:50:22" (1/1) ... [2024-11-09 06:50:22,906 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:50:22" (1/1) ... [2024-11-09 06:50:22,911 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:50:22" (1/1) ... [2024-11-09 06:50:22,911 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:50:22" (1/1) ... [2024-11-09 06:50:22,925 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:50:22" (1/1) ... [2024-11-09 06:50:22,930 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:50:22" (1/1) ... [2024-11-09 06:50:22,933 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:50:22" (1/1) ... [2024-11-09 06:50:22,935 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:50:22" (1/1) ... [2024-11-09 06:50:22,945 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 06:50:22,947 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 06:50:22,948 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 06:50:22,948 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 06:50:22,949 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:50:22" (1/1) ... [2024-11-09 06:50:22,972 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 06:50:22,990 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd89bf24-5288-44fd-8334-33a26ea77ae9/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:50:23,010 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd89bf24-5288-44fd-8334-33a26ea77ae9/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-09 06:50:23,014 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd89bf24-5288-44fd-8334-33a26ea77ae9/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-09 06:50:23,048 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 06:50:23,049 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-09 06:50:23,049 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-11-09 06:50:23,049 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-09 06:50:23,049 INFO L130 BoogieDeclarations]: Found specification of procedure min [2024-11-09 06:50:23,049 INFO L138 BoogieDeclarations]: Found implementation of procedure min [2024-11-09 06:50:23,050 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-09 06:50:23,050 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2024-11-09 06:50:23,050 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2024-11-09 06:50:23,050 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2024-11-09 06:50:23,050 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_tree [2024-11-09 06:50:23,051 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_tree [2024-11-09 06:50:23,051 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-09 06:50:23,051 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 06:50:23,051 INFO L130 BoogieDeclarations]: Found specification of procedure size [2024-11-09 06:50:23,051 INFO L138 BoogieDeclarations]: Found implementation of procedure size [2024-11-09 06:50:23,052 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 06:50:23,052 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 06:50:23,052 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-09 06:50:23,052 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-09 06:50:23,053 INFO L130 BoogieDeclarations]: Found specification of procedure tree_inorder [2024-11-09 06:50:23,053 INFO L138 BoogieDeclarations]: Found implementation of procedure tree_inorder [2024-11-09 06:50:23,053 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 06:50:23,218 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 06:50:23,221 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 06:50:23,719 INFO L? ?]: Removed 78 outVars from TransFormulas that were not future-live. [2024-11-09 06:50:23,720 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 06:50:23,770 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 06:50:23,771 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 06:50:23,771 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 06:50:23 BoogieIcfgContainer [2024-11-09 06:50:23,772 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 06:50:23,775 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 06:50:23,775 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 06:50:23,779 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 06:50:23,779 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 06:50:22" (1/3) ... [2024-11-09 06:50:23,780 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f0f0ca4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 06:50:23, skipping insertion in model container [2024-11-09 06:50:23,780 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:50:22" (2/3) ... [2024-11-09 06:50:23,781 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f0f0ca4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 06:50:23, skipping insertion in model container [2024-11-09 06:50:23,781 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 06:50:23" (3/3) ... [2024-11-09 06:50:23,783 INFO L112 eAbstractionObserver]: Analyzing ICFG tree_del_iter.c [2024-11-09 06:50:23,802 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 06:50:23,802 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-09 06:50:23,857 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 06:50:23,872 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3077d261, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 06:50:23,873 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-09 06:50:23,879 INFO L276 IsEmpty]: Start isEmpty. Operand has 79 states, 50 states have (on average 1.28) internal successors, (64), 52 states have internal predecessors, (64), 20 states have call successors, (20), 6 states have call predecessors, (20), 6 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-09 06:50:23,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-09 06:50:23,896 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:50:23,898 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:50:23,899 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 06:50:23,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:50:23,909 INFO L85 PathProgramCache]: Analyzing trace with hash -1148482463, now seen corresponding path program 1 times [2024-11-09 06:50:23,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:50:23,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456643584] [2024-11-09 06:50:23,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:50:23,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:50:24,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:50:24,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:50:24,784 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:50:24,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456643584] [2024-11-09 06:50:24,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456643584] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:50:24,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:50:24,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 06:50:24,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678002656] [2024-11-09 06:50:24,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:50:24,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 06:50:24,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:50:24,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 06:50:24,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 06:50:24,842 INFO L87 Difference]: Start difference. First operand has 79 states, 50 states have (on average 1.28) internal successors, (64), 52 states have internal predecessors, (64), 20 states have call successors, (20), 6 states have call predecessors, (20), 6 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-09 06:50:24,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:50:24,960 INFO L93 Difference]: Finished difference Result 83 states and 109 transitions. [2024-11-09 06:50:24,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 06:50:24,963 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 35 [2024-11-09 06:50:24,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:50:24,975 INFO L225 Difference]: With dead ends: 83 [2024-11-09 06:50:24,975 INFO L226 Difference]: Without dead ends: 79 [2024-11-09 06:50:24,977 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 06:50:24,982 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 0 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 06:50:24,983 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 369 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 06:50:25,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-11-09 06:50:25,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2024-11-09 06:50:25,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 50 states have (on average 1.2) internal successors, (60), 52 states have internal predecessors, (60), 20 states have call successors, (20), 6 states have call predecessors, (20), 7 states have return successors, (23), 20 states have call predecessors, (23), 20 states have call successors, (23) [2024-11-09 06:50:25,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 103 transitions. [2024-11-09 06:50:25,042 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 103 transitions. Word has length 35 [2024-11-09 06:50:25,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:50:25,042 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 103 transitions. [2024-11-09 06:50:25,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-09 06:50:25,043 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 103 transitions. [2024-11-09 06:50:25,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-09 06:50:25,046 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:50:25,046 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:50:25,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 06:50:25,047 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 06:50:25,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:50:25,048 INFO L85 PathProgramCache]: Analyzing trace with hash -1042706580, now seen corresponding path program 1 times [2024-11-09 06:50:25,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:50:25,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881748897] [2024-11-09 06:50:25,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:50:25,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:50:25,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:50:25,485 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-09 06:50:25,485 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:50:25,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881748897] [2024-11-09 06:50:25,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881748897] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:50:25,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1850897826] [2024-11-09 06:50:25,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:50:25,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:50:25,487 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd89bf24-5288-44fd-8334-33a26ea77ae9/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:50:25,489 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd89bf24-5288-44fd-8334-33a26ea77ae9/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:50:25,494 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd89bf24-5288-44fd-8334-33a26ea77ae9/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 06:50:25,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:50:25,691 INFO L255 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-09 06:50:25,710 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:50:25,944 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-09 06:50:25,944 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:50:26,318 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-09 06:50:26,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1850897826] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 06:50:26,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [456480144] [2024-11-09 06:50:26,355 INFO L159 IcfgInterpreter]: Started Sifa with 40 locations of interest [2024-11-09 06:50:26,356 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 06:50:26,363 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:426) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:273) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:167) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2024-11-09 06:50:26,368 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 06:50:26,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 10 [2024-11-09 06:50:26,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801567652] [2024-11-09 06:50:26,369 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 06:50:26,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 06:50:26,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:50:26,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 06:50:26,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-09 06:50:26,377 INFO L87 Difference]: Start difference. First operand 79 states and 103 transitions. Second operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 9 states have internal predecessors, (38), 5 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2024-11-09 06:50:26,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:50:26,604 INFO L93 Difference]: Finished difference Result 85 states and 112 transitions. [2024-11-09 06:50:26,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 06:50:26,605 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 9 states have internal predecessors, (38), 5 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) Word has length 47 [2024-11-09 06:50:26,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:50:26,608 INFO L225 Difference]: With dead ends: 85 [2024-11-09 06:50:26,608 INFO L226 Difference]: Without dead ends: 81 [2024-11-09 06:50:26,609 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-11-09 06:50:26,610 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 1 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 438 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 06:50:26,611 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 438 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 06:50:26,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-11-09 06:50:26,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2024-11-09 06:50:26,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 51 states have (on average 1.196078431372549) internal successors, (61), 54 states have internal predecessors, (61), 20 states have call successors, (20), 6 states have call predecessors, (20), 8 states have return successors, (25), 20 states have call predecessors, (25), 20 states have call successors, (25) [2024-11-09 06:50:26,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 106 transitions. [2024-11-09 06:50:26,625 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 106 transitions. Word has length 47 [2024-11-09 06:50:26,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:50:26,626 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 106 transitions. [2024-11-09 06:50:26,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 9 states have internal predecessors, (38), 5 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2024-11-09 06:50:26,627 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 106 transitions. [2024-11-09 06:50:26,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-09 06:50:26,629 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:50:26,630 INFO L215 NwaCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1] [2024-11-09 06:50:26,657 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd89bf24-5288-44fd-8334-33a26ea77ae9/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 06:50:26,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd89bf24-5288-44fd-8334-33a26ea77ae9/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:50:26,835 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 06:50:26,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:50:26,836 INFO L85 PathProgramCache]: Analyzing trace with hash -1185154105, now seen corresponding path program 1 times [2024-11-09 06:50:26,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:50:26,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518797251] [2024-11-09 06:50:26,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:50:26,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:50:26,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:50:27,204 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-09 06:50:27,204 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:50:27,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518797251] [2024-11-09 06:50:27,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518797251] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:50:27,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:50:27,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 06:50:27,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132952457] [2024-11-09 06:50:27,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:50:27,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 06:50:27,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:50:27,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 06:50:27,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-09 06:50:27,211 INFO L87 Difference]: Start difference. First operand 81 states and 106 transitions. Second operand has 8 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 4 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2024-11-09 06:50:27,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:50:27,373 INFO L93 Difference]: Finished difference Result 83 states and 109 transitions. [2024-11-09 06:50:27,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 06:50:27,377 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 4 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) Word has length 59 [2024-11-09 06:50:27,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:50:27,379 INFO L225 Difference]: With dead ends: 83 [2024-11-09 06:50:27,379 INFO L226 Difference]: Without dead ends: 83 [2024-11-09 06:50:27,380 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-09 06:50:27,384 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 26 mSDsluCounter, 474 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 562 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 06:50:27,385 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 562 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 06:50:27,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-11-09 06:50:27,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2024-11-09 06:50:27,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 52 states have (on average 1.1923076923076923) internal successors, (62), 56 states have internal predecessors, (62), 20 states have call successors, (20), 6 states have call predecessors, (20), 9 states have return successors, (27), 20 states have call predecessors, (27), 20 states have call successors, (27) [2024-11-09 06:50:27,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 109 transitions. [2024-11-09 06:50:27,411 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 109 transitions. Word has length 59 [2024-11-09 06:50:27,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:50:27,412 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 109 transitions. [2024-11-09 06:50:27,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 4 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2024-11-09 06:50:27,412 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 109 transitions. [2024-11-09 06:50:27,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-09 06:50:27,416 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:50:27,417 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:50:27,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 06:50:27,420 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 06:50:27,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:50:27,421 INFO L85 PathProgramCache]: Analyzing trace with hash 1293982086, now seen corresponding path program 1 times [2024-11-09 06:50:27,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:50:27,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093226394] [2024-11-09 06:50:27,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:50:27,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:50:27,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:50:27,985 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-09 06:50:27,985 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:50:27,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093226394] [2024-11-09 06:50:27,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2093226394] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:50:27,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1516463296] [2024-11-09 06:50:27,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:50:27,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:50:27,989 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd89bf24-5288-44fd-8334-33a26ea77ae9/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:50:27,992 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd89bf24-5288-44fd-8334-33a26ea77ae9/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:50:27,993 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd89bf24-5288-44fd-8334-33a26ea77ae9/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 06:50:28,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:50:28,213 INFO L255 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-09 06:50:28,219 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:50:28,398 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-09 06:50:28,399 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:50:28,745 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-09 06:50:28,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1516463296] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 06:50:28,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1833140013] [2024-11-09 06:50:28,749 INFO L159 IcfgInterpreter]: Started Sifa with 48 locations of interest [2024-11-09 06:50:28,750 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 06:50:28,750 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:426) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:273) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:167) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2024-11-09 06:50:28,751 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 06:50:28,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 15 [2024-11-09 06:50:28,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771353396] [2024-11-09 06:50:28,752 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 06:50:28,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-09 06:50:28,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:50:28,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-09 06:50:28,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2024-11-09 06:50:28,754 INFO L87 Difference]: Start difference. First operand 83 states and 109 transitions. Second operand has 15 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 7 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 7 states have call predecessors, (12), 6 states have call successors, (12) [2024-11-09 06:50:29,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:50:29,167 INFO L93 Difference]: Finished difference Result 85 states and 113 transitions. [2024-11-09 06:50:29,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 06:50:29,169 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 7 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 7 states have call predecessors, (12), 6 states have call successors, (12) Word has length 71 [2024-11-09 06:50:29,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:50:29,172 INFO L225 Difference]: With dead ends: 85 [2024-11-09 06:50:29,172 INFO L226 Difference]: Without dead ends: 85 [2024-11-09 06:50:29,176 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2024-11-09 06:50:29,178 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 48 mSDsluCounter, 764 mSDsCounter, 0 mSdLazyCounter, 276 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 845 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 06:50:29,178 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 845 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 276 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 06:50:29,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-11-09 06:50:29,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2024-11-09 06:50:29,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 53 states have (on average 1.1886792452830188) internal successors, (63), 58 states have internal predecessors, (63), 20 states have call successors, (20), 6 states have call predecessors, (20), 10 states have return successors, (30), 20 states have call predecessors, (30), 20 states have call successors, (30) [2024-11-09 06:50:29,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 113 transitions. [2024-11-09 06:50:29,203 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 113 transitions. Word has length 71 [2024-11-09 06:50:29,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:50:29,204 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 113 transitions. [2024-11-09 06:50:29,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 7 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 7 states have call predecessors, (12), 6 states have call successors, (12) [2024-11-09 06:50:29,205 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 113 transitions. [2024-11-09 06:50:29,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-09 06:50:29,211 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:50:29,211 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:50:29,241 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd89bf24-5288-44fd-8334-33a26ea77ae9/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-09 06:50:29,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd89bf24-5288-44fd-8334-33a26ea77ae9/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:50:29,412 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 06:50:29,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:50:29,413 INFO L85 PathProgramCache]: Analyzing trace with hash -240001079, now seen corresponding path program 1 times [2024-11-09 06:50:29,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:50:29,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847330165] [2024-11-09 06:50:29,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:50:29,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:50:29,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 06:50:29,480 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 06:50:29,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 06:50:29,605 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2024-11-09 06:50:29,605 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 06:50:29,607 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK (1 of 2 remaining) [2024-11-09 06:50:29,609 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (0 of 2 remaining) [2024-11-09 06:50:29,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 06:50:29,615 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-11-09 06:50:29,677 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 06:50:29,682 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 06:50:29 BoogieIcfgContainer [2024-11-09 06:50:29,682 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 06:50:29,683 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 06:50:29,683 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 06:50:29,683 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 06:50:29,684 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 06:50:23" (3/4) ... [2024-11-09 06:50:29,685 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-09 06:50:29,761 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd89bf24-5288-44fd-8334-33a26ea77ae9/bin/utaipan-verify-YMUCfTKeje/witness.graphml [2024-11-09 06:50:29,762 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 06:50:29,762 INFO L158 Benchmark]: Toolchain (without parser) took 7396.71ms. Allocated memory is still 165.7MB. Free memory was 131.6MB in the beginning and 57.1MB in the end (delta: 74.5MB). Peak memory consumption was 76.6MB. Max. memory is 16.1GB. [2024-11-09 06:50:29,763 INFO L158 Benchmark]: CDTParser took 0.39ms. Allocated memory is still 119.5MB. Free memory was 82.4MB in the beginning and 82.4MB in the end (delta: 27.2kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 06:50:29,763 INFO L158 Benchmark]: CACSL2BoogieTranslator took 463.21ms. Allocated memory is still 165.7MB. Free memory was 131.6MB in the beginning and 117.5MB in the end (delta: 14.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-09 06:50:29,764 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.45ms. Allocated memory is still 165.7MB. Free memory was 117.5MB in the beginning and 115.4MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 06:50:29,764 INFO L158 Benchmark]: Boogie Preprocessor took 51.28ms. Allocated memory is still 165.7MB. Free memory was 115.4MB in the beginning and 113.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 06:50:29,765 INFO L158 Benchmark]: RCFGBuilder took 824.52ms. Allocated memory is still 165.7MB. Free memory was 113.3MB in the beginning and 86.1MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-11-09 06:50:29,765 INFO L158 Benchmark]: TraceAbstraction took 5907.58ms. Allocated memory is still 165.7MB. Free memory was 85.4MB in the beginning and 60.2MB in the end (delta: 25.2MB). Peak memory consumption was 28.3MB. Max. memory is 16.1GB. [2024-11-09 06:50:29,766 INFO L158 Benchmark]: Witness Printer took 78.99ms. Allocated memory is still 165.7MB. Free memory was 60.2MB in the beginning and 57.1MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 06:50:29,768 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.39ms. Allocated memory is still 119.5MB. Free memory was 82.4MB in the beginning and 82.4MB in the end (delta: 27.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 463.21ms. Allocated memory is still 165.7MB. Free memory was 131.6MB in the beginning and 117.5MB in the end (delta: 14.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 57.45ms. Allocated memory is still 165.7MB. Free memory was 117.5MB in the beginning and 115.4MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 51.28ms. Allocated memory is still 165.7MB. Free memory was 115.4MB in the beginning and 113.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 824.52ms. Allocated memory is still 165.7MB. Free memory was 113.3MB in the beginning and 86.1MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * TraceAbstraction took 5907.58ms. Allocated memory is still 165.7MB. Free memory was 85.4MB in the beginning and 60.2MB in the end (delta: 25.2MB). Peak memory consumption was 28.3MB. Max. memory is 16.1GB. * Witness Printer took 78.99ms. Allocated memory is still 165.7MB. Free memory was 60.2MB in the beginning and 57.1MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 14]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L110] CALL, EXPR 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 [n={-3: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 [n={-3:0}] [L31] n->right = nondet_tree() [L32] return n; VAL [\result={-3:0}] [L110] RET, EXPR nondet_tree() [L110] CALL task(nondet_tree()) [L86] CALL, EXPR min(t) VAL [\old(n)={-3:0}] [L37] COND FALSE !(!n) [L40] EXPR n->data [L40] int a = n->data; [L41] EXPR n->left VAL [\old(n)={-3:0}, a=-1, n={-3:0}] [L41] CALL, EXPR min(n->left) VAL [\old(n)={0:0}] [L37] COND TRUE !n [L38] return 2147483647; VAL [\old(n)={0:0}, \result=2147483647] [L41] RET, EXPR min(n->left) VAL [\old(n)={-3:0}, a=-1, n={-3:0}] [L41] int b = min(n->left); [L42] EXPR n->right VAL [\old(n)={-3:0}, a=-1, b=2147483647] [L42] CALL, EXPR min(n->right) VAL [\old(n)={0:0}] [L37] COND TRUE !n [L38] return 2147483647; VAL [\old(n)={0:0}, \result=2147483647] [L42] RET, EXPR min(n->right) VAL [\old(n)={-3:0}, a=-1, b=2147483647] [L42] int c = min(n->right); [L43] COND FALSE !(b <= a && b <= c) [L44] COND FALSE !(c <= a && c <= b) [L45] return a; VAL [\old(n)={-3:0}, \result=-1] [L86] RET, EXPR min(t) VAL [t={-3:0}] [L86] int a = min(t); [L87] int b; VAL [a=-1, b={5:0}, t={-3:0}] [L89] CALL, EXPR size(t) VAL [\old(t)={-3:0}] [L81] COND FALSE !(!t) [L82] EXPR t->left VAL [\old(t)={-3:0}, t={-3:0}] [L82] CALL, EXPR size(t->left) VAL [\old(t)={0:0}] [L81] COND TRUE !t [L81] return 0; VAL [\old(t)={0:0}, \result=0] [L82] RET, EXPR size(t->left) VAL [\old(t)={-3:0}, t={-3:0}] [L82] EXPR t->right VAL [\old(t)={-3:0}] [L82] CALL, EXPR size(t->right) VAL [\old(t)={0:0}] [L81] COND TRUE !t [L81] return 0; VAL [\old(t)={0:0}, \result=0] [L82] RET, EXPR size(t->right) VAL [\old(t)={-3:0}] [L82] return size(t->left) + size(t->right) + 1; [L89] RET, EXPR size(t) VAL [a=-1, b={5:0}, t={-3:0}] [L89] int n = size(t); [L90] CALL assume_cycle_if_not(n != 0) [L9] COND FALSE !(!cond) [L90] RET assume_cycle_if_not(n != 0) [L91] EXPR, FCALL calloc(n, sizeof(int)) VAL [a=-1, b={5:0}, n=1, t={-3:0}] [L91] int *x = calloc(n, sizeof(int)); [L92] CALL tree_inorder(t, x, n) VAL [\old(a)={-2:0}, \old(i)=1, \old(t)={-3:0}] [L70] COND FALSE !(!t) [L73] EXPR t->left VAL [\old(a)={-2:0}, \old(i)=1, \old(t)={-3:0}, a={-2:0}, i=1, t={-3:0}] [L73] CALL, EXPR tree_inorder(t->left, a, i) VAL [\old(a)={-2:0}, \old(i)=1, \old(t)={0:0}] [L70] COND TRUE !t [L71] return i; VAL [\old(a)={-2:0}, \old(i)=1, \old(t)={0:0}, \result=1, a={-2:0}] [L73] RET, EXPR tree_inorder(t->left, a, i) VAL [\old(a)={-2:0}, \old(i)=1, \old(t)={-3:0}, a={-2:0}, i=1, t={-3:0}] [L73] i = tree_inorder(t->left, a, i) [L74] EXPR i++ [L74] EXPR t->data [L74] a[i++] = t->data [L75] EXPR t->right VAL [\old(a)={-2:0}, \old(i)=1, \old(t)={-3:0}, a={-2:0}, i=2] [L75] CALL, EXPR tree_inorder(t->right, a, i) VAL [\old(a)={-2:0}, \old(i)=2, \old(t)={0:0}] [L70] COND TRUE !t [L71] return i; VAL [\old(a)={-2:0}, \old(i)=2, \old(t)={0:0}, \result=2, a={-2:0}] [L75] RET, EXPR tree_inorder(t->right, a, i) VAL [\old(a)={-2:0}, \old(i)=1, \old(t)={-3:0}, a={-2:0}, i=2] [L75] i = tree_inorder(t->right, a, i) [L76] return i; VAL [\old(a)={-2:0}, \old(i)=1, \old(t)={-3:0}, \result=2, a={-2:0}, i=2] [L92] RET tree_inorder(t, x, n) VAL [a=-1, b={5:0}, n=1, t={-3:0}, x={-2:0}] [L93] EXPR x[0] VAL [a=-1, b={5:0}, n=1, t={-3:0}, x={-2:0}] [L93] CALL __VERIFIER_assert(a == x[0]) [L16] COND TRUE !cond [L16] CALL reach_error() [L14] __assert_fail("0", "tree_del_iter.c", 14, "reach_error") - UnprovableResult [Line: 109]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 79 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 5.8s, OverallIterations: 5, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 91 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 75 mSDsluCounter, 2214 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1861 mSDsCounter, 26 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 500 IncrementalHoareTripleChecker+Invalid, 526 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 26 mSolverCounterUnsat, 353 mSDtfsCounter, 500 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 268 GetRequests, 235 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=85occurred in iteration=4, InterpolantAutomatonStates: 33, 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, 4 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 413 NumberOfCodeBlocks, 413 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 440 ConstructedInterpolants, 0 QuantifiedInterpolants, 1099 SizeOfPredicates, 6 NumberOfNonLiveVariables, 627 ConjunctsInSsa, 50 ConjunctsInUnsatCore, 8 InterpolantComputations, 2 PerfectInterpolantSequences, 156/168 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! [2024-11-09 06:50:29,810 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd89bf24-5288-44fd-8334-33a26ea77ae9/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-memcleanup)