./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-pthread/cs_sync.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc 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/seq-pthread/cs_sync.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 459cf049271151c452003a0973bcdcc76c918d5759d842702be03de8528f67ef --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 16:53:08,643 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 16:53:08,698 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 16:53:08,702 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 16:53:08,703 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 16:53:08,722 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 16:53:08,723 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 16:53:08,723 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 16:53:08,723 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 16:53:08,723 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 16:53:08,723 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 16:53:08,723 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 16:53:08,724 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 16:53:08,724 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 16:53:08,724 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 16:53:08,724 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 16:53:08,724 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 16:53:08,724 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 16:53:08,724 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 16:53:08,724 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 16:53:08,724 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 16:53:08,724 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 16:53:08,725 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 16:53:08,725 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 16:53:08,725 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 16:53:08,725 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 16:53:08,725 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 16:53:08,725 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 16:53:08,725 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 16:53:08,725 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 16:53:08,725 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 16:53:08,725 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 16:53:08,725 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 16:53:08,726 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 16:53:08,726 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 16:53:08,726 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 16:53:08,726 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 16:53:08,726 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 16:53:08,726 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 16:53:08,726 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 16:53:08,726 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 16:53:08,726 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 16:53:08,726 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 16:53:08,727 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 -> 459cf049271151c452003a0973bcdcc76c918d5759d842702be03de8528f67ef [2025-02-05 16:53:08,975 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 16:53:08,988 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 16:53:08,991 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 16:53:08,993 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 16:53:08,993 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 16:53:08,995 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-pthread/cs_sync.i [2025-02-05 16:53:10,167 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2a8e2d64a/7eef492a389b4b2f89660916c79c23fd/FLAGa3e773f69 [2025-02-05 16:53:10,549 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 16:53:10,555 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-pthread/cs_sync.i [2025-02-05 16:53:10,574 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2a8e2d64a/7eef492a389b4b2f89660916c79c23fd/FLAGa3e773f69 [2025-02-05 16:53:10,772 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2a8e2d64a/7eef492a389b4b2f89660916c79c23fd [2025-02-05 16:53:10,775 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 16:53:10,776 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 16:53:10,779 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 16:53:10,780 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 16:53:10,783 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 16:53:10,784 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 04:53:10" (1/1) ... [2025-02-05 16:53:10,785 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79c199b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:53:10, skipping insertion in model container [2025-02-05 16:53:10,785 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 04:53:10" (1/1) ... [2025-02-05 16:53:10,817 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 16:53:11,122 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/seq-pthread/cs_sync.i[34698,34711] [2025-02-05 16:53:11,191 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 16:53:11,201 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 16:53:11,239 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/seq-pthread/cs_sync.i[34698,34711] [2025-02-05 16:53:11,287 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 16:53:11,323 INFO L204 MainTranslator]: Completed translation [2025-02-05 16:53:11,324 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:53:11 WrapperNode [2025-02-05 16:53:11,324 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 16:53:11,325 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 16:53:11,325 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 16:53:11,325 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 16:53:11,329 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:53:11" (1/1) ... [2025-02-05 16:53:11,346 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:53:11" (1/1) ... [2025-02-05 16:53:11,378 INFO L138 Inliner]: procedures = 245, calls = 253, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 551 [2025-02-05 16:53:11,379 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 16:53:11,379 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 16:53:11,379 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 16:53:11,379 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 16:53:11,386 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:53:11" (1/1) ... [2025-02-05 16:53:11,387 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:53:11" (1/1) ... [2025-02-05 16:53:11,395 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:53:11" (1/1) ... [2025-02-05 16:53:11,438 INFO L175 MemorySlicer]: Split 126 memory accesses to 17 slices as follows [2, 8, 8, 3, 3, 7, 8, 20, 12, 16, 12, 0, 8, 6, 3, 7, 3]. 16 percent of accesses are in the largest equivalence class. The 33 initializations are split as follows [2, 3, 3, 0, 0, 0, 3, 6, 2, 6, 2, 0, 4, 2, 0, 0, 0]. The 38 writes are split as follows [0, 2, 2, 1, 1, 1, 2, 8, 5, 5, 4, 0, 2, 2, 1, 1, 1]. [2025-02-05 16:53:11,438 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:53:11" (1/1) ... [2025-02-05 16:53:11,438 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:53:11" (1/1) ... [2025-02-05 16:53:11,457 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:53:11" (1/1) ... [2025-02-05 16:53:11,459 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:53:11" (1/1) ... [2025-02-05 16:53:11,464 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:53:11" (1/1) ... [2025-02-05 16:53:11,467 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:53:11" (1/1) ... [2025-02-05 16:53:11,474 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 16:53:11,475 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 16:53:11,475 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 16:53:11,475 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 16:53:11,476 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:53:11" (1/1) ... [2025-02-05 16:53:11,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 16:53:11,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:53:11,508 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-05 16:53:11,511 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-05 16:53:11,531 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-05 16:53:11,531 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-05 16:53:11,531 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-05 16:53:11,532 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_cond_signal [2025-02-05 16:53:11,532 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_cond_signal [2025-02-05 16:53:11,532 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_mutex_lock [2025-02-05 16:53:11,532 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_mutex_lock [2025-02-05 16:53:11,532 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-05 16:53:11,532 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-05 16:53:11,532 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-05 16:53:11,532 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-02-05 16:53:11,533 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-02-05 16:53:11,533 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-02-05 16:53:11,533 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-02-05 16:53:11,533 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-02-05 16:53:11,533 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-02-05 16:53:11,533 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-02-05 16:53:11,533 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2025-02-05 16:53:11,533 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2025-02-05 16:53:11,533 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2025-02-05 16:53:11,533 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2025-02-05 16:53:11,534 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#14 [2025-02-05 16:53:11,534 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#15 [2025-02-05 16:53:11,534 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#16 [2025-02-05 16:53:11,534 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-05 16:53:11,534 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-02-05 16:53:11,534 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-02-05 16:53:11,534 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-02-05 16:53:11,534 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-02-05 16:53:11,534 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-02-05 16:53:11,534 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2025-02-05 16:53:11,534 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2025-02-05 16:53:11,534 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2025-02-05 16:53:11,534 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2025-02-05 16:53:11,535 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2025-02-05 16:53:11,535 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2025-02-05 16:53:11,535 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#11 [2025-02-05 16:53:11,535 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#12 [2025-02-05 16:53:11,535 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#13 [2025-02-05 16:53:11,535 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#14 [2025-02-05 16:53:11,535 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#15 [2025-02-05 16:53:11,535 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#16 [2025-02-05 16:53:11,535 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_mutex_unlock [2025-02-05 16:53:11,535 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_mutex_unlock [2025-02-05 16:53:11,535 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-05 16:53:11,535 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-05 16:53:11,535 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-05 16:53:11,535 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-02-05 16:53:11,535 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-02-05 16:53:11,535 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-02-05 16:53:11,535 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-02-05 16:53:11,535 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-02-05 16:53:11,535 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-02-05 16:53:11,535 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-02-05 16:53:11,535 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-02-05 16:53:11,535 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-02-05 16:53:11,535 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-02-05 16:53:11,535 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-02-05 16:53:11,535 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2025-02-05 16:53:11,535 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2025-02-05 16:53:11,535 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#16 [2025-02-05 16:53:11,535 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_cond_init [2025-02-05 16:53:11,535 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_cond_init [2025-02-05 16:53:11,535 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-05 16:53:11,535 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-05 16:53:11,535 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-05 16:53:11,535 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-02-05 16:53:11,535 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-02-05 16:53:11,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-02-05 16:53:11,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-02-05 16:53:11,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-02-05 16:53:11,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-02-05 16:53:11,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-02-05 16:53:11,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-02-05 16:53:11,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-02-05 16:53:11,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-02-05 16:53:11,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-02-05 16:53:11,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2025-02-05 16:53:11,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2025-02-05 16:53:11,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#16 [2025-02-05 16:53:11,536 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 16:53:11,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-05 16:53:11,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-05 16:53:11,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-05 16:53:11,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-02-05 16:53:11,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-02-05 16:53:11,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-02-05 16:53:11,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-02-05 16:53:11,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-02-05 16:53:11,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-02-05 16:53:11,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-02-05 16:53:11,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2025-02-05 16:53:11,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2025-02-05 16:53:11,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2025-02-05 16:53:11,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2025-02-05 16:53:11,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#14 [2025-02-05 16:53:11,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#15 [2025-02-05 16:53:11,539 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#16 [2025-02-05 16:53:11,539 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_create [2025-02-05 16:53:11,539 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_create [2025-02-05 16:53:11,539 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_cond_wait [2025-02-05 16:53:11,540 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_cond_wait [2025-02-05 16:53:11,540 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_join [2025-02-05 16:53:11,540 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_join [2025-02-05 16:53:11,540 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~$Pointer$ [2025-02-05 16:53:11,540 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~$Pointer$ [2025-02-05 16:53:11,540 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_cs [2025-02-05 16:53:11,540 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_cs [2025-02-05 16:53:11,540 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 16:53:11,541 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-05 16:53:11,541 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-05 16:53:11,541 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-05 16:53:11,541 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-02-05 16:53:11,541 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-02-05 16:53:11,541 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-02-05 16:53:11,541 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-02-05 16:53:11,541 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-02-05 16:53:11,541 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-02-05 16:53:11,541 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-02-05 16:53:11,541 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-02-05 16:53:11,541 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-02-05 16:53:11,541 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-02-05 16:53:11,541 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-02-05 16:53:11,541 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-02-05 16:53:11,541 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-02-05 16:53:11,541 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 16:53:11,541 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 16:53:11,748 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 16:53:11,751 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 16:53:12,257 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L987-1: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);main_thread_#res#1.base, main_thread_#res#1.offset := 0, 0;call ULTIMATE.dealloc(main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset);havoc main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset;call ULTIMATE.dealloc(main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset);havoc main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset; [2025-02-05 16:53:12,258 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L987-1: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2025-02-05 16:53:12,259 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L987-2: SUMMARY for call __CS_cs(); srcloc: null [2025-02-05 16:53:12,259 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L989-1: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);main_thread_#res#1.base, main_thread_#res#1.offset := 0, 0;call ULTIMATE.dealloc(main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset);havoc main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset;call ULTIMATE.dealloc(main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset);havoc main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset; [2025-02-05 16:53:12,260 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L989-1: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2025-02-05 16:53:12,260 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L989-2: SUMMARY for call __CS_cs(); srcloc: null [2025-02-05 16:53:12,260 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L991-1: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);main_thread_#res#1.base, main_thread_#res#1.offset := 0, 0;call ULTIMATE.dealloc(main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset);havoc main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset;call ULTIMATE.dealloc(main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset);havoc main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset; [2025-02-05 16:53:12,260 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L991-1: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2025-02-05 16:53:12,260 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L991-2: SUMMARY for call __CS_cs(); srcloc: null [2025-02-05 16:53:12,558 INFO L? ?]: Removed 90 outVars from TransFormulas that were not future-live. [2025-02-05 16:53:12,558 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 16:53:12,572 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 16:53:12,575 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 16:53:12,575 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 04:53:12 BoogieIcfgContainer [2025-02-05 16:53:12,576 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 16:53:12,577 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 16:53:12,577 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 16:53:12,581 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 16:53:12,581 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 04:53:10" (1/3) ... [2025-02-05 16:53:12,582 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7286f776 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 04:53:12, skipping insertion in model container [2025-02-05 16:53:12,582 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:53:11" (2/3) ... [2025-02-05 16:53:12,582 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7286f776 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 04:53:12, skipping insertion in model container [2025-02-05 16:53:12,582 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 04:53:12" (3/3) ... [2025-02-05 16:53:12,583 INFO L128 eAbstractionObserver]: Analyzing ICFG cs_sync.i [2025-02-05 16:53:12,594 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 16:53:12,597 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG cs_sync.i that has 11 procedures, 186 locations, 1 initial locations, 5 loop locations, and 1 error locations. [2025-02-05 16:53:12,644 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 16:53:12,652 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;@3ff412a9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 16:53:12,653 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 16:53:12,657 INFO L276 IsEmpty]: Start isEmpty. Operand has 186 states, 119 states have (on average 1.453781512605042) internal successors, (173), 120 states have internal predecessors, (173), 55 states have call successors, (55), 10 states have call predecessors, (55), 10 states have return successors, (55), 55 states have call predecessors, (55), 55 states have call successors, (55) [2025-02-05 16:53:12,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-02-05 16:53:12,666 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:53:12,667 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 16:53:12,667 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:53:12,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:53:12,674 INFO L85 PathProgramCache]: Analyzing trace with hash -2136996797, now seen corresponding path program 1 times [2025-02-05 16:53:12,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:53:12,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617125034] [2025-02-05 16:53:12,680 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:53:12,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:53:12,819 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-02-05 16:53:12,911 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-02-05 16:53:12,912 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:53:12,912 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:53:13,191 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-02-05 16:53:13,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:53:13,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617125034] [2025-02-05 16:53:13,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617125034] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:53:13,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:53:13,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:53:13,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206540427] [2025-02-05 16:53:13,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:53:13,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:53:13,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:53:13,217 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:53:13,217 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:53:13,220 INFO L87 Difference]: Start difference. First operand has 186 states, 119 states have (on average 1.453781512605042) internal successors, (173), 120 states have internal predecessors, (173), 55 states have call successors, (55), 10 states have call predecessors, (55), 10 states have return successors, (55), 55 states have call predecessors, (55), 55 states have call successors, (55) Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-02-05 16:53:14,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:53:14,114 INFO L93 Difference]: Finished difference Result 370 states and 607 transitions. [2025-02-05 16:53:14,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:53:14,116 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 71 [2025-02-05 16:53:14,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:53:14,124 INFO L225 Difference]: With dead ends: 370 [2025-02-05 16:53:14,124 INFO L226 Difference]: Without dead ends: 184 [2025-02-05 16:53:14,128 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-05 16:53:14,130 INFO L435 NwaCegarLoop]: 276 mSDtfsCounter, 2 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 549 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-05 16:53:14,131 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 549 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-05 16:53:14,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2025-02-05 16:53:14,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 183. [2025-02-05 16:53:14,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 117 states have (on average 1.4188034188034189) internal successors, (166), 117 states have internal predecessors, (166), 55 states have call successors, (55), 10 states have call predecessors, (55), 10 states have return successors, (55), 55 states have call predecessors, (55), 55 states have call successors, (55) [2025-02-05 16:53:14,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 276 transitions. [2025-02-05 16:53:14,169 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 276 transitions. Word has length 71 [2025-02-05 16:53:14,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:53:14,170 INFO L471 AbstractCegarLoop]: Abstraction has 183 states and 276 transitions. [2025-02-05 16:53:14,170 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-02-05 16:53:14,171 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 276 transitions. [2025-02-05 16:53:14,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-02-05 16:53:14,178 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:53:14,178 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 16:53:14,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 16:53:14,179 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:53:14,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:53:14,179 INFO L85 PathProgramCache]: Analyzing trace with hash 1843400155, now seen corresponding path program 1 times [2025-02-05 16:53:14,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:53:14,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475571743] [2025-02-05 16:53:14,179 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:53:14,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:53:14,251 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-02-05 16:53:14,284 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-02-05 16:53:14,286 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:53:14,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:53:14,434 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-02-05 16:53:14,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:53:14,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475571743] [2025-02-05 16:53:14,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1475571743] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:53:14,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:53:14,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:53:14,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507045961] [2025-02-05 16:53:14,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:53:14,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:53:14,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:53:14,437 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:53:14,437 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:53:14,437 INFO L87 Difference]: Start difference. First operand 183 states and 276 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-02-05 16:53:14,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:53:14,483 INFO L93 Difference]: Finished difference Result 364 states and 551 transitions. [2025-02-05 16:53:14,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:53:14,486 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 73 [2025-02-05 16:53:14,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:53:14,489 INFO L225 Difference]: With dead ends: 364 [2025-02-05 16:53:14,489 INFO L226 Difference]: Without dead ends: 184 [2025-02-05 16:53:14,491 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-05 16:53:14,494 INFO L435 NwaCegarLoop]: 274 mSDtfsCounter, 0 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 545 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:53:14,494 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 545 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:53:14,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2025-02-05 16:53:14,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 184. [2025-02-05 16:53:14,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 118 states have (on average 1.4152542372881356) internal successors, (167), 118 states have internal predecessors, (167), 55 states have call successors, (55), 10 states have call predecessors, (55), 10 states have return successors, (55), 55 states have call predecessors, (55), 55 states have call successors, (55) [2025-02-05 16:53:14,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 277 transitions. [2025-02-05 16:53:14,522 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 277 transitions. Word has length 73 [2025-02-05 16:53:14,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:53:14,523 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 277 transitions. [2025-02-05 16:53:14,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-02-05 16:53:14,523 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 277 transitions. [2025-02-05 16:53:14,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-02-05 16:53:14,526 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:53:14,527 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 16:53:14,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 16:53:14,527 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:53:14,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:53:14,529 INFO L85 PathProgramCache]: Analyzing trace with hash 1015932817, now seen corresponding path program 1 times [2025-02-05 16:53:14,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:53:14,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879657267] [2025-02-05 16:53:14,530 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:53:14,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:53:14,600 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-02-05 16:53:14,624 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-02-05 16:53:14,625 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:53:14,625 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:53:14,816 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-02-05 16:53:14,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:53:14,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879657267] [2025-02-05 16:53:14,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879657267] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:53:14,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [331599031] [2025-02-05 16:53:14,816 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:53:14,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:53:14,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:53:14,820 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-05 16:53:14,822 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-05 16:53:15,062 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-02-05 16:53:15,165 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-02-05 16:53:15,166 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:53:15,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:53:15,170 INFO L256 TraceCheckSpWp]: Trace formula consists of 668 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 16:53:15,175 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:53:15,201 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-02-05 16:53:15,203 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 16:53:15,292 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-02-05 16:53:15,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [331599031] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 16:53:15,292 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 16:53:15,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2025-02-05 16:53:15,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197478170] [2025-02-05 16:53:15,292 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 16:53:15,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 16:53:15,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:53:15,293 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 16:53:15,293 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:53:15,293 INFO L87 Difference]: Start difference. First operand 184 states and 277 transitions. Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 1 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-02-05 16:53:15,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:53:15,330 INFO L93 Difference]: Finished difference Result 367 states and 555 transitions. [2025-02-05 16:53:15,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:53:15,332 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 1 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 74 [2025-02-05 16:53:15,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:53:15,334 INFO L225 Difference]: With dead ends: 367 [2025-02-05 16:53:15,334 INFO L226 Difference]: Without dead ends: 186 [2025-02-05 16:53:15,336 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 145 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:53:15,336 INFO L435 NwaCegarLoop]: 274 mSDtfsCounter, 0 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 545 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:53:15,336 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 545 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:53:15,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2025-02-05 16:53:15,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2025-02-05 16:53:15,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 120 states have (on average 1.4083333333333334) internal successors, (169), 120 states have internal predecessors, (169), 55 states have call successors, (55), 10 states have call predecessors, (55), 10 states have return successors, (55), 55 states have call predecessors, (55), 55 states have call successors, (55) [2025-02-05 16:53:15,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 279 transitions. [2025-02-05 16:53:15,350 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 279 transitions. Word has length 74 [2025-02-05 16:53:15,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:53:15,350 INFO L471 AbstractCegarLoop]: Abstraction has 186 states and 279 transitions. [2025-02-05 16:53:15,350 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 1 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-02-05 16:53:15,350 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 279 transitions. [2025-02-05 16:53:15,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-02-05 16:53:15,351 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:53:15,351 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 16:53:15,359 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-05 16:53:15,552 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:53:15,552 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:53:15,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:53:15,553 INFO L85 PathProgramCache]: Analyzing trace with hash 507087057, now seen corresponding path program 2 times [2025-02-05 16:53:15,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:53:15,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769163518] [2025-02-05 16:53:15,553 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 16:53:15,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:53:15,619 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 76 statements into 2 equivalence classes. [2025-02-05 16:53:15,648 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 17 of 76 statements. [2025-02-05 16:53:15,648 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-05 16:53:15,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:53:15,808 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2025-02-05 16:53:15,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:53:15,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769163518] [2025-02-05 16:53:15,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1769163518] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:53:15,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:53:15,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:53:15,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187380872] [2025-02-05 16:53:15,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:53:15,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 16:53:15,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:53:15,811 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 16:53:15,811 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 16:53:15,811 INFO L87 Difference]: Start difference. First operand 186 states and 279 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-02-05 16:53:15,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:53:15,872 INFO L93 Difference]: Finished difference Result 362 states and 553 transitions. [2025-02-05 16:53:15,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 16:53:15,872 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 76 [2025-02-05 16:53:15,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:53:15,878 INFO L225 Difference]: With dead ends: 362 [2025-02-05 16:53:15,878 INFO L226 Difference]: Without dead ends: 336 [2025-02-05 16:53:15,879 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-05 16:53:15,879 INFO L435 NwaCegarLoop]: 339 mSDtfsCounter, 237 mSDsluCounter, 599 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 938 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:53:15,879 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 938 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:53:15,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2025-02-05 16:53:15,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 335. [2025-02-05 16:53:15,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 215 states have (on average 1.4325581395348836) internal successors, (308), 215 states have internal predecessors, (308), 99 states have call successors, (99), 20 states have call predecessors, (99), 20 states have return successors, (107), 99 states have call predecessors, (107), 99 states have call successors, (107) [2025-02-05 16:53:15,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 514 transitions. [2025-02-05 16:53:15,915 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 514 transitions. Word has length 76 [2025-02-05 16:53:15,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:53:15,916 INFO L471 AbstractCegarLoop]: Abstraction has 335 states and 514 transitions. [2025-02-05 16:53:15,916 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-02-05 16:53:15,916 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 514 transitions. [2025-02-05 16:53:15,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-02-05 16:53:15,921 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:53:15,922 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 16:53:15,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 16:53:15,922 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:53:15,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:53:15,922 INFO L85 PathProgramCache]: Analyzing trace with hash -485438278, now seen corresponding path program 1 times [2025-02-05 16:53:15,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:53:15,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018055162] [2025-02-05 16:53:15,922 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:53:15,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:53:15,986 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-02-05 16:53:16,004 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-02-05 16:53:16,004 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:53:16,004 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:53:16,250 INFO L134 CoverageAnalysis]: Checked inductivity of 663 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 662 trivial. 0 not checked. [2025-02-05 16:53:16,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:53:16,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018055162] [2025-02-05 16:53:16,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1018055162] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:53:16,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [833836363] [2025-02-05 16:53:16,251 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:53:16,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:53:16,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:53:16,253 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-05 16:53:16,256 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-05 16:53:16,471 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-02-05 16:53:16,584 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-02-05 16:53:16,584 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:53:16,584 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:53:16,588 INFO L256 TraceCheckSpWp]: Trace formula consists of 1121 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 16:53:16,592 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:53:16,611 INFO L134 CoverageAnalysis]: Checked inductivity of 663 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 662 trivial. 0 not checked. [2025-02-05 16:53:16,612 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 16:53:16,805 INFO L134 CoverageAnalysis]: Checked inductivity of 663 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 662 trivial. 0 not checked. [2025-02-05 16:53:16,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [833836363] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 16:53:16,806 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 16:53:16,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2025-02-05 16:53:16,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811513348] [2025-02-05 16:53:16,806 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 16:53:16,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:53:16,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:53:16,810 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:53:16,810 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:53:16,811 INFO L87 Difference]: Start difference. First operand 335 states and 514 transitions. Second operand has 5 states, 5 states have (on average 17.2) internal successors, (86), 5 states have internal predecessors, (86), 2 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 2 states have call predecessors, (38), 2 states have call successors, (38) [2025-02-05 16:53:17,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:53:17,792 INFO L93 Difference]: Finished difference Result 667 states and 1025 transitions. [2025-02-05 16:53:17,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 16:53:17,793 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 5 states have internal predecessors, (86), 2 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 2 states have call predecessors, (38), 2 states have call successors, (38) Word has length 170 [2025-02-05 16:53:17,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:53:17,795 INFO L225 Difference]: With dead ends: 667 [2025-02-05 16:53:17,795 INFO L226 Difference]: Without dead ends: 340 [2025-02-05 16:53:17,797 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 342 GetRequests, 337 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:53:17,797 INFO L435 NwaCegarLoop]: 272 mSDtfsCounter, 2 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 542 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:53:17,798 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 542 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-05 16:53:17,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2025-02-05 16:53:17,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 340. [2025-02-05 16:53:17,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 340 states, 220 states have (on average 1.4272727272727272) internal successors, (314), 220 states have internal predecessors, (314), 99 states have call successors, (99), 20 states have call predecessors, (99), 20 states have return successors, (107), 99 states have call predecessors, (107), 99 states have call successors, (107) [2025-02-05 16:53:17,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 520 transitions. [2025-02-05 16:53:17,823 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 520 transitions. Word has length 170 [2025-02-05 16:53:17,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:53:17,823 INFO L471 AbstractCegarLoop]: Abstraction has 340 states and 520 transitions. [2025-02-05 16:53:17,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 5 states have internal predecessors, (86), 2 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 2 states have call predecessors, (38), 2 states have call successors, (38) [2025-02-05 16:53:17,824 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 520 transitions. [2025-02-05 16:53:17,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-02-05 16:53:17,828 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:53:17,829 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 6, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:53:17,837 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-05 16:53:18,029 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-05 16:53:18,030 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:53:18,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:53:18,030 INFO L85 PathProgramCache]: Analyzing trace with hash 1841553338, now seen corresponding path program 1 times [2025-02-05 16:53:18,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:53:18,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40179000] [2025-02-05 16:53:18,030 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:53:18,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:53:18,094 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-02-05 16:53:18,118 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-02-05 16:53:18,118 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:53:18,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:53:18,658 INFO L134 CoverageAnalysis]: Checked inductivity of 689 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2025-02-05 16:53:18,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:53:18,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40179000] [2025-02-05 16:53:18,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [40179000] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:53:18,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:53:18,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 16:53:18,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464914777] [2025-02-05 16:53:18,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:53:18,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:53:18,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:53:18,659 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:53:18,659 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:53:18,659 INFO L87 Difference]: Start difference. First operand 340 states and 520 transitions. Second operand has 5 states, 4 states have (on average 13.25) internal successors, (53), 5 states have internal predecessors, (53), 4 states have call successors, (18), 1 states have call predecessors, (18), 2 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2025-02-05 16:53:19,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:53:19,872 INFO L93 Difference]: Finished difference Result 707 states and 1089 transitions. [2025-02-05 16:53:19,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 16:53:19,872 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 13.25) internal successors, (53), 5 states have internal predecessors, (53), 4 states have call successors, (18), 1 states have call predecessors, (18), 2 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) Word has length 175 [2025-02-05 16:53:19,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:53:19,882 INFO L225 Difference]: With dead ends: 707 [2025-02-05 16:53:19,882 INFO L226 Difference]: Without dead ends: 677 [2025-02-05 16:53:19,883 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:53:19,883 INFO L435 NwaCegarLoop]: 287 mSDtfsCounter, 311 mSDsluCounter, 744 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 334 SdHoareTripleChecker+Valid, 1031 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:53:19,883 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [334 Valid, 1031 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-02-05 16:53:19,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 677 states. [2025-02-05 16:53:19,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 677 to 670. [2025-02-05 16:53:19,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 670 states, 429 states have (on average 1.4289044289044288) internal successors, (613), 432 states have internal predecessors, (613), 197 states have call successors, (197), 40 states have call predecessors, (197), 43 states have return successors, (229), 197 states have call predecessors, (229), 197 states have call successors, (229) [2025-02-05 16:53:19,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 670 states and 1039 transitions. [2025-02-05 16:53:19,948 INFO L78 Accepts]: Start accepts. Automaton has 670 states and 1039 transitions. Word has length 175 [2025-02-05 16:53:19,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:53:19,949 INFO L471 AbstractCegarLoop]: Abstraction has 670 states and 1039 transitions. [2025-02-05 16:53:19,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 13.25) internal successors, (53), 5 states have internal predecessors, (53), 4 states have call successors, (18), 1 states have call predecessors, (18), 2 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2025-02-05 16:53:19,949 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 1039 transitions. [2025-02-05 16:53:19,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2025-02-05 16:53:19,954 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:53:19,954 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 6, 5, 5, 5, 5, 5, 5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 16:53:19,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 16:53:19,954 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:53:19,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:53:19,955 INFO L85 PathProgramCache]: Analyzing trace with hash -2108776806, now seen corresponding path program 1 times [2025-02-05 16:53:19,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:53:19,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94905676] [2025-02-05 16:53:19,955 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:53:19,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:53:20,028 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-02-05 16:53:20,092 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-02-05 16:53:20,093 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:53:20,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:53:20,505 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2025-02-05 16:53:20,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:53:20,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94905676] [2025-02-05 16:53:20,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94905676] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:53:20,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:53:20,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:53:20,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834009786] [2025-02-05 16:53:20,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:53:20,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 16:53:20,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:53:20,507 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 16:53:20,507 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 16:53:20,507 INFO L87 Difference]: Start difference. First operand 670 states and 1039 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-02-05 16:53:20,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:53:20,811 INFO L93 Difference]: Finished difference Result 1077 states and 1649 transitions. [2025-02-05 16:53:20,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 16:53:20,812 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 190 [2025-02-05 16:53:20,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:53:20,819 INFO L225 Difference]: With dead ends: 1077 [2025-02-05 16:53:20,820 INFO L226 Difference]: Without dead ends: 666 [2025-02-05 16:53:20,823 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-05 16:53:20,824 INFO L435 NwaCegarLoop]: 318 mSDtfsCounter, 259 mSDsluCounter, 576 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 894 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:53:20,824 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 894 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 16:53:20,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 666 states. [2025-02-05 16:53:20,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 666 to 659. [2025-02-05 16:53:20,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 659 states, 421 states have (on average 1.4275534441805227) internal successors, (601), 423 states have internal predecessors, (601), 195 states have call successors, (195), 40 states have call predecessors, (195), 42 states have return successors, (223), 195 states have call predecessors, (223), 195 states have call successors, (223) [2025-02-05 16:53:20,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 1019 transitions. [2025-02-05 16:53:20,878 INFO L78 Accepts]: Start accepts. Automaton has 659 states and 1019 transitions. Word has length 190 [2025-02-05 16:53:20,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:53:20,878 INFO L471 AbstractCegarLoop]: Abstraction has 659 states and 1019 transitions. [2025-02-05 16:53:20,878 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-02-05 16:53:20,878 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 1019 transitions. [2025-02-05 16:53:20,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2025-02-05 16:53:20,882 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:53:20,882 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 6, 5, 5, 5, 5, 5, 5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 16:53:20,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 16:53:20,882 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:53:20,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:53:20,883 INFO L85 PathProgramCache]: Analyzing trace with hash 1498611864, now seen corresponding path program 1 times [2025-02-05 16:53:20,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:53:20,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049760320] [2025-02-05 16:53:20,883 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:53:20,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:53:20,934 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-02-05 16:53:20,971 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-02-05 16:53:20,972 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:53:20,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:53:21,264 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2025-02-05 16:53:21,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:53:21,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049760320] [2025-02-05 16:53:21,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049760320] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:53:21,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:53:21,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:53:21,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337093837] [2025-02-05 16:53:21,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:53:21,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 16:53:21,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:53:21,266 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 16:53:21,266 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 16:53:21,266 INFO L87 Difference]: Start difference. First operand 659 states and 1019 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-02-05 16:53:21,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:53:21,542 INFO L93 Difference]: Finished difference Result 1235 states and 1895 transitions. [2025-02-05 16:53:21,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 16:53:21,543 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 190 [2025-02-05 16:53:21,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:53:21,547 INFO L225 Difference]: With dead ends: 1235 [2025-02-05 16:53:21,547 INFO L226 Difference]: Without dead ends: 575 [2025-02-05 16:53:21,550 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-05 16:53:21,550 INFO L435 NwaCegarLoop]: 318 mSDtfsCounter, 255 mSDsluCounter, 577 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 895 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:53:21,550 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [255 Valid, 895 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 16:53:21,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2025-02-05 16:53:21,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 571. [2025-02-05 16:53:21,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 571 states, 366 states have (on average 1.360655737704918) internal successors, (498), 368 states have internal predecessors, (498), 168 states have call successors, (168), 35 states have call predecessors, (168), 36 states have return successors, (188), 167 states have call predecessors, (188), 168 states have call successors, (188) [2025-02-05 16:53:21,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 854 transitions. [2025-02-05 16:53:21,594 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 854 transitions. Word has length 190 [2025-02-05 16:53:21,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:53:21,594 INFO L471 AbstractCegarLoop]: Abstraction has 571 states and 854 transitions. [2025-02-05 16:53:21,594 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-02-05 16:53:21,595 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 854 transitions. [2025-02-05 16:53:21,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-02-05 16:53:21,598 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:53:21,598 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 6, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 16:53:21,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 16:53:21,599 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:53:21,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:53:21,600 INFO L85 PathProgramCache]: Analyzing trace with hash -536164126, now seen corresponding path program 1 times [2025-02-05 16:53:21,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:53:21,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948066892] [2025-02-05 16:53:21,601 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:53:21,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:53:21,655 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-02-05 16:53:21,670 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-02-05 16:53:21,671 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:53:21,671 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:53:22,145 INFO L134 CoverageAnalysis]: Checked inductivity of 687 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 687 trivial. 0 not checked. [2025-02-05 16:53:22,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:53:22,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948066892] [2025-02-05 16:53:22,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948066892] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:53:22,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:53:22,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 16:53:22,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643626029] [2025-02-05 16:53:22,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:53:22,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:53:22,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:53:22,148 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:53:22,148 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:53:22,148 INFO L87 Difference]: Start difference. First operand 571 states and 854 transitions. Second operand has 5 states, 4 states have (on average 13.5) internal successors, (54), 5 states have internal predecessors, (54), 4 states have call successors, (19), 1 states have call predecessors, (19), 2 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2025-02-05 16:53:26,163 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-05 16:53:27,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:53:27,107 INFO L93 Difference]: Finished difference Result 618 states and 912 transitions. [2025-02-05 16:53:27,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 16:53:27,107 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 13.5) internal successors, (54), 5 states have internal predecessors, (54), 4 states have call successors, (19), 1 states have call predecessors, (19), 2 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) Word has length 175 [2025-02-05 16:53:27,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:53:27,111 INFO L225 Difference]: With dead ends: 618 [2025-02-05 16:53:27,111 INFO L226 Difference]: Without dead ends: 482 [2025-02-05 16:53:27,112 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:53:27,112 INFO L435 NwaCegarLoop]: 331 mSDtfsCounter, 289 mSDsluCounter, 745 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 40 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 305 SdHoareTripleChecker+Valid, 1076 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2025-02-05 16:53:27,112 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [305 Valid, 1076 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 213 Invalid, 1 Unknown, 0 Unchecked, 4.9s Time] [2025-02-05 16:53:27,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2025-02-05 16:53:27,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 472. [2025-02-05 16:53:27,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 472 states, 304 states have (on average 1.355263157894737) internal successors, (412), 305 states have internal predecessors, (412), 136 states have call successors, (136), 29 states have call predecessors, (136), 31 states have return successors, (154), 137 states have call predecessors, (154), 136 states have call successors, (154) [2025-02-05 16:53:27,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 702 transitions. [2025-02-05 16:53:27,139 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 702 transitions. Word has length 175 [2025-02-05 16:53:27,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:53:27,139 INFO L471 AbstractCegarLoop]: Abstraction has 472 states and 702 transitions. [2025-02-05 16:53:27,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 13.5) internal successors, (54), 5 states have internal predecessors, (54), 4 states have call successors, (19), 1 states have call predecessors, (19), 2 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2025-02-05 16:53:27,139 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 702 transitions. [2025-02-05 16:53:27,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2025-02-05 16:53:27,143 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:53:27,143 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 8, 8, 8, 8, 8, 8, 8, 8, 6, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 16:53:27,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 16:53:27,143 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:53:27,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:53:27,144 INFO L85 PathProgramCache]: Analyzing trace with hash 175334671, now seen corresponding path program 1 times [2025-02-05 16:53:27,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:53:27,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786442757] [2025-02-05 16:53:27,144 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:53:27,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:53:27,198 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 255 statements into 1 equivalence classes. [2025-02-05 16:53:27,241 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 255 of 255 statements. [2025-02-05 16:53:27,241 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:53:27,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:53:27,543 INFO L134 CoverageAnalysis]: Checked inductivity of 1534 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1530 trivial. 0 not checked. [2025-02-05 16:53:27,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:53:27,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786442757] [2025-02-05 16:53:27,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [786442757] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:53:27,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [804361585] [2025-02-05 16:53:27,544 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:53:27,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:53:27,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:53:27,546 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-05 16:53:27,550 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-05 16:53:27,856 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 255 statements into 1 equivalence classes. [2025-02-05 16:53:28,374 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 255 of 255 statements. [2025-02-05 16:53:28,374 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:53:28,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:53:28,385 INFO L256 TraceCheckSpWp]: Trace formula consists of 1645 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-05 16:53:28,393 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:53:28,501 INFO L134 CoverageAnalysis]: Checked inductivity of 1534 backedges. 640 proven. 4 refuted. 0 times theorem prover too weak. 890 trivial. 0 not checked. [2025-02-05 16:53:28,501 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 16:53:28,989 INFO L134 CoverageAnalysis]: Checked inductivity of 1534 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1530 trivial. 0 not checked. [2025-02-05 16:53:28,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [804361585] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 16:53:28,989 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 16:53:28,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 5] total 11 [2025-02-05 16:53:28,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546051232] [2025-02-05 16:53:28,989 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 16:53:28,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-05 16:53:28,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:53:28,992 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-05 16:53:28,992 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2025-02-05 16:53:28,992 INFO L87 Difference]: Start difference. First operand 472 states and 702 transitions. Second operand has 11 states, 11 states have (on average 8.454545454545455) internal successors, (93), 11 states have internal predecessors, (93), 9 states have call successors, (51), 5 states have call predecessors, (51), 6 states have return successors, (52), 7 states have call predecessors, (52), 9 states have call successors, (52) [2025-02-05 16:53:33,005 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-05 16:53:33,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:53:33,965 INFO L93 Difference]: Finished difference Result 1194 states and 1805 transitions. [2025-02-05 16:53:33,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 16:53:33,966 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.454545454545455) internal successors, (93), 11 states have internal predecessors, (93), 9 states have call successors, (51), 5 states have call predecessors, (51), 6 states have return successors, (52), 7 states have call predecessors, (52), 9 states have call successors, (52) Word has length 255 [2025-02-05 16:53:33,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:53:33,974 INFO L225 Difference]: With dead ends: 1194 [2025-02-05 16:53:33,974 INFO L226 Difference]: Without dead ends: 758 [2025-02-05 16:53:33,976 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 521 GetRequests, 510 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2025-02-05 16:53:33,977 INFO L435 NwaCegarLoop]: 259 mSDtfsCounter, 715 mSDsluCounter, 523 mSDsCounter, 0 mSdLazyCounter, 757 mSolverCounterSat, 438 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 762 SdHoareTripleChecker+Valid, 782 SdHoareTripleChecker+Invalid, 1196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 438 IncrementalHoareTripleChecker+Valid, 757 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2025-02-05 16:53:33,977 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [762 Valid, 782 Invalid, 1196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [438 Valid, 757 Invalid, 1 Unknown, 0 Unchecked, 4.9s Time] [2025-02-05 16:53:33,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 758 states. [2025-02-05 16:53:34,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 758 to 741. [2025-02-05 16:53:34,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 741 states, 475 states have (on average 1.3789473684210527) internal successors, (655), 478 states have internal predecessors, (655), 212 states have call successors, (212), 51 states have call predecessors, (212), 53 states have return successors, (244), 211 states have call predecessors, (244), 212 states have call successors, (244) [2025-02-05 16:53:34,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 741 states to 741 states and 1111 transitions. [2025-02-05 16:53:34,036 INFO L78 Accepts]: Start accepts. Automaton has 741 states and 1111 transitions. Word has length 255 [2025-02-05 16:53:34,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:53:34,037 INFO L471 AbstractCegarLoop]: Abstraction has 741 states and 1111 transitions. [2025-02-05 16:53:34,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.454545454545455) internal successors, (93), 11 states have internal predecessors, (93), 9 states have call successors, (51), 5 states have call predecessors, (51), 6 states have return successors, (52), 7 states have call predecessors, (52), 9 states have call successors, (52) [2025-02-05 16:53:34,037 INFO L276 IsEmpty]: Start isEmpty. Operand 741 states and 1111 transitions. [2025-02-05 16:53:34,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2025-02-05 16:53:34,041 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:53:34,041 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 8, 8, 8, 8, 8, 8, 8, 8, 6, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 16:53:34,065 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-05 16:53:34,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:53:34,242 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:53:34,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:53:34,242 INFO L85 PathProgramCache]: Analyzing trace with hash -1136057649, now seen corresponding path program 1 times [2025-02-05 16:53:34,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:53:34,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675494882] [2025-02-05 16:53:34,243 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:53:34,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:53:34,309 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 255 statements into 1 equivalence classes. [2025-02-05 16:53:34,454 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 255 of 255 statements. [2025-02-05 16:53:34,455 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:53:34,455 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:53:35,805 INFO L134 CoverageAnalysis]: Checked inductivity of 1534 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1530 trivial. 0 not checked. [2025-02-05 16:53:35,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:53:35,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675494882] [2025-02-05 16:53:35,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675494882] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:53:35,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [116972094] [2025-02-05 16:53:35,806 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:53:35,806 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:53:35,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:53:35,808 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-05 16:53:35,809 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-05 16:53:36,109 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 255 statements into 1 equivalence classes. [2025-02-05 16:53:36,272 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 255 of 255 statements. [2025-02-05 16:53:36,272 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:53:36,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:53:36,283 INFO L256 TraceCheckSpWp]: Trace formula consists of 1743 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-02-05 16:53:36,295 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:53:36,583 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-02-05 16:53:47,433 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 16:53:47,445 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 16:53:47,446 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 48 [2025-02-05 16:53:49,306 INFO L349 Elim1Store]: treesize reduction 64, result has 54.9 percent of original size [2025-02-05 16:53:49,307 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 49 treesize of output 104 [2025-02-05 16:54:19,584 INFO L134 CoverageAnalysis]: Checked inductivity of 1534 backedges. 1031 proven. 4 refuted. 0 times theorem prover too weak. 499 trivial. 0 not checked. [2025-02-05 16:54:19,584 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 16:54:19,761 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 25 treesize of output 23 [2025-02-05 16:54:19,764 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 35 treesize of output 31 [2025-02-05 16:54:20,115 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 20 treesize of output 18 [2025-02-05 16:54:20,117 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 26 treesize of output 22 [2025-02-05 16:54:20,179 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 20 treesize of output 18 [2025-02-05 16:54:20,182 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 26 treesize of output 22 [2025-02-05 16:54:20,361 INFO L134 CoverageAnalysis]: Checked inductivity of 1534 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1530 trivial. 0 not checked. [2025-02-05 16:54:20,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [116972094] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 16:54:20,361 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 16:54:20,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15, 9] total 38 [2025-02-05 16:54:20,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466340688] [2025-02-05 16:54:20,361 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 16:54:20,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2025-02-05 16:54:20,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:54:20,362 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-02-05 16:54:20,363 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=1257, Unknown=5, NotChecked=0, Total=1406 [2025-02-05 16:54:20,363 INFO L87 Difference]: Start difference. First operand 741 states and 1111 transitions. Second operand has 38 states, 35 states have (on average 4.628571428571429) internal successors, (162), 36 states have internal predecessors, (162), 19 states have call successors, (70), 12 states have call predecessors, (70), 14 states have return successors, (70), 17 states have call predecessors, (70), 19 states have call successors, (70) [2025-02-05 16:54:24,533 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-05 16:54:25,810 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-05 16:54:29,637 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.93s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-05 16:54:34,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:54:34,657 INFO L93 Difference]: Finished difference Result 1454 states and 2231 transitions. [2025-02-05 16:54:34,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-02-05 16:54:34,658 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 35 states have (on average 4.628571428571429) internal successors, (162), 36 states have internal predecessors, (162), 19 states have call successors, (70), 12 states have call predecessors, (70), 14 states have return successors, (70), 17 states have call predecessors, (70), 19 states have call successors, (70) Word has length 255 [2025-02-05 16:54:34,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:54:34,663 INFO L225 Difference]: With dead ends: 1454 [2025-02-05 16:54:34,664 INFO L226 Difference]: Without dead ends: 835 [2025-02-05 16:54:34,667 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 558 GetRequests, 487 SyntacticMatches, 7 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1006 ImplicationChecksByTransitivity, 43.4s TimeCoverageRelationStatistics Valid=686, Invalid=3599, Unknown=5, NotChecked=0, Total=4290 [2025-02-05 16:54:34,667 INFO L435 NwaCegarLoop]: 241 mSDtfsCounter, 1905 mSDsluCounter, 2416 mSDsCounter, 0 mSdLazyCounter, 3943 mSolverCounterSat, 1595 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1905 SdHoareTripleChecker+Valid, 2657 SdHoareTripleChecker+Invalid, 5539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1595 IncrementalHoareTripleChecker+Valid, 3943 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:54:34,667 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1905 Valid, 2657 Invalid, 5539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1595 Valid, 3943 Invalid, 1 Unknown, 0 Unchecked, 13.0s Time] [2025-02-05 16:54:34,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 835 states. [2025-02-05 16:54:34,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 835 to 788. [2025-02-05 16:54:34,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 788 states, 503 states have (on average 1.3757455268389662) internal successors, (692), 509 states have internal predecessors, (692), 226 states have call successors, (226), 51 states have call predecessors, (226), 58 states have return successors, (283), 227 states have call predecessors, (283), 226 states have call successors, (283) [2025-02-05 16:54:34,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 1201 transitions. [2025-02-05 16:54:34,733 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 1201 transitions. Word has length 255 [2025-02-05 16:54:34,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:54:34,734 INFO L471 AbstractCegarLoop]: Abstraction has 788 states and 1201 transitions. [2025-02-05 16:54:34,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 35 states have (on average 4.628571428571429) internal successors, (162), 36 states have internal predecessors, (162), 19 states have call successors, (70), 12 states have call predecessors, (70), 14 states have return successors, (70), 17 states have call predecessors, (70), 19 states have call successors, (70) [2025-02-05 16:54:34,735 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 1201 transitions. [2025-02-05 16:54:34,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2025-02-05 16:54:34,742 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:54:34,742 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 9, 9, 9, 9, 9, 9, 9, 9, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 16:54:34,753 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-05 16:54:34,946 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,SelfDestructingSolverStorable10 [2025-02-05 16:54:34,946 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:54:34,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:54:34,947 INFO L85 PathProgramCache]: Analyzing trace with hash 1579971836, now seen corresponding path program 1 times [2025-02-05 16:54:34,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:54:34,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318524112] [2025-02-05 16:54:34,947 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:54:34,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:54:35,009 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 284 statements into 1 equivalence classes. [2025-02-05 16:54:35,082 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 284 of 284 statements. [2025-02-05 16:54:35,082 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:54:35,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:54:37,331 INFO L134 CoverageAnalysis]: Checked inductivity of 1810 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 1798 trivial. 0 not checked. [2025-02-05 16:54:37,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:54:37,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318524112] [2025-02-05 16:54:37,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318524112] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:54:37,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1957437841] [2025-02-05 16:54:37,332 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:54:37,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:54:37,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:54:37,334 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-05 16:54:37,335 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-05 16:54:37,654 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 284 statements into 1 equivalence classes. [2025-02-05 16:54:37,848 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 284 of 284 statements. [2025-02-05 16:54:37,849 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:54:37,849 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:54:37,856 INFO L256 TraceCheckSpWp]: Trace formula consists of 1953 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-02-05 16:54:37,864 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:54:38,083 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2025-02-05 16:54:39,874 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 16:54:39,881 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 16:54:39,882 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 56 treesize of output 50 [2025-02-05 16:54:40,031 INFO L349 Elim1Store]: treesize reduction 58, result has 61.3 percent of original size [2025-02-05 16:54:40,032 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 57 treesize of output 122