./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/verifythis/tree_del_iter_incorrect.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/verifythis/tree_del_iter_incorrect.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 11dfc9c267e4b15a18edd43bd8f373e4d6af1fa864b5f35e9818e0875ad24411 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 03:39:35,666 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 03:39:35,738 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 03:39:35,746 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 03:39:35,748 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 03:39:35,770 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 03:39:35,772 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 03:39:35,772 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 03:39:35,773 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 03:39:35,773 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 03:39:35,773 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 03:39:35,774 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 03:39:35,774 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 03:39:35,774 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 03:39:35,774 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 03:39:35,774 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 03:39:35,775 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 03:39:35,775 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 03:39:35,775 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 03:39:35,775 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 03:39:35,775 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 03:39:35,775 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 03:39:35,775 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 03:39:35,775 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 03:39:35,775 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 03:39:35,775 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 03:39:35,776 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 03:39:35,776 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 03:39:35,776 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 03:39:35,776 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 03:39:35,776 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 03:39:35,776 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 03:39:35,776 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:39:35,776 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 03:39:35,777 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 03:39:35,777 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 03:39:35,777 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 03:39:35,777 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:39:35,777 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 03:39:35,777 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 03:39:35,777 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 03:39:35,777 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 03:39:35,777 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 03:39:35,777 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 03:39:35,777 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 03:39:35,777 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 03:39:35,777 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 03:39:35,778 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 03:39:35,778 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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-jdk21/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 -> 11dfc9c267e4b15a18edd43bd8f373e4d6af1fa864b5f35e9818e0875ad24411 [2025-01-09 03:39:35,983 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 03:39:35,988 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 03:39:35,989 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 03:39:35,990 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 03:39:35,990 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 03:39:35,991 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/verifythis/tree_del_iter_incorrect.c [2025-01-09 03:39:37,145 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7c5465034/f1ad99187fa04049b6254f531611c0df/FLAGf7bdab6a7 [2025-01-09 03:39:37,426 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 03:39:37,444 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/verifythis/tree_del_iter_incorrect.c [2025-01-09 03:39:37,465 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7c5465034/f1ad99187fa04049b6254f531611c0df/FLAGf7bdab6a7 [2025-01-09 03:39:37,486 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7c5465034/f1ad99187fa04049b6254f531611c0df [2025-01-09 03:39:37,488 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 03:39:37,490 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 03:39:37,491 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 03:39:37,491 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 03:39:37,494 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 03:39:37,495 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:39:37" (1/1) ... [2025-01-09 03:39:37,495 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@700dacb8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:39:37, skipping insertion in model container [2025-01-09 03:39:37,496 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:39:37" (1/1) ... [2025-01-09 03:39:37,511 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 03:39:37,614 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/verifythis/tree_del_iter_incorrect.c[619,632] [2025-01-09 03:39:37,632 WARN L1731 CHandler]: Possible shadowing of function min [2025-01-09 03:39:37,647 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 03:39:37,659 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 03:39:37,666 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/verifythis/tree_del_iter_incorrect.c[619,632] [2025-01-09 03:39:37,679 WARN L1731 CHandler]: Possible shadowing of function min [2025-01-09 03:39:37,687 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 03:39:37,697 INFO L204 MainTranslator]: Completed translation [2025-01-09 03:39:37,698 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:39:37 WrapperNode [2025-01-09 03:39:37,698 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 03:39:37,699 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 03:39:37,699 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 03:39:37,699 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 03:39:37,703 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:39:37" (1/1) ... [2025-01-09 03:39:37,711 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:39:37" (1/1) ... [2025-01-09 03:39:37,731 INFO L138 Inliner]: procedures = 29, calls = 61, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 103 [2025-01-09 03:39:37,731 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 03:39:37,732 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 03:39:37,734 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 03:39:37,734 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 03:39:37,739 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:39:37" (1/1) ... [2025-01-09 03:39:37,739 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:39:37" (1/1) ... [2025-01-09 03:39:37,742 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:39:37" (1/1) ... [2025-01-09 03:39:37,762 INFO L175 MemorySlicer]: Split 27 memory accesses to 4 slices as follows [2, 18, 2, 5]. 67 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, 4, 1, 2]. [2025-01-09 03:39:37,765 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:39:37" (1/1) ... [2025-01-09 03:39:37,765 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:39:37" (1/1) ... [2025-01-09 03:39:37,773 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:39:37" (1/1) ... [2025-01-09 03:39:37,774 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:39:37" (1/1) ... [2025-01-09 03:39:37,776 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:39:37" (1/1) ... [2025-01-09 03:39:37,777 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:39:37" (1/1) ... [2025-01-09 03:39:37,778 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:39:37" (1/1) ... [2025-01-09 03:39:37,782 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 03:39:37,783 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 03:39:37,783 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 03:39:37,783 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 03:39:37,786 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:39:37" (1/1) ... [2025-01-09 03:39:37,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:39:37,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:39:37,808 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 03:39:37,817 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 03:39:37,834 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 03:39:37,834 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-09 03:39:37,834 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-01-09 03:39:37,834 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-01-09 03:39:37,834 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-01-09 03:39:37,835 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-01-09 03:39:37,835 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 03:39:37,835 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 03:39:37,835 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-09 03:39:37,835 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-01-09 03:39:37,835 INFO L130 BoogieDeclarations]: Found specification of procedure min [2025-01-09 03:39:37,835 INFO L138 BoogieDeclarations]: Found implementation of procedure min [2025-01-09 03:39:37,835 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 03:39:37,835 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 03:39:37,835 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-09 03:39:37,836 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-01-09 03:39:37,836 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2025-01-09 03:39:37,836 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2025-01-09 03:39:37,836 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-01-09 03:39:37,836 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-01-09 03:39:37,836 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-01-09 03:39:37,836 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-01-09 03:39:37,836 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_tree [2025-01-09 03:39:37,837 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_tree [2025-01-09 03:39:37,837 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 03:39:37,837 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 03:39:37,837 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 03:39:37,837 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-09 03:39:37,837 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 03:39:37,837 INFO L130 BoogieDeclarations]: Found specification of procedure size [2025-01-09 03:39:37,837 INFO L138 BoogieDeclarations]: Found implementation of procedure size [2025-01-09 03:39:37,837 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 03:39:37,838 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 03:39:37,838 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-01-09 03:39:37,838 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-01-09 03:39:37,838 INFO L130 BoogieDeclarations]: Found specification of procedure tree_inorder [2025-01-09 03:39:37,838 INFO L138 BoogieDeclarations]: Found implementation of procedure tree_inorder [2025-01-09 03:39:37,838 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 03:39:37,981 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 03:39:37,982 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 03:39:38,170 INFO L? ?]: Removed 62 outVars from TransFormulas that were not future-live. [2025-01-09 03:39:38,170 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 03:39:38,177 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 03:39:38,177 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 03:39:38,177 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:39:38 BoogieIcfgContainer [2025-01-09 03:39:38,177 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 03:39:38,179 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 03:39:38,179 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 03:39:38,182 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 03:39:38,182 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 03:39:37" (1/3) ... [2025-01-09 03:39:38,183 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f709b53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:39:38, skipping insertion in model container [2025-01-09 03:39:38,183 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:39:37" (2/3) ... [2025-01-09 03:39:38,183 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f709b53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:39:38, skipping insertion in model container [2025-01-09 03:39:38,183 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:39:38" (3/3) ... [2025-01-09 03:39:38,184 INFO L128 eAbstractionObserver]: Analyzing ICFG tree_del_iter_incorrect.c [2025-01-09 03:39:38,193 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 03:39:38,194 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG tree_del_iter_incorrect.c that has 7 procedures, 79 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-01-09 03:39:38,224 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 03:39:38,231 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;@23d5d5fc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 03:39:38,231 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 03:39:38,234 INFO L276 IsEmpty]: Start isEmpty. Operand has 79 states, 51 states have (on average 1.2156862745098038) internal successors, (62), 52 states have internal predecessors, (62), 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) [2025-01-09 03:39:38,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-01-09 03:39:38,239 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:39:38,240 INFO L218 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] [2025-01-09 03:39:38,240 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:39:38,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:39:38,243 INFO L85 PathProgramCache]: Analyzing trace with hash 73314766, now seen corresponding path program 1 times [2025-01-09 03:39:38,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:39:38,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347267487] [2025-01-09 03:39:38,248 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:39:38,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:39:38,302 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-01-09 03:39:38,328 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-01-09 03:39:38,328 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:39:38,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:39:38,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:39:38,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:39:38,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347267487] [2025-01-09 03:39:38,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347267487] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:39:38,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:39:38,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 03:39:38,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748428981] [2025-01-09 03:39:38,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:39:38,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:39:38,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:39:38,572 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:39:38,573 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:39:38,574 INFO L87 Difference]: Start difference. First operand has 79 states, 51 states have (on average 1.2156862745098038) internal successors, (62), 52 states have internal predecessors, (62), 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 5.2) internal successors, (26), 4 states have internal predecessors, (26), 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) [2025-01-09 03:39:38,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:39:38,627 INFO L93 Difference]: Finished difference Result 136 states and 181 transitions. [2025-01-09 03:39:38,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:39:38,629 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 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 37 [2025-01-09 03:39:38,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:39:38,634 INFO L225 Difference]: With dead ends: 136 [2025-01-09 03:39:38,635 INFO L226 Difference]: Without dead ends: 77 [2025-01-09 03:39:38,638 INFO L434 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 [2025-01-09 03:39:38,640 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 0 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:39:38,640 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 387 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:39:38,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2025-01-09 03:39:38,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2025-01-09 03:39:38,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 49 states have (on average 1.163265306122449) internal successors, (57), 50 states have internal predecessors, (57), 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) [2025-01-09 03:39:38,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 100 transitions. [2025-01-09 03:39:38,667 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 100 transitions. Word has length 37 [2025-01-09 03:39:38,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:39:38,668 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 100 transitions. [2025-01-09 03:39:38,668 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 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) [2025-01-09 03:39:38,668 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 100 transitions. [2025-01-09 03:39:38,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-01-09 03:39:38,669 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:39:38,670 INFO L218 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] [2025-01-09 03:39:38,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 03:39:38,670 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:39:38,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:39:38,670 INFO L85 PathProgramCache]: Analyzing trace with hash -782323941, now seen corresponding path program 1 times [2025-01-09 03:39:38,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:39:38,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451130888] [2025-01-09 03:39:38,671 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:39:38,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:39:38,690 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-01-09 03:39:38,699 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-01-09 03:39:38,699 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:39:38,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:39:38,893 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-09 03:39:38,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:39:38,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451130888] [2025-01-09 03:39:38,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [451130888] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:39:38,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [971942571] [2025-01-09 03:39:38,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:39:38,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:39:38,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:39:38,898 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:39:38,903 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 03:39:38,979 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-01-09 03:39:39,021 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-01-09 03:39:39,021 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:39:39,021 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:39:39,025 INFO L256 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-01-09 03:39:39,030 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:39:39,124 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-09 03:39:39,124 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 03:39:39,299 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-09 03:39:39,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [971942571] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 03:39:39,300 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 03:39:39,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 8 [2025-01-09 03:39:39,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526051767] [2025-01-09 03:39:39,302 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 03:39:39,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 03:39:39,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:39:39,303 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 03:39:39,303 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-01-09 03:39:39,304 INFO L87 Difference]: Start difference. First operand 77 states and 100 transitions. Second operand has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 4 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2025-01-09 03:39:39,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:39:39,371 INFO L93 Difference]: Finished difference Result 136 states and 178 transitions. [2025-01-09 03:39:39,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 03:39:39,372 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 4 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) Word has length 49 [2025-01-09 03:39:39,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:39:39,373 INFO L225 Difference]: With dead ends: 136 [2025-01-09 03:39:39,373 INFO L226 Difference]: Without dead ends: 79 [2025-01-09 03:39:39,374 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-01-09 03:39:39,374 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 1 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 526 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:39:39,375 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 526 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:39:39,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2025-01-09 03:39:39,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2025-01-09 03:39:39,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 50 states have (on average 1.16) internal successors, (58), 52 states have internal predecessors, (58), 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) [2025-01-09 03:39:39,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 103 transitions. [2025-01-09 03:39:39,389 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 103 transitions. Word has length 49 [2025-01-09 03:39:39,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:39:39,389 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 103 transitions. [2025-01-09 03:39:39,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 4 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2025-01-09 03:39:39,389 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 103 transitions. [2025-01-09 03:39:39,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-01-09 03:39:39,390 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:39:39,390 INFO L218 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] [2025-01-09 03:39:39,398 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 03:39:39,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:39:39,593 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:39:39,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:39:39,593 INFO L85 PathProgramCache]: Analyzing trace with hash 892594128, now seen corresponding path program 1 times [2025-01-09 03:39:39,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:39:39,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166750760] [2025-01-09 03:39:39,594 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:39:39,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:39:39,605 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-01-09 03:39:39,612 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-01-09 03:39:39,612 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:39:39,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:39:39,788 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-01-09 03:39:39,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:39:39,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166750760] [2025-01-09 03:39:39,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166750760] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:39:39,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:39:39,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 03:39:39,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111621922] [2025-01-09 03:39:39,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:39:39,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 03:39:39,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:39:39,790 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 03:39:39,790 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 03:39:39,790 INFO L87 Difference]: Start difference. First operand 79 states and 103 transitions. Second operand has 8 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 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) [2025-01-09 03:39:39,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:39:39,852 INFO L93 Difference]: Finished difference Result 136 states and 178 transitions. [2025-01-09 03:39:39,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 03:39:39,853 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 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 61 [2025-01-09 03:39:39,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:39:39,855 INFO L225 Difference]: With dead ends: 136 [2025-01-09 03:39:39,855 INFO L226 Difference]: Without dead ends: 81 [2025-01-09 03:39:39,855 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 03:39:39,856 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 21 mSDsluCounter, 489 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 579 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:39:39,856 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 579 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:39:39,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2025-01-09 03:39:39,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2025-01-09 03:39:39,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 51 states have (on average 1.1568627450980393) internal successors, (59), 54 states have internal predecessors, (59), 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) [2025-01-09 03:39:39,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 106 transitions. [2025-01-09 03:39:39,869 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 106 transitions. Word has length 61 [2025-01-09 03:39:39,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:39:39,870 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 106 transitions. [2025-01-09 03:39:39,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 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) [2025-01-09 03:39:39,870 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 106 transitions. [2025-01-09 03:39:39,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-01-09 03:39:39,871 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:39:39,871 INFO L218 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] [2025-01-09 03:39:39,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 03:39:39,871 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:39:39,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:39:39,873 INFO L85 PathProgramCache]: Analyzing trace with hash -590469958, now seen corresponding path program 1 times [2025-01-09 03:39:39,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:39:39,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42897064] [2025-01-09 03:39:39,873 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:39:39,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:39:39,892 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-01-09 03:39:39,907 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-01-09 03:39:39,907 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:39:39,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:39:40,142 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-01-09 03:39:40,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:39:40,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42897064] [2025-01-09 03:39:40,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42897064] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:39:40,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1538765439] [2025-01-09 03:39:40,142 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:39:40,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:39:40,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:39:40,144 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:39:40,155 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 03:39:40,218 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-01-09 03:39:40,255 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-01-09 03:39:40,256 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:39:40,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:39:40,257 INFO L256 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-01-09 03:39:40,260 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:39:40,345 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-01-09 03:39:40,345 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 03:39:40,513 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-01-09 03:39:40,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1538765439] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 03:39:40,514 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 03:39:40,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 16 [2025-01-09 03:39:40,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079389784] [2025-01-09 03:39:40,514 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 03:39:40,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-09 03:39:40,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:39:40,515 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-09 03:39:40,515 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2025-01-09 03:39:40,515 INFO L87 Difference]: Start difference. First operand 81 states and 106 transitions. Second operand has 16 states, 16 states have (on average 3.3125) internal successors, (53), 15 states have internal predecessors, (53), 8 states have call successors, (17), 2 states have call predecessors, (17), 5 states have return successors, (17), 9 states have call predecessors, (17), 7 states have call successors, (17) [2025-01-09 03:39:40,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:39:40,797 INFO L93 Difference]: Finished difference Result 132 states and 174 transitions. [2025-01-09 03:39:40,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 03:39:40,797 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.3125) internal successors, (53), 15 states have internal predecessors, (53), 8 states have call successors, (17), 2 states have call predecessors, (17), 5 states have return successors, (17), 9 states have call predecessors, (17), 7 states have call successors, (17) Word has length 74 [2025-01-09 03:39:40,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:39:40,799 INFO L225 Difference]: With dead ends: 132 [2025-01-09 03:39:40,799 INFO L226 Difference]: Without dead ends: 85 [2025-01-09 03:39:40,799 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2025-01-09 03:39:40,800 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 40 mSDsluCounter, 850 mSDsCounter, 0 mSdLazyCounter, 383 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 928 SdHoareTripleChecker+Invalid, 409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 383 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 03:39:40,800 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 928 Invalid, 409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 383 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 03:39:40,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2025-01-09 03:39:40,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2025-01-09 03:39:40,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 54 states have (on average 1.1481481481481481) internal successors, (62), 57 states have internal predecessors, (62), 20 states have call successors, (20), 7 states have call predecessors, (20), 10 states have return successors, (29), 20 states have call predecessors, (29), 20 states have call successors, (29) [2025-01-09 03:39:40,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 111 transitions. [2025-01-09 03:39:40,809 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 111 transitions. Word has length 74 [2025-01-09 03:39:40,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:39:40,809 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 111 transitions. [2025-01-09 03:39:40,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.3125) internal successors, (53), 15 states have internal predecessors, (53), 8 states have call successors, (17), 2 states have call predecessors, (17), 5 states have return successors, (17), 9 states have call predecessors, (17), 7 states have call successors, (17) [2025-01-09 03:39:40,810 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 111 transitions. [2025-01-09 03:39:40,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-01-09 03:39:40,811 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:39:40,812 INFO L218 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] [2025-01-09 03:39:40,822 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 03:39:41,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:39:41,016 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:39:41,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:39:41,016 INFO L85 PathProgramCache]: Analyzing trace with hash 924515453, now seen corresponding path program 1 times [2025-01-09 03:39:41,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:39:41,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612684855] [2025-01-09 03:39:41,017 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:39:41,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:39:41,032 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-01-09 03:39:41,062 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-01-09 03:39:41,062 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:39:41,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 03:39:41,062 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 03:39:41,072 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-01-09 03:39:41,107 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-01-09 03:39:41,107 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:39:41,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 03:39:41,141 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 03:39:41,141 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 03:39:41,141 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 03:39:41,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 03:39:41,149 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-01-09 03:39:41,188 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 03:39:41,190 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 03:39:41 BoogieIcfgContainer [2025-01-09 03:39:41,193 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 03:39:41,194 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 03:39:41,194 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 03:39:41,194 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 03:39:41,195 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:39:38" (3/4) ... [2025-01-09 03:39:41,195 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-01-09 03:39:41,228 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 44. [2025-01-09 03:39:41,273 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 03:39:41,274 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 03:39:41,274 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 03:39:41,274 INFO L158 Benchmark]: Toolchain (without parser) took 3784.26ms. Allocated memory was 142.6MB in the beginning and 302.0MB in the end (delta: 159.4MB). Free memory was 106.7MB in the beginning and 184.5MB in the end (delta: -77.8MB). Peak memory consumption was 83.5MB. Max. memory is 16.1GB. [2025-01-09 03:39:41,274 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 117.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 03:39:41,274 INFO L158 Benchmark]: CACSL2BoogieTranslator took 207.25ms. Allocated memory is still 142.6MB. Free memory was 106.7MB in the beginning and 93.8MB in the end (delta: 12.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 03:39:41,275 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.75ms. Allocated memory is still 142.6MB. Free memory was 93.8MB in the beginning and 92.5MB in the end (delta: 1.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 03:39:41,275 INFO L158 Benchmark]: Boogie Preprocessor took 50.49ms. Allocated memory is still 142.6MB. Free memory was 92.5MB in the beginning and 89.0MB in the end (delta: 3.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 03:39:41,275 INFO L158 Benchmark]: RCFGBuilder took 394.93ms. Allocated memory is still 142.6MB. Free memory was 89.0MB in the beginning and 66.8MB in the end (delta: 22.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-01-09 03:39:41,275 INFO L158 Benchmark]: TraceAbstraction took 3014.38ms. Allocated memory was 142.6MB in the beginning and 302.0MB in the end (delta: 159.4MB). Free memory was 66.2MB in the beginning and 192.9MB in the end (delta: -126.7MB). Peak memory consumption was 33.2MB. Max. memory is 16.1GB. [2025-01-09 03:39:41,275 INFO L158 Benchmark]: Witness Printer took 79.68ms. Allocated memory is still 302.0MB. Free memory was 192.9MB in the beginning and 184.5MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 03:39:41,276 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 201.3MB. Free memory is still 117.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 207.25ms. Allocated memory is still 142.6MB. Free memory was 106.7MB in the beginning and 93.8MB in the end (delta: 12.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.75ms. Allocated memory is still 142.6MB. Free memory was 93.8MB in the beginning and 92.5MB in the end (delta: 1.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 50.49ms. Allocated memory is still 142.6MB. Free memory was 92.5MB in the beginning and 89.0MB in the end (delta: 3.5MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 394.93ms. Allocated memory is still 142.6MB. Free memory was 89.0MB in the beginning and 66.8MB in the end (delta: 22.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 3014.38ms. Allocated memory was 142.6MB in the beginning and 302.0MB in the end (delta: 159.4MB). Free memory was 66.2MB in the beginning and 192.9MB in the end (delta: -126.7MB). Peak memory consumption was 33.2MB. Max. memory is 16.1GB. * Witness Printer took 79.68ms. Allocated memory is still 302.0MB. Free memory was 192.9MB in the beginning and 184.5MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. 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: [L105] 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={-1: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={-1:0}] [L31] n->right = nondet_tree() [L32] return n; VAL [\result={-1:0}] [L105] RET, EXPR nondet_tree() [L105] CALL task(nondet_tree()) [L83] CALL, EXPR min(t) VAL [\old(n)={-1:0}] [L37] COND FALSE !(!n) [L40] EXPR n->left VAL [\old(n)={-1:0}, n={-1: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)={-1:0}, n={-1:0}] [L40] int a = min(n->left); [L41] EXPR n->right VAL [\old(n)={-1: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)={-1:0}, a=2147483647] [L41] int b = min(n->right); [L42] COND TRUE a <= b [L42] return a; VAL [\old(n)={-1:0}, \result=2147483647] [L83] RET, EXPR min(t) VAL [t={-1:0}] [L83] int a = min(t); [L84] int b; VAL [a=2147483647, b={5:0}, t={-1:0}] [L86] CALL, EXPR size(t) VAL [\old(t)={-1:0}] [L78] COND FALSE !(!t) [L79] EXPR t->left VAL [\old(t)={-1:0}, t={-1:0}] [L79] CALL, EXPR size(t->left) VAL [\old(t)={0:0}] [L78] COND TRUE !t [L78] return 0; VAL [\old(t)={0:0}, \result=0] [L79] RET, EXPR size(t->left) VAL [\old(t)={-1:0}, t={-1:0}] [L79] EXPR t->right VAL [\old(t)={-1:0}] [L79] CALL, EXPR size(t->right) VAL [\old(t)={0:0}] [L78] COND TRUE !t [L78] return 0; VAL [\old(t)={0:0}, \result=0] [L79] RET, EXPR size(t->right) VAL [\old(t)={-1:0}] [L79] return size(t->left) + size(t->right) + 1; [L86] RET, EXPR size(t) VAL [a=2147483647, b={5:0}, t={-1:0}] [L86] int n = size(t); [L87] CALL assume_abort_if_not(n != 0) [L10] COND FALSE !(!cond) [L87] RET assume_abort_if_not(n != 0) [L88] EXPR, FCALL calloc(n, sizeof(int)) VAL [a=2147483647, b={5:0}, n=1, t={-1:0}] [L88] int *x = calloc(n, sizeof(int)); [L89] CALL tree_inorder(t, x, n) VAL [\old(a)={-3:0}, \old(i)=1, \old(t)={-1:0}] [L67] COND FALSE !(!t) [L70] EXPR t->left VAL [\old(a)={-3:0}, \old(i)=1, \old(t)={-1:0}, a={-3:0}, i=1, t={-1:0}] [L70] CALL, EXPR tree_inorder(t->left, a, i) VAL [\old(a)={-3:0}, \old(i)=1, \old(t)={0:0}] [L67] COND TRUE !t [L68] return i; VAL [\old(a)={-3:0}, \old(i)=1, \old(t)={0:0}, \result=1, a={-3:0}] [L70] RET, EXPR tree_inorder(t->left, a, i) VAL [\old(a)={-3:0}, \old(i)=1, \old(t)={-1:0}, a={-3:0}, i=1, t={-1:0}] [L70] i = tree_inorder(t->left, a, i) [L71] EXPR i++ [L71] EXPR t->data [L71] a[i++] = t->data [L72] EXPR t->right VAL [\old(a)={-3:0}, \old(i)=1, \old(t)={-1:0}, a={-3:0}, i=2] [L72] CALL, EXPR tree_inorder(t->right, a, i) VAL [\old(a)={-3:0}, \old(i)=2, \old(t)={0:0}] [L67] COND TRUE !t [L68] return i; VAL [\old(a)={-3:0}, \old(i)=2, \old(t)={0:0}, \result=2, a={-3:0}] [L72] RET, EXPR tree_inorder(t->right, a, i) VAL [\old(a)={-3:0}, \old(i)=1, \old(t)={-1:0}, a={-3:0}, i=2] [L72] i = tree_inorder(t->right, a, i) [L73] return i; VAL [\old(a)={-3:0}, \old(i)=1, \old(t)={-1:0}, \result=2, a={-3:0}, i=2] [L89] RET tree_inorder(t, x, n) VAL [a=2147483647, b={5:0}, n=1, t={-1:0}, x={-3:0}] [L90] EXPR x[0] [L90] 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 7 procedures, 79 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.9s, OverallIterations: 5, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 77 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 62 mSDsluCounter, 2420 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2061 mSDsCounter, 27 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 525 IncrementalHoareTripleChecker+Invalid, 552 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 27 mSolverCounterUnsat, 359 mSDtfsCounter, 525 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 278 GetRequests, 245 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=85occurred in iteration=4, InterpolantAutomatonStates: 36, 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.2s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 430 NumberOfCodeBlocks, 430 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 459 ConstructedInterpolants, 0 QuantifiedInterpolants, 1110 SizeOfPredicates, 6 NumberOfNonLiveVariables, 631 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, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2025-01-09 03:39:41,302 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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