./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/forester-heap/sll-buckets-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 48c9605d 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/forester-heap/sll-buckets-2.i -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 5a4c2149f6fe1f453f0ff04220f5041f2227f6654d0fa84d48205415ce284fcb --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-07 20:08:29,243 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-07 20:08:29,319 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-07 20:08:29,324 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-07 20:08:29,325 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-07 20:08:29,351 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-07 20:08:29,352 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-07 20:08:29,352 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-07 20:08:29,353 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-07 20:08:29,353 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-07 20:08:29,354 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-07 20:08:29,354 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-07 20:08:29,355 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-07 20:08:29,355 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-07 20:08:29,355 INFO L153 SettingsManager]: * Use SBE=true [2025-02-07 20:08:29,355 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-07 20:08:29,355 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-07 20:08:29,355 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-07 20:08:29,355 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-07 20:08:29,356 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-07 20:08:29,356 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-07 20:08:29,356 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-07 20:08:29,356 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-07 20:08:29,356 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-07 20:08:29,356 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-07 20:08:29,356 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-07 20:08:29,356 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-07 20:08:29,356 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-07 20:08:29,356 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-07 20:08:29,356 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-07 20:08:29,356 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-07 20:08:29,356 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-07 20:08:29,356 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 20:08:29,357 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-07 20:08:29,357 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-07 20:08:29,357 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-07 20:08:29,357 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-07 20:08:29,357 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-07 20:08:29,357 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-07 20:08:29,357 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-07 20:08:29,357 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-07 20:08:29,357 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-07 20:08:29,357 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-07 20:08:29,357 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 -> 5a4c2149f6fe1f453f0ff04220f5041f2227f6654d0fa84d48205415ce284fcb [2025-02-07 20:08:29,632 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-07 20:08:29,641 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-07 20:08:29,644 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-07 20:08:29,645 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-07 20:08:29,645 INFO L274 PluginConnector]: CDTParser initialized [2025-02-07 20:08:29,647 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/sll-buckets-2.i [2025-02-07 20:08:30,963 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3f1c3cee8/5c5a489e4ca24d38b4001c79e4061d75/FLAGbb4d8a5be [2025-02-07 20:08:31,327 INFO L384 CDTParser]: Found 1 translation units. [2025-02-07 20:08:31,328 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-buckets-2.i [2025-02-07 20:08:31,348 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3f1c3cee8/5c5a489e4ca24d38b4001c79e4061d75/FLAGbb4d8a5be [2025-02-07 20:08:31,364 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3f1c3cee8/5c5a489e4ca24d38b4001c79e4061d75 [2025-02-07 20:08:31,367 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-07 20:08:31,368 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-07 20:08:31,371 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-07 20:08:31,371 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-07 20:08:31,375 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-07 20:08:31,376 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 08:08:31" (1/1) ... [2025-02-07 20:08:31,378 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@745dd4a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:08:31, skipping insertion in model container [2025-02-07 20:08:31,378 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 08:08:31" (1/1) ... [2025-02-07 20:08:31,422 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-07 20:08:31,649 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/forester-heap/sll-buckets-2.i[22663,22676] [2025-02-07 20:08:31,652 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/forester-heap/sll-buckets-2.i[22734,22747] [2025-02-07 20:08:31,653 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/forester-heap/sll-buckets-2.i[22862,22875] [2025-02-07 20:08:31,656 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/forester-heap/sll-buckets-2.i[23275,23288] [2025-02-07 20:08:31,656 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/forester-heap/sll-buckets-2.i[23364,23377] [2025-02-07 20:08:31,659 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 20:08:31,665 INFO L200 MainTranslator]: Completed pre-run [2025-02-07 20:08:31,705 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/forester-heap/sll-buckets-2.i[22663,22676] [2025-02-07 20:08:31,705 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/forester-heap/sll-buckets-2.i[22734,22747] [2025-02-07 20:08:31,707 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/forester-heap/sll-buckets-2.i[22862,22875] [2025-02-07 20:08:31,709 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/forester-heap/sll-buckets-2.i[23275,23288] [2025-02-07 20:08:31,709 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/forester-heap/sll-buckets-2.i[23364,23377] [2025-02-07 20:08:31,710 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 20:08:31,734 INFO L204 MainTranslator]: Completed translation [2025-02-07 20:08:31,735 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:08:31 WrapperNode [2025-02-07 20:08:31,735 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-07 20:08:31,736 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-07 20:08:31,736 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-07 20:08:31,736 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-07 20:08:31,741 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:08:31" (1/1) ... [2025-02-07 20:08:31,749 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:08:31" (1/1) ... [2025-02-07 20:08:31,769 INFO L138 Inliner]: procedures = 119, calls = 42, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 141 [2025-02-07 20:08:31,770 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-07 20:08:31,772 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-07 20:08:31,773 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-07 20:08:31,773 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-07 20:08:31,780 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:08:31" (1/1) ... [2025-02-07 20:08:31,780 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:08:31" (1/1) ... [2025-02-07 20:08:31,783 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:08:31" (1/1) ... [2025-02-07 20:08:31,795 INFO L175 MemorySlicer]: Split 32 memory accesses to 2 slices as follows [2, 30]. 94 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 16 writes are split as follows [0, 16]. [2025-02-07 20:08:31,796 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:08:31" (1/1) ... [2025-02-07 20:08:31,796 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:08:31" (1/1) ... [2025-02-07 20:08:31,802 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:08:31" (1/1) ... [2025-02-07 20:08:31,805 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:08:31" (1/1) ... [2025-02-07 20:08:31,806 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:08:31" (1/1) ... [2025-02-07 20:08:31,807 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:08:31" (1/1) ... [2025-02-07 20:08:31,808 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-07 20:08:31,809 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-07 20:08:31,809 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-07 20:08:31,809 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-07 20:08:31,811 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:08:31" (1/1) ... [2025-02-07 20:08:31,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 20:08:31,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:08:31,838 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-02-07 20:08:31,840 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-02-07 20:08:31,858 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-07 20:08:31,859 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-07 20:08:31,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-07 20:08:31,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-07 20:08:31,859 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-07 20:08:31,859 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-07 20:08:31,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-07 20:08:31,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-07 20:08:31,859 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-07 20:08:31,859 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-07 20:08:31,859 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-07 20:08:31,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-07 20:08:31,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-07 20:08:31,859 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-07 20:08:31,859 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-07 20:08:31,975 INFO L257 CfgBuilder]: Building ICFG [2025-02-07 20:08:31,977 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-07 20:08:32,291 INFO L? ?]: Removed 27 outVars from TransFormulas that were not future-live. [2025-02-07 20:08:32,292 INFO L308 CfgBuilder]: Performing block encoding [2025-02-07 20:08:32,300 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-07 20:08:32,301 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-07 20:08:32,301 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 08:08:32 BoogieIcfgContainer [2025-02-07 20:08:32,301 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-07 20:08:32,303 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-07 20:08:32,304 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-07 20:08:32,307 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-07 20:08:32,307 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 08:08:31" (1/3) ... [2025-02-07 20:08:32,309 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a72ab0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 08:08:32, skipping insertion in model container [2025-02-07 20:08:32,309 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:08:31" (2/3) ... [2025-02-07 20:08:32,309 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a72ab0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 08:08:32, skipping insertion in model container [2025-02-07 20:08:32,309 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 08:08:32" (3/3) ... [2025-02-07 20:08:32,310 INFO L128 eAbstractionObserver]: Analyzing ICFG sll-buckets-2.i [2025-02-07 20:08:32,322 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-07 20:08:32,323 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG sll-buckets-2.i that has 1 procedures, 45 locations, 1 initial locations, 10 loop locations, and 5 error locations. [2025-02-07 20:08:32,372 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-07 20:08:32,385 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;@57f4270e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-07 20:08:32,385 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-02-07 20:08:32,389 INFO L276 IsEmpty]: Start isEmpty. Operand has 45 states, 39 states have (on average 1.794871794871795) internal successors, (70), 44 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:08:32,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-02-07 20:08:32,393 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:08:32,394 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:08:32,395 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-02-07 20:08:32,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:08:32,400 INFO L85 PathProgramCache]: Analyzing trace with hash -119040555, now seen corresponding path program 1 times [2025-02-07 20:08:32,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:08:32,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395732464] [2025-02-07 20:08:32,408 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:08:32,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:08:32,515 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-07 20:08:32,564 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-07 20:08:32,564 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:08:32,564 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:08:32,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:08:32,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:08:32,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395732464] [2025-02-07 20:08:32,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395732464] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:08:32,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:08:32,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-07 20:08:32,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268787014] [2025-02-07 20:08:32,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:08:32,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 20:08:32,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:08:32,790 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 20:08:32,790 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 20:08:32,794 INFO L87 Difference]: Start difference. First operand has 45 states, 39 states have (on average 1.794871794871795) internal successors, (70), 44 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:08:32,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:08:32,883 INFO L93 Difference]: Finished difference Result 108 states and 172 transitions. [2025-02-07 20:08:32,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 20:08:32,886 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-02-07 20:08:32,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:08:32,892 INFO L225 Difference]: With dead ends: 108 [2025-02-07 20:08:32,893 INFO L226 Difference]: Without dead ends: 62 [2025-02-07 20:08:32,896 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-07 20:08:32,899 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 64 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 20:08:32,900 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 80 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 20:08:32,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2025-02-07 20:08:32,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 45. [2025-02-07 20:08:32,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 41 states have (on average 1.2926829268292683) internal successors, (53), 44 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:08:32,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 53 transitions. [2025-02-07 20:08:32,930 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 53 transitions. Word has length 8 [2025-02-07 20:08:32,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:08:32,931 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 53 transitions. [2025-02-07 20:08:32,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:08:32,931 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 53 transitions. [2025-02-07 20:08:32,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-02-07 20:08:32,931 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:08:32,931 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:08:32,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-07 20:08:32,932 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-02-07 20:08:32,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:08:32,932 INFO L85 PathProgramCache]: Analyzing trace with hash -1525298717, now seen corresponding path program 1 times [2025-02-07 20:08:32,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:08:32,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422389601] [2025-02-07 20:08:32,933 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:08:32,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:08:32,968 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-07 20:08:33,017 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-07 20:08:33,021 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:08:33,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:08:33,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:08:33,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:08:33,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422389601] [2025-02-07 20:08:33,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422389601] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:08:33,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:08:33,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 20:08:33,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981126852] [2025-02-07 20:08:33,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:08:33,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 20:08:33,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:08:33,652 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 20:08:33,652 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 20:08:33,652 INFO L87 Difference]: Start difference. First operand 45 states and 53 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:08:33,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:08:33,785 INFO L93 Difference]: Finished difference Result 65 states and 79 transitions. [2025-02-07 20:08:33,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 20:08:33,785 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-02-07 20:08:33,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:08:33,786 INFO L225 Difference]: With dead ends: 65 [2025-02-07 20:08:33,786 INFO L226 Difference]: Without dead ends: 51 [2025-02-07 20:08:33,786 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-07 20:08:33,787 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 19 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 20:08:33,787 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 104 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 20:08:33,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2025-02-07 20:08:33,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 48. [2025-02-07 20:08:33,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 45 states have (on average 1.2666666666666666) internal successors, (57), 47 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:08:33,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 57 transitions. [2025-02-07 20:08:33,796 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 57 transitions. Word has length 9 [2025-02-07 20:08:33,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:08:33,797 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 57 transitions. [2025-02-07 20:08:33,798 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:08:33,798 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 57 transitions. [2025-02-07 20:08:33,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-02-07 20:08:33,798 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:08:33,798 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:08:33,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-07 20:08:33,799 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-02-07 20:08:33,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:08:33,799 INFO L85 PathProgramCache]: Analyzing trace with hash 1306728994, now seen corresponding path program 1 times [2025-02-07 20:08:33,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:08:33,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290586612] [2025-02-07 20:08:33,800 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:08:33,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:08:33,828 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-07 20:08:33,834 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-07 20:08:33,834 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:08:33,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:08:33,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:08:33,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:08:33,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290586612] [2025-02-07 20:08:33,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290586612] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:08:33,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:08:33,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-07 20:08:33,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748409009] [2025-02-07 20:08:33,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:08:33,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-07 20:08:33,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:08:33,866 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-07 20:08:33,866 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 20:08:33,866 INFO L87 Difference]: Start difference. First operand 48 states and 57 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:08:33,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:08:33,888 INFO L93 Difference]: Finished difference Result 48 states and 57 transitions. [2025-02-07 20:08:33,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-07 20:08:33,888 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-02-07 20:08:33,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:08:33,889 INFO L225 Difference]: With dead ends: 48 [2025-02-07 20:08:33,889 INFO L226 Difference]: Without dead ends: 46 [2025-02-07 20:08:33,889 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 20:08:33,890 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 18 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 20:08:33,890 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 50 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 20:08:33,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2025-02-07 20:08:33,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2025-02-07 20:08:33,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 44 states have (on average 1.25) internal successors, (55), 45 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:08:33,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 55 transitions. [2025-02-07 20:08:33,896 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 55 transitions. Word has length 11 [2025-02-07 20:08:33,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:08:33,896 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 55 transitions. [2025-02-07 20:08:33,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:08:33,896 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 55 transitions. [2025-02-07 20:08:33,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-02-07 20:08:33,896 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:08:33,896 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:08:33,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-07 20:08:33,897 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-02-07 20:08:33,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:08:33,897 INFO L85 PathProgramCache]: Analyzing trace with hash -1445276185, now seen corresponding path program 1 times [2025-02-07 20:08:33,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:08:33,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797691754] [2025-02-07 20:08:33,897 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:08:33,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:08:33,920 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-07 20:08:33,947 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-07 20:08:33,947 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:08:33,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:08:34,821 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:08:34,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:08:34,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797691754] [2025-02-07 20:08:34,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1797691754] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 20:08:34,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1140511085] [2025-02-07 20:08:34,822 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:08:34,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:08:34,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:08:34,827 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-02-07 20:08:34,829 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-02-07 20:08:34,921 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-07 20:08:34,962 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-07 20:08:34,962 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:08:34,962 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:08:34,969 INFO L256 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-02-07 20:08:34,978 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 20:08:35,060 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 32 [2025-02-07 20:08:35,075 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 36 [2025-02-07 20:08:35,117 INFO L349 Elim1Store]: treesize reduction 54, result has 23.9 percent of original size [2025-02-07 20:08:35,117 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 70 treesize of output 64 [2025-02-07 20:08:35,126 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-02-07 20:08:35,138 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 20:08:35,140 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 20:08:35,141 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 20:08:35,142 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2025-02-07 20:08:35,161 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2025-02-07 20:08:35,162 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 27 [2025-02-07 20:08:35,182 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 23 [2025-02-07 20:08:35,400 INFO L349 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2025-02-07 20:08:35,400 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 57 treesize of output 39 [2025-02-07 20:08:35,410 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 49 [2025-02-07 20:08:35,671 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:08:35,671 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 20:08:35,890 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:08:35,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1140511085] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 20:08:35,890 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 20:08:35,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 6] total 15 [2025-02-07 20:08:35,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767870262] [2025-02-07 20:08:35,890 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 20:08:35,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-02-07 20:08:35,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:08:35,892 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-07 20:08:35,892 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2025-02-07 20:08:35,892 INFO L87 Difference]: Start difference. First operand 46 states and 55 transitions. Second operand has 16 states, 16 states have (on average 2.375) internal successors, (38), 15 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:08:36,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:08:36,500 INFO L93 Difference]: Finished difference Result 84 states and 97 transitions. [2025-02-07 20:08:36,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-07 20:08:36,500 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.375) internal successors, (38), 15 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-02-07 20:08:36,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:08:36,501 INFO L225 Difference]: With dead ends: 84 [2025-02-07 20:08:36,501 INFO L226 Difference]: Without dead ends: 72 [2025-02-07 20:08:36,502 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=89, Invalid=331, Unknown=0, NotChecked=0, Total=420 [2025-02-07 20:08:36,502 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 65 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-07 20:08:36,502 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 242 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 253 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-07 20:08:36,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2025-02-07 20:08:36,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 52. [2025-02-07 20:08:36,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 50 states have (on average 1.22) internal successors, (61), 51 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:08:36,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 61 transitions. [2025-02-07 20:08:36,510 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 61 transitions. Word has length 15 [2025-02-07 20:08:36,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:08:36,510 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 61 transitions. [2025-02-07 20:08:36,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.375) internal successors, (38), 15 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:08:36,510 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 61 transitions. [2025-02-07 20:08:36,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-02-07 20:08:36,511 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:08:36,511 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:08:36,520 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-07 20:08:36,711 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:08:36,712 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-02-07 20:08:36,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:08:36,712 INFO L85 PathProgramCache]: Analyzing trace with hash -439248054, now seen corresponding path program 1 times [2025-02-07 20:08:36,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:08:36,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050042012] [2025-02-07 20:08:36,712 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:08:36,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:08:36,736 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-07 20:08:36,747 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-07 20:08:36,748 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:08:36,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:08:36,973 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:08:36,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:08:36,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050042012] [2025-02-07 20:08:36,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050042012] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 20:08:36,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1068467279] [2025-02-07 20:08:36,973 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:08:36,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:08:36,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:08:36,976 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-02-07 20:08:36,978 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-02-07 20:08:37,070 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-07 20:08:37,102 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-07 20:08:37,102 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:08:37,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:08:37,104 INFO L256 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-02-07 20:08:37,107 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 20:08:37,131 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 28 [2025-02-07 20:08:37,139 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 20:08:37,156 INFO L349 Elim1Store]: treesize reduction 41, result has 10.9 percent of original size [2025-02-07 20:08:37,157 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 33 [2025-02-07 20:08:37,174 INFO L349 Elim1Store]: treesize reduction 44, result has 10.2 percent of original size [2025-02-07 20:08:37,175 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 55 treesize of output 36 [2025-02-07 20:08:37,224 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 20:08:37,225 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2025-02-07 20:08:37,239 INFO L349 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2025-02-07 20:08:37,239 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2025-02-07 20:08:37,274 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 24 [2025-02-07 20:08:37,366 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2025-02-07 20:08:37,373 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:08:37,373 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 20:08:37,409 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_474 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_474) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) 0))) is different from false [2025-02-07 20:08:37,419 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~item~0#1.base_30| Int) (v_ArrVal_474 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_30|) 0)) (not (= (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~item~0#1.base_30| v_ArrVal_474) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) 0)))) is different from false [2025-02-07 20:08:37,426 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:08:37,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1068467279] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 20:08:37,426 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 20:08:37,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 12 [2025-02-07 20:08:37,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932088182] [2025-02-07 20:08:37,427 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 20:08:37,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-07 20:08:37,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:08:37,427 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-07 20:08:37,428 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=83, Unknown=2, NotChecked=38, Total=156 [2025-02-07 20:08:37,428 INFO L87 Difference]: Start difference. First operand 52 states and 61 transitions. Second operand has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 12 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:08:37,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:08:37,843 INFO L93 Difference]: Finished difference Result 116 states and 137 transitions. [2025-02-07 20:08:37,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-07 20:08:37,844 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 12 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-02-07 20:08:37,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:08:37,845 INFO L225 Difference]: With dead ends: 116 [2025-02-07 20:08:37,845 INFO L226 Difference]: Without dead ends: 114 [2025-02-07 20:08:37,846 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=164, Unknown=2, NotChecked=58, Total=306 [2025-02-07 20:08:37,846 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 124 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 184 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-07 20:08:37,847 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 337 Invalid, 415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 218 Invalid, 0 Unknown, 184 Unchecked, 0.3s Time] [2025-02-07 20:08:37,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2025-02-07 20:08:37,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 70. [2025-02-07 20:08:37,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 68 states have (on average 1.2352941176470589) internal successors, (84), 69 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:08:37,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 84 transitions. [2025-02-07 20:08:37,863 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 84 transitions. Word has length 18 [2025-02-07 20:08:37,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:08:37,863 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 84 transitions. [2025-02-07 20:08:37,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 12 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:08:37,863 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 84 transitions. [2025-02-07 20:08:37,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-02-07 20:08:37,864 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:08:37,864 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:08:37,872 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-02-07 20:08:38,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:08:38,065 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-02-07 20:08:38,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:08:38,065 INFO L85 PathProgramCache]: Analyzing trace with hash -1176231797, now seen corresponding path program 2 times [2025-02-07 20:08:38,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:08:38,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238647492] [2025-02-07 20:08:38,066 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 20:08:38,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:08:38,087 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-02-07 20:08:38,109 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-02-07 20:08:38,109 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-07 20:08:38,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:08:38,537 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:08:38,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:08:38,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238647492] [2025-02-07 20:08:38,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238647492] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 20:08:38,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [190498827] [2025-02-07 20:08:38,538 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 20:08:38,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:08:38,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:08:38,541 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 20:08:38,544 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-07 20:08:38,630 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-02-07 20:08:38,895 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-02-07 20:08:38,895 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-07 20:08:38,896 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:08:38,898 INFO L256 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-02-07 20:08:38,902 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 20:08:38,951 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 20:08:38,953 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 20:08:38,954 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 20:08:38,957 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2025-02-07 20:08:38,963 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 22 [2025-02-07 20:08:38,966 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 7 [2025-02-07 20:08:38,990 WARN L214 Elim1Store]: Array PQE input equivalent to false [2025-02-07 20:08:39,071 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-02-07 20:08:39,073 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2025-02-07 20:08:39,106 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2025-02-07 20:08:39,107 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 25 [2025-02-07 20:08:39,135 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2025-02-07 20:08:39,274 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-07 20:08:39,274 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-07 20:08:39,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [190498827] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:08:39,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-07 20:08:39,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 12 [2025-02-07 20:08:39,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837400554] [2025-02-07 20:08:39,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:08:39,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-07 20:08:39,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:08:39,275 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-07 20:08:39,275 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2025-02-07 20:08:39,275 INFO L87 Difference]: Start difference. First operand 70 states and 84 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:08:39,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:08:39,576 INFO L93 Difference]: Finished difference Result 162 states and 196 transitions. [2025-02-07 20:08:39,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-07 20:08:39,576 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-02-07 20:08:39,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:08:39,577 INFO L225 Difference]: With dead ends: 162 [2025-02-07 20:08:39,577 INFO L226 Difference]: Without dead ends: 122 [2025-02-07 20:08:39,578 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2025-02-07 20:08:39,578 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 100 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 20:08:39,578 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 153 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 20:08:39,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2025-02-07 20:08:39,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 87. [2025-02-07 20:08:39,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 85 states have (on average 1.223529411764706) internal successors, (104), 86 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:08:39,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 104 transitions. [2025-02-07 20:08:39,595 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 104 transitions. Word has length 20 [2025-02-07 20:08:39,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:08:39,595 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 104 transitions. [2025-02-07 20:08:39,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:08:39,595 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 104 transitions. [2025-02-07 20:08:39,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-02-07 20:08:39,596 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:08:39,596 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:08:39,605 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-07 20:08:39,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:08:39,800 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-02-07 20:08:39,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:08:39,801 INFO L85 PathProgramCache]: Analyzing trace with hash -448803093, now seen corresponding path program 2 times [2025-02-07 20:08:39,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:08:39,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010420483] [2025-02-07 20:08:39,801 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 20:08:39,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:08:39,822 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-02-07 20:08:39,836 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-02-07 20:08:39,836 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-07 20:08:39,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:08:40,539 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:08:40,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:08:40,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010420483] [2025-02-07 20:08:40,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010420483] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 20:08:40,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1782144414] [2025-02-07 20:08:40,540 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 20:08:40,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:08:40,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:08:40,544 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 20:08:40,545 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-07 20:08:40,648 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-02-07 20:08:40,885 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-02-07 20:08:40,885 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-07 20:08:40,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:08:40,888 INFO L256 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 57 conjuncts are in the unsatisfiable core [2025-02-07 20:08:40,893 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 20:08:40,910 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 36 [2025-02-07 20:08:40,921 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 36 [2025-02-07 20:08:40,950 INFO L349 Elim1Store]: treesize reduction 62, result has 21.5 percent of original size [2025-02-07 20:08:40,950 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 85 treesize of output 84 [2025-02-07 20:08:40,960 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-02-07 20:08:40,970 INFO L349 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2025-02-07 20:08:40,970 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 43 [2025-02-07 20:08:40,985 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 20:08:40,986 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 45 [2025-02-07 20:08:40,990 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2025-02-07 20:08:40,999 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 23 [2025-02-07 20:08:41,009 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 31 [2025-02-07 20:08:41,211 INFO L349 Elim1Store]: treesize reduction 88, result has 14.6 percent of original size [2025-02-07 20:08:41,211 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 16 case distinctions, treesize of input 129 treesize of output 83 [2025-02-07 20:08:41,225 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 20:08:41,226 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 64 [2025-02-07 20:08:41,520 INFO L349 Elim1Store]: treesize reduction 80, result has 8.0 percent of original size [2025-02-07 20:08:41,521 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 12 case distinctions, treesize of input 129 treesize of output 76 [2025-02-07 20:08:41,535 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 20:08:41,536 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 55 [2025-02-07 20:08:41,810 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:08:41,811 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 20:08:46,333 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:08:46,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1782144414] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 20:08:46,334 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 20:08:46,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 21 [2025-02-07 20:08:46,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185298437] [2025-02-07 20:08:46,334 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 20:08:46,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-02-07 20:08:46,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:08:46,335 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-02-07 20:08:46,336 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=377, Unknown=1, NotChecked=0, Total=462 [2025-02-07 20:08:46,336 INFO L87 Difference]: Start difference. First operand 87 states and 104 transitions. Second operand has 22 states, 22 states have (on average 2.5454545454545454) internal successors, (56), 21 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:08:47,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:08:47,346 INFO L93 Difference]: Finished difference Result 110 states and 129 transitions. [2025-02-07 20:08:47,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-07 20:08:47,346 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.5454545454545454) internal successors, (56), 21 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-02-07 20:08:47,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:08:47,348 INFO L225 Difference]: With dead ends: 110 [2025-02-07 20:08:47,348 INFO L226 Difference]: Without dead ends: 98 [2025-02-07 20:08:47,349 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=141, Invalid=560, Unknown=1, NotChecked=0, Total=702 [2025-02-07 20:08:47,349 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 51 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-07 20:08:47,349 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 290 Invalid, 305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 294 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-07 20:08:47,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-02-07 20:08:47,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 93. [2025-02-07 20:08:47,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 91 states have (on average 1.2087912087912087) internal successors, (110), 92 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:08:47,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 110 transitions. [2025-02-07 20:08:47,366 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 110 transitions. Word has length 21 [2025-02-07 20:08:47,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:08:47,367 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 110 transitions. [2025-02-07 20:08:47,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.5454545454545454) internal successors, (56), 21 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:08:47,367 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 110 transitions. [2025-02-07 20:08:47,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-02-07 20:08:47,368 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:08:47,368 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:08:47,377 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-07 20:08:47,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2025-02-07 20:08:47,569 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-02-07 20:08:47,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:08:47,569 INFO L85 PathProgramCache]: Analyzing trace with hash 2038178809, now seen corresponding path program 1 times [2025-02-07 20:08:47,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:08:47,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709184423] [2025-02-07 20:08:47,569 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:08:47,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:08:47,590 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-07 20:08:47,603 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-07 20:08:47,603 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:08:47,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:08:47,950 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:08:47,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:08:47,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709184423] [2025-02-07 20:08:47,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709184423] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 20:08:47,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2084033171] [2025-02-07 20:08:47,950 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:08:47,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:08:47,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:08:47,953 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 20:08:47,955 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-07 20:08:48,064 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-07 20:08:48,096 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-07 20:08:48,096 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:08:48,096 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:08:48,098 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 50 conjuncts are in the unsatisfiable core [2025-02-07 20:08:48,101 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 20:08:48,117 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 32 [2025-02-07 20:08:48,125 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 20:08:48,144 INFO L349 Elim1Store]: treesize reduction 39, result has 11.4 percent of original size [2025-02-07 20:08:48,144 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 38 [2025-02-07 20:08:48,162 INFO L349 Elim1Store]: treesize reduction 36, result has 32.1 percent of original size [2025-02-07 20:08:48,163 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 86 treesize of output 74 [2025-02-07 20:08:48,175 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 52 [2025-02-07 20:08:48,179 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 16 [2025-02-07 20:08:48,189 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-02-07 20:08:48,274 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 20:08:48,283 INFO L349 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2025-02-07 20:08:48,283 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 89 treesize of output 60 [2025-02-07 20:08:48,301 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 20:08:48,322 INFO L349 Elim1Store]: treesize reduction 12, result has 67.6 percent of original size [2025-02-07 20:08:48,322 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 37 [2025-02-07 20:08:48,338 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2025-02-07 20:08:48,422 INFO L349 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2025-02-07 20:08:48,423 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 87 treesize of output 58 [2025-02-07 20:08:48,435 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2025-02-07 20:08:48,597 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-02-07 20:08:48,659 INFO L349 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2025-02-07 20:08:48,659 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 29 [2025-02-07 20:08:48,664 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:08:48,664 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 20:08:48,716 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_933 (Array Int Int)) (v_ArrVal_932 (Array Int Int))) (not (= (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_932))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|))) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_933) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|)) 0))) is different from false [2025-02-07 20:08:48,725 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~item~0#1.base_41| Int) (v_ArrVal_933 (Array Int Int)) (v_ArrVal_932 (Array Int Int))) (or (not (= (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~item~0#1.base_41| v_ArrVal_932))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|))) (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~item~0#1.base_41| v_ArrVal_933) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|)) 0)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_41|) 0)))) is different from false [2025-02-07 20:08:48,731 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:08:48,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2084033171] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 20:08:48,731 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 20:08:48,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 17 [2025-02-07 20:08:48,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674321571] [2025-02-07 20:08:48,731 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 20:08:48,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-02-07 20:08:48,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:08:48,732 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-02-07 20:08:48,732 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=195, Unknown=2, NotChecked=58, Total=306 [2025-02-07 20:08:48,732 INFO L87 Difference]: Start difference. First operand 93 states and 110 transitions. Second operand has 18 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 17 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:08:49,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:08:49,727 INFO L93 Difference]: Finished difference Result 242 states and 293 transitions. [2025-02-07 20:08:49,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-02-07 20:08:49,727 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 17 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-02-07 20:08:49,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:08:49,729 INFO L225 Difference]: With dead ends: 242 [2025-02-07 20:08:49,729 INFO L226 Difference]: Without dead ends: 240 [2025-02-07 20:08:49,729 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=201, Invalid=617, Unknown=2, NotChecked=110, Total=930 [2025-02-07 20:08:49,730 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 435 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 435 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 638 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 305 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-07 20:08:49,730 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [435 Valid, 322 Invalid, 638 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 292 Invalid, 0 Unknown, 305 Unchecked, 0.5s Time] [2025-02-07 20:08:49,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2025-02-07 20:08:49,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 163. [2025-02-07 20:08:49,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 161 states have (on average 1.236024844720497) internal successors, (199), 162 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:08:49,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 199 transitions. [2025-02-07 20:08:49,756 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 199 transitions. Word has length 21 [2025-02-07 20:08:49,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:08:49,756 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 199 transitions. [2025-02-07 20:08:49,757 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 17 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:08:49,757 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 199 transitions. [2025-02-07 20:08:49,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-02-07 20:08:49,757 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:08:49,758 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:08:49,765 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-02-07 20:08:49,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:08:49,961 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-02-07 20:08:49,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:08:49,961 INFO L85 PathProgramCache]: Analyzing trace with hash 219101562, now seen corresponding path program 2 times [2025-02-07 20:08:49,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:08:49,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702220675] [2025-02-07 20:08:49,961 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 20:08:49,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:08:49,980 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-02-07 20:08:49,993 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-02-07 20:08:49,994 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-07 20:08:49,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:08:50,444 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-07 20:08:50,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:08:50,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702220675] [2025-02-07 20:08:50,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702220675] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 20:08:50,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [51741211] [2025-02-07 20:08:50,444 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 20:08:50,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:08:50,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:08:50,446 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 20:08:50,447 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-07 20:08:50,549 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-02-07 20:08:50,693 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-02-07 20:08:50,693 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-07 20:08:50,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:08:50,695 INFO L256 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 58 conjuncts are in the unsatisfiable core [2025-02-07 20:08:50,699 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 20:08:50,720 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 28 [2025-02-07 20:08:50,736 INFO L349 Elim1Store]: treesize reduction 62, result has 7.5 percent of original size [2025-02-07 20:08:50,736 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 166 treesize of output 131 [2025-02-07 20:08:50,740 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 20:08:50,755 INFO L349 Elim1Store]: treesize reduction 39, result has 11.4 percent of original size [2025-02-07 20:08:50,755 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 38 [2025-02-07 20:08:50,765 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 34 [2025-02-07 20:08:50,768 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 36 [2025-02-07 20:08:50,771 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 16 [2025-02-07 20:08:50,782 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 11 [2025-02-07 20:08:50,843 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 20:08:50,844 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2025-02-07 20:08:50,847 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 20:08:50,847 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 34 [2025-02-07 20:08:50,863 INFO L349 Elim1Store]: treesize reduction 12, result has 58.6 percent of original size [2025-02-07 20:08:50,863 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 29 [2025-02-07 20:08:50,873 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2025-02-07 20:08:50,914 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2025-02-07 20:08:50,924 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2025-02-07 20:08:50,927 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 27 [2025-02-07 20:08:51,113 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 [2025-02-07 20:08:51,119 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-02-07 20:08:51,156 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-07 20:08:51,156 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 20:08:51,235 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1090 (Array Int Int)) (v_ArrVal_1089 (Array Int Int)) (|ULTIMATE.start_main_~item~0#1.offset| Int)) (= (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_main_~item~0#1.base| (store (select |c_#memory_int#1| |c_ULTIMATE.start_main_~item~0#1.base|) (+ 4 |ULTIMATE.start_main_~item~0#1.offset|) 1)) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_1089) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_1090) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) 8)) 1)) is different from false [2025-02-07 20:08:51,268 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:08:51,268 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 35 [2025-02-07 20:08:51,324 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-07 20:08:51,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [51741211] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 20:08:51,325 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 20:08:51,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 19 [2025-02-07 20:08:51,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798894733] [2025-02-07 20:08:51,325 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 20:08:51,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-02-07 20:08:51,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:08:51,326 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-02-07 20:08:51,326 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=291, Unknown=1, NotChecked=34, Total=380 [2025-02-07 20:08:51,326 INFO L87 Difference]: Start difference. First operand 163 states and 199 transitions. Second operand has 20 states, 20 states have (on average 2.7) internal successors, (54), 19 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:08:52,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:08:52,223 INFO L93 Difference]: Finished difference Result 339 states and 415 transitions. [2025-02-07 20:08:52,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-07 20:08:52,223 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.7) internal successors, (54), 19 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2025-02-07 20:08:52,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:08:52,225 INFO L225 Difference]: With dead ends: 339 [2025-02-07 20:08:52,225 INFO L226 Difference]: Without dead ends: 299 [2025-02-07 20:08:52,226 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=184, Invalid=631, Unknown=1, NotChecked=54, Total=870 [2025-02-07 20:08:52,226 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 242 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 445 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 601 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 445 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 136 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-07 20:08:52,227 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [242 Valid, 400 Invalid, 601 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 445 Invalid, 0 Unknown, 136 Unchecked, 0.5s Time] [2025-02-07 20:08:52,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2025-02-07 20:08:52,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 214. [2025-02-07 20:08:52,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 212 states have (on average 1.2311320754716981) internal successors, (261), 213 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:08:52,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 261 transitions. [2025-02-07 20:08:52,270 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 261 transitions. Word has length 23 [2025-02-07 20:08:52,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:08:52,270 INFO L471 AbstractCegarLoop]: Abstraction has 214 states and 261 transitions. [2025-02-07 20:08:52,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.7) internal successors, (54), 19 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:08:52,270 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 261 transitions. [2025-02-07 20:08:52,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-02-07 20:08:52,271 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:08:52,271 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:08:52,283 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-07 20:08:52,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2025-02-07 20:08:52,472 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-02-07 20:08:52,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:08:52,473 INFO L85 PathProgramCache]: Analyzing trace with hash -625370309, now seen corresponding path program 1 times [2025-02-07 20:08:52,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:08:52,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346610114] [2025-02-07 20:08:52,473 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:08:52,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:08:52,491 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-07 20:08:52,500 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-07 20:08:52,500 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:08:52,500 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:08:53,028 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:08:53,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:08:53,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346610114] [2025-02-07 20:08:53,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346610114] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 20:08:53,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1474098714] [2025-02-07 20:08:53,028 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:08:53,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:08:53,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:08:53,031 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 20:08:53,032 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-07 20:08:53,158 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-07 20:08:53,195 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-07 20:08:53,195 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:08:53,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:08:53,199 INFO L256 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 93 conjuncts are in the unsatisfiable core [2025-02-07 20:08:53,205 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 20:08:53,236 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 36 [2025-02-07 20:08:53,250 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 36 [2025-02-07 20:08:53,289 INFO L349 Elim1Store]: treesize reduction 62, result has 21.5 percent of original size [2025-02-07 20:08:53,290 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 161 treesize of output 148 [2025-02-07 20:08:53,298 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 20:08:53,313 INFO L349 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2025-02-07 20:08:53,313 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 57 [2025-02-07 20:08:53,324 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 31 [2025-02-07 20:08:53,338 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 23 [2025-02-07 20:08:53,349 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 31 [2025-02-07 20:08:53,363 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-02-07 20:08:53,396 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-07 20:08:53,397 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 20:08:53,402 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 51 [2025-02-07 20:08:53,414 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 15 [2025-02-07 20:08:53,419 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 20:08:53,420 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 20:08:53,424 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 51 [2025-02-07 20:08:53,439 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 15 [2025-02-07 20:08:53,454 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 7 [2025-02-07 20:08:53,465 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 20:08:53,467 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 20:08:53,471 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 20:08:53,481 INFO L349 Elim1Store]: treesize reduction 31, result has 13.9 percent of original size [2025-02-07 20:08:53,481 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 46 [2025-02-07 20:08:53,649 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 20:08:53,650 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 20:08:53,650 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 20:08:53,651 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 20:08:53,652 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 20:08:53,652 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 53 [2025-02-07 20:08:53,659 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 20:08:53,679 INFO L349 Elim1Store]: treesize reduction 56, result has 16.4 percent of original size [2025-02-07 20:08:53,679 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 162 treesize of output 113 [2025-02-07 20:08:53,685 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 20:08:53,698 INFO L349 Elim1Store]: treesize reduction 28, result has 47.2 percent of original size [2025-02-07 20:08:53,699 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 33 treesize of output 37 [2025-02-07 20:08:53,719 INFO L349 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2025-02-07 20:08:53,720 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2025-02-07 20:08:53,842 INFO L349 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2025-02-07 20:08:53,842 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 38 [2025-02-07 20:08:53,868 INFO L349 Elim1Store]: treesize reduction 56, result has 16.4 percent of original size [2025-02-07 20:08:53,868 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 160 treesize of output 111 [2025-02-07 20:08:53,884 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 20:08:53,885 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 20:08:53,886 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 53 [2025-02-07 20:08:54,644 INFO L349 Elim1Store]: treesize reduction 45, result has 8.2 percent of original size [2025-02-07 20:08:54,645 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 2 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 14 case distinctions, treesize of input 175 treesize of output 81 [2025-02-07 20:08:54,654 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 20:08:54,655 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 16 [2025-02-07 20:08:54,758 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:08:54,759 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 20:08:55,133 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:08:55,133 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 107 treesize of output 100 [2025-02-07 20:08:55,219 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:08:55,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1474098714] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 20:08:55,219 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 20:08:55,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 12] total 27 [2025-02-07 20:08:55,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878450099] [2025-02-07 20:08:55,220 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 20:08:55,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-02-07 20:08:55,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:08:55,220 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-02-07 20:08:55,221 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=658, Unknown=0, NotChecked=0, Total=756 [2025-02-07 20:08:55,221 INFO L87 Difference]: Start difference. First operand 214 states and 261 transitions. Second operand has 28 states, 28 states have (on average 2.25) internal successors, (63), 27 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:08:58,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:08:58,344 INFO L93 Difference]: Finished difference Result 399 states and 486 transitions. [2025-02-07 20:08:58,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-02-07 20:08:58,345 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 2.25) internal successors, (63), 27 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2025-02-07 20:08:58,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:08:58,346 INFO L225 Difference]: With dead ends: 399 [2025-02-07 20:08:58,346 INFO L226 Difference]: Without dead ends: 359 [2025-02-07 20:08:58,347 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 519 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=546, Invalid=2210, Unknown=0, NotChecked=0, Total=2756 [2025-02-07 20:08:58,349 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 409 mSDsluCounter, 462 mSDsCounter, 0 mSdLazyCounter, 733 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 409 SdHoareTripleChecker+Valid, 504 SdHoareTripleChecker+Invalid, 768 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 733 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-07 20:08:58,350 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [409 Valid, 504 Invalid, 768 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 733 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-07 20:08:58,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2025-02-07 20:08:58,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 259. [2025-02-07 20:08:58,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 257 states have (on average 1.2334630350194553) internal successors, (317), 258 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:08:58,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 317 transitions. [2025-02-07 20:08:58,394 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 317 transitions. Word has length 23 [2025-02-07 20:08:58,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:08:58,394 INFO L471 AbstractCegarLoop]: Abstraction has 259 states and 317 transitions. [2025-02-07 20:08:58,395 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 2.25) internal successors, (63), 27 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:08:58,395 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 317 transitions. [2025-02-07 20:08:58,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-02-07 20:08:58,396 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:08:58,396 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-07 20:08:58,407 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-02-07 20:08:58,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:08:58,597 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-02-07 20:08:58,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:08:58,597 INFO L85 PathProgramCache]: Analyzing trace with hash -804621865, now seen corresponding path program 1 times [2025-02-07 20:08:58,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:08:58,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254307146] [2025-02-07 20:08:58,597 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:08:58,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:08:58,611 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-07 20:08:58,620 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-07 20:08:58,621 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:08:58,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-07 20:08:58,621 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-07 20:08:58,623 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-07 20:08:58,634 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-07 20:08:58,635 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:08:58,635 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-07 20:08:58,655 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-07 20:08:58,656 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-07 20:08:58,656 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2025-02-07 20:08:58,659 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2025-02-07 20:08:58,661 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (2 of 5 remaining) [2025-02-07 20:08:58,662 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2025-02-07 20:08:58,662 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2025-02-07 20:08:58,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-07 20:08:58,665 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1, 1] [2025-02-07 20:08:58,697 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-07 20:08:58,700 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.02 08:08:58 BoogieIcfgContainer [2025-02-07 20:08:58,700 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-07 20:08:58,701 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-07 20:08:58,701 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-07 20:08:58,702 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-07 20:08:58,702 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 08:08:32" (3/4) ... [2025-02-07 20:08:58,703 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-02-07 20:08:58,741 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 22. [2025-02-07 20:08:58,813 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-07 20:08:58,815 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-07 20:08:58,815 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-07 20:08:58,815 INFO L158 Benchmark]: Toolchain (without parser) took 27447.13ms. Allocated memory was 142.6MB in the beginning and 343.9MB in the end (delta: 201.3MB). Free memory was 112.1MB in the beginning and 215.2MB in the end (delta: -103.1MB). Peak memory consumption was 98.0MB. Max. memory is 16.1GB. [2025-02-07 20:08:58,816 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 201.3MB. Free memory is still 124.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 20:08:58,816 INFO L158 Benchmark]: CACSL2BoogieTranslator took 364.27ms. Allocated memory is still 142.6MB. Free memory was 111.6MB in the beginning and 93.9MB in the end (delta: 17.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-07 20:08:58,816 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.14ms. Allocated memory is still 142.6MB. Free memory was 93.9MB in the beginning and 92.1MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 20:08:58,816 INFO L158 Benchmark]: Boogie Preprocessor took 36.14ms. Allocated memory is still 142.6MB. Free memory was 92.1MB in the beginning and 90.0MB in the end (delta: 2.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-07 20:08:58,817 INFO L158 Benchmark]: IcfgBuilder took 492.14ms. Allocated memory is still 142.6MB. Free memory was 90.0MB in the beginning and 71.4MB in the end (delta: 18.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-07 20:08:58,817 INFO L158 Benchmark]: TraceAbstraction took 26397.11ms. Allocated memory was 142.6MB in the beginning and 343.9MB in the end (delta: 201.3MB). Free memory was 71.0MB in the beginning and 219.8MB in the end (delta: -148.8MB). Peak memory consumption was 47.6MB. Max. memory is 16.1GB. [2025-02-07 20:08:58,818 INFO L158 Benchmark]: Witness Printer took 113.47ms. Allocated memory is still 343.9MB. Free memory was 219.8MB in the beginning and 215.2MB in the end (delta: 4.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-07 20:08:58,819 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.23ms. Allocated memory is still 201.3MB. Free memory is still 124.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 364.27ms. Allocated memory is still 142.6MB. Free memory was 111.6MB in the beginning and 93.9MB in the end (delta: 17.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.14ms. Allocated memory is still 142.6MB. Free memory was 93.9MB in the beginning and 92.1MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 36.14ms. Allocated memory is still 142.6MB. Free memory was 92.1MB in the beginning and 90.0MB in the end (delta: 2.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 492.14ms. Allocated memory is still 142.6MB. Free memory was 90.0MB in the beginning and 71.4MB in the end (delta: 18.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 26397.11ms. Allocated memory was 142.6MB in the beginning and 343.9MB in the end (delta: 201.3MB). Free memory was 71.0MB in the beginning and 219.8MB in the end (delta: -148.8MB). Peak memory consumption was 47.6MB. Max. memory is 16.1GB. * Witness Printer took 113.47ms. Allocated memory is still 343.9MB. Free memory was 219.8MB in the beginning and 215.2MB in the end (delta: 4.6MB). 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: 1061]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L1004] BCK* bucket = malloc(sizeof(BCK)); [L1005] bucket->data = 0 [L1006] bucket->list = ((void*)0) [L1008] bucket->next = malloc(sizeof(BCK)) [L1009] EXPR bucket->next [L1009] BCK* bcki = bucket->next; [L1010] bcki->data = 1 [L1011] bcki->list = ((void*)0) [L1013] bcki->next = malloc(sizeof(BCK)) [L1014] EXPR bcki->next [L1014] bcki = bcki->next [L1015] bcki->data = 2 [L1016] bcki->list = ((void*)0) [L1017] bcki->next = ((void*)0) [L1019] struct TSLL* item = ((void*)0); [L1020] struct TSLL* itr = ((void*)0); VAL [bucket={-3:0}] [L1021] COND TRUE __VERIFIER_nondet_int() [L1021] COND TRUE __VERIFIER_nondet_int() [L1023] item = malloc(sizeof(SLL)) [L1024] item->next = ((void*)0) [L1025] COND TRUE __VERIFIER_nondet_int() [L1026] item->data = 0 [L1032] bcki = bucket VAL [bcki={-3:0}, bucket={-3:0}, item={-4:0}] [L1034] COND TRUE 0 VAL [bcki={-3:0}, bucket={-3:0}, item={-4:0}] [L1034] COND FALSE !(!(bcki != ((void*)0))) VAL [bcki={-3:0}, bucket={-3:0}, item={-4:0}] [L1034] COND FALSE !(0) VAL [bcki={-3:0}, bucket={-3:0}, item={-4:0}] [L1035] COND TRUE 0 VAL [bcki={-3:0}, bucket={-3:0}, item={-4:0}] [L1035] COND FALSE !(!(item != ((void*)0))) VAL [bcki={-3:0}, bucket={-3:0}, item={-4:0}] [L1035] COND FALSE !(0) VAL [bcki={-3:0}, bucket={-3:0}, item={-4:0}] [L1036] COND TRUE bcki->data != item->data [L1036] EXPR bcki->data [L1036] EXPR item->data [L1036] COND FALSE !(bcki->data != item->data) [L1038] COND TRUE 0 VAL [bcki={-3:0}, bucket={-3:0}, item={-4:0}] [L1038] COND FALSE !(!(bcki != ((void*)0))) VAL [bcki={-3:0}, bucket={-3:0}, item={-4:0}] [L1038] COND FALSE !(0) VAL [bcki={-3:0}, bucket={-3:0}, item={-4:0}] [L1040] EXPR bcki->list [L1040] COND TRUE bcki->list == ((void*)0) [L1041] bcki->list = item [L1021] COND TRUE __VERIFIER_nondet_int() [L1021] COND FALSE !(__VERIFIER_nondet_int()) [L1052] bcki = bucket VAL [bcki={-3:0}] [L1053] COND TRUE bcki != ((void*)0) [L1055] EXPR bcki->list [L1055] item = bcki->list [L1056] bcki->list = ((void*)0) [L1057] COND TRUE item != ((void*)0) [L1059] itr = item [L1060] EXPR item->next [L1060] item = item->next [L1061] COND TRUE 0 [L1061] EXPR itr->data [L1061] EXPR bcki->data [L1061] COND TRUE !(itr->data != bcki->data) [L1061] reach_error() VAL [bcki={-3:0}, item={0:0}, itr={-4:0}] - UnprovableResult [Line: 1064]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1038]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1035]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1034]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 45 locations, 5 error locations. Started 1 CEGAR loops. OverallTime: 26.3s, OverallIterations: 11, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 7.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1527 SdHoareTripleChecker+Valid, 3.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1527 mSDsluCounter, 2482 SdHoareTripleChecker+Invalid, 3.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 625 IncrementalHoareTripleChecker+Unchecked, 2126 mSDsCounter, 151 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2428 IncrementalHoareTripleChecker+Invalid, 3204 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 151 mSolverCounterUnsat, 356 mSDtfsCounter, 2428 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 385 GetRequests, 192 SyntacticMatches, 2 SemanticMatches, 191 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 1022 ImplicationChecksByTransitivity, 10.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=259occurred in iteration=10, InterpolantAutomatonStates: 122, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 10 MinimizatonAttempts, 386 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 14.8s InterpolantComputationTime, 336 NumberOfCodeBlocks, 336 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 408 ConstructedInterpolants, 47 QuantifiedInterpolants, 15372 SizeOfPredicates, 39 NumberOfNonLiveVariables, 1659 ConjunctsInSsa, 363 ConjunctsInUnsatCore, 23 InterpolantComputations, 4 PerfectInterpolantSequences, 53/144 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-02-07 20:08:58,852 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