./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 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/verifythis/tree_del_rec_incorrect.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --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 5a7a61549e909154c33d5cf68876338c8745b83dde5aedff258c17f34600afc7 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-09 23:29:02,869 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 23:29:02,952 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 23:29:02,956 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 23:29:02,956 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 23:29:02,976 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 23:29:02,976 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 23:29:02,977 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 23:29:02,977 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 23:29:02,978 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 23:29:02,978 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 23:29:02,978 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 23:29:02,979 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 23:29:02,979 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 23:29:02,980 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 23:29:02,980 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 23:29:02,981 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 23:29:02,981 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 23:29:02,983 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 23:29:02,984 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 23:29:02,984 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 23:29:02,984 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 23:29:02,985 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 23:29:02,985 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 23:29:02,985 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 23:29:02,985 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 23:29:02,985 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 23:29:02,986 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 23:29:02,986 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-09 23:29:02,986 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 23:29:02,986 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 23:29:02,987 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 23:29:02,987 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 23:29:02,987 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 23:29:02,987 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 23:29:02,988 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 23:29:02,988 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 23:29:02,990 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 23:29:02,990 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 23:29:02,991 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 23:29:02,991 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 23:29:02,991 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 23:29:02,991 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> 5a7a61549e909154c33d5cf68876338c8745b83dde5aedff258c17f34600afc7 [2024-11-09 23:29:03,237 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 23:29:03,262 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 23:29:03,264 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 23:29:03,265 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 23:29:03,265 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 23:29:03,266 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/verifythis/tree_del_rec_incorrect.c [2024-11-09 23:29:04,681 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 23:29:04,845 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 23:29:04,846 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/tree_del_rec_incorrect.c [2024-11-09 23:29:04,853 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/04762113f/8f7f802cc5d2465a8fa5b591cbeb222f/FLAGbb3427a33 [2024-11-09 23:29:04,865 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/04762113f/8f7f802cc5d2465a8fa5b591cbeb222f [2024-11-09 23:29:04,867 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 23:29:04,869 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 23:29:04,870 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 23:29:04,870 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 23:29:04,878 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 23:29:04,879 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 11:29:04" (1/1) ... [2024-11-09 23:29:04,880 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c2843fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:29:04, skipping insertion in model container [2024-11-09 23:29:04,881 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 11:29:04" (1/1) ... [2024-11-09 23:29:04,899 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 23:29:05,062 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/tree_del_rec_incorrect.c[618,631] [2024-11-09 23:29:05,085 WARN L1684 CHandler]: Possible shadowing of function min [2024-11-09 23:29:05,088 WARN L1684 CHandler]: Possible shadowing of function min [2024-11-09 23:29:05,119 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 23:29:05,136 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 23:29:05,149 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/tree_del_rec_incorrect.c[618,631] [2024-11-09 23:29:05,157 WARN L1684 CHandler]: Possible shadowing of function min [2024-11-09 23:29:05,160 WARN L1684 CHandler]: Possible shadowing of function min [2024-11-09 23:29:05,174 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 23:29:05,196 INFO L204 MainTranslator]: Completed translation [2024-11-09 23:29:05,196 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:29:05 WrapperNode [2024-11-09 23:29:05,197 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 23:29:05,198 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 23:29:05,199 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 23:29:05,199 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 23:29:05,206 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:29:05" (1/1) ... [2024-11-09 23:29:05,218 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:29:05" (1/1) ... [2024-11-09 23:29:05,247 INFO L138 Inliner]: procedures = 29, calls = 58, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 67 [2024-11-09 23:29:05,249 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 23:29:05,250 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 23:29:05,250 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 23:29:05,250 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 23:29:05,260 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:29:05" (1/1) ... [2024-11-09 23:29:05,261 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:29:05" (1/1) ... [2024-11-09 23:29:05,265 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:29:05" (1/1) ... [2024-11-09 23:29:05,289 INFO L175 MemorySlicer]: Split 24 memory accesses to 4 slices as follows [2, 2, 5, 15]. 63 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 7 writes are split as follows [0, 1, 2, 4]. [2024-11-09 23:29:05,289 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:29:05" (1/1) ... [2024-11-09 23:29:05,290 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:29:05" (1/1) ... [2024-11-09 23:29:05,298 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:29:05" (1/1) ... [2024-11-09 23:29:05,299 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:29:05" (1/1) ... [2024-11-09 23:29:05,301 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:29:05" (1/1) ... [2024-11-09 23:29:05,302 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:29:05" (1/1) ... [2024-11-09 23:29:05,307 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 23:29:05,308 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-09 23:29:05,308 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-09 23:29:05,308 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-09 23:29:05,309 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:29:05" (1/1) ... [2024-11-09 23:29:05,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 23:29:05,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 23:29:05,343 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 23:29:05,348 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 23:29:05,389 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 23:29:05,389 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-09 23:29:05,389 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-09 23:29:05,389 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-09 23:29:05,389 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-09 23:29:05,390 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-11-09 23:29:05,390 INFO L130 BoogieDeclarations]: Found specification of procedure tree_del [2024-11-09 23:29:05,390 INFO L138 BoogieDeclarations]: Found implementation of procedure tree_del [2024-11-09 23:29:05,390 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-09 23:29:05,390 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-09 23:29:05,390 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-09 23:29:05,391 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-09 23:29:05,391 INFO L130 BoogieDeclarations]: Found specification of procedure min [2024-11-09 23:29:05,391 INFO L138 BoogieDeclarations]: Found implementation of procedure min [2024-11-09 23:29:05,391 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-09 23:29:05,391 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-09 23:29:05,391 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-09 23:29:05,392 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-09 23:29:05,392 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2024-11-09 23:29:05,392 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2024-11-09 23:29:05,392 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-09 23:29:05,392 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-09 23:29:05,392 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-09 23:29:05,393 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-11-09 23:29:05,393 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_tree [2024-11-09 23:29:05,393 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_tree [2024-11-09 23:29:05,393 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 23:29:05,393 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-09 23:29:05,393 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-09 23:29:05,393 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-09 23:29:05,394 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 23:29:05,394 INFO L130 BoogieDeclarations]: Found specification of procedure size [2024-11-09 23:29:05,394 INFO L138 BoogieDeclarations]: Found implementation of procedure size [2024-11-09 23:29:05,394 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 23:29:05,394 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 23:29:05,394 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-09 23:29:05,394 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-09 23:29:05,394 INFO L130 BoogieDeclarations]: Found specification of procedure tree_inorder [2024-11-09 23:29:05,394 INFO L138 BoogieDeclarations]: Found implementation of procedure tree_inorder [2024-11-09 23:29:05,395 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 23:29:05,516 INFO L256 CfgBuilder]: Building ICFG [2024-11-09 23:29:05,517 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 23:29:05,602 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L39: havoc ~a~0, ~b~0; [2024-11-09 23:29:05,634 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L27: havoc ~n~0.base, ~n~0.offset; [2024-11-09 23:29:05,803 INFO L? ?]: Removed 51 outVars from TransFormulas that were not future-live. [2024-11-09 23:29:05,804 INFO L307 CfgBuilder]: Performing block encoding [2024-11-09 23:29:05,827 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 23:29:05,828 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 23:29:05,829 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 11:29:05 BoogieIcfgContainer [2024-11-09 23:29:05,829 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-09 23:29:05,831 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 23:29:05,832 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 23:29:05,835 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 23:29:05,835 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 11:29:04" (1/3) ... [2024-11-09 23:29:05,836 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6920fcf9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 11:29:05, skipping insertion in model container [2024-11-09 23:29:05,836 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:29:05" (2/3) ... [2024-11-09 23:29:05,838 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6920fcf9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 11:29:05, skipping insertion in model container [2024-11-09 23:29:05,838 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 11:29:05" (3/3) ... [2024-11-09 23:29:05,839 INFO L112 eAbstractionObserver]: Analyzing ICFG tree_del_rec_incorrect.c [2024-11-09 23:29:05,855 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 23:29:05,856 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 23:29:05,901 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 23:29:05,910 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=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@63d085f0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 23:29:05,910 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 23:29:05,914 INFO L276 IsEmpty]: Start isEmpty. Operand has 86 states, 55 states have (on average 1.2) internal successors, (66), 56 states have internal predecessors, (66), 22 states have call successors, (22), 7 states have call predecessors, (22), 7 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-09 23:29:05,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-09 23:29:05,924 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:29:05,925 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, 1, 1] [2024-11-09 23:29:05,925 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:29:05,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:29:05,931 INFO L85 PathProgramCache]: Analyzing trace with hash 921271183, now seen corresponding path program 1 times [2024-11-09 23:29:05,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:29:05,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389651640] [2024-11-09 23:29:05,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:29:05,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:29:06,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:29:06,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:29:06,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:29:06,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 23:29:06,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:29:06,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-09 23:29:06,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:29:06,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-09 23:29:06,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:29:06,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-09 23:29:06,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:29:06,333 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 23:29:06,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:29:06,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389651640] [2024-11-09 23:29:06,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389651640] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:29:06,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:29:06,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 23:29:06,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413836787] [2024-11-09 23:29:06,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:29:06,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 23:29:06,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:29:06,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 23:29:06,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 23:29:06,366 INFO L87 Difference]: Start difference. First operand has 86 states, 55 states have (on average 1.2) internal successors, (66), 56 states have internal predecessors, (66), 22 states have call successors, (22), 7 states have call predecessors, (22), 7 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (6), 5 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-09 23:29:06,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:29:06,743 INFO L93 Difference]: Finished difference Result 150 states and 198 transitions. [2024-11-09 23:29:06,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 23:29:06,747 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (6), 5 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 37 [2024-11-09 23:29:06,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:29:06,757 INFO L225 Difference]: With dead ends: 150 [2024-11-09 23:29:06,759 INFO L226 Difference]: Without dead ends: 85 [2024-11-09 23:29:06,763 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-09 23:29:06,768 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 107 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 23:29:06,769 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 91 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 23:29:06,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-11-09 23:29:06,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 80. [2024-11-09 23:29:06,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 50 states have (on average 1.14) internal successors, (57), 50 states have internal predecessors, (57), 22 states have call successors, (22), 7 states have call predecessors, (22), 7 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-09 23:29:06,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 101 transitions. [2024-11-09 23:29:06,823 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 101 transitions. Word has length 37 [2024-11-09 23:29:06,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:29:06,824 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 101 transitions. [2024-11-09 23:29:06,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (6), 5 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-09 23:29:06,825 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 101 transitions. [2024-11-09 23:29:06,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-09 23:29:06,829 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:29:06,829 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, 1, 1] [2024-11-09 23:29:06,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 23:29:06,830 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:29:06,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:29:06,832 INFO L85 PathProgramCache]: Analyzing trace with hash -2020386416, now seen corresponding path program 1 times [2024-11-09 23:29:06,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:29:06,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594465301] [2024-11-09 23:29:06,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:29:06,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:29:06,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:29:07,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:29:07,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:29:07,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 23:29:07,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:29:07,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-09 23:29:07,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:29:07,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-09 23:29:07,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:29:07,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-09 23:29:07,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:29:07,155 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 23:29:07,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:29:07,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594465301] [2024-11-09 23:29:07,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [594465301] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:29:07,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:29:07,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 23:29:07,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090502561] [2024-11-09 23:29:07,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:29:07,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 23:29:07,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:29:07,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 23:29:07,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-09 23:29:07,162 INFO L87 Difference]: Start difference. First operand 80 states and 101 transitions. Second operand has 8 states, 8 states have (on average 3.25) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (6), 5 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 23:29:07,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:29:07,582 INFO L93 Difference]: Finished difference Result 143 states and 185 transitions. [2024-11-09 23:29:07,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 23:29:07,582 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (6), 5 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 37 [2024-11-09 23:29:07,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:29:07,584 INFO L225 Difference]: With dead ends: 143 [2024-11-09 23:29:07,585 INFO L226 Difference]: Without dead ends: 87 [2024-11-09 23:29:07,585 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-11-09 23:29:07,586 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 110 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 322 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 23:29:07,587 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 162 Invalid, 412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 322 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 23:29:07,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-11-09 23:29:07,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 82. [2024-11-09 23:29:07,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 51 states have (on average 1.1372549019607843) internal successors, (58), 52 states have internal predecessors, (58), 22 states have call successors, (22), 7 states have call predecessors, (22), 8 states have return successors, (25), 22 states have call predecessors, (25), 22 states have call successors, (25) [2024-11-09 23:29:07,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 105 transitions. [2024-11-09 23:29:07,605 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 105 transitions. Word has length 37 [2024-11-09 23:29:07,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:29:07,605 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 105 transitions. [2024-11-09 23:29:07,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (6), 5 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 23:29:07,606 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 105 transitions. [2024-11-09 23:29:07,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-09 23:29:07,610 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:29:07,610 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, 1, 1] [2024-11-09 23:29:07,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 23:29:07,610 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:29:07,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:29:07,611 INFO L85 PathProgramCache]: Analyzing trace with hash -1535484923, now seen corresponding path program 1 times [2024-11-09 23:29:07,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:29:07,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640641478] [2024-11-09 23:29:07,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:29:07,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:29:07,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:29:07,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:29:07,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:29:07,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 23:29:07,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:29:07,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-09 23:29:07,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:29:08,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:29:08,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:29:08,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 23:29:08,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:29:08,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-09 23:29:08,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:29:08,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-09 23:29:08,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:29:08,061 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 23:29:08,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:29:08,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640641478] [2024-11-09 23:29:08,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640641478] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 23:29:08,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1084774975] [2024-11-09 23:29:08,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:29:08,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 23:29:08,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 23:29:08,064 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 23:29:08,066 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 23:29:08,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:29:08,179 INFO L255 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-09 23:29:08,189 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 23:29:08,320 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 23:29:08,320 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 23:29:08,495 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 23:29:08,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1084774975] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 23:29:08,495 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 23:29:08,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 7] total 13 [2024-11-09 23:29:08,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630859721] [2024-11-09 23:29:08,496 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 23:29:08,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-09 23:29:08,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:29:08,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-09 23:29:08,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-11-09 23:29:08,498 INFO L87 Difference]: Start difference. First operand 82 states and 105 transitions. Second operand has 13 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 9 states have internal predecessors, (44), 5 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2024-11-09 23:29:09,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:29:09,093 INFO L93 Difference]: Finished difference Result 149 states and 194 transitions. [2024-11-09 23:29:09,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 23:29:09,094 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 9 states have internal predecessors, (44), 5 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) Word has length 49 [2024-11-09 23:29:09,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:29:09,096 INFO L225 Difference]: With dead ends: 149 [2024-11-09 23:29:09,096 INFO L226 Difference]: Without dead ends: 87 [2024-11-09 23:29:09,100 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=72, Invalid=234, Unknown=0, NotChecked=0, Total=306 [2024-11-09 23:29:09,101 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 108 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 554 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 645 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 554 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 23:29:09,102 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 252 Invalid, 645 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 554 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 23:29:09,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-11-09 23:29:09,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 84. [2024-11-09 23:29:09,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 52 states have (on average 1.1346153846153846) internal successors, (59), 54 states have internal predecessors, (59), 22 states have call successors, (22), 7 states have call predecessors, (22), 9 states have return successors, (27), 22 states have call predecessors, (27), 22 states have call successors, (27) [2024-11-09 23:29:09,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 108 transitions. [2024-11-09 23:29:09,122 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 108 transitions. Word has length 49 [2024-11-09 23:29:09,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:29:09,123 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 108 transitions. [2024-11-09 23:29:09,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 9 states have internal predecessors, (44), 5 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2024-11-09 23:29:09,124 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 108 transitions. [2024-11-09 23:29:09,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-11-09 23:29:09,127 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:29:09,127 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, 1, 1] [2024-11-09 23:29:09,145 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-09 23:29:09,327 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 23:29:09,328 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:29:09,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:29:09,328 INFO L85 PathProgramCache]: Analyzing trace with hash -927482643, now seen corresponding path program 1 times [2024-11-09 23:29:09,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:29:09,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847804017] [2024-11-09 23:29:09,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:29:09,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:29:09,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:29:09,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:29:09,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:29:09,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:29:09,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:29:09,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 23:29:09,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:29:09,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 23:29:09,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:29:09,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-09 23:29:09,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:29:09,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:29:09,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:29:09,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 23:29:09,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:29:09,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-09 23:29:09,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:29:09,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-09 23:29:09,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:29:09,578 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 23:29:09,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:29:09,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847804017] [2024-11-09 23:29:09,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847804017] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:29:09,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:29:09,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-09 23:29:09,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913104138] [2024-11-09 23:29:09,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:29:09,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 23:29:09,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:29:09,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 23:29:09,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-11-09 23:29:09,585 INFO L87 Difference]: Start difference. First operand 84 states and 108 transitions. Second operand has 11 states, 10 states have (on average 3.3) internal successors, (33), 7 states have internal predecessors, (33), 4 states have call successors, (10), 5 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 23:29:10,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:29:10,130 INFO L93 Difference]: Finished difference Result 149 states and 194 transitions. [2024-11-09 23:29:10,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 23:29:10,131 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.3) internal successors, (33), 7 states have internal predecessors, (33), 4 states have call successors, (10), 5 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 61 [2024-11-09 23:29:10,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:29:10,133 INFO L225 Difference]: With dead ends: 149 [2024-11-09 23:29:10,133 INFO L226 Difference]: Without dead ends: 89 [2024-11-09 23:29:10,134 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2024-11-09 23:29:10,135 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 125 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 528 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 624 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 528 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 23:29:10,135 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 241 Invalid, 624 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 528 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 23:29:10,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-11-09 23:29:10,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 86. [2024-11-09 23:29:10,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 53 states have (on average 1.1320754716981132) internal successors, (60), 56 states have internal predecessors, (60), 22 states have call successors, (22), 7 states have call predecessors, (22), 10 states have return successors, (29), 22 states have call predecessors, (29), 22 states have call successors, (29) [2024-11-09 23:29:10,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 111 transitions. [2024-11-09 23:29:10,149 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 111 transitions. Word has length 61 [2024-11-09 23:29:10,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:29:10,149 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 111 transitions. [2024-11-09 23:29:10,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.3) internal successors, (33), 7 states have internal predecessors, (33), 4 states have call successors, (10), 5 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 23:29:10,150 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 111 transitions. [2024-11-09 23:29:10,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-09 23:29:10,153 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:29:10,153 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, 1, 1, 1] [2024-11-09 23:29:10,153 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 23:29:10,153 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:29:10,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:29:10,154 INFO L85 PathProgramCache]: Analyzing trace with hash 332857519, now seen corresponding path program 1 times [2024-11-09 23:29:10,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:29:10,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482712985] [2024-11-09 23:29:10,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:29:10,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:29:10,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:29:10,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:29:10,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:29:10,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:29:10,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:29:10,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 23:29:10,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:29:10,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 23:29:10,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:29:10,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:29:10,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:29:10,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 23:29:10,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:29:10,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-09 23:29:10,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:29:10,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:29:10,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:29:10,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 23:29:10,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:29:10,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 23:29:10,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:29:10,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-09 23:29:10,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:29:10,441 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-11-09 23:29:10,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:29:10,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482712985] [2024-11-09 23:29:10,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1482712985] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:29:10,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:29:10,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-09 23:29:10,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433998076] [2024-11-09 23:29:10,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:29:10,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 23:29:10,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:29:10,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 23:29:10,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-11-09 23:29:10,443 INFO L87 Difference]: Start difference. First operand 86 states and 111 transitions. Second operand has 11 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 7 states have internal predecessors, (37), 4 states have call successors, (12), 5 states have call predecessors, (12), 3 states have return successors, (11), 5 states have call predecessors, (11), 3 states have call successors, (11) [2024-11-09 23:29:10,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:29:10,913 INFO L93 Difference]: Finished difference Result 141 states and 182 transitions. [2024-11-09 23:29:10,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 23:29:10,913 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 7 states have internal predecessors, (37), 4 states have call successors, (12), 5 states have call predecessors, (12), 3 states have return successors, (11), 5 states have call predecessors, (11), 3 states have call successors, (11) Word has length 74 [2024-11-09 23:29:10,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:29:10,915 INFO L225 Difference]: With dead ends: 141 [2024-11-09 23:29:10,916 INFO L226 Difference]: Without dead ends: 89 [2024-11-09 23:29:10,916 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2024-11-09 23:29:10,917 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 117 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 530 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 618 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 530 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 23:29:10,920 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 239 Invalid, 618 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 530 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 23:29:10,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-11-09 23:29:10,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 88. [2024-11-09 23:29:10,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 54 states have (on average 1.1296296296296295) internal successors, (61), 58 states have internal predecessors, (61), 22 states have call successors, (22), 7 states have call predecessors, (22), 11 states have return successors, (31), 22 states have call predecessors, (31), 22 states have call successors, (31) [2024-11-09 23:29:10,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 114 transitions. [2024-11-09 23:29:10,944 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 114 transitions. Word has length 74 [2024-11-09 23:29:10,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:29:10,945 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 114 transitions. [2024-11-09 23:29:10,945 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 7 states have internal predecessors, (37), 4 states have call successors, (12), 5 states have call predecessors, (12), 3 states have return successors, (11), 5 states have call predecessors, (11), 3 states have call successors, (11) [2024-11-09 23:29:10,946 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 114 transitions. [2024-11-09 23:29:10,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-09 23:29:10,947 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:29:10,947 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, 1, 1, 1] [2024-11-09 23:29:10,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 23:29:10,949 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:29:10,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:29:10,950 INFO L85 PathProgramCache]: Analyzing trace with hash 947301810, now seen corresponding path program 1 times [2024-11-09 23:29:10,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:29:10,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350898846] [2024-11-09 23:29:10,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:29:10,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:29:10,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 23:29:10,989 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 23:29:11,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 23:29:11,055 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 23:29:11,057 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 23:29:11,058 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-09 23:29:11,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 23:29:11,062 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-11-09 23:29:11,118 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 23:29:11,120 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 11:29:11 BoogieIcfgContainer [2024-11-09 23:29:11,122 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 23:29:11,123 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 23:29:11,123 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 23:29:11,123 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 23:29:11,124 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 11:29:05" (3/4) ... [2024-11-09 23:29:11,124 INFO L137 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-09 23:29:11,180 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-09 23:29:11,184 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 23:29:11,185 INFO L158 Benchmark]: Toolchain (without parser) took 6316.10ms. Allocated memory was 155.2MB in the beginning and 218.1MB in the end (delta: 62.9MB). Free memory was 97.5MB in the beginning and 84.7MB in the end (delta: 12.8MB). Peak memory consumption was 77.8MB. Max. memory is 16.1GB. [2024-11-09 23:29:11,185 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 155.2MB. Free memory was 116.2MB in the beginning and 116.1MB in the end (delta: 139.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 23:29:11,185 INFO L158 Benchmark]: CACSL2BoogieTranslator took 326.79ms. Allocated memory is still 155.2MB. Free memory was 97.5MB in the beginning and 83.2MB in the end (delta: 14.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-09 23:29:11,185 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.11ms. Allocated memory is still 155.2MB. Free memory was 83.2MB in the beginning and 81.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 23:29:11,185 INFO L158 Benchmark]: Boogie Preprocessor took 57.18ms. Allocated memory is still 155.2MB. Free memory was 81.6MB in the beginning and 78.0MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 23:29:11,186 INFO L158 Benchmark]: IcfgBuilder took 521.20ms. Allocated memory is still 155.2MB. Free memory was 78.0MB in the beginning and 54.4MB in the end (delta: 23.6MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-11-09 23:29:11,186 INFO L158 Benchmark]: TraceAbstraction took 5291.28ms. Allocated memory was 155.2MB in the beginning and 218.1MB in the end (delta: 62.9MB). Free memory was 53.4MB in the beginning and 87.8MB in the end (delta: -34.4MB). Peak memory consumption was 31.6MB. Max. memory is 16.1GB. [2024-11-09 23:29:11,187 INFO L158 Benchmark]: Witness Printer took 61.21ms. Allocated memory is still 218.1MB. Free memory was 87.8MB in the beginning and 84.7MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 23:29:11,189 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.18ms. Allocated memory is still 155.2MB. Free memory was 116.2MB in the beginning and 116.1MB in the end (delta: 139.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 326.79ms. Allocated memory is still 155.2MB. Free memory was 97.5MB in the beginning and 83.2MB in the end (delta: 14.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.11ms. Allocated memory is still 155.2MB. Free memory was 83.2MB in the beginning and 81.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 57.18ms. Allocated memory is still 155.2MB. Free memory was 81.6MB in the beginning and 78.0MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * IcfgBuilder took 521.20ms. Allocated memory is still 155.2MB. Free memory was 78.0MB in the beginning and 54.4MB in the end (delta: 23.6MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 5291.28ms. Allocated memory was 155.2MB in the beginning and 218.1MB in the end (delta: 62.9MB). Free memory was 53.4MB in the beginning and 87.8MB in the end (delta: -34.4MB). Peak memory consumption was 31.6MB. Max. memory is 16.1GB. * Witness Printer took 61.21ms. Allocated memory is still 218.1MB. Free memory was 87.8MB in the beginning and 84.7MB 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: 16]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L98] 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={-2: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={-2:0}] [L31] n->right = nondet_tree() [L32] return n; VAL [\result={-2:0}] [L98] RET, EXPR nondet_tree() [L98] CALL task(nondet_tree()) [L76] CALL, EXPR min(t) VAL [\old(n)={-2:0}] [L37] COND FALSE !(!n) [L40] EXPR n->left VAL [\old(n)={-2:0}, n={-2:0}] [L40] CALL, EXPR min(n->left) VAL [\old(n)={0:0}] [L37] COND TRUE !n [L38] return 2147483647; VAL [\old(n)={0:0}, \result=2147483647] [L40] RET, EXPR min(n->left) VAL [\old(n)={-2:0}, n={-2:0}] [L40] int a = min(n->left); [L41] EXPR n->right VAL [\old(n)={-2:0}, a=2147483647] [L41] CALL, EXPR min(n->right) VAL [\old(n)={0:0}] [L37] COND TRUE !n [L38] return 2147483647; VAL [\old(n)={0:0}, \result=2147483647] [L41] RET, EXPR min(n->right) VAL [\old(n)={-2:0}, a=2147483647] [L41] int b = min(n->right); [L42] COND TRUE a <= b [L42] return a; VAL [\old(n)={-2:0}, \result=2147483647] [L76] RET, EXPR min(t) VAL [t={-2:0}] [L76] int a = min(t); [L77] int b; VAL [a=2147483647, b={5:0}, t={-2:0}] [L79] CALL, EXPR size(t) VAL [\old(t)={-2:0}] [L71] COND FALSE !(!t) [L72] EXPR t->left VAL [\old(t)={-2:0}, t={-2:0}] [L72] CALL, EXPR size(t->left) VAL [\old(t)={0:0}] [L71] COND TRUE !t [L71] return 0; VAL [\old(t)={0:0}, \result=0] [L72] RET, EXPR size(t->left) VAL [\old(t)={-2:0}, t={-2:0}] [L72] EXPR t->right VAL [\old(t)={-2:0}] [L72] CALL, EXPR size(t->right) VAL [\old(t)={0:0}] [L71] COND TRUE !t [L71] return 0; VAL [\old(t)={0:0}, \result=0] [L72] RET, EXPR size(t->right) VAL [\old(t)={-2:0}] [L72] return size(t->left) + size(t->right) + 1; [L79] RET, EXPR size(t) VAL [a=2147483647, b={5:0}, t={-2:0}] [L79] int n = size(t); [L80] CALL assume_abort_if_not(n != 0) [L10] COND FALSE !(!cond) [L80] RET assume_abort_if_not(n != 0) [L81] EXPR, FCALL calloc(n, sizeof(int)) VAL [a=2147483647, b={5:0}, n=1, t={-2:0}] [L81] int *x = calloc(n, sizeof(int)); [L82] CALL tree_inorder(t, x, n) VAL [\old(a)={-3:0}, \old(i)=1, \old(t)={-2:0}] [L60] COND FALSE !(!t) [L63] EXPR t->left VAL [\old(a)={-3:0}, \old(i)=1, \old(t)={-2:0}, a={-3:0}, i=1, t={-2:0}] [L63] CALL, EXPR tree_inorder(t->left, a, i) VAL [\old(a)={-3:0}, \old(i)=1, \old(t)={0:0}] [L60] COND TRUE !t [L61] return i; VAL [\old(a)={-3:0}, \old(i)=1, \old(t)={0:0}, \result=1, a={-3:0}] [L63] RET, EXPR tree_inorder(t->left, a, i) VAL [\old(a)={-3:0}, \old(i)=1, \old(t)={-2:0}, a={-3:0}, i=1, t={-2:0}] [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(a)={-3:0}, \old(i)=1, \old(t)={-2:0}, a={-3:0}, i=2] [L65] CALL, EXPR tree_inorder(t->right, a, i) VAL [\old(a)={-3:0}, \old(i)=2, \old(t)={0:0}] [L60] COND TRUE !t [L61] return i; VAL [\old(a)={-3:0}, \old(i)=2, \old(t)={0:0}, \result=2, a={-3:0}] [L65] RET, EXPR tree_inorder(t->right, a, i) VAL [\old(a)={-3:0}, \old(i)=1, \old(t)={-2:0}, a={-3:0}, i=2] [L65] i = tree_inorder(t->right, a, i) [L66] return i; VAL [\old(a)={-3:0}, \old(i)=1, \old(t)={-2:0}, \result=2, a={-3:0}, i=2] [L82] RET tree_inorder(t, x, n) VAL [a=2147483647, b={5:0}, n=1, t={-2:0}, x={-3:0}] [L83] EXPR x[0] [L83] CALL __VERIFIER_assert(a == x[0]) VAL [\old(cond)=0] [L16] COND TRUE !cond VAL [\old(cond)=0] [L16] reach_error() VAL [\old(cond)=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 8 procedures, 86 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.2s, OverallIterations: 6, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 612 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 567 mSDsluCounter, 985 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 760 mSDsCounter, 449 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2040 IncrementalHoareTripleChecker+Invalid, 2489 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 449 mSolverCounterUnsat, 225 mSDtfsCounter, 2040 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 225 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=88occurred in iteration=5, InterpolantAutomatonStates: 47, 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, 17 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 393 NumberOfCodeBlocks, 393 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 349 ConstructedInterpolants, 0 QuantifiedInterpolants, 926 SizeOfPredicates, 2 NumberOfNonLiveVariables, 242 ConjunctsInSsa, 25 ConjunctsInUnsatCore, 7 InterpolantComputations, 4 PerfectInterpolantSequences, 90/96 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 23:29:11,221 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (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