./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/memory-model/4SB.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/memory-model/4SB.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 15b0cbd6c91287c392a1dcce1e0a32a1c72d5f0acdee848dea776c36b74cf850 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 10:40:44,604 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 10:40:44,657 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 10:40:44,663 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 10:40:44,666 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 10:40:44,690 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 10:40:44,691 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 10:40:44,691 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 10:40:44,691 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 10:40:44,691 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 10:40:44,691 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 10:40:44,691 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 10:40:44,692 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 10:40:44,692 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 10:40:44,692 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 10:40:44,692 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 10:40:44,692 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 10:40:44,692 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 10:40:44,692 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 10:40:44,692 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 10:40:44,692 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 10:40:44,692 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 10:40:44,693 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 10:40:44,693 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 10:40:44,693 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 10:40:44,693 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 10:40:44,693 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 10:40:44,693 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 10:40:44,693 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 10:40:44,693 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 10:40:44,693 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 10:40:44,693 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 10:40:44,693 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 10:40:44,694 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 10:40:44,694 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 10:40:44,694 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 10:40:44,694 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 10:40:44,694 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 10:40:44,694 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 10:40:44,694 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 10:40:44,694 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 10:40:44,694 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 10:40:44,694 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 10:40:44,694 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 -> 15b0cbd6c91287c392a1dcce1e0a32a1c72d5f0acdee848dea776c36b74cf850 [2025-02-05 10:40:44,909 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 10:40:44,917 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 10:40:44,919 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 10:40:44,919 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 10:40:44,919 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 10:40:44,920 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memory-model/4SB.i [2025-02-05 10:40:46,074 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/917c660fa/28ef5cd3e37d4789a9d4ffde91399c4d/FLAG0464928a0 [2025-02-05 10:40:46,402 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 10:40:46,407 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/memory-model/4SB.i [2025-02-05 10:40:46,419 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/917c660fa/28ef5cd3e37d4789a9d4ffde91399c4d/FLAG0464928a0 [2025-02-05 10:40:46,654 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/917c660fa/28ef5cd3e37d4789a9d4ffde91399c4d [2025-02-05 10:40:46,656 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 10:40:46,657 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 10:40:46,659 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 10:40:46,659 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 10:40:46,662 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 10:40:46,662 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 10:40:46" (1/1) ... [2025-02-05 10:40:46,663 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59d65918 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:40:46, skipping insertion in model container [2025-02-05 10:40:46,663 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 10:40:46" (1/1) ... [2025-02-05 10:40:46,691 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 10:40:46,887 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/memory-model/4SB.i[21105,21118] [2025-02-05 10:40:46,890 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 10:40:46,899 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 10:40:46,985 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/memory-model/4SB.i[21105,21118] [2025-02-05 10:40:46,986 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 10:40:46,994 INFO L204 MainTranslator]: Completed translation [2025-02-05 10:40:46,995 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:40:46 WrapperNode [2025-02-05 10:40:46,995 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 10:40:46,996 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 10:40:46,996 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 10:40:46,996 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 10:40:46,999 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:40:46" (1/1) ... [2025-02-05 10:40:47,013 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:40:46" (1/1) ... [2025-02-05 10:40:47,062 INFO L138 Inliner]: procedures = 27, calls = 680, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 1617 [2025-02-05 10:40:47,062 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 10:40:47,063 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 10:40:47,063 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 10:40:47,063 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 10:40:47,069 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:40:46" (1/1) ... [2025-02-05 10:40:47,069 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:40:46" (1/1) ... [2025-02-05 10:40:47,084 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:40:46" (1/1) ... [2025-02-05 10:40:47,115 INFO L175 MemorySlicer]: Split 488 memory accesses to 16 slices as follows [96, 12, 10, 60, 45, 10, 13, 13, 3, 12, 152, 15, 13, 11, 13, 10]. 31 percent of accesses are in the largest equivalence class. The 36 initializations are split as follows [0, 10, 0, 0, 0, 1, 5, 5, 0, 5, 0, 0, 5, 0, 5, 0]. The 171 writes are split as follows [20, 1, 5, 20, 15, 3, 2, 2, 2, 2, 80, 5, 2, 5, 2, 5]. [2025-02-05 10:40:47,116 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:40:46" (1/1) ... [2025-02-05 10:40:47,116 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:40:46" (1/1) ... [2025-02-05 10:40:47,141 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:40:46" (1/1) ... [2025-02-05 10:40:47,143 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:40:46" (1/1) ... [2025-02-05 10:40:47,146 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:40:46" (1/1) ... [2025-02-05 10:40:47,148 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:40:46" (1/1) ... [2025-02-05 10:40:47,158 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 10:40:47,163 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 10:40:47,163 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 10:40:47,163 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 10:40:47,163 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:40:46" (1/1) ... [2025-02-05 10:40:47,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 10:40:47,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:40:47,188 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 10:40:47,195 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 10:40:47,210 INFO L130 BoogieDeclarations]: Found specification of procedure store_buffering_4_conditions [2025-02-05 10:40:47,210 INFO L138 BoogieDeclarations]: Found implementation of procedure store_buffering_4_conditions [2025-02-05 10:40:47,210 INFO L130 BoogieDeclarations]: Found specification of procedure tso_core_write [2025-02-05 10:40:47,211 INFO L138 BoogieDeclarations]: Found implementation of procedure tso_core_write [2025-02-05 10:40:47,211 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_headerT [2025-02-05 10:40:47,211 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_nondet_headerT [2025-02-05 10:40:47,211 INFO L130 BoogieDeclarations]: Found specification of procedure stepWriteBuffer [2025-02-05 10:40:47,211 INFO L138 BoogieDeclarations]: Found implementation of procedure stepWriteBuffer [2025-02-05 10:40:47,211 INFO L130 BoogieDeclarations]: Found specification of procedure tso_core_read [2025-02-05 10:40:47,211 INFO L138 BoogieDeclarations]: Found implementation of procedure tso_core_read [2025-02-05 10:40:47,211 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-05 10:40:47,211 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-05 10:40:47,211 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-05 10:40:47,211 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-05 10:40:47,212 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-02-05 10:40:47,212 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-02-05 10:40:47,212 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-02-05 10:40:47,212 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-02-05 10:40:47,212 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-02-05 10:40:47,212 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-02-05 10:40:47,212 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-02-05 10:40:47,212 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-02-05 10:40:47,213 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-02-05 10:40:47,213 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-02-05 10:40:47,213 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-02-05 10:40:47,213 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2025-02-05 10:40:47,213 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2025-02-05 10:40:47,213 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-05 10:40:47,213 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-05 10:40:47,213 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-05 10:40:47,213 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-02-05 10:40:47,213 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-02-05 10:40:47,214 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-02-05 10:40:47,214 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-02-05 10:40:47,214 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-02-05 10:40:47,214 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-02-05 10:40:47,214 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-02-05 10:40:47,215 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-02-05 10:40:47,215 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-02-05 10:40:47,215 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-02-05 10:40:47,215 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-02-05 10:40:47,215 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2025-02-05 10:40:47,216 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2025-02-05 10:40:47,216 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 10:40:47,216 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-05 10:40:47,216 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-05 10:40:47,216 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-05 10:40:47,216 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-02-05 10:40:47,216 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-02-05 10:40:47,216 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-02-05 10:40:47,216 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-02-05 10:40:47,216 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-02-05 10:40:47,216 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-02-05 10:40:47,216 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-02-05 10:40:47,216 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-02-05 10:40:47,216 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-02-05 10:40:47,216 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-02-05 10:40:47,216 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-02-05 10:40:47,216 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-02-05 10:40:47,216 INFO L130 BoogieDeclarations]: Found specification of procedure initWriteBuffer [2025-02-05 10:40:47,216 INFO L138 BoogieDeclarations]: Found implementation of procedure initWriteBuffer [2025-02-05 10:40:47,216 INFO L130 BoogieDeclarations]: Found specification of procedure tso_core_fence [2025-02-05 10:40:47,216 INFO L138 BoogieDeclarations]: Found implementation of procedure tso_core_fence [2025-02-05 10:40:47,216 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 10:40:47,216 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 10:40:47,216 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-05 10:40:47,392 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 10:40:47,393 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 10:40:48,165 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L62: havoc __VERIFIER_nondet_operations_#t~nondet1#1; [2025-02-05 10:40:48,166 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L71: havoc #t~mem7#1;havoc #t~mem8#1;havoc #t~mem9#1;havoc #t~mem10#1;havoc #t~mem11#1;call ULTIMATE.dealloc(~#result~0#1.base, ~#result~0#1.offset);havoc ~#result~0#1.base, ~#result~0#1.offset; [2025-02-05 10:40:48,636 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L59: havoc __VERIFIER_nondet_step_#t~nondet0#1; [2025-02-05 10:40:48,637 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L95: call ULTIMATE.dealloc(main_~#sharedMemory~0#1.base, main_~#sharedMemory~0#1.offset);havoc main_~#sharedMemory~0#1.base, main_~#sharedMemory~0#1.offset;call ULTIMATE.dealloc(main_~#wrBuffer0~0#1.base, main_~#wrBuffer0~0#1.offset);havoc main_~#wrBuffer0~0#1.base, main_~#wrBuffer0~0#1.offset;call ULTIMATE.dealloc(main_~#wrBuffer1~0#1.base, main_~#wrBuffer1~0#1.offset);havoc main_~#wrBuffer1~0#1.base, main_~#wrBuffer1~0#1.offset;call ULTIMATE.dealloc(main_~#wrBuffer2~0#1.base, main_~#wrBuffer2~0#1.offset);havoc main_~#wrBuffer2~0#1.base, main_~#wrBuffer2~0#1.offset;call ULTIMATE.dealloc(main_~#wrBuffer3~0#1.base, main_~#wrBuffer3~0#1.offset);havoc main_~#wrBuffer3~0#1.base, main_~#wrBuffer3~0#1.offset;call ULTIMATE.dealloc(main_~#g_history~0#1.base, main_~#g_history~0#1.offset);havoc main_~#g_history~0#1.base, main_~#g_history~0#1.offset;call ULTIMATE.dealloc(main_~#global_time~0#1.base, main_~#global_time~0#1.offset);havoc main_~#global_time~0#1.base, main_~#global_time~0#1.offset;call ULTIMATE.dealloc(main_~#litmus_input~0#1.base, main_~#litmus_input~0#1.offset);havoc main_~#litmus_input~0#1.base, main_~#litmus_input~0#1.offset;call ULTIMATE.dealloc(main_~#input_action~0#1.base, main_~#input_action~0#1.offset);havoc main_~#input_action~0#1.base, main_~#input_action~0#1.offset; [2025-02-05 10:40:48,737 INFO L? ?]: Removed 207 outVars from TransFormulas that were not future-live. [2025-02-05 10:40:48,737 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 10:40:48,750 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 10:40:48,750 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 10:40:48,750 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 10:40:48 BoogieIcfgContainer [2025-02-05 10:40:48,750 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 10:40:48,752 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 10:40:48,752 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 10:40:48,755 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 10:40:48,755 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 10:40:46" (1/3) ... [2025-02-05 10:40:48,755 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ec9ce17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 10:40:48, skipping insertion in model container [2025-02-05 10:40:48,755 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:40:46" (2/3) ... [2025-02-05 10:40:48,755 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ec9ce17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 10:40:48, skipping insertion in model container [2025-02-05 10:40:48,755 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 10:40:48" (3/3) ... [2025-02-05 10:40:48,756 INFO L128 eAbstractionObserver]: Analyzing ICFG 4SB.i [2025-02-05 10:40:48,765 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 10:40:48,766 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 4SB.i that has 8 procedures, 272 locations, 1 initial locations, 9 loop locations, and 1 error locations. [2025-02-05 10:40:48,827 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 10:40:48,835 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;@8b55610, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 10:40:48,835 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 10:40:48,840 INFO L276 IsEmpty]: Start isEmpty. Operand has 272 states, 237 states have (on average 1.5696202531645569) internal successors, (372), 242 states have internal predecessors, (372), 26 states have call successors, (26), 7 states have call predecessors, (26), 7 states have return successors, (26), 23 states have call predecessors, (26), 26 states have call successors, (26) [2025-02-05 10:40:48,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-02-05 10:40:48,848 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:40:48,849 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 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] [2025-02-05 10:40:48,849 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:40:48,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:40:48,852 INFO L85 PathProgramCache]: Analyzing trace with hash 1745163428, now seen corresponding path program 1 times [2025-02-05 10:40:48,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:40:48,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384086964] [2025-02-05 10:40:48,857 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:40:48,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:40:49,223 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-02-05 10:40:49,248 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-02-05 10:40:49,250 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:40:49,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:40:49,560 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-02-05 10:40:49,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:40:49,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384086964] [2025-02-05 10:40:49,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384086964] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:40:49,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:40:49,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:40:49,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829852370] [2025-02-05 10:40:49,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:40:49,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:40:49,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:40:49,582 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:40:49,582 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:40:49,585 INFO L87 Difference]: Start difference. First operand has 272 states, 237 states have (on average 1.5696202531645569) internal successors, (372), 242 states have internal predecessors, (372), 26 states have call successors, (26), 7 states have call predecessors, (26), 7 states have return successors, (26), 23 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-02-05 10:40:49,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:40:49,638 INFO L93 Difference]: Finished difference Result 542 states and 846 transitions. [2025-02-05 10:40:49,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:40:49,640 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 64 [2025-02-05 10:40:49,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:40:49,647 INFO L225 Difference]: With dead ends: 542 [2025-02-05 10:40:49,647 INFO L226 Difference]: Without dead ends: 258 [2025-02-05 10:40:49,652 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 10:40:49,653 INFO L435 NwaCegarLoop]: 375 mSDtfsCounter, 0 mSDsluCounter, 372 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 747 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 10:40:49,655 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 747 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:40:49,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2025-02-05 10:40:49,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 258. [2025-02-05 10:40:49,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 224 states have (on average 1.3258928571428572) internal successors, (297), 228 states have internal predecessors, (297), 26 states have call successors, (26), 7 states have call predecessors, (26), 7 states have return successors, (26), 23 states have call predecessors, (26), 26 states have call successors, (26) [2025-02-05 10:40:49,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 349 transitions. [2025-02-05 10:40:49,705 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 349 transitions. Word has length 64 [2025-02-05 10:40:49,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:40:49,705 INFO L471 AbstractCegarLoop]: Abstraction has 258 states and 349 transitions. [2025-02-05 10:40:49,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-02-05 10:40:49,705 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 349 transitions. [2025-02-05 10:40:49,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-02-05 10:40:49,708 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:40:49,708 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:40:49,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 10:40:49,708 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:40:49,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:40:49,709 INFO L85 PathProgramCache]: Analyzing trace with hash 2006953936, now seen corresponding path program 1 times [2025-02-05 10:40:49,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:40:49,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711094462] [2025-02-05 10:40:49,709 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:40:49,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:40:49,917 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-02-05 10:40:49,924 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-02-05 10:40:49,924 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:40:49,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:40:50,085 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-02-05 10:40:50,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:40:50,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711094462] [2025-02-05 10:40:50,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711094462] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:40:50,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1375365331] [2025-02-05 10:40:50,085 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:40:50,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:40:50,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:40:50,090 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 10:40:50,091 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 10:40:50,402 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-02-05 10:40:50,481 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-02-05 10:40:50,482 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:40:50,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:40:50,485 INFO L256 TraceCheckSpWp]: Trace formula consists of 647 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 10:40:50,489 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:40:50,511 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-05 10:40:50,514 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 10:40:50,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1375365331] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:40:50,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 10:40:50,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-02-05 10:40:50,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682159356] [2025-02-05 10:40:50,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:40:50,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:40:50,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:40:50,518 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:40:50,519 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 10:40:50,519 INFO L87 Difference]: Start difference. First operand 258 states and 349 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-05 10:40:50,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:40:50,549 INFO L93 Difference]: Finished difference Result 511 states and 696 transitions. [2025-02-05 10:40:50,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:40:50,553 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) Word has length 66 [2025-02-05 10:40:50,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:40:50,554 INFO L225 Difference]: With dead ends: 511 [2025-02-05 10:40:50,554 INFO L226 Difference]: Without dead ends: 259 [2025-02-05 10:40:50,555 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 10:40:50,556 INFO L435 NwaCegarLoop]: 347 mSDtfsCounter, 0 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 692 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 10:40:50,556 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 692 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:40:50,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2025-02-05 10:40:50,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 259. [2025-02-05 10:40:50,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 225 states have (on average 1.3244444444444445) internal successors, (298), 229 states have internal predecessors, (298), 26 states have call successors, (26), 7 states have call predecessors, (26), 7 states have return successors, (26), 23 states have call predecessors, (26), 26 states have call successors, (26) [2025-02-05 10:40:50,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 350 transitions. [2025-02-05 10:40:50,567 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 350 transitions. Word has length 66 [2025-02-05 10:40:50,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:40:50,567 INFO L471 AbstractCegarLoop]: Abstraction has 259 states and 350 transitions. [2025-02-05 10:40:50,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-05 10:40:50,567 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 350 transitions. [2025-02-05 10:40:50,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-02-05 10:40:50,569 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:40:50,569 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:40:50,577 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 10:40:50,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:40:50,770 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:40:50,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:40:50,771 INFO L85 PathProgramCache]: Analyzing trace with hash -1263199732, now seen corresponding path program 1 times [2025-02-05 10:40:50,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:40:50,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236680934] [2025-02-05 10:40:50,771 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:40:50,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:40:50,892 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-02-05 10:40:50,895 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-02-05 10:40:50,919 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:40:50,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:40:51,048 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2025-02-05 10:40:51,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:40:51,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236680934] [2025-02-05 10:40:51,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236680934] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:40:51,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1153716835] [2025-02-05 10:40:51,048 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:40:51,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:40:51,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:40:51,052 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 10:40:51,053 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 10:40:51,305 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-02-05 10:40:51,375 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-02-05 10:40:51,376 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:40:51,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:40:51,379 INFO L256 TraceCheckSpWp]: Trace formula consists of 707 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 10:40:51,381 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:40:51,390 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2025-02-05 10:40:51,390 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 10:40:51,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1153716835] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:40:51,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 10:40:51,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-02-05 10:40:51,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032389730] [2025-02-05 10:40:51,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:40:51,391 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:40:51,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:40:51,391 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:40:51,391 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 10:40:51,392 INFO L87 Difference]: Start difference. First operand 259 states and 350 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-05 10:40:51,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:40:51,415 INFO L93 Difference]: Finished difference Result 501 states and 677 transitions. [2025-02-05 10:40:51,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:40:51,415 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 70 [2025-02-05 10:40:51,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:40:51,417 INFO L225 Difference]: With dead ends: 501 [2025-02-05 10:40:51,417 INFO L226 Difference]: Without dead ends: 266 [2025-02-05 10:40:51,417 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 10:40:51,418 INFO L435 NwaCegarLoop]: 343 mSDtfsCounter, 6 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 683 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 10:40:51,418 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 683 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:40:51,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2025-02-05 10:40:51,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 260. [2025-02-05 10:40:51,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 226 states have (on average 1.323008849557522) internal successors, (299), 230 states have internal predecessors, (299), 26 states have call successors, (26), 7 states have call predecessors, (26), 7 states have return successors, (26), 23 states have call predecessors, (26), 26 states have call successors, (26) [2025-02-05 10:40:51,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 351 transitions. [2025-02-05 10:40:51,447 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 351 transitions. Word has length 70 [2025-02-05 10:40:51,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:40:51,447 INFO L471 AbstractCegarLoop]: Abstraction has 260 states and 351 transitions. [2025-02-05 10:40:51,447 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-05 10:40:51,447 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 351 transitions. [2025-02-05 10:40:51,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-02-05 10:40:51,449 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:40:51,449 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 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] [2025-02-05 10:40:51,455 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-05 10:40:51,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:40:51,650 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:40:51,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:40:51,650 INFO L85 PathProgramCache]: Analyzing trace with hash 1625438621, now seen corresponding path program 1 times [2025-02-05 10:40:51,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:40:51,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528366064] [2025-02-05 10:40:51,650 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:40:51,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:40:51,863 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-02-05 10:40:51,867 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-02-05 10:40:51,867 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:40:51,867 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:40:51,961 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-02-05 10:40:51,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:40:51,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528366064] [2025-02-05 10:40:51,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528366064] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:40:51,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2126470310] [2025-02-05 10:40:51,962 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:40:51,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:40:51,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:40:51,967 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 10:40:51,974 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 10:40:52,263 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-02-05 10:40:52,334 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-02-05 10:40:52,334 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:40:52,334 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:40:52,337 INFO L256 TraceCheckSpWp]: Trace formula consists of 711 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 10:40:52,339 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:40:52,351 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-02-05 10:40:52,351 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 10:40:52,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2126470310] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:40:52,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 10:40:52,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-02-05 10:40:52,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002437731] [2025-02-05 10:40:52,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:40:52,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:40:52,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:40:52,353 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:40:52,353 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 10:40:52,353 INFO L87 Difference]: Start difference. First operand 260 states and 351 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-05 10:40:52,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:40:52,387 INFO L93 Difference]: Finished difference Result 495 states and 668 transitions. [2025-02-05 10:40:52,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:40:52,391 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 73 [2025-02-05 10:40:52,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:40:52,392 INFO L225 Difference]: With dead ends: 495 [2025-02-05 10:40:52,392 INFO L226 Difference]: Without dead ends: 267 [2025-02-05 10:40:52,393 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 10:40:52,393 INFO L435 NwaCegarLoop]: 343 mSDtfsCounter, 6 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 682 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 10:40:52,394 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 682 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:40:52,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2025-02-05 10:40:52,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 261. [2025-02-05 10:40:52,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 227 states have (on average 1.3215859030837005) internal successors, (300), 231 states have internal predecessors, (300), 26 states have call successors, (26), 7 states have call predecessors, (26), 7 states have return successors, (26), 23 states have call predecessors, (26), 26 states have call successors, (26) [2025-02-05 10:40:52,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 352 transitions. [2025-02-05 10:40:52,401 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 352 transitions. Word has length 73 [2025-02-05 10:40:52,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:40:52,401 INFO L471 AbstractCegarLoop]: Abstraction has 261 states and 352 transitions. [2025-02-05 10:40:52,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-05 10:40:52,402 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 352 transitions. [2025-02-05 10:40:52,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-02-05 10:40:52,403 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:40:52,403 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 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] [2025-02-05 10:40:52,417 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-05 10:40:52,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:40:52,604 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:40:52,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:40:52,605 INFO L85 PathProgramCache]: Analyzing trace with hash -1597748122, now seen corresponding path program 1 times [2025-02-05 10:40:52,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:40:52,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452429005] [2025-02-05 10:40:52,605 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:40:52,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:40:52,730 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-02-05 10:40:52,733 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-02-05 10:40:52,733 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:40:52,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:40:52,805 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-02-05 10:40:52,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:40:52,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452429005] [2025-02-05 10:40:52,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452429005] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:40:52,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1166234496] [2025-02-05 10:40:52,808 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:40:52,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:40:52,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:40:52,809 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 10:40:52,811 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 10:40:53,088 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-02-05 10:40:53,151 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-02-05 10:40:53,151 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:40:53,151 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:40:53,153 INFO L256 TraceCheckSpWp]: Trace formula consists of 715 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 10:40:53,155 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:40:53,166 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2025-02-05 10:40:53,167 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 10:40:53,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1166234496] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:40:53,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 10:40:53,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-02-05 10:40:53,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213023681] [2025-02-05 10:40:53,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:40:53,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:40:53,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:40:53,167 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:40:53,167 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 10:40:53,168 INFO L87 Difference]: Start difference. First operand 261 states and 352 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-05 10:40:53,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:40:53,194 INFO L93 Difference]: Finished difference Result 489 states and 659 transitions. [2025-02-05 10:40:53,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:40:53,195 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 76 [2025-02-05 10:40:53,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:40:53,196 INFO L225 Difference]: With dead ends: 489 [2025-02-05 10:40:53,196 INFO L226 Difference]: Without dead ends: 268 [2025-02-05 10:40:53,197 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 10:40:53,197 INFO L435 NwaCegarLoop]: 343 mSDtfsCounter, 6 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 682 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 10:40:53,197 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 682 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:40:53,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2025-02-05 10:40:53,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 262. [2025-02-05 10:40:53,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 228 states have (on average 1.3201754385964912) internal successors, (301), 232 states have internal predecessors, (301), 26 states have call successors, (26), 7 states have call predecessors, (26), 7 states have return successors, (26), 23 states have call predecessors, (26), 26 states have call successors, (26) [2025-02-05 10:40:53,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 353 transitions. [2025-02-05 10:40:53,204 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 353 transitions. Word has length 76 [2025-02-05 10:40:53,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:40:53,204 INFO L471 AbstractCegarLoop]: Abstraction has 262 states and 353 transitions. [2025-02-05 10:40:53,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-05 10:40:53,204 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 353 transitions. [2025-02-05 10:40:53,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-02-05 10:40:53,206 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:40:53,206 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 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] [2025-02-05 10:40:53,212 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-05 10:40:53,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:40:53,408 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:40:53,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:40:53,408 INFO L85 PathProgramCache]: Analyzing trace with hash -1536898621, now seen corresponding path program 1 times [2025-02-05 10:40:53,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:40:53,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110129106] [2025-02-05 10:40:53,408 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:40:53,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:40:53,536 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-02-05 10:40:53,542 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-02-05 10:40:53,542 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:40:53,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:40:53,605 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2025-02-05 10:40:53,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:40:53,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110129106] [2025-02-05 10:40:53,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110129106] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:40:53,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1295764231] [2025-02-05 10:40:53,605 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:40:53,606 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:40:53,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:40:53,607 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 10:40:53,612 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 10:40:53,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-02-05 10:40:53,961 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-02-05 10:40:53,961 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:40:53,961 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:40:53,963 INFO L256 TraceCheckSpWp]: Trace formula consists of 719 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 10:40:53,965 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:40:53,976 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-02-05 10:40:53,977 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 10:40:53,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1295764231] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:40:53,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 10:40:53,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-02-05 10:40:53,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840115787] [2025-02-05 10:40:53,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:40:53,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:40:53,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:40:53,978 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:40:53,979 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 10:40:53,979 INFO L87 Difference]: Start difference. First operand 262 states and 353 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-05 10:40:54,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:40:54,005 INFO L93 Difference]: Finished difference Result 479 states and 647 transitions. [2025-02-05 10:40:54,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:40:54,007 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 79 [2025-02-05 10:40:54,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:40:54,008 INFO L225 Difference]: With dead ends: 479 [2025-02-05 10:40:54,008 INFO L226 Difference]: Without dead ends: 269 [2025-02-05 10:40:54,009 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 10:40:54,009 INFO L435 NwaCegarLoop]: 343 mSDtfsCounter, 6 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 682 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 10:40:54,009 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 682 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:40:54,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2025-02-05 10:40:54,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 263. [2025-02-05 10:40:54,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 229 states have (on average 1.3187772925764192) internal successors, (302), 233 states have internal predecessors, (302), 26 states have call successors, (26), 7 states have call predecessors, (26), 7 states have return successors, (26), 23 states have call predecessors, (26), 26 states have call successors, (26) [2025-02-05 10:40:54,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 354 transitions. [2025-02-05 10:40:54,025 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 354 transitions. Word has length 79 [2025-02-05 10:40:54,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:40:54,025 INFO L471 AbstractCegarLoop]: Abstraction has 263 states and 354 transitions. [2025-02-05 10:40:54,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-05 10:40:54,025 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 354 transitions. [2025-02-05 10:40:54,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-02-05 10:40:54,027 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:40:54,027 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 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] [2025-02-05 10:40:54,036 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-05 10:40:54,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:40:54,228 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:40:54,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:40:54,228 INFO L85 PathProgramCache]: Analyzing trace with hash -571158080, now seen corresponding path program 1 times [2025-02-05 10:40:54,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:40:54,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013477091] [2025-02-05 10:40:54,228 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:40:54,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:40:54,376 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-02-05 10:40:54,379 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-02-05 10:40:54,379 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:40:54,379 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:40:54,469 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2025-02-05 10:40:54,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:40:54,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013477091] [2025-02-05 10:40:54,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1013477091] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:40:54,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1953422425] [2025-02-05 10:40:54,470 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:40:54,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:40:54,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:40:54,472 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 10:40:54,476 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-05 10:40:54,799 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-02-05 10:40:54,859 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-02-05 10:40:54,859 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:40:54,859 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:40:54,861 INFO L256 TraceCheckSpWp]: Trace formula consists of 723 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 10:40:54,864 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:40:54,872 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2025-02-05 10:40:54,872 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 10:40:54,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1953422425] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:40:54,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 10:40:54,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-02-05 10:40:54,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784977777] [2025-02-05 10:40:54,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:40:54,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:40:54,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:40:54,873 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:40:54,873 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 10:40:54,873 INFO L87 Difference]: Start difference. First operand 263 states and 354 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-02-05 10:40:54,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:40:54,961 INFO L93 Difference]: Finished difference Result 330 states and 460 transitions. [2025-02-05 10:40:54,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:40:54,962 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 82 [2025-02-05 10:40:54,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:40:54,963 INFO L225 Difference]: With dead ends: 330 [2025-02-05 10:40:54,963 INFO L226 Difference]: Without dead ends: 321 [2025-02-05 10:40:54,964 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 10:40:54,964 INFO L435 NwaCegarLoop]: 303 mSDtfsCounter, 93 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 604 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 10:40:54,964 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 604 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 10:40:54,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2025-02-05 10:40:54,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 264. [2025-02-05 10:40:54,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 230 states have (on average 1.317391304347826) internal successors, (303), 234 states have internal predecessors, (303), 26 states have call successors, (26), 7 states have call predecessors, (26), 7 states have return successors, (26), 23 states have call predecessors, (26), 26 states have call successors, (26) [2025-02-05 10:40:54,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 355 transitions. [2025-02-05 10:40:54,970 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 355 transitions. Word has length 82 [2025-02-05 10:40:54,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:40:54,971 INFO L471 AbstractCegarLoop]: Abstraction has 264 states and 355 transitions. [2025-02-05 10:40:54,971 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-02-05 10:40:54,971 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 355 transitions. [2025-02-05 10:40:54,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-02-05 10:40:54,972 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:40:54,972 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 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] [2025-02-05 10:40:54,979 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-05 10:40:55,172 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2025-02-05 10:40:55,172 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:40:55,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:40:55,173 INFO L85 PathProgramCache]: Analyzing trace with hash 2009509676, now seen corresponding path program 1 times [2025-02-05 10:40:55,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:40:55,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153725022] [2025-02-05 10:40:55,173 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:40:55,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:40:55,281 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-02-05 10:40:55,283 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-02-05 10:40:55,283 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:40:55,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:40:55,364 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2025-02-05 10:40:55,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:40:55,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153725022] [2025-02-05 10:40:55,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153725022] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:40:55,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [486850713] [2025-02-05 10:40:55,364 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:40:55,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:40:55,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:40:55,366 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 10:40:55,367 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-05 10:40:55,665 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-02-05 10:40:55,726 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-02-05 10:40:55,726 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:40:55,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:40:55,729 INFO L256 TraceCheckSpWp]: Trace formula consists of 750 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 10:40:55,731 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:40:55,749 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2025-02-05 10:40:55,749 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 10:40:55,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [486850713] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:40:55,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 10:40:55,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-02-05 10:40:55,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849927232] [2025-02-05 10:40:55,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:40:55,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 10:40:55,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:40:55,750 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 10:40:55,750 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 10:40:55,751 INFO L87 Difference]: Start difference. First operand 264 states and 355 transitions. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-02-05 10:40:55,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:40:55,775 INFO L93 Difference]: Finished difference Result 334 states and 465 transitions. [2025-02-05 10:40:55,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 10:40:55,776 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 92 [2025-02-05 10:40:55,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:40:55,780 INFO L225 Difference]: With dead ends: 334 [2025-02-05 10:40:55,780 INFO L226 Difference]: Without dead ends: 267 [2025-02-05 10:40:55,781 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 10:40:55,781 INFO L435 NwaCegarLoop]: 345 mSDtfsCounter, 1 mSDsluCounter, 680 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1025 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 10:40:55,781 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1025 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:40:55,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2025-02-05 10:40:55,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 266. [2025-02-05 10:40:55,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 232 states have (on average 1.3146551724137931) internal successors, (305), 236 states have internal predecessors, (305), 26 states have call successors, (26), 7 states have call predecessors, (26), 7 states have return successors, (26), 23 states have call predecessors, (26), 26 states have call successors, (26) [2025-02-05 10:40:55,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 357 transitions. [2025-02-05 10:40:55,792 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 357 transitions. Word has length 92 [2025-02-05 10:40:55,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:40:55,792 INFO L471 AbstractCegarLoop]: Abstraction has 266 states and 357 transitions. [2025-02-05 10:40:55,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-02-05 10:40:55,793 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 357 transitions. [2025-02-05 10:40:55,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-02-05 10:40:55,794 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:40:55,794 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 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] [2025-02-05 10:40:55,801 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-02-05 10:40:55,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:40:55,995 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:40:55,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:40:55,996 INFO L85 PathProgramCache]: Analyzing trace with hash 1503951051, now seen corresponding path program 1 times [2025-02-05 10:40:55,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:40:55,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311242071] [2025-02-05 10:40:55,996 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:40:55,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:40:56,118 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-02-05 10:40:56,121 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-02-05 10:40:56,121 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:40:56,121 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:40:56,183 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2025-02-05 10:40:56,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:40:56,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311242071] [2025-02-05 10:40:56,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311242071] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:40:56,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [544439178] [2025-02-05 10:40:56,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:40:56,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:40:56,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:40:56,190 INFO L229 MonitoredProcess]: Starting monitored process 9 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 10:40:56,192 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-05 10:40:56,518 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-02-05 10:40:56,578 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-02-05 10:40:56,579 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:40:56,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:40:56,582 INFO L256 TraceCheckSpWp]: Trace formula consists of 747 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 10:40:56,583 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:40:56,599 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2025-02-05 10:40:56,599 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 10:40:56,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [544439178] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:40:56,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 10:40:56,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-02-05 10:40:56,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723232009] [2025-02-05 10:40:56,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:40:56,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 10:40:56,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:40:56,600 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 10:40:56,600 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 10:40:56,601 INFO L87 Difference]: Start difference. First operand 266 states and 357 transitions. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-02-05 10:40:56,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:40:56,618 INFO L93 Difference]: Finished difference Result 338 states and 470 transitions. [2025-02-05 10:40:56,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 10:40:56,619 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 92 [2025-02-05 10:40:56,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:40:56,620 INFO L225 Difference]: With dead ends: 338 [2025-02-05 10:40:56,620 INFO L226 Difference]: Without dead ends: 269 [2025-02-05 10:40:56,620 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 10:40:56,621 INFO L435 NwaCegarLoop]: 345 mSDtfsCounter, 1 mSDsluCounter, 682 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1027 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 10:40:56,621 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1027 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:40:56,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2025-02-05 10:40:56,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 269. [2025-02-05 10:40:56,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 235 states have (on average 1.3106382978723403) internal successors, (308), 239 states have internal predecessors, (308), 26 states have call successors, (26), 7 states have call predecessors, (26), 7 states have return successors, (26), 23 states have call predecessors, (26), 26 states have call successors, (26) [2025-02-05 10:40:56,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 360 transitions. [2025-02-05 10:40:56,631 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 360 transitions. Word has length 92 [2025-02-05 10:40:56,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:40:56,631 INFO L471 AbstractCegarLoop]: Abstraction has 269 states and 360 transitions. [2025-02-05 10:40:56,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-02-05 10:40:56,631 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 360 transitions. [2025-02-05 10:40:56,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-02-05 10:40:56,632 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:40:56,632 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 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] [2025-02-05 10:40:56,647 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-02-05 10:40:56,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:40:56,837 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:40:56,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:40:56,837 INFO L85 PathProgramCache]: Analyzing trace with hash -1774923443, now seen corresponding path program 1 times [2025-02-05 10:40:56,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:40:56,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775167868] [2025-02-05 10:40:56,837 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:40:56,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:40:56,940 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-02-05 10:40:56,942 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-02-05 10:40:56,942 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:40:56,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:40:56,999 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2025-02-05 10:40:56,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:40:56,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775167868] [2025-02-05 10:40:56,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775167868] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:40:56,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1283202300] [2025-02-05 10:40:56,999 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:40:57,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:40:57,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:40:57,001 INFO L229 MonitoredProcess]: Starting monitored process 10 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 10:40:57,004 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-02-05 10:40:57,338 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-02-05 10:40:57,400 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-02-05 10:40:57,400 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:40:57,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:40:57,403 INFO L256 TraceCheckSpWp]: Trace formula consists of 753 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 10:40:57,405 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:40:57,422 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-02-05 10:40:57,422 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 10:40:57,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1283202300] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:40:57,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 10:40:57,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-02-05 10:40:57,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948287724] [2025-02-05 10:40:57,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:40:57,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:40:57,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:40:57,424 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:40:57,424 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 10:40:57,424 INFO L87 Difference]: Start difference. First operand 269 states and 360 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-02-05 10:40:57,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:40:57,434 INFO L93 Difference]: Finished difference Result 341 states and 471 transitions. [2025-02-05 10:40:57,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:40:57,434 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 92 [2025-02-05 10:40:57,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:40:57,436 INFO L225 Difference]: With dead ends: 341 [2025-02-05 10:40:57,436 INFO L226 Difference]: Without dead ends: 332 [2025-02-05 10:40:57,436 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 10:40:57,436 INFO L435 NwaCegarLoop]: 346 mSDtfsCounter, 83 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 690 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 10:40:57,437 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 690 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:40:57,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2025-02-05 10:40:57,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 331. [2025-02-05 10:40:57,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 331 states, 297 states have (on average 1.367003367003367) internal successors, (406), 301 states have internal predecessors, (406), 26 states have call successors, (26), 7 states have call predecessors, (26), 7 states have return successors, (26), 23 states have call predecessors, (26), 26 states have call successors, (26) [2025-02-05 10:40:57,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 458 transitions. [2025-02-05 10:40:57,443 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 458 transitions. Word has length 92 [2025-02-05 10:40:57,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:40:57,444 INFO L471 AbstractCegarLoop]: Abstraction has 331 states and 458 transitions. [2025-02-05 10:40:57,444 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-02-05 10:40:57,444 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 458 transitions. [2025-02-05 10:40:57,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-02-05 10:40:57,444 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:40:57,445 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1] [2025-02-05 10:40:57,452 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-02-05 10:40:57,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:40:57,649 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:40:57,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:40:57,650 INFO L85 PathProgramCache]: Analyzing trace with hash -355107272, now seen corresponding path program 1 times [2025-02-05 10:40:57,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:40:57,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545082707] [2025-02-05 10:40:57,650 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:40:57,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:40:57,780 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-02-05 10:40:57,782 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-02-05 10:40:57,782 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:40:57,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:40:57,846 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2025-02-05 10:40:57,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:40:57,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545082707] [2025-02-05 10:40:57,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545082707] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:40:57,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1131717943] [2025-02-05 10:40:57,847 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:40:57,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:40:57,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:40:57,849 INFO L229 MonitoredProcess]: Starting monitored process 11 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 10:40:57,851 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-02-05 10:40:58,250 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-02-05 10:40:58,325 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-02-05 10:40:58,326 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:40:58,326 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:40:58,329 INFO L256 TraceCheckSpWp]: Trace formula consists of 814 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 10:40:58,331 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:40:58,345 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2025-02-05 10:40:58,345 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 10:40:58,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1131717943] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:40:58,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 10:40:58,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-02-05 10:40:58,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004262739] [2025-02-05 10:40:58,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:40:58,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:40:58,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:40:58,347 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:40:58,347 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 10:40:58,347 INFO L87 Difference]: Start difference. First operand 331 states and 458 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-02-05 10:40:58,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:40:58,360 INFO L93 Difference]: Finished difference Result 405 states and 573 transitions. [2025-02-05 10:40:58,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:40:58,361 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 120 [2025-02-05 10:40:58,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:40:58,362 INFO L225 Difference]: With dead ends: 405 [2025-02-05 10:40:58,363 INFO L226 Difference]: Without dead ends: 333 [2025-02-05 10:40:58,364 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 10:40:58,364 INFO L435 NwaCegarLoop]: 347 mSDtfsCounter, 0 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 689 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 10:40:58,365 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 689 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:40:58,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2025-02-05 10:40:58,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 333. [2025-02-05 10:40:58,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 333 states, 299 states have (on average 1.3645484949832776) internal successors, (408), 303 states have internal predecessors, (408), 26 states have call successors, (26), 7 states have call predecessors, (26), 7 states have return successors, (26), 23 states have call predecessors, (26), 26 states have call successors, (26) [2025-02-05 10:40:58,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 460 transitions. [2025-02-05 10:40:58,378 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 460 transitions. Word has length 120 [2025-02-05 10:40:58,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:40:58,378 INFO L471 AbstractCegarLoop]: Abstraction has 333 states and 460 transitions. [2025-02-05 10:40:58,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-02-05 10:40:58,379 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 460 transitions. [2025-02-05 10:40:58,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-02-05 10:40:58,381 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:40:58,381 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1] [2025-02-05 10:40:58,391 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-02-05 10:40:58,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:40:58,586 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:40:58,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:40:58,587 INFO L85 PathProgramCache]: Analyzing trace with hash -484189991, now seen corresponding path program 1 times [2025-02-05 10:40:58,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:40:58,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072841354] [2025-02-05 10:40:58,587 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:40:58,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:40:58,724 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-02-05 10:40:58,726 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-02-05 10:40:58,727 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:40:58,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:40:58,797 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2025-02-05 10:40:58,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:40:58,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072841354] [2025-02-05 10:40:58,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072841354] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:40:58,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1296661565] [2025-02-05 10:40:58,797 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:40:58,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:40:58,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:40:58,804 INFO L229 MonitoredProcess]: Starting monitored process 12 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 10:40:58,813 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-02-05 10:40:59,147 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-02-05 10:40:59,251 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-02-05 10:40:59,251 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:40:59,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:40:59,254 INFO L256 TraceCheckSpWp]: Trace formula consists of 817 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 10:40:59,256 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:40:59,268 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2025-02-05 10:40:59,268 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 10:40:59,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1296661565] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:40:59,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 10:40:59,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-02-05 10:40:59,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377198282] [2025-02-05 10:40:59,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:40:59,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 10:40:59,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:40:59,269 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 10:40:59,271 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 10:40:59,271 INFO L87 Difference]: Start difference. First operand 333 states and 460 transitions. Second operand has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-02-05 10:40:59,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:40:59,290 INFO L93 Difference]: Finished difference Result 476 states and 682 transitions. [2025-02-05 10:40:59,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 10:40:59,291 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 120 [2025-02-05 10:40:59,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:40:59,292 INFO L225 Difference]: With dead ends: 476 [2025-02-05 10:40:59,293 INFO L226 Difference]: Without dead ends: 339 [2025-02-05 10:40:59,293 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 10:40:59,294 INFO L435 NwaCegarLoop]: 345 mSDtfsCounter, 1 mSDsluCounter, 682 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1027 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 10:40:59,294 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1027 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:40:59,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2025-02-05 10:40:59,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 339. [2025-02-05 10:40:59,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 339 states, 305 states have (on average 1.3573770491803279) internal successors, (414), 309 states have internal predecessors, (414), 26 states have call successors, (26), 7 states have call predecessors, (26), 7 states have return successors, (26), 23 states have call predecessors, (26), 26 states have call successors, (26) [2025-02-05 10:40:59,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 466 transitions. [2025-02-05 10:40:59,310 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 466 transitions. Word has length 120 [2025-02-05 10:40:59,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:40:59,310 INFO L471 AbstractCegarLoop]: Abstraction has 339 states and 466 transitions. [2025-02-05 10:40:59,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-02-05 10:40:59,310 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 466 transitions. [2025-02-05 10:40:59,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-02-05 10:40:59,311 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:40:59,311 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1] [2025-02-05 10:40:59,318 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-02-05 10:40:59,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-02-05 10:40:59,512 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:40:59,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:40:59,512 INFO L85 PathProgramCache]: Analyzing trace with hash 541302008, now seen corresponding path program 1 times [2025-02-05 10:40:59,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:40:59,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331567690] [2025-02-05 10:40:59,512 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:40:59,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:40:59,735 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-02-05 10:40:59,739 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-02-05 10:40:59,739 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:40:59,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:40:59,811 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2025-02-05 10:40:59,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:40:59,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331567690] [2025-02-05 10:40:59,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331567690] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:40:59,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [552398804] [2025-02-05 10:40:59,813 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:40:59,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:40:59,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:40:59,816 INFO L229 MonitoredProcess]: Starting monitored process 13 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 10:40:59,818 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-02-05 10:41:00,177 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-02-05 10:41:00,239 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-02-05 10:41:00,239 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:41:00,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:41:00,243 INFO L256 TraceCheckSpWp]: Trace formula consists of 814 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 10:41:00,245 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:41:00,260 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2025-02-05 10:41:00,260 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 10:41:00,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [552398804] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:41:00,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 10:41:00,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-02-05 10:41:00,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197701689] [2025-02-05 10:41:00,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:41:00,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 10:41:00,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:41:00,262 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 10:41:00,262 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 10:41:00,262 INFO L87 Difference]: Start difference. First operand 339 states and 466 transitions. Second operand has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-02-05 10:41:00,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:41:00,283 INFO L93 Difference]: Finished difference Result 488 states and 694 transitions. [2025-02-05 10:41:00,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 10:41:00,283 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 120 [2025-02-05 10:41:00,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:41:00,285 INFO L225 Difference]: With dead ends: 488 [2025-02-05 10:41:00,285 INFO L226 Difference]: Without dead ends: 345 [2025-02-05 10:41:00,285 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 10:41:00,285 INFO L435 NwaCegarLoop]: 345 mSDtfsCounter, 1 mSDsluCounter, 682 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1027 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 10:41:00,285 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1027 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:41:00,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2025-02-05 10:41:00,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 345. [2025-02-05 10:41:00,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 345 states, 311 states have (on average 1.3504823151125402) internal successors, (420), 315 states have internal predecessors, (420), 26 states have call successors, (26), 7 states have call predecessors, (26), 7 states have return successors, (26), 23 states have call predecessors, (26), 26 states have call successors, (26) [2025-02-05 10:41:00,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 472 transitions. [2025-02-05 10:41:00,296 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 472 transitions. Word has length 120 [2025-02-05 10:41:00,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:41:00,296 INFO L471 AbstractCegarLoop]: Abstraction has 345 states and 472 transitions. [2025-02-05 10:41:00,296 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-02-05 10:41:00,296 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 472 transitions. [2025-02-05 10:41:00,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-02-05 10:41:00,297 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:41:00,297 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1] [2025-02-05 10:41:00,305 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-02-05 10:41:00,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:41:00,498 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:41:00,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:41:00,499 INFO L85 PathProgramCache]: Analyzing trace with hash 572321815, now seen corresponding path program 1 times [2025-02-05 10:41:00,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:41:00,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203202112] [2025-02-05 10:41:00,499 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:41:00,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:41:00,650 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-02-05 10:41:00,652 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-02-05 10:41:00,653 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:41:00,653 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:41:00,702 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2025-02-05 10:41:00,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:41:00,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203202112] [2025-02-05 10:41:00,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203202112] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:41:00,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [362119046] [2025-02-05 10:41:00,702 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:41:00,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:41:00,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:41:00,706 INFO L229 MonitoredProcess]: Starting monitored process 14 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 10:41:00,713 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-02-05 10:41:01,077 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-02-05 10:41:01,139 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-02-05 10:41:01,139 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:41:01,139 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:41:01,143 INFO L256 TraceCheckSpWp]: Trace formula consists of 811 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 10:41:01,144 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:41:01,201 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-02-05 10:41:01,201 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 10:41:01,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [362119046] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:41:01,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 10:41:01,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-02-05 10:41:01,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124993074] [2025-02-05 10:41:01,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:41:01,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:41:01,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:41:01,202 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:41:01,202 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 10:41:01,202 INFO L87 Difference]: Start difference. First operand 345 states and 472 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-02-05 10:41:01,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:41:01,215 INFO L93 Difference]: Finished difference Result 494 states and 696 transitions. [2025-02-05 10:41:01,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:41:01,215 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 120 [2025-02-05 10:41:01,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:41:01,217 INFO L225 Difference]: With dead ends: 494 [2025-02-05 10:41:01,217 INFO L226 Difference]: Without dead ends: 485 [2025-02-05 10:41:01,217 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 10:41:01,217 INFO L435 NwaCegarLoop]: 347 mSDtfsCounter, 55 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 691 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 10:41:01,218 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 691 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:41:01,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2025-02-05 10:41:01,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 485. [2025-02-05 10:41:01,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 485 states, 451 states have (on average 1.401330376940133) internal successors, (632), 455 states have internal predecessors, (632), 26 states have call successors, (26), 7 states have call predecessors, (26), 7 states have return successors, (26), 23 states have call predecessors, (26), 26 states have call successors, (26) [2025-02-05 10:41:01,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 684 transitions. [2025-02-05 10:41:01,226 INFO L78 Accepts]: Start accepts. Automaton has 485 states and 684 transitions. Word has length 120 [2025-02-05 10:41:01,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:41:01,226 INFO L471 AbstractCegarLoop]: Abstraction has 485 states and 684 transitions. [2025-02-05 10:41:01,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-02-05 10:41:01,226 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 684 transitions. [2025-02-05 10:41:01,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-02-05 10:41:01,227 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:41:01,227 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 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, 1, 1, 1, 1] [2025-02-05 10:41:01,236 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-02-05 10:41:01,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:41:01,432 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:41:01,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:41:01,433 INFO L85 PathProgramCache]: Analyzing trace with hash 789065444, now seen corresponding path program 1 times [2025-02-05 10:41:01,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:41:01,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567635773] [2025-02-05 10:41:01,433 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:41:01,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:41:01,526 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-02-05 10:41:01,528 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-02-05 10:41:01,528 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:41:01,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:41:01,599 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2025-02-05 10:41:01,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:41:01,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567635773] [2025-02-05 10:41:01,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567635773] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:41:01,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [179994371] [2025-02-05 10:41:01,600 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:41:01,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:41:01,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:41:01,604 INFO L229 MonitoredProcess]: Starting monitored process 15 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 10:41:01,605 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-02-05 10:41:01,979 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-02-05 10:41:02,042 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-02-05 10:41:02,042 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:41:02,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:41:02,045 INFO L256 TraceCheckSpWp]: Trace formula consists of 841 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 10:41:02,047 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:41:02,100 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2025-02-05 10:41:02,100 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 10:41:02,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [179994371] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:41:02,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 10:41:02,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-02-05 10:41:02,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728795715] [2025-02-05 10:41:02,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:41:02,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:41:02,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:41:02,102 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:41:02,102 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 10:41:02,102 INFO L87 Difference]: Start difference. First operand 485 states and 684 transitions. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-02-05 10:41:02,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:41:02,112 INFO L93 Difference]: Finished difference Result 774 states and 1120 transitions. [2025-02-05 10:41:02,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:41:02,112 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 130 [2025-02-05 10:41:02,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:41:02,115 INFO L225 Difference]: With dead ends: 774 [2025-02-05 10:41:02,115 INFO L226 Difference]: Without dead ends: 765 [2025-02-05 10:41:02,115 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 10:41:02,115 INFO L435 NwaCegarLoop]: 346 mSDtfsCounter, 51 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 690 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 10:41:02,115 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 690 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:41:02,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 765 states. [2025-02-05 10:41:02,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 765 to 765. [2025-02-05 10:41:02,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 765 states, 731 states have (on average 1.4445964432284542) internal successors, (1056), 735 states have internal predecessors, (1056), 26 states have call successors, (26), 7 states have call predecessors, (26), 7 states have return successors, (26), 23 states have call predecessors, (26), 26 states have call successors, (26) [2025-02-05 10:41:02,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 765 states to 765 states and 1108 transitions. [2025-02-05 10:41:02,126 INFO L78 Accepts]: Start accepts. Automaton has 765 states and 1108 transitions. Word has length 130 [2025-02-05 10:41:02,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:41:02,126 INFO L471 AbstractCegarLoop]: Abstraction has 765 states and 1108 transitions. [2025-02-05 10:41:02,126 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-02-05 10:41:02,126 INFO L276 IsEmpty]: Start isEmpty. Operand 765 states and 1108 transitions. [2025-02-05 10:41:02,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-02-05 10:41:02,128 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:41:02,128 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 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] [2025-02-05 10:41:02,139 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-02-05 10:41:02,328 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-02-05 10:41:02,329 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:41:02,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:41:02,329 INFO L85 PathProgramCache]: Analyzing trace with hash -388951835, now seen corresponding path program 1 times [2025-02-05 10:41:02,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:41:02,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675299909] [2025-02-05 10:41:02,329 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:41:02,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:41:02,447 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-02-05 10:41:02,448 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-02-05 10:41:02,449 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:41:02,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:41:02,503 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2025-02-05 10:41:02,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:41:02,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675299909] [2025-02-05 10:41:02,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675299909] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:41:02,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1628554852] [2025-02-05 10:41:02,503 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:41:02,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:41:02,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:41:02,506 INFO L229 MonitoredProcess]: Starting monitored process 16 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 10:41:02,507 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-02-05 10:41:02,983 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-02-05 10:41:03,069 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-02-05 10:41:03,070 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:41:03,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:41:03,073 INFO L256 TraceCheckSpWp]: Trace formula consists of 897 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 10:41:03,078 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:41:03,172 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2025-02-05 10:41:03,173 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 10:41:03,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1628554852] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:41:03,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 10:41:03,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-02-05 10:41:03,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047577027] [2025-02-05 10:41:03,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:41:03,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:41:03,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:41:03,174 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:41:03,174 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 10:41:03,174 INFO L87 Difference]: Start difference. First operand 765 states and 1108 transitions. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-02-05 10:41:03,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:41:03,207 INFO L93 Difference]: Finished difference Result 1334 states and 1968 transitions. [2025-02-05 10:41:03,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:41:03,208 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 154 [2025-02-05 10:41:03,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:41:03,216 INFO L225 Difference]: With dead ends: 1334 [2025-02-05 10:41:03,216 INFO L226 Difference]: Without dead ends: 1325 [2025-02-05 10:41:03,216 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 10:41:03,217 INFO L435 NwaCegarLoop]: 346 mSDtfsCounter, 48 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 690 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 10:41:03,217 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 690 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:41:03,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1325 states. [2025-02-05 10:41:03,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1325 to 1325. [2025-02-05 10:41:03,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1325 states, 1291 states have (on average 1.474825716498838) internal successors, (1904), 1295 states have internal predecessors, (1904), 26 states have call successors, (26), 7 states have call predecessors, (26), 7 states have return successors, (26), 23 states have call predecessors, (26), 26 states have call successors, (26) [2025-02-05 10:41:03,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1325 states to 1325 states and 1956 transitions. [2025-02-05 10:41:03,272 INFO L78 Accepts]: Start accepts. Automaton has 1325 states and 1956 transitions. Word has length 154 [2025-02-05 10:41:03,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:41:03,272 INFO L471 AbstractCegarLoop]: Abstraction has 1325 states and 1956 transitions. [2025-02-05 10:41:03,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-02-05 10:41:03,272 INFO L276 IsEmpty]: Start isEmpty. Operand 1325 states and 1956 transitions. [2025-02-05 10:41:03,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-02-05 10:41:03,274 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:41:03,275 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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] [2025-02-05 10:41:03,291 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2025-02-05 10:41:03,480 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-02-05 10:41:03,480 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:41:03,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:41:03,480 INFO L85 PathProgramCache]: Analyzing trace with hash 290103724, now seen corresponding path program 1 times [2025-02-05 10:41:03,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:41:03,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169727331] [2025-02-05 10:41:03,481 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:41:03,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:41:03,609 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-02-05 10:41:03,612 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-02-05 10:41:03,612 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:41:03,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:41:03,672 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 143 trivial. 0 not checked. [2025-02-05 10:41:03,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:41:03,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169727331] [2025-02-05 10:41:03,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169727331] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:41:03,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [833266497] [2025-02-05 10:41:03,673 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:41:03,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:41:03,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:41:03,676 INFO L229 MonitoredProcess]: Starting monitored process 17 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 10:41:03,679 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-02-05 10:41:04,083 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-02-05 10:41:04,158 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-02-05 10:41:04,158 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:41:04,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:41:04,161 INFO L256 TraceCheckSpWp]: Trace formula consists of 936 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 10:41:04,163 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:41:04,274 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-02-05 10:41:04,275 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 10:41:04,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [833266497] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:41:04,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 10:41:04,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-02-05 10:41:04,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404899596] [2025-02-05 10:41:04,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:41:04,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:41:04,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:41:04,276 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:41:04,276 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 10:41:04,276 INFO L87 Difference]: Start difference. First operand 1325 states and 1956 transitions. Second operand has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-02-05 10:41:04,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:41:04,295 INFO L93 Difference]: Finished difference Result 2454 states and 3664 transitions. [2025-02-05 10:41:04,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:41:04,296 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 170 [2025-02-05 10:41:04,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:41:04,303 INFO L225 Difference]: With dead ends: 2454 [2025-02-05 10:41:04,303 INFO L226 Difference]: Without dead ends: 2445 [2025-02-05 10:41:04,304 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 10:41:04,305 INFO L435 NwaCegarLoop]: 346 mSDtfsCounter, 45 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 689 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 10:41:04,305 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 689 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:41:04,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2445 states. [2025-02-05 10:41:04,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2445 to 2445. [2025-02-05 10:41:04,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2445 states, 2411 states have (on average 1.4931563666528411) internal successors, (3600), 2415 states have internal predecessors, (3600), 26 states have call successors, (26), 7 states have call predecessors, (26), 7 states have return successors, (26), 23 states have call predecessors, (26), 26 states have call successors, (26) [2025-02-05 10:41:04,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2445 states to 2445 states and 3652 transitions. [2025-02-05 10:41:04,337 INFO L78 Accepts]: Start accepts. Automaton has 2445 states and 3652 transitions. Word has length 170 [2025-02-05 10:41:04,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:41:04,337 INFO L471 AbstractCegarLoop]: Abstraction has 2445 states and 3652 transitions. [2025-02-05 10:41:04,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-02-05 10:41:04,337 INFO L276 IsEmpty]: Start isEmpty. Operand 2445 states and 3652 transitions. [2025-02-05 10:41:04,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2025-02-05 10:41:04,340 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:41:04,341 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-02-05 10:41:04,348 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2025-02-05 10:41:04,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-02-05 10:41:04,542 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:41:04,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:41:04,543 INFO L85 PathProgramCache]: Analyzing trace with hash 1186272199, now seen corresponding path program 1 times [2025-02-05 10:41:04,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:41:04,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669811453] [2025-02-05 10:41:04,543 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:41:04,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:41:04,656 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 200 statements into 1 equivalence classes. [2025-02-05 10:41:04,659 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 200 of 200 statements. [2025-02-05 10:41:04,659 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:41:04,659 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:41:04,724 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2025-02-05 10:41:04,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:41:04,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669811453] [2025-02-05 10:41:04,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669811453] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:41:04,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2063971590] [2025-02-05 10:41:04,725 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:41:04,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:41:04,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:41:04,727 INFO L229 MonitoredProcess]: Starting monitored process 18 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 10:41:04,729 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-02-05 10:41:05,181 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 200 statements into 1 equivalence classes. [2025-02-05 10:41:05,267 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 200 of 200 statements. [2025-02-05 10:41:05,267 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:41:05,267 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:41:05,271 INFO L256 TraceCheckSpWp]: Trace formula consists of 1001 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 10:41:05,273 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:41:05,280 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2025-02-05 10:41:05,281 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 10:41:05,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2063971590] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:41:05,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 10:41:05,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-02-05 10:41:05,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819056822] [2025-02-05 10:41:05,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:41:05,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:41:05,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:41:05,282 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:41:05,282 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 10:41:05,282 INFO L87 Difference]: Start difference. First operand 2445 states and 3652 transitions. Second operand has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-02-05 10:41:05,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:41:05,301 INFO L93 Difference]: Finished difference Result 3606 states and 5424 transitions. [2025-02-05 10:41:05,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:41:05,302 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 200 [2025-02-05 10:41:05,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:41:05,308 INFO L225 Difference]: With dead ends: 3606 [2025-02-05 10:41:05,308 INFO L226 Difference]: Without dead ends: 2477 [2025-02-05 10:41:05,310 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 10:41:05,310 INFO L435 NwaCegarLoop]: 347 mSDtfsCounter, 0 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 689 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 10:41:05,311 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 689 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:41:05,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2477 states. [2025-02-05 10:41:05,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2477 to 2477. [2025-02-05 10:41:05,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2477 states, 2443 states have (on average 1.4866966844044207) internal successors, (3632), 2447 states have internal predecessors, (3632), 26 states have call successors, (26), 7 states have call predecessors, (26), 7 states have return successors, (26), 23 states have call predecessors, (26), 26 states have call successors, (26) [2025-02-05 10:41:05,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2477 states to 2477 states and 3684 transitions. [2025-02-05 10:41:05,341 INFO L78 Accepts]: Start accepts. Automaton has 2477 states and 3684 transitions. Word has length 200 [2025-02-05 10:41:05,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:41:05,341 INFO L471 AbstractCegarLoop]: Abstraction has 2477 states and 3684 transitions. [2025-02-05 10:41:05,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-02-05 10:41:05,341 INFO L276 IsEmpty]: Start isEmpty. Operand 2477 states and 3684 transitions. [2025-02-05 10:41:05,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2025-02-05 10:41:05,344 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:41:05,344 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-02-05 10:41:05,353 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2025-02-05 10:41:05,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-02-05 10:41:05,545 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:41:05,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:41:05,546 INFO L85 PathProgramCache]: Analyzing trace with hash 1558568488, now seen corresponding path program 1 times [2025-02-05 10:41:05,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:41:05,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762601757] [2025-02-05 10:41:05,546 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:41:05,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:41:05,704 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 200 statements into 1 equivalence classes. [2025-02-05 10:41:05,708 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 200 of 200 statements. [2025-02-05 10:41:05,708 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:41:05,708 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:41:05,773 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2025-02-05 10:41:05,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:41:05,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762601757] [2025-02-05 10:41:05,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762601757] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:41:05,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [182731900] [2025-02-05 10:41:05,774 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:41:05,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:41:05,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:41:05,775 INFO L229 MonitoredProcess]: Starting monitored process 19 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 10:41:05,777 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-02-05 10:41:06,211 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 200 statements into 1 equivalence classes. [2025-02-05 10:41:06,292 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 200 of 200 statements. [2025-02-05 10:41:06,293 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:41:06,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:41:06,296 INFO L256 TraceCheckSpWp]: Trace formula consists of 1004 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 10:41:06,299 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:41:06,418 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2025-02-05 10:41:06,419 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 10:41:06,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [182731900] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:41:06,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 10:41:06,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-02-05 10:41:06,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148219765] [2025-02-05 10:41:06,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:41:06,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:41:06,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:41:06,419 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:41:06,419 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 10:41:06,420 INFO L87 Difference]: Start difference. First operand 2477 states and 3684 transitions. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-02-05 10:41:06,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:41:06,444 INFO L93 Difference]: Finished difference Result 4758 states and 7120 transitions. [2025-02-05 10:41:06,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:41:06,445 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 200 [2025-02-05 10:41:06,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:41:06,457 INFO L225 Difference]: With dead ends: 4758 [2025-02-05 10:41:06,457 INFO L226 Difference]: Without dead ends: 4749 [2025-02-05 10:41:06,459 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 10:41:06,459 INFO L435 NwaCegarLoop]: 346 mSDtfsCounter, 43 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 690 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 10:41:06,459 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 690 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:41:06,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4749 states. [2025-02-05 10:41:06,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4749 to 4749. [2025-02-05 10:41:06,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4749 states, 4715 states have (on average 1.4965005302226935) internal successors, (7056), 4719 states have internal predecessors, (7056), 26 states have call successors, (26), 7 states have call predecessors, (26), 7 states have return successors, (26), 23 states have call predecessors, (26), 26 states have call successors, (26) [2025-02-05 10:41:06,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4749 states to 4749 states and 7108 transitions. [2025-02-05 10:41:06,517 INFO L78 Accepts]: Start accepts. Automaton has 4749 states and 7108 transitions. Word has length 200 [2025-02-05 10:41:06,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:41:06,517 INFO L471 AbstractCegarLoop]: Abstraction has 4749 states and 7108 transitions. [2025-02-05 10:41:06,517 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-02-05 10:41:06,518 INFO L276 IsEmpty]: Start isEmpty. Operand 4749 states and 7108 transitions. [2025-02-05 10:41:06,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2025-02-05 10:41:06,524 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:41:06,524 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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] [2025-02-05 10:41:06,534 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2025-02-05 10:41:06,724 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,19 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:41:06,725 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:41:06,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:41:06,726 INFO L85 PathProgramCache]: Analyzing trace with hash -546773065, now seen corresponding path program 1 times [2025-02-05 10:41:06,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:41:06,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214610587] [2025-02-05 10:41:06,726 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:41:06,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:41:06,881 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 252 statements into 1 equivalence classes. [2025-02-05 10:41:06,883 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 252 of 252 statements. [2025-02-05 10:41:06,883 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:41:06,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:41:06,965 INFO L134 CoverageAnalysis]: Checked inductivity of 344 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 343 trivial. 0 not checked. [2025-02-05 10:41:06,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:41:06,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214610587] [2025-02-05 10:41:06,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1214610587] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:41:06,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2027460996] [2025-02-05 10:41:06,966 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:41:06,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:41:06,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:41:06,968 INFO L229 MonitoredProcess]: Starting monitored process 20 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 10:41:06,969 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-02-05 10:41:07,450 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 252 statements into 1 equivalence classes. [2025-02-05 10:41:07,548 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 252 of 252 statements. [2025-02-05 10:41:07,549 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:41:07,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:41:07,553 INFO L256 TraceCheckSpWp]: Trace formula consists of 1130 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 10:41:07,555 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:41:07,712 INFO L134 CoverageAnalysis]: Checked inductivity of 344 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 344 trivial. 0 not checked. [2025-02-05 10:41:07,713 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 10:41:07,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2027460996] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:41:07,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 10:41:07,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-02-05 10:41:07,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431688962] [2025-02-05 10:41:07,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:41:07,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:41:07,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:41:07,714 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:41:07,714 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 10:41:07,714 INFO L87 Difference]: Start difference. First operand 4749 states and 7108 transitions. Second operand has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-02-05 10:41:07,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:41:07,743 INFO L93 Difference]: Finished difference Result 9302 states and 13968 transitions. [2025-02-05 10:41:07,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:41:07,743 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 252 [2025-02-05 10:41:07,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:41:07,773 INFO L225 Difference]: With dead ends: 9302 [2025-02-05 10:41:07,773 INFO L226 Difference]: Without dead ends: 9293 [2025-02-05 10:41:07,777 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 252 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 10:41:07,779 INFO L435 NwaCegarLoop]: 346 mSDtfsCounter, 27 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 689 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 10:41:07,779 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 689 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:41:07,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9293 states. [2025-02-05 10:41:07,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9293 to 9293. [2025-02-05 10:41:07,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9293 states, 9259 states have (on average 1.5016740468733125) internal successors, (13904), 9263 states have internal predecessors, (13904), 26 states have call successors, (26), 7 states have call predecessors, (26), 7 states have return successors, (26), 23 states have call predecessors, (26), 26 states have call successors, (26) [2025-02-05 10:41:07,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9293 states to 9293 states and 13956 transitions. [2025-02-05 10:41:07,901 INFO L78 Accepts]: Start accepts. Automaton has 9293 states and 13956 transitions. Word has length 252 [2025-02-05 10:41:07,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:41:07,902 INFO L471 AbstractCegarLoop]: Abstraction has 9293 states and 13956 transitions. [2025-02-05 10:41:07,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-02-05 10:41:07,902 INFO L276 IsEmpty]: Start isEmpty. Operand 9293 states and 13956 transitions. [2025-02-05 10:41:07,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2025-02-05 10:41:07,915 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:41:07,915 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-02-05 10:41:07,927 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2025-02-05 10:41:08,115 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,20 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:41:08,116 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:41:08,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:41:08,116 INFO L85 PathProgramCache]: Analyzing trace with hash -1280385270, now seen corresponding path program 1 times [2025-02-05 10:41:08,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:41:08,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077179922] [2025-02-05 10:41:08,117 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:41:08,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:41:08,315 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 296 statements into 1 equivalence classes. [2025-02-05 10:41:08,318 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 296 of 296 statements. [2025-02-05 10:41:08,318 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:41:08,318 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:41:08,456 INFO L134 CoverageAnalysis]: Checked inductivity of 507 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 506 trivial. 0 not checked. [2025-02-05 10:41:08,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:41:08,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077179922] [2025-02-05 10:41:08,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077179922] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:41:08,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1187304840] [2025-02-05 10:41:08,457 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:41:08,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:41:08,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:41:08,460 INFO L229 MonitoredProcess]: Starting monitored process 21 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 10:41:08,461 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2025-02-05 10:41:08,988 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 296 statements into 1 equivalence classes. [2025-02-05 10:41:09,098 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 296 of 296 statements. [2025-02-05 10:41:09,098 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:41:09,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:41:09,104 INFO L256 TraceCheckSpWp]: Trace formula consists of 1233 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 10:41:09,107 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:41:09,316 INFO L134 CoverageAnalysis]: Checked inductivity of 507 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 507 trivial. 0 not checked. [2025-02-05 10:41:09,316 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 10:41:09,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1187304840] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:41:09,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 10:41:09,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-02-05 10:41:09,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538254011] [2025-02-05 10:41:09,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:41:09,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:41:09,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:41:09,317 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:41:09,317 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 10:41:09,320 INFO L87 Difference]: Start difference. First operand 9293 states and 13956 transitions. Second operand has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-02-05 10:41:09,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:41:09,431 INFO L93 Difference]: Finished difference Result 18390 states and 27664 transitions. [2025-02-05 10:41:09,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:41:09,431 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 296 [2025-02-05 10:41:09,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:41:09,487 INFO L225 Difference]: With dead ends: 18390 [2025-02-05 10:41:09,487 INFO L226 Difference]: Without dead ends: 18381 [2025-02-05 10:41:09,499 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 296 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 10:41:09,504 INFO L435 NwaCegarLoop]: 346 mSDtfsCounter, 26 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 689 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 10:41:09,505 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 689 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:41:09,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18381 states. [2025-02-05 10:41:09,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18381 to 18381. [2025-02-05 10:41:09,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18381 states, 18347 states have (on average 1.5043331334823131) internal successors, (27600), 18351 states have internal predecessors, (27600), 26 states have call successors, (26), 7 states have call predecessors, (26), 7 states have return successors, (26), 23 states have call predecessors, (26), 26 states have call successors, (26) [2025-02-05 10:41:09,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18381 states to 18381 states and 27652 transitions. [2025-02-05 10:41:09,730 INFO L78 Accepts]: Start accepts. Automaton has 18381 states and 27652 transitions. Word has length 296 [2025-02-05 10:41:09,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:41:09,730 INFO L471 AbstractCegarLoop]: Abstraction has 18381 states and 27652 transitions. [2025-02-05 10:41:09,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-02-05 10:41:09,731 INFO L276 IsEmpty]: Start isEmpty. Operand 18381 states and 27652 transitions. [2025-02-05 10:41:09,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 355 [2025-02-05 10:41:09,757 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:41:09,757 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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] [2025-02-05 10:41:09,767 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2025-02-05 10:41:09,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,21 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:41:09,961 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:41:09,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:41:09,961 INFO L85 PathProgramCache]: Analyzing trace with hash 416556439, now seen corresponding path program 1 times [2025-02-05 10:41:09,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:41:09,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023322537] [2025-02-05 10:41:09,962 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:41:09,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:41:10,186 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 354 statements into 1 equivalence classes. [2025-02-05 10:41:10,189 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 354 of 354 statements. [2025-02-05 10:41:10,189 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:41:10,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:41:10,300 INFO L134 CoverageAnalysis]: Checked inductivity of 722 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 721 trivial. 0 not checked. [2025-02-05 10:41:10,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:41:10,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023322537] [2025-02-05 10:41:10,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023322537] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:41:10,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [447792930] [2025-02-05 10:41:10,301 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:41:10,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:41:10,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:41:10,303 INFO L229 MonitoredProcess]: Starting monitored process 22 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 10:41:10,311 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2025-02-05 10:41:10,847 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 354 statements into 1 equivalence classes. [2025-02-05 10:41:10,969 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 354 of 354 statements. [2025-02-05 10:41:10,970 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:41:10,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:41:10,975 INFO L256 TraceCheckSpWp]: Trace formula consists of 1377 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 10:41:10,978 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:41:10,993 INFO L134 CoverageAnalysis]: Checked inductivity of 722 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 721 trivial. 0 not checked. [2025-02-05 10:41:10,994 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 10:41:11,029 INFO L134 CoverageAnalysis]: Checked inductivity of 722 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 721 trivial. 0 not checked. [2025-02-05 10:41:11,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [447792930] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 10:41:11,030 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 10:41:11,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-02-05 10:41:11,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217624984] [2025-02-05 10:41:11,030 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 10:41:11,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 10:41:11,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:41:11,031 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 10:41:11,031 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-05 10:41:11,031 INFO L87 Difference]: Start difference. First operand 18381 states and 27652 transitions. Second operand has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 7 states have internal predecessors, (141), 1 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-02-05 10:41:11,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:41:11,117 INFO L93 Difference]: Finished difference Result 36761 states and 55305 transitions. [2025-02-05 10:41:11,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 10:41:11,118 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 7 states have internal predecessors, (141), 1 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 354 [2025-02-05 10:41:11,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:41:11,139 INFO L225 Difference]: With dead ends: 36761 [2025-02-05 10:41:11,139 INFO L226 Difference]: Without dead ends: 18384 [2025-02-05 10:41:11,156 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 710 GetRequests, 705 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-05 10:41:11,157 INFO L435 NwaCegarLoop]: 347 mSDtfsCounter, 0 mSDsluCounter, 1032 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1379 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 10:41:11,158 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1379 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:41:11,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18384 states. [2025-02-05 10:41:11,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18384 to 18384. [2025-02-05 10:41:11,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18384 states, 18350 states have (on average 1.50425068119891) internal successors, (27603), 18354 states have internal predecessors, (27603), 26 states have call successors, (26), 7 states have call predecessors, (26), 7 states have return successors, (26), 23 states have call predecessors, (26), 26 states have call successors, (26) [2025-02-05 10:41:11,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18384 states to 18384 states and 27655 transitions. [2025-02-05 10:41:11,460 INFO L78 Accepts]: Start accepts. Automaton has 18384 states and 27655 transitions. Word has length 354 [2025-02-05 10:41:11,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:41:11,463 INFO L471 AbstractCegarLoop]: Abstraction has 18384 states and 27655 transitions. [2025-02-05 10:41:11,463 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 7 states have internal predecessors, (141), 1 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-02-05 10:41:11,463 INFO L276 IsEmpty]: Start isEmpty. Operand 18384 states and 27655 transitions. [2025-02-05 10:41:11,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 358 [2025-02-05 10:41:11,517 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:41:11,517 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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] [2025-02-05 10:41:11,529 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2025-02-05 10:41:11,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2025-02-05 10:41:11,718 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:41:11,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:41:11,719 INFO L85 PathProgramCache]: Analyzing trace with hash -1001234875, now seen corresponding path program 2 times [2025-02-05 10:41:11,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:41:11,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577632213] [2025-02-05 10:41:11,719 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 10:41:11,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:41:11,869 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 357 statements into 2 equivalence classes. [2025-02-05 10:41:11,944 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 357 of 357 statements. [2025-02-05 10:41:11,948 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 10:41:11,948 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:41:12,075 INFO L134 CoverageAnalysis]: Checked inductivity of 731 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 712 trivial. 0 not checked. [2025-02-05 10:41:12,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:41:12,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577632213] [2025-02-05 10:41:12,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577632213] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:41:12,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [737122868] [2025-02-05 10:41:12,075 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 10:41:12,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:41:12,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:41:12,081 INFO L229 MonitoredProcess]: Starting monitored process 23 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 10:41:12,084 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2025-02-05 10:41:12,629 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 357 statements into 2 equivalence classes. [2025-02-05 10:41:15,565 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 357 of 357 statements. [2025-02-05 10:41:15,566 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 10:41:15,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:41:15,575 INFO L256 TraceCheckSpWp]: Trace formula consists of 1422 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-05 10:41:15,578 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:41:15,606 INFO L134 CoverageAnalysis]: Checked inductivity of 731 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 721 trivial. 0 not checked. [2025-02-05 10:41:15,607 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 10:41:15,672 INFO L134 CoverageAnalysis]: Checked inductivity of 731 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 721 trivial. 0 not checked. [2025-02-05 10:41:15,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [737122868] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 10:41:15,672 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 10:41:15,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7, 7] total 14 [2025-02-05 10:41:15,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757982246] [2025-02-05 10:41:15,672 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 10:41:15,673 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-05 10:41:15,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:41:15,673 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-05 10:41:15,673 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2025-02-05 10:41:15,674 INFO L87 Difference]: Start difference. First operand 18384 states and 27655 transitions. Second operand has 14 states, 14 states have (on average 10.857142857142858) internal successors, (152), 14 states have internal predecessors, (152), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) [2025-02-05 10:41:15,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:41:15,812 INFO L93 Difference]: Finished difference Result 36768 states and 55320 transitions. [2025-02-05 10:41:15,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-05 10:41:15,813 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 10.857142857142858) internal successors, (152), 14 states have internal predecessors, (152), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) Word has length 357 [2025-02-05 10:41:15,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:41:15,841 INFO L225 Difference]: With dead ends: 36768 [2025-02-05 10:41:15,841 INFO L226 Difference]: Without dead ends: 18391 [2025-02-05 10:41:15,856 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 716 GetRequests, 704 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2025-02-05 10:41:15,857 INFO L435 NwaCegarLoop]: 346 mSDtfsCounter, 0 mSDsluCounter, 1373 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1719 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 10:41:15,857 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1719 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:41:15,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18391 states. [2025-02-05 10:41:15,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18391 to 18391. [2025-02-05 10:41:16,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18391 states, 18357 states have (on average 1.5040583973416135) internal successors, (27610), 18361 states have internal predecessors, (27610), 26 states have call successors, (26), 7 states have call predecessors, (26), 7 states have return successors, (26), 23 states have call predecessors, (26), 26 states have call successors, (26) [2025-02-05 10:41:16,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18391 states to 18391 states and 27662 transitions. [2025-02-05 10:41:16,031 INFO L78 Accepts]: Start accepts. Automaton has 18391 states and 27662 transitions. Word has length 357 [2025-02-05 10:41:16,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:41:16,031 INFO L471 AbstractCegarLoop]: Abstraction has 18391 states and 27662 transitions. [2025-02-05 10:41:16,031 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 10.857142857142858) internal successors, (152), 14 states have internal predecessors, (152), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) [2025-02-05 10:41:16,031 INFO L276 IsEmpty]: Start isEmpty. Operand 18391 states and 27662 transitions. [2025-02-05 10:41:16,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 368 [2025-02-05 10:41:16,048 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:41:16,048 INFO L218 NwaCegarLoop]: trace histogram [10, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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] [2025-02-05 10:41:16,060 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2025-02-05 10:41:16,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-02-05 10:41:16,251 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:41:16,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:41:16,251 INFO L85 PathProgramCache]: Analyzing trace with hash 1973642057, now seen corresponding path program 3 times [2025-02-05 10:41:16,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:41:16,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999791954] [2025-02-05 10:41:16,251 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-05 10:41:16,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:41:16,390 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 367 statements into 9 equivalence classes. [2025-02-05 10:41:16,462 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 69 of 367 statements. [2025-02-05 10:41:16,462 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-02-05 10:41:16,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:41:16,979 INFO L134 CoverageAnalysis]: Checked inductivity of 814 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 812 trivial. 0 not checked. [2025-02-05 10:41:16,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:41:16,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999791954] [2025-02-05 10:41:16,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999791954] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:41:16,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:41:16,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 10:41:16,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206789173] [2025-02-05 10:41:16,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:41:16,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 10:41:16,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:41:16,980 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 10:41:16,981 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 10:41:16,981 INFO L87 Difference]: Start difference. First operand 18391 states and 27662 transitions. Second operand has 7 states, 7 states have (on average 18.857142857142858) internal successors, (132), 7 states have internal predecessors, (132), 2 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-05 10:41:21,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:41:21,550 INFO L93 Difference]: Finished difference Result 36724 states and 55260 transitions. [2025-02-05 10:41:21,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 10:41:21,551 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.857142857142858) internal successors, (132), 7 states have internal predecessors, (132), 2 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 367 [2025-02-05 10:41:21,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:41:21,574 INFO L225 Difference]: With dead ends: 36724 [2025-02-05 10:41:21,574 INFO L226 Difference]: Without dead ends: 18526 [2025-02-05 10:41:21,591 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-02-05 10:41:21,592 INFO L435 NwaCegarLoop]: 312 mSDtfsCounter, 340 mSDsluCounter, 1259 mSDsCounter, 0 mSdLazyCounter, 381 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 361 SdHoareTripleChecker+Valid, 1571 SdHoareTripleChecker+Invalid, 457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2025-02-05 10:41:21,592 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [361 Valid, 1571 Invalid, 457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 381 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2025-02-05 10:41:21,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18526 states. [2025-02-05 10:41:21,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18526 to 18487. [2025-02-05 10:41:21,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18487 states, 18438 states have (on average 1.5027117908666883) internal successors, (27707), 18446 states have internal predecessors, (27707), 41 states have call successors, (41), 7 states have call predecessors, (41), 7 states have return successors, (41), 35 states have call predecessors, (41), 41 states have call successors, (41) [2025-02-05 10:41:21,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18487 states to 18487 states and 27789 transitions. [2025-02-05 10:41:21,777 INFO L78 Accepts]: Start accepts. Automaton has 18487 states and 27789 transitions. Word has length 367 [2025-02-05 10:41:21,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:41:21,777 INFO L471 AbstractCegarLoop]: Abstraction has 18487 states and 27789 transitions. [2025-02-05 10:41:21,778 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.857142857142858) internal successors, (132), 7 states have internal predecessors, (132), 2 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-05 10:41:21,778 INFO L276 IsEmpty]: Start isEmpty. Operand 18487 states and 27789 transitions. [2025-02-05 10:41:21,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 392 [2025-02-05 10:41:21,792 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:41:21,793 INFO L218 NwaCegarLoop]: trace histogram [10, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:41:21,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-02-05 10:41:21,793 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:41:21,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:41:21,793 INFO L85 PathProgramCache]: Analyzing trace with hash -936774260, now seen corresponding path program 1 times [2025-02-05 10:41:21,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:41:21,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229552474] [2025-02-05 10:41:21,794 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:41:21,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:41:21,947 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 391 statements into 1 equivalence classes. [2025-02-05 10:41:21,957 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 391 of 391 statements. [2025-02-05 10:41:21,958 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:41:21,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:41:22,127 INFO L134 CoverageAnalysis]: Checked inductivity of 816 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 815 trivial. 0 not checked. [2025-02-05 10:41:22,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:41:22,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229552474] [2025-02-05 10:41:22,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229552474] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:41:22,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1649188734] [2025-02-05 10:41:22,128 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:41:22,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:41:22,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:41:22,130 INFO L229 MonitoredProcess]: Starting monitored process 24 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 10:41:22,135 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2025-02-05 10:41:22,935 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 391 statements into 1 equivalence classes. [2025-02-05 10:41:23,117 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 391 of 391 statements. [2025-02-05 10:41:23,118 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:41:23,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:41:23,124 INFO L256 TraceCheckSpWp]: Trace formula consists of 1829 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-05 10:41:23,129 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:41:23,270 INFO L134 CoverageAnalysis]: Checked inductivity of 816 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 761 trivial. 0 not checked. [2025-02-05 10:41:23,270 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 10:41:23,422 INFO L134 CoverageAnalysis]: Checked inductivity of 816 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 761 trivial. 0 not checked. [2025-02-05 10:41:23,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1649188734] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 10:41:23,422 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 10:41:23,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 13, 13] total 18 [2025-02-05 10:41:23,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865497233] [2025-02-05 10:41:23,422 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 10:41:23,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-02-05 10:41:23,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:41:23,423 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-02-05 10:41:23,424 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=181, Unknown=0, NotChecked=0, Total=306 [2025-02-05 10:41:23,424 INFO L87 Difference]: Start difference. First operand 18487 states and 27789 transitions. Second operand has 18 states, 18 states have (on average 10.38888888888889) internal successors, (187), 18 states have internal predecessors, (187), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-02-05 10:41:23,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:41:23,601 INFO L93 Difference]: Finished difference Result 36978 states and 55590 transitions. [2025-02-05 10:41:23,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-02-05 10:41:23,602 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 10.38888888888889) internal successors, (187), 18 states have internal predecessors, (187), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 391 [2025-02-05 10:41:23,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:41:23,623 INFO L225 Difference]: With dead ends: 36978 [2025-02-05 10:41:23,623 INFO L226 Difference]: Without dead ends: 18504 [2025-02-05 10:41:23,640 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 784 GetRequests, 760 SyntacticMatches, 8 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=125, Invalid=181, Unknown=0, NotChecked=0, Total=306 [2025-02-05 10:41:23,640 INFO L435 NwaCegarLoop]: 342 mSDtfsCounter, 10 mSDsluCounter, 2033 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 2375 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 10:41:23,641 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 2375 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 10:41:23,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18504 states. [2025-02-05 10:41:23,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18504 to 18498. [2025-02-05 10:41:23,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18498 states, 18448 states have (on average 1.5024934952298352) internal successors, (27718), 18456 states have internal predecessors, (27718), 42 states have call successors, (42), 7 states have call predecessors, (42), 7 states have return successors, (42), 36 states have call predecessors, (42), 42 states have call successors, (42) [2025-02-05 10:41:23,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18498 states to 18498 states and 27802 transitions. [2025-02-05 10:41:23,880 INFO L78 Accepts]: Start accepts. Automaton has 18498 states and 27802 transitions. Word has length 391 [2025-02-05 10:41:23,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:41:23,880 INFO L471 AbstractCegarLoop]: Abstraction has 18498 states and 27802 transitions. [2025-02-05 10:41:23,880 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 10.38888888888889) internal successors, (187), 18 states have internal predecessors, (187), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-02-05 10:41:23,880 INFO L276 IsEmpty]: Start isEmpty. Operand 18498 states and 27802 transitions. [2025-02-05 10:41:23,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 399 [2025-02-05 10:41:23,900 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:41:23,901 INFO L218 NwaCegarLoop]: trace histogram [14, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:41:23,914 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2025-02-05 10:41:24,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2025-02-05 10:41:24,105 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:41:24,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:41:24,105 INFO L85 PathProgramCache]: Analyzing trace with hash -173955719, now seen corresponding path program 2 times [2025-02-05 10:41:24,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:41:24,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056526556] [2025-02-05 10:41:24,106 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 10:41:24,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:41:24,282 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 398 statements into 2 equivalence classes. [2025-02-05 10:41:24,310 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 398 of 398 statements. [2025-02-05 10:41:24,310 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 10:41:24,310 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:41:24,460 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 869 trivial. 0 not checked. [2025-02-05 10:41:24,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:41:24,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056526556] [2025-02-05 10:41:24,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056526556] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:41:24,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1138696598] [2025-02-05 10:41:24,461 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 10:41:24,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:41:24,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:41:24,463 INFO L229 MonitoredProcess]: Starting monitored process 25 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 10:41:24,468 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2025-02-05 10:41:25,203 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 398 statements into 2 equivalence classes. [2025-02-05 10:41:26,295 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 398 of 398 statements. [2025-02-05 10:41:26,295 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 10:41:26,295 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:41:26,304 INFO L256 TraceCheckSpWp]: Trace formula consists of 1893 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-05 10:41:26,308 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:41:26,337 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 862 trivial. 0 not checked. [2025-02-05 10:41:26,337 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 10:41:26,391 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 865 trivial. 0 not checked. [2025-02-05 10:41:26,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1138696598] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 10:41:26,391 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 10:41:26,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 10 [2025-02-05 10:41:26,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538399565] [2025-02-05 10:41:26,392 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 10:41:26,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 10:41:26,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:41:26,393 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 10:41:26,393 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-02-05 10:41:26,393 INFO L87 Difference]: Start difference. First operand 18498 states and 27802 transitions. Second operand has 10 states, 10 states have (on average 17.9) internal successors, (179), 10 states have internal predecessors, (179), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-02-05 10:41:26,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:41:26,568 INFO L93 Difference]: Finished difference Result 36991 states and 55605 transitions. [2025-02-05 10:41:26,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-05 10:41:26,569 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 17.9) internal successors, (179), 10 states have internal predecessors, (179), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 398 [2025-02-05 10:41:26,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:41:26,587 INFO L225 Difference]: With dead ends: 36991 [2025-02-05 10:41:26,587 INFO L226 Difference]: Without dead ends: 18539 [2025-02-05 10:41:26,602 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 798 GetRequests, 790 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-02-05 10:41:26,603 INFO L435 NwaCegarLoop]: 342 mSDtfsCounter, 47 mSDsluCounter, 1694 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 2036 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 10:41:26,603 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 2036 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 10:41:26,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18539 states. [2025-02-05 10:41:26,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18539 to 18533. [2025-02-05 10:41:26,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18533 states, 18478 states have (on average 1.5019482627990042) internal successors, (27753), 18486 states have internal predecessors, (27753), 47 states have call successors, (47), 7 states have call predecessors, (47), 7 states have return successors, (47), 41 states have call predecessors, (47), 47 states have call successors, (47) [2025-02-05 10:41:26,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18533 states to 18533 states and 27847 transitions. [2025-02-05 10:41:26,765 INFO L78 Accepts]: Start accepts. Automaton has 18533 states and 27847 transitions. Word has length 398 [2025-02-05 10:41:26,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:41:26,765 INFO L471 AbstractCegarLoop]: Abstraction has 18533 states and 27847 transitions. [2025-02-05 10:41:26,765 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 17.9) internal successors, (179), 10 states have internal predecessors, (179), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-02-05 10:41:26,765 INFO L276 IsEmpty]: Start isEmpty. Operand 18533 states and 27847 transitions. [2025-02-05 10:41:26,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 414 [2025-02-05 10:41:26,780 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:41:26,780 INFO L218 NwaCegarLoop]: trace histogram [14, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1] [2025-02-05 10:41:26,791 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2025-02-05 10:41:26,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-02-05 10:41:26,981 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:41:26,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:41:26,982 INFO L85 PathProgramCache]: Analyzing trace with hash -660587534, now seen corresponding path program 3 times [2025-02-05 10:41:26,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:41:26,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307676444] [2025-02-05 10:41:26,983 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-05 10:41:26,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:41:27,178 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 413 statements into 9 equivalence classes. [2025-02-05 10:41:27,331 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 93 of 413 statements. [2025-02-05 10:41:27,331 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-02-05 10:41:27,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:41:28,382 INFO L134 CoverageAnalysis]: Checked inductivity of 920 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 916 trivial. 0 not checked. [2025-02-05 10:41:28,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:41:28,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307676444] [2025-02-05 10:41:28,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307676444] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:41:28,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:41:28,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 10:41:28,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612593819] [2025-02-05 10:41:28,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:41:28,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 10:41:28,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:41:28,384 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 10:41:28,384 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 10:41:28,384 INFO L87 Difference]: Start difference. First operand 18533 states and 27847 transitions. Second operand has 7 states, 7 states have (on average 22.0) internal successors, (154), 7 states have internal predecessors, (154), 3 states have call successors, (7), 1 states have call predecessors, (7), 2 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2025-02-05 10:41:32,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:41:32,435 INFO L93 Difference]: Finished difference Result 37131 states and 55794 transitions. [2025-02-05 10:41:32,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 10:41:32,436 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 22.0) internal successors, (154), 7 states have internal predecessors, (154), 3 states have call successors, (7), 1 states have call predecessors, (7), 2 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) Word has length 413 [2025-02-05 10:41:32,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:41:32,467 INFO L225 Difference]: With dead ends: 37131 [2025-02-05 10:41:32,468 INFO L226 Difference]: Without dead ends: 18714 [2025-02-05 10:41:32,486 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-02-05 10:41:32,486 INFO L435 NwaCegarLoop]: 348 mSDtfsCounter, 160 mSDsluCounter, 1422 mSDsCounter, 0 mSdLazyCounter, 434 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 1770 SdHoareTripleChecker+Invalid, 455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 434 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2025-02-05 10:41:32,487 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 1770 Invalid, 455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 434 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2025-02-05 10:41:32,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18714 states. [2025-02-05 10:41:32,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18714 to 18616. [2025-02-05 10:41:32,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18616 states, 18548 states have (on average 1.5008087125296528) internal successors, (27837), 18560 states have internal predecessors, (27837), 60 states have call successors, (60), 7 states have call predecessors, (60), 7 states have return successors, (60), 51 states have call predecessors, (60), 60 states have call successors, (60) [2025-02-05 10:41:32,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18616 states to 18616 states and 27957 transitions. [2025-02-05 10:41:32,673 INFO L78 Accepts]: Start accepts. Automaton has 18616 states and 27957 transitions. Word has length 413 [2025-02-05 10:41:32,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:41:32,673 INFO L471 AbstractCegarLoop]: Abstraction has 18616 states and 27957 transitions. [2025-02-05 10:41:32,674 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.0) internal successors, (154), 7 states have internal predecessors, (154), 3 states have call successors, (7), 1 states have call predecessors, (7), 2 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2025-02-05 10:41:32,674 INFO L276 IsEmpty]: Start isEmpty. Operand 18616 states and 27957 transitions. [2025-02-05 10:41:32,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 434 [2025-02-05 10:41:32,690 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:41:32,690 INFO L218 NwaCegarLoop]: trace histogram [14, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:41:32,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-02-05 10:41:32,690 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:41:32,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:41:32,691 INFO L85 PathProgramCache]: Analyzing trace with hash -1846975065, now seen corresponding path program 1 times [2025-02-05 10:41:32,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:41:32,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675463440] [2025-02-05 10:41:32,691 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:41:32,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:41:32,918 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 433 statements into 1 equivalence classes. [2025-02-05 10:41:32,931 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 433 of 433 statements. [2025-02-05 10:41:32,932 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:41:32,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:41:33,081 INFO L134 CoverageAnalysis]: Checked inductivity of 933 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 932 trivial. 0 not checked. [2025-02-05 10:41:33,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:41:33,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675463440] [2025-02-05 10:41:33,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675463440] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:41:33,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1005032382] [2025-02-05 10:41:33,082 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:41:33,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:41:33,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:41:33,084 INFO L229 MonitoredProcess]: Starting monitored process 26 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 10:41:33,086 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2025-02-05 10:41:33,801 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 433 statements into 1 equivalence classes. [2025-02-05 10:41:33,978 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 433 of 433 statements. [2025-02-05 10:41:33,978 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:41:33,978 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:41:33,985 INFO L256 TraceCheckSpWp]: Trace formula consists of 2089 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-05 10:41:33,990 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:41:34,045 INFO L134 CoverageAnalysis]: Checked inductivity of 933 backedges. 3 proven. 51 refuted. 0 times theorem prover too weak. 879 trivial. 0 not checked. [2025-02-05 10:41:34,046 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 10:41:34,168 INFO L134 CoverageAnalysis]: Checked inductivity of 933 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 882 trivial. 0 not checked. [2025-02-05 10:41:34,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1005032382] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 10:41:34,168 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 10:41:34,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 9, 9] total 18 [2025-02-05 10:41:34,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221913793] [2025-02-05 10:41:34,169 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 10:41:34,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-02-05 10:41:34,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:41:34,170 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-02-05 10:41:34,170 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=181, Unknown=0, NotChecked=0, Total=306 [2025-02-05 10:41:34,170 INFO L87 Difference]: Start difference. First operand 18616 states and 27957 transitions. Second operand has 18 states, 18 states have (on average 12.055555555555555) internal successors, (217), 18 states have internal predecessors, (217), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-02-05 10:41:34,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:41:34,446 INFO L93 Difference]: Finished difference Result 37227 states and 55919 transitions. [2025-02-05 10:41:34,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-02-05 10:41:34,447 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 12.055555555555555) internal successors, (217), 18 states have internal predecessors, (217), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 433 [2025-02-05 10:41:34,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:41:34,471 INFO L225 Difference]: With dead ends: 37227 [2025-02-05 10:41:34,471 INFO L226 Difference]: Without dead ends: 18685 [2025-02-05 10:41:34,486 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 868 GetRequests, 852 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=125, Invalid=181, Unknown=0, NotChecked=0, Total=306 [2025-02-05 10:41:34,486 INFO L435 NwaCegarLoop]: 345 mSDtfsCounter, 109 mSDsluCounter, 2393 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 2738 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 10:41:34,486 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 2738 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 10:41:34,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18685 states. [2025-02-05 10:41:34,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18685 to 18679. [2025-02-05 10:41:34,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18679 states, 18602 states have (on average 1.4998387270186002) internal successors, (27900), 18614 states have internal predecessors, (27900), 69 states have call successors, (69), 7 states have call predecessors, (69), 7 states have return successors, (69), 60 states have call predecessors, (69), 69 states have call successors, (69) [2025-02-05 10:41:34,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18679 states to 18679 states and 28038 transitions. [2025-02-05 10:41:34,749 INFO L78 Accepts]: Start accepts. Automaton has 18679 states and 28038 transitions. Word has length 433 [2025-02-05 10:41:34,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:41:34,749 INFO L471 AbstractCegarLoop]: Abstraction has 18679 states and 28038 transitions. [2025-02-05 10:41:34,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 12.055555555555555) internal successors, (217), 18 states have internal predecessors, (217), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-02-05 10:41:34,750 INFO L276 IsEmpty]: Start isEmpty. Operand 18679 states and 28038 transitions. [2025-02-05 10:41:34,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 461 [2025-02-05 10:41:34,770 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:41:34,771 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 14, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1] [2025-02-05 10:41:34,781 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2025-02-05 10:41:34,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-02-05 10:41:34,972 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:41:34,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:41:34,972 INFO L85 PathProgramCache]: Analyzing trace with hash -1665226476, now seen corresponding path program 2 times [2025-02-05 10:41:34,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:41:34,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385524721] [2025-02-05 10:41:34,973 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 10:41:34,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:41:35,195 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 460 statements into 2 equivalence classes. [2025-02-05 10:41:35,219 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 460 of 460 statements. [2025-02-05 10:41:35,220 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 10:41:35,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:41:35,391 INFO L134 CoverageAnalysis]: Checked inductivity of 1173 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1172 trivial. 0 not checked. [2025-02-05 10:41:35,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:41:35,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385524721] [2025-02-05 10:41:35,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385524721] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:41:35,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [990084891] [2025-02-05 10:41:35,392 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 10:41:35,392 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:41:35,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:41:35,393 INFO L229 MonitoredProcess]: Starting monitored process 27 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 10:41:35,396 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2025-02-05 10:41:36,202 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 460 statements into 2 equivalence classes. [2025-02-05 10:41:37,830 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 460 of 460 statements. [2025-02-05 10:41:37,830 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 10:41:37,830 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:41:37,839 INFO L256 TraceCheckSpWp]: Trace formula consists of 2125 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-05 10:41:37,844 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:41:37,864 INFO L134 CoverageAnalysis]: Checked inductivity of 1173 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 1165 trivial. 0 not checked. [2025-02-05 10:41:37,864 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 10:41:37,912 INFO L134 CoverageAnalysis]: Checked inductivity of 1173 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1168 trivial. 0 not checked. [2025-02-05 10:41:37,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [990084891] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 10:41:37,912 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 10:41:37,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 10 [2025-02-05 10:41:37,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892107200] [2025-02-05 10:41:37,912 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 10:41:37,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 10:41:37,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:41:37,913 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 10:41:37,914 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-02-05 10:41:37,914 INFO L87 Difference]: Start difference. First operand 18679 states and 28038 transitions. Second operand has 10 states, 10 states have (on average 19.3) internal successors, (193), 10 states have internal predecessors, (193), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-02-05 10:41:38,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:41:38,075 INFO L93 Difference]: Finished difference Result 37254 states and 55949 transitions. [2025-02-05 10:41:38,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-05 10:41:38,076 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 19.3) internal successors, (193), 10 states have internal predecessors, (193), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 460 [2025-02-05 10:41:38,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:41:38,094 INFO L225 Difference]: With dead ends: 37254 [2025-02-05 10:41:38,095 INFO L226 Difference]: Without dead ends: 18720 [2025-02-05 10:41:38,108 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 922 GetRequests, 914 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-02-05 10:41:38,109 INFO L435 NwaCegarLoop]: 341 mSDtfsCounter, 67 mSDsluCounter, 680 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 1021 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 10:41:38,109 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 1021 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 10:41:38,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18720 states. [2025-02-05 10:41:38,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18720 to 18714. [2025-02-05 10:41:38,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18714 states, 18632 states have (on average 1.4993022756547874) internal successors, (27935), 18644 states have internal predecessors, (27935), 74 states have call successors, (74), 7 states have call predecessors, (74), 7 states have return successors, (74), 65 states have call predecessors, (74), 74 states have call successors, (74) [2025-02-05 10:41:38,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18714 states to 18714 states and 28083 transitions. [2025-02-05 10:41:38,323 INFO L78 Accepts]: Start accepts. Automaton has 18714 states and 28083 transitions. Word has length 460 [2025-02-05 10:41:38,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:41:38,323 INFO L471 AbstractCegarLoop]: Abstraction has 18714 states and 28083 transitions. [2025-02-05 10:41:38,324 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 19.3) internal successors, (193), 10 states have internal predecessors, (193), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-02-05 10:41:38,324 INFO L276 IsEmpty]: Start isEmpty. Operand 18714 states and 28083 transitions. [2025-02-05 10:41:38,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 476 [2025-02-05 10:41:38,338 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:41:38,339 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 14, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1] [2025-02-05 10:41:38,353 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Ended with exit code 0 [2025-02-05 10:41:38,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-02-05 10:41:38,539 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:41:38,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:41:38,540 INFO L85 PathProgramCache]: Analyzing trace with hash -2084418163, now seen corresponding path program 3 times [2025-02-05 10:41:38,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:41:38,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663553767] [2025-02-05 10:41:38,540 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-05 10:41:38,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:41:38,691 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 475 statements into 16 equivalence classes. [2025-02-05 10:41:39,790 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 145 of 475 statements. [2025-02-05 10:41:39,790 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-02-05 10:41:39,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:41:39,911 INFO L134 CoverageAnalysis]: Checked inductivity of 1223 backedges. 82 proven. 2 refuted. 0 times theorem prover too weak. 1139 trivial. 0 not checked. [2025-02-05 10:41:39,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:41:39,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663553767] [2025-02-05 10:41:39,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663553767] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:41:39,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [176643473] [2025-02-05 10:41:39,913 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-05 10:41:39,913 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:41:39,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:41:39,914 INFO L229 MonitoredProcess]: Starting monitored process 28 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 10:41:39,922 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2025-02-05 10:41:40,731 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 475 statements into 16 equivalence classes. [2025-02-05 10:41:53,330 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 145 of 475 statements. [2025-02-05 10:41:53,330 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-02-05 10:41:53,330 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:41:53,350 INFO L256 TraceCheckSpWp]: Trace formula consists of 1228 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-05 10:41:53,356 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:41:53,394 INFO L134 CoverageAnalysis]: Checked inductivity of 1223 backedges. 82 proven. 2 refuted. 0 times theorem prover too weak. 1139 trivial. 0 not checked. [2025-02-05 10:41:53,395 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 10:41:53,442 INFO L134 CoverageAnalysis]: Checked inductivity of 1223 backedges. 82 proven. 2 refuted. 0 times theorem prover too weak. 1139 trivial. 0 not checked. [2025-02-05 10:41:53,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [176643473] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 10:41:53,442 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 10:41:53,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2025-02-05 10:41:53,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772801767] [2025-02-05 10:41:53,442 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 10:41:53,443 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 10:41:53,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:41:53,443 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 10:41:53,443 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-05 10:41:53,443 INFO L87 Difference]: Start difference. First operand 18714 states and 28083 transitions. Second operand has 7 states, 7 states have (on average 25.714285714285715) internal successors, (180), 7 states have internal predecessors, (180), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-02-05 10:41:53,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:41:53,696 INFO L93 Difference]: Finished difference Result 23395 states and 35071 transitions. [2025-02-05 10:41:53,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 10:41:53,696 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 25.714285714285715) internal successors, (180), 7 states have internal predecessors, (180), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 475 [2025-02-05 10:41:53,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:41:53,721 INFO L225 Difference]: With dead ends: 23395 [2025-02-05 10:41:53,721 INFO L226 Difference]: Without dead ends: 23386 [2025-02-05 10:41:53,727 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 957 GetRequests, 949 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2025-02-05 10:41:53,728 INFO L435 NwaCegarLoop]: 351 mSDtfsCounter, 686 mSDsluCounter, 600 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 686 SdHoareTripleChecker+Valid, 951 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 10:41:53,728 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [686 Valid, 951 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 10:41:53,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23386 states. [2025-02-05 10:41:53,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23386 to 14170. [2025-02-05 10:41:53,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14170 states, 14088 states have (on average 1.4968057921635434) internal successors, (21087), 14100 states have internal predecessors, (21087), 74 states have call successors, (74), 7 states have call predecessors, (74), 7 states have return successors, (74), 65 states have call predecessors, (74), 74 states have call successors, (74) [2025-02-05 10:41:53,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14170 states to 14170 states and 21235 transitions. [2025-02-05 10:41:53,893 INFO L78 Accepts]: Start accepts. Automaton has 14170 states and 21235 transitions. Word has length 475 [2025-02-05 10:41:53,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:41:53,894 INFO L471 AbstractCegarLoop]: Abstraction has 14170 states and 21235 transitions. [2025-02-05 10:41:53,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.714285714285715) internal successors, (180), 7 states have internal predecessors, (180), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-02-05 10:41:53,894 INFO L276 IsEmpty]: Start isEmpty. Operand 14170 states and 21235 transitions. [2025-02-05 10:41:53,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 476 [2025-02-05 10:41:53,905 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:41:53,906 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 14, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1] [2025-02-05 10:41:53,932 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2025-02-05 10:41:54,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,28 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:41:54,107 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:41:54,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:41:54,107 INFO L85 PathProgramCache]: Analyzing trace with hash 1780584525, now seen corresponding path program 4 times [2025-02-05 10:41:54,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:41:54,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586779383] [2025-02-05 10:41:54,108 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-05 10:41:54,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:41:54,271 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 475 statements into 2 equivalence classes. [2025-02-05 10:41:54,302 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 475 of 475 statements. [2025-02-05 10:41:54,302 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-05 10:41:54,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:41:54,576 INFO L134 CoverageAnalysis]: Checked inductivity of 1223 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 1172 trivial. 0 not checked. [2025-02-05 10:41:54,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:41:54,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586779383] [2025-02-05 10:41:54,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586779383] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:41:54,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1250327686] [2025-02-05 10:41:54,577 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-05 10:41:54,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:41:54,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:41:54,580 INFO L229 MonitoredProcess]: Starting monitored process 29 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 10:41:54,580 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2025-02-05 10:41:55,393 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 475 statements into 2 equivalence classes. [2025-02-05 10:41:55,911 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 475 of 475 statements. [2025-02-05 10:41:55,911 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-05 10:41:55,911 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:41:55,923 INFO L256 TraceCheckSpWp]: Trace formula consists of 2145 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-05 10:41:55,931 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:41:55,968 INFO L134 CoverageAnalysis]: Checked inductivity of 1223 backedges. 3 proven. 51 refuted. 0 times theorem prover too weak. 1169 trivial. 0 not checked. [2025-02-05 10:41:55,971 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 10:41:56,147 INFO L134 CoverageAnalysis]: Checked inductivity of 1223 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 1172 trivial. 0 not checked. [2025-02-05 10:41:56,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1250327686] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 10:41:56,147 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 10:41:56,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2025-02-05 10:41:56,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879699557] [2025-02-05 10:41:56,147 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 10:41:56,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-02-05 10:41:56,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:41:56,149 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-05 10:41:56,149 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2025-02-05 10:41:56,149 INFO L87 Difference]: Start difference. First operand 14170 states and 21235 transitions. Second operand has 16 states, 16 states have (on average 12.75) internal successors, (204), 16 states have internal predecessors, (204), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-02-05 10:41:56,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:41:56,363 INFO L93 Difference]: Finished difference Result 28223 states and 42329 transitions. [2025-02-05 10:41:56,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-05 10:41:56,364 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 12.75) internal successors, (204), 16 states have internal predecessors, (204), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 475 [2025-02-05 10:41:56,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:41:56,379 INFO L225 Difference]: With dead ends: 28223 [2025-02-05 10:41:56,379 INFO L226 Difference]: Without dead ends: 14226 [2025-02-05 10:41:56,393 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 957 GetRequests, 943 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2025-02-05 10:41:56,394 INFO L435 NwaCegarLoop]: 352 mSDtfsCounter, 89 mSDsluCounter, 1718 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 2070 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 10:41:56,394 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 2070 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 10:41:56,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14226 states. [2025-02-05 10:41:56,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14226 to 14226. [2025-02-05 10:41:56,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14226 states, 14136 states have (on average 1.4956847764572723) internal successors, (21143), 14148 states have internal predecessors, (21143), 82 states have call successors, (82), 7 states have call predecessors, (82), 7 states have return successors, (82), 73 states have call predecessors, (82), 82 states have call successors, (82) [2025-02-05 10:41:56,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14226 states to 14226 states and 21307 transitions. [2025-02-05 10:41:56,526 INFO L78 Accepts]: Start accepts. Automaton has 14226 states and 21307 transitions. Word has length 475 [2025-02-05 10:41:56,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:41:56,527 INFO L471 AbstractCegarLoop]: Abstraction has 14226 states and 21307 transitions. [2025-02-05 10:41:56,527 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 12.75) internal successors, (204), 16 states have internal predecessors, (204), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-02-05 10:41:56,527 INFO L276 IsEmpty]: Start isEmpty. Operand 14226 states and 21307 transitions. [2025-02-05 10:41:56,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 500 [2025-02-05 10:41:56,539 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:41:56,539 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1] [2025-02-05 10:41:56,555 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Ended with exit code 0 [2025-02-05 10:41:56,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,29 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:41:56,744 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:41:56,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:41:56,745 INFO L85 PathProgramCache]: Analyzing trace with hash 403491533, now seen corresponding path program 5 times [2025-02-05 10:41:56,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:41:56,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208360761] [2025-02-05 10:41:56,745 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-05 10:41:56,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:41:56,929 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 499 statements into 16 equivalence classes. [2025-02-05 10:41:56,932 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) and asserted 106 of 499 statements. [2025-02-05 10:41:56,935 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2025-02-05 10:41:56,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:41:57,027 INFO L134 CoverageAnalysis]: Checked inductivity of 1459 backedges. 208 proven. 0 refuted. 0 times theorem prover too weak. 1251 trivial. 0 not checked. [2025-02-05 10:41:57,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:41:57,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208360761] [2025-02-05 10:41:57,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208360761] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:41:57,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:41:57,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 10:41:57,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165986948] [2025-02-05 10:41:57,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:41:57,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 10:41:57,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:41:57,031 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 10:41:57,031 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 10:41:57,031 INFO L87 Difference]: Start difference. First operand 14226 states and 21307 transitions. Second operand has 5 states, 5 states have (on average 41.8) internal successors, (209), 5 states have internal predecessors, (209), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-02-05 10:41:57,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:41:57,234 INFO L93 Difference]: Finished difference Result 30747 states and 46279 transitions. [2025-02-05 10:41:57,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 10:41:57,234 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 41.8) internal successors, (209), 5 states have internal predecessors, (209), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 499 [2025-02-05 10:41:57,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:41:57,250 INFO L225 Difference]: With dead ends: 30747 [2025-02-05 10:41:57,251 INFO L226 Difference]: Without dead ends: 17106 [2025-02-05 10:41:57,263 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-05 10:41:57,264 INFO L435 NwaCegarLoop]: 336 mSDtfsCounter, 30 mSDsluCounter, 624 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 960 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 10:41:57,264 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 960 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 10:41:57,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17106 states. [2025-02-05 10:41:57,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17106 to 15762. [2025-02-05 10:41:57,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15762 states, 15672 states have (on average 1.496107708014293) internal successors, (23447), 15684 states have internal predecessors, (23447), 82 states have call successors, (82), 7 states have call predecessors, (82), 7 states have return successors, (82), 73 states have call predecessors, (82), 82 states have call successors, (82) [2025-02-05 10:41:57,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15762 states to 15762 states and 23611 transitions. [2025-02-05 10:41:57,561 INFO L78 Accepts]: Start accepts. Automaton has 15762 states and 23611 transitions. Word has length 499 [2025-02-05 10:41:57,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:41:57,566 INFO L471 AbstractCegarLoop]: Abstraction has 15762 states and 23611 transitions. [2025-02-05 10:41:57,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 41.8) internal successors, (209), 5 states have internal predecessors, (209), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-02-05 10:41:57,566 INFO L276 IsEmpty]: Start isEmpty. Operand 15762 states and 23611 transitions. [2025-02-05 10:41:57,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 500 [2025-02-05 10:41:57,600 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:41:57,601 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1] [2025-02-05 10:41:57,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-02-05 10:41:57,601 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:41:57,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:41:57,601 INFO L85 PathProgramCache]: Analyzing trace with hash 1304559468, now seen corresponding path program 1 times [2025-02-05 10:41:57,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:41:57,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152060260] [2025-02-05 10:41:57,601 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:41:57,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:41:57,766 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 499 statements into 1 equivalence classes. [2025-02-05 10:41:57,783 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 499 of 499 statements. [2025-02-05 10:41:57,783 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:41:57,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:41:58,181 INFO L134 CoverageAnalysis]: Checked inductivity of 1459 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 1388 trivial. 0 not checked. [2025-02-05 10:41:58,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:41:58,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152060260] [2025-02-05 10:41:58,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152060260] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:41:58,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:41:58,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 10:41:58,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230612357] [2025-02-05 10:41:58,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:41:58,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 10:41:58,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:41:58,182 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 10:41:58,182 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-05 10:41:58,183 INFO L87 Difference]: Start difference. First operand 15762 states and 23611 transitions. Second operand has 8 states, 8 states have (on average 21.25) internal successors, (170), 8 states have internal predecessors, (170), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-02-05 10:41:58,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:41:58,708 INFO L93 Difference]: Finished difference Result 76123 states and 114339 transitions. [2025-02-05 10:41:58,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-05 10:41:58,709 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 21.25) internal successors, (170), 8 states have internal predecessors, (170), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 499 [2025-02-05 10:41:58,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:41:58,763 INFO L225 Difference]: With dead ends: 76123 [2025-02-05 10:41:58,763 INFO L226 Difference]: Without dead ends: 60946 [2025-02-05 10:41:58,783 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2025-02-05 10:41:58,784 INFO L435 NwaCegarLoop]: 325 mSDtfsCounter, 578 mSDsluCounter, 1507 mSDsCounter, 0 mSdLazyCounter, 412 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 584 SdHoareTripleChecker+Valid, 1832 SdHoareTripleChecker+Invalid, 414 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 10:41:58,784 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [584 Valid, 1832 Invalid, 414 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 412 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 10:41:58,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60946 states. [2025-02-05 10:41:59,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60946 to 18258. [2025-02-05 10:41:59,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18258 states, 18168 states have (on average 1.4702223690004403) internal successors, (26711), 18180 states have internal predecessors, (26711), 82 states have call successors, (82), 7 states have call predecessors, (82), 7 states have return successors, (82), 73 states have call predecessors, (82), 82 states have call successors, (82) [2025-02-05 10:41:59,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18258 states to 18258 states and 26875 transitions. [2025-02-05 10:41:59,076 INFO L78 Accepts]: Start accepts. Automaton has 18258 states and 26875 transitions. Word has length 499 [2025-02-05 10:41:59,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:41:59,076 INFO L471 AbstractCegarLoop]: Abstraction has 18258 states and 26875 transitions. [2025-02-05 10:41:59,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 21.25) internal successors, (170), 8 states have internal predecessors, (170), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-02-05 10:41:59,077 INFO L276 IsEmpty]: Start isEmpty. Operand 18258 states and 26875 transitions. [2025-02-05 10:41:59,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 500 [2025-02-05 10:41:59,090 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:41:59,091 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1] [2025-02-05 10:41:59,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-02-05 10:41:59,091 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:41:59,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:41:59,091 INFO L85 PathProgramCache]: Analyzing trace with hash 766973061, now seen corresponding path program 1 times [2025-02-05 10:41:59,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:41:59,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779371429] [2025-02-05 10:41:59,092 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:41:59,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:41:59,253 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 499 statements into 1 equivalence classes. [2025-02-05 10:41:59,292 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 499 of 499 statements. [2025-02-05 10:41:59,293 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:41:59,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:41:59,844 INFO L134 CoverageAnalysis]: Checked inductivity of 1459 backedges. 145 proven. 0 refuted. 0 times theorem prover too weak. 1314 trivial. 0 not checked. [2025-02-05 10:41:59,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:41:59,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779371429] [2025-02-05 10:41:59,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779371429] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:41:59,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:41:59,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 10:41:59,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397007828] [2025-02-05 10:41:59,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:41:59,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 10:41:59,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:41:59,846 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 10:41:59,846 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-05 10:41:59,846 INFO L87 Difference]: Start difference. First operand 18258 states and 26875 transitions. Second operand has 8 states, 8 states have (on average 23.0) internal successors, (184), 8 states have internal predecessors, (184), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-02-05 10:42:00,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:42:00,471 INFO L93 Difference]: Finished difference Result 78619 states and 117219 transitions. [2025-02-05 10:42:00,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-05 10:42:00,472 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 23.0) internal successors, (184), 8 states have internal predecessors, (184), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 499 [2025-02-05 10:42:00,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:42:00,534 INFO L225 Difference]: With dead ends: 78619 [2025-02-05 10:42:00,534 INFO L226 Difference]: Without dead ends: 60946 [2025-02-05 10:42:00,565 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2025-02-05 10:42:00,565 INFO L435 NwaCegarLoop]: 326 mSDtfsCounter, 381 mSDsluCounter, 1825 mSDsCounter, 0 mSdLazyCounter, 472 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 387 SdHoareTripleChecker+Valid, 2151 SdHoareTripleChecker+Invalid, 474 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 472 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 10:42:00,566 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [387 Valid, 2151 Invalid, 474 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 472 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 10:42:00,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60946 states. [2025-02-05 10:42:00,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60946 to 22098. [2025-02-05 10:42:01,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22098 states, 22008 states have (on average 1.4579698291530352) internal successors, (32087), 22020 states have internal predecessors, (32087), 82 states have call successors, (82), 7 states have call predecessors, (82), 7 states have return successors, (82), 73 states have call predecessors, (82), 82 states have call successors, (82) [2025-02-05 10:42:01,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22098 states to 22098 states and 32251 transitions. [2025-02-05 10:42:01,038 INFO L78 Accepts]: Start accepts. Automaton has 22098 states and 32251 transitions. Word has length 499 [2025-02-05 10:42:01,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:42:01,038 INFO L471 AbstractCegarLoop]: Abstraction has 22098 states and 32251 transitions. [2025-02-05 10:42:01,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 23.0) internal successors, (184), 8 states have internal predecessors, (184), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-02-05 10:42:01,038 INFO L276 IsEmpty]: Start isEmpty. Operand 22098 states and 32251 transitions. [2025-02-05 10:42:01,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 500 [2025-02-05 10:42:01,055 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:42:01,055 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1] [2025-02-05 10:42:01,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-02-05 10:42:01,055 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:42:01,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:42:01,055 INFO L85 PathProgramCache]: Analyzing trace with hash 1728504032, now seen corresponding path program 1 times [2025-02-05 10:42:01,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:42:01,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667920614] [2025-02-05 10:42:01,056 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:42:01,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:42:01,213 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 499 statements into 1 equivalence classes. [2025-02-05 10:42:01,261 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 499 of 499 statements. [2025-02-05 10:42:01,261 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:42:01,261 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:42:01,411 INFO L134 CoverageAnalysis]: Checked inductivity of 1459 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 1307 trivial. 0 not checked. [2025-02-05 10:42:01,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:42:01,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667920614] [2025-02-05 10:42:01,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667920614] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:42:01,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:42:01,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 10:42:01,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588881455] [2025-02-05 10:42:01,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:42:01,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 10:42:01,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:42:01,413 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 10:42:01,413 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 10:42:01,413 INFO L87 Difference]: Start difference. First operand 22098 states and 32251 transitions. Second operand has 4 states, 4 states have (on average 46.25) internal successors, (185), 4 states have internal predecessors, (185), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-02-05 10:42:01,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:42:01,592 INFO L93 Difference]: Finished difference Result 44187 states and 64519 transitions. [2025-02-05 10:42:01,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 10:42:01,592 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 46.25) internal successors, (185), 4 states have internal predecessors, (185), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 499 [2025-02-05 10:42:01,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:42:01,607 INFO L225 Difference]: With dead ends: 44187 [2025-02-05 10:42:01,607 INFO L226 Difference]: Without dead ends: 22674 [2025-02-05 10:42:01,613 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 10:42:01,614 INFO L435 NwaCegarLoop]: 345 mSDtfsCounter, 1 mSDsluCounter, 680 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1025 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 10:42:01,614 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1025 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:42:01,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22674 states. [2025-02-05 10:42:01,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22674 to 22482. [2025-02-05 10:42:01,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22482 states, 22392 states have (on average 1.4501161128974633) internal successors, (32471), 22404 states have internal predecessors, (32471), 82 states have call successors, (82), 7 states have call predecessors, (82), 7 states have return successors, (82), 73 states have call predecessors, (82), 82 states have call successors, (82) [2025-02-05 10:42:01,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22482 states to 22482 states and 32635 transitions. [2025-02-05 10:42:01,793 INFO L78 Accepts]: Start accepts. Automaton has 22482 states and 32635 transitions. Word has length 499 [2025-02-05 10:42:01,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:42:01,793 INFO L471 AbstractCegarLoop]: Abstraction has 22482 states and 32635 transitions. [2025-02-05 10:42:01,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 46.25) internal successors, (185), 4 states have internal predecessors, (185), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-02-05 10:42:01,793 INFO L276 IsEmpty]: Start isEmpty. Operand 22482 states and 32635 transitions. [2025-02-05 10:42:01,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 500 [2025-02-05 10:42:01,810 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:42:01,811 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1] [2025-02-05 10:42:01,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-02-05 10:42:01,811 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:42:01,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:42:01,811 INFO L85 PathProgramCache]: Analyzing trace with hash -1425799173, now seen corresponding path program 1 times [2025-02-05 10:42:01,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:42:01,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409770728] [2025-02-05 10:42:01,812 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:42:01,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:42:01,964 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 499 statements into 1 equivalence classes. [2025-02-05 10:42:02,000 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 499 of 499 statements. [2025-02-05 10:42:02,000 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:42:02,000 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:42:02,162 INFO L134 CoverageAnalysis]: Checked inductivity of 1459 backedges. 208 proven. 0 refuted. 0 times theorem prover too weak. 1251 trivial. 0 not checked. [2025-02-05 10:42:02,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:42:02,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409770728] [2025-02-05 10:42:02,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409770728] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:42:02,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:42:02,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 10:42:02,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971896128] [2025-02-05 10:42:02,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:42:02,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 10:42:02,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:42:02,163 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 10:42:02,163 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 10:42:02,163 INFO L87 Difference]: Start difference. First operand 22482 states and 32635 transitions. Second operand has 4 states, 4 states have (on average 52.25) internal successors, (209), 4 states have internal predecessors, (209), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-02-05 10:42:02,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:42:02,263 INFO L93 Difference]: Finished difference Result 44955 states and 65287 transitions. [2025-02-05 10:42:02,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 10:42:02,263 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 52.25) internal successors, (209), 4 states have internal predecessors, (209), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 499 [2025-02-05 10:42:02,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:42:02,286 INFO L225 Difference]: With dead ends: 44955 [2025-02-05 10:42:02,286 INFO L226 Difference]: Without dead ends: 23058 [2025-02-05 10:42:02,303 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 10:42:02,303 INFO L435 NwaCegarLoop]: 345 mSDtfsCounter, 1 mSDsluCounter, 680 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1025 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 10:42:02,303 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1025 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:42:02,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23058 states. [2025-02-05 10:42:02,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23058 to 22866. [2025-02-05 10:42:02,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22866 states, 22776 states have (on average 1.4425272216368106) internal successors, (32855), 22788 states have internal predecessors, (32855), 82 states have call successors, (82), 7 states have call predecessors, (82), 7 states have return successors, (82), 73 states have call predecessors, (82), 82 states have call successors, (82) [2025-02-05 10:42:02,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22866 states to 22866 states and 33019 transitions. [2025-02-05 10:42:02,502 INFO L78 Accepts]: Start accepts. Automaton has 22866 states and 33019 transitions. Word has length 499 [2025-02-05 10:42:02,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:42:02,502 INFO L471 AbstractCegarLoop]: Abstraction has 22866 states and 33019 transitions. [2025-02-05 10:42:02,502 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 52.25) internal successors, (209), 4 states have internal predecessors, (209), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-02-05 10:42:02,502 INFO L276 IsEmpty]: Start isEmpty. Operand 22866 states and 33019 transitions. [2025-02-05 10:42:02,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 500 [2025-02-05 10:42:02,520 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:42:02,520 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1] [2025-02-05 10:42:02,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-02-05 10:42:02,520 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:42:02,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:42:02,520 INFO L85 PathProgramCache]: Analyzing trace with hash 1533794394, now seen corresponding path program 1 times [2025-02-05 10:42:02,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:42:02,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041183976] [2025-02-05 10:42:02,521 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:42:02,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:42:02,685 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 499 statements into 1 equivalence classes. [2025-02-05 10:42:02,721 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 499 of 499 statements. [2025-02-05 10:42:02,721 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:42:02,721 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:42:02,927 INFO L134 CoverageAnalysis]: Checked inductivity of 1459 backedges. 208 proven. 0 refuted. 0 times theorem prover too weak. 1251 trivial. 0 not checked. [2025-02-05 10:42:02,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:42:02,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041183976] [2025-02-05 10:42:02,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041183976] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:42:02,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:42:02,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 10:42:02,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647566704] [2025-02-05 10:42:02,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:42:02,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 10:42:02,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:42:02,929 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 10:42:02,929 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 10:42:02,929 INFO L87 Difference]: Start difference. First operand 22866 states and 33019 transitions. Second operand has 4 states, 4 states have (on average 52.25) internal successors, (209), 4 states have internal predecessors, (209), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-02-05 10:42:03,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:42:03,026 INFO L93 Difference]: Finished difference Result 45723 states and 66247 transitions. [2025-02-05 10:42:03,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 10:42:03,027 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 52.25) internal successors, (209), 4 states have internal predecessors, (209), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 499 [2025-02-05 10:42:03,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:42:03,047 INFO L225 Difference]: With dead ends: 45723 [2025-02-05 10:42:03,047 INFO L226 Difference]: Without dead ends: 23442 [2025-02-05 10:42:03,064 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 10:42:03,064 INFO L435 NwaCegarLoop]: 345 mSDtfsCounter, 1 mSDsluCounter, 682 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1027 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 10:42:03,064 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1027 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:42:03,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23442 states. [2025-02-05 10:42:03,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23442 to 23442. [2025-02-05 10:42:03,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23442 states, 23352 states have (on average 1.4316118533744433) internal successors, (33431), 23364 states have internal predecessors, (33431), 82 states have call successors, (82), 7 states have call predecessors, (82), 7 states have return successors, (82), 73 states have call predecessors, (82), 82 states have call successors, (82) [2025-02-05 10:42:03,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23442 states to 23442 states and 33595 transitions. [2025-02-05 10:42:03,263 INFO L78 Accepts]: Start accepts. Automaton has 23442 states and 33595 transitions. Word has length 499 [2025-02-05 10:42:03,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:42:03,263 INFO L471 AbstractCegarLoop]: Abstraction has 23442 states and 33595 transitions. [2025-02-05 10:42:03,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 52.25) internal successors, (209), 4 states have internal predecessors, (209), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-02-05 10:42:03,263 INFO L276 IsEmpty]: Start isEmpty. Operand 23442 states and 33595 transitions. [2025-02-05 10:42:03,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 500 [2025-02-05 10:42:03,285 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:42:03,285 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1] [2025-02-05 10:42:03,285 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-02-05 10:42:03,285 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:42:03,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:42:03,286 INFO L85 PathProgramCache]: Analyzing trace with hash -188191621, now seen corresponding path program 1 times [2025-02-05 10:42:03,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:42:03,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627204650] [2025-02-05 10:42:03,286 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:42:03,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:42:03,440 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 499 statements into 1 equivalence classes. [2025-02-05 10:42:03,476 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 499 of 499 statements. [2025-02-05 10:42:03,476 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:42:03,476 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:42:03,624 INFO L134 CoverageAnalysis]: Checked inductivity of 1459 backedges. 328 proven. 0 refuted. 0 times theorem prover too weak. 1131 trivial. 0 not checked. [2025-02-05 10:42:03,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:42:03,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627204650] [2025-02-05 10:42:03,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627204650] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:42:03,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:42:03,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 10:42:03,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759152717] [2025-02-05 10:42:03,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:42:03,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 10:42:03,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:42:03,625 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 10:42:03,625 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 10:42:03,625 INFO L87 Difference]: Start difference. First operand 23442 states and 33595 transitions. Second operand has 4 states, 4 states have (on average 52.25) internal successors, (209), 4 states have internal predecessors, (209), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-02-05 10:42:03,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:42:03,721 INFO L93 Difference]: Finished difference Result 46491 states and 66631 transitions. [2025-02-05 10:42:03,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 10:42:03,721 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 52.25) internal successors, (209), 4 states have internal predecessors, (209), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 499 [2025-02-05 10:42:03,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:42:03,743 INFO L225 Difference]: With dead ends: 46491 [2025-02-05 10:42:03,743 INFO L226 Difference]: Without dead ends: 23634 [2025-02-05 10:42:03,762 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 10:42:03,762 INFO L435 NwaCegarLoop]: 348 mSDtfsCounter, 0 mSDsluCounter, 682 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1030 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 10:42:03,762 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1030 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:42:03,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23634 states. [2025-02-05 10:42:03,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23634 to 23442. [2025-02-05 10:42:03,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23442 states, 23352 states have (on average 1.4233898595409387) internal successors, (33239), 23364 states have internal predecessors, (33239), 82 states have call successors, (82), 7 states have call predecessors, (82), 7 states have return successors, (82), 73 states have call predecessors, (82), 82 states have call successors, (82) [2025-02-05 10:42:03,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23442 states to 23442 states and 33403 transitions. [2025-02-05 10:42:03,961 INFO L78 Accepts]: Start accepts. Automaton has 23442 states and 33403 transitions. Word has length 499 [2025-02-05 10:42:03,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:42:03,961 INFO L471 AbstractCegarLoop]: Abstraction has 23442 states and 33403 transitions. [2025-02-05 10:42:03,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 52.25) internal successors, (209), 4 states have internal predecessors, (209), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-02-05 10:42:03,962 INFO L276 IsEmpty]: Start isEmpty. Operand 23442 states and 33403 transitions. [2025-02-05 10:42:03,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 500 [2025-02-05 10:42:03,979 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:42:03,979 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1] [2025-02-05 10:42:03,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-02-05 10:42:03,979 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:42:03,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:42:03,980 INFO L85 PathProgramCache]: Analyzing trace with hash 573689690, now seen corresponding path program 1 times [2025-02-05 10:42:03,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:42:03,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798131526] [2025-02-05 10:42:03,980 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:42:03,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:42:04,175 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 499 statements into 1 equivalence classes. [2025-02-05 10:42:04,210 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 499 of 499 statements. [2025-02-05 10:42:04,210 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:42:04,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:42:04,571 INFO L134 CoverageAnalysis]: Checked inductivity of 1459 backedges. 191 proven. 0 refuted. 0 times theorem prover too weak. 1268 trivial. 0 not checked. [2025-02-05 10:42:04,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:42:04,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798131526] [2025-02-05 10:42:04,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798131526] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:42:04,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:42:04,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 10:42:04,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275881058] [2025-02-05 10:42:04,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:42:04,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 10:42:04,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:42:04,572 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 10:42:04,572 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-05 10:42:04,572 INFO L87 Difference]: Start difference. First operand 23442 states and 33403 transitions. Second operand has 8 states, 8 states have (on average 25.0) internal successors, (200), 8 states have internal predecessors, (200), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-02-05 10:42:05,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:42:05,046 INFO L93 Difference]: Finished difference Result 88411 states and 126819 transitions. [2025-02-05 10:42:05,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-05 10:42:05,046 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 25.0) internal successors, (200), 8 states have internal predecessors, (200), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 499 [2025-02-05 10:42:05,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:42:05,105 INFO L225 Difference]: With dead ends: 88411 [2025-02-05 10:42:05,105 INFO L226 Difference]: Without dead ends: 65554 [2025-02-05 10:42:05,143 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2025-02-05 10:42:05,143 INFO L435 NwaCegarLoop]: 328 mSDtfsCounter, 451 mSDsluCounter, 1519 mSDsCounter, 0 mSdLazyCounter, 397 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 457 SdHoareTripleChecker+Valid, 1847 SdHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 397 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 10:42:05,144 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [457 Valid, 1847 Invalid, 399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 397 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 10:42:05,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65554 states. [2025-02-05 10:42:05,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65554 to 26514. [2025-02-05 10:42:05,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26514 states, 26424 states have (on average 1.4250302755071147) internal successors, (37655), 26436 states have internal predecessors, (37655), 82 states have call successors, (82), 7 states have call predecessors, (82), 7 states have return successors, (82), 73 states have call predecessors, (82), 82 states have call successors, (82) [2025-02-05 10:42:05,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26514 states to 26514 states and 37819 transitions. [2025-02-05 10:42:05,515 INFO L78 Accepts]: Start accepts. Automaton has 26514 states and 37819 transitions. Word has length 499 [2025-02-05 10:42:05,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:42:05,515 INFO L471 AbstractCegarLoop]: Abstraction has 26514 states and 37819 transitions. [2025-02-05 10:42:05,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 25.0) internal successors, (200), 8 states have internal predecessors, (200), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-02-05 10:42:05,515 INFO L276 IsEmpty]: Start isEmpty. Operand 26514 states and 37819 transitions. [2025-02-05 10:42:05,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 500 [2025-02-05 10:42:05,537 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:42:05,537 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1] [2025-02-05 10:42:05,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-02-05 10:42:05,537 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:42:05,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:42:05,538 INFO L85 PathProgramCache]: Analyzing trace with hash 1985150519, now seen corresponding path program 1 times [2025-02-05 10:42:05,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:42:05,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605909066] [2025-02-05 10:42:05,538 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:42:05,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:42:05,771 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 499 statements into 1 equivalence classes. [2025-02-05 10:42:05,829 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 499 of 499 statements. [2025-02-05 10:42:05,829 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:42:05,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:42:06,056 INFO L134 CoverageAnalysis]: Checked inductivity of 1459 backedges. 194 proven. 0 refuted. 0 times theorem prover too weak. 1265 trivial. 0 not checked. [2025-02-05 10:42:06,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:42:06,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605909066] [2025-02-05 10:42:06,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605909066] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:42:06,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:42:06,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 10:42:06,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017867074] [2025-02-05 10:42:06,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:42:06,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 10:42:06,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:42:06,058 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 10:42:06,058 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 10:42:06,058 INFO L87 Difference]: Start difference. First operand 26514 states and 37819 transitions. Second operand has 4 states, 4 states have (on average 50.25) internal successors, (201), 4 states have internal predecessors, (201), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-02-05 10:42:06,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:42:06,216 INFO L93 Difference]: Finished difference Result 53019 states and 75655 transitions. [2025-02-05 10:42:06,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 10:42:06,216 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 50.25) internal successors, (201), 4 states have internal predecessors, (201), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 499 [2025-02-05 10:42:06,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:42:06,243 INFO L225 Difference]: With dead ends: 53019 [2025-02-05 10:42:06,243 INFO L226 Difference]: Without dead ends: 27090 [2025-02-05 10:42:06,266 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 10:42:06,266 INFO L435 NwaCegarLoop]: 345 mSDtfsCounter, 1 mSDsluCounter, 680 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1025 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 10:42:06,266 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1025 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:42:06,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27090 states. [2025-02-05 10:42:06,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27090 to 26898. [2025-02-05 10:42:06,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26898 states, 26808 states have (on average 1.4189421068337809) internal successors, (38039), 26820 states have internal predecessors, (38039), 82 states have call successors, (82), 7 states have call predecessors, (82), 7 states have return successors, (82), 73 states have call predecessors, (82), 82 states have call successors, (82) [2025-02-05 10:42:06,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26898 states to 26898 states and 38203 transitions. [2025-02-05 10:42:06,629 INFO L78 Accepts]: Start accepts. Automaton has 26898 states and 38203 transitions. Word has length 499 [2025-02-05 10:42:06,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:42:06,631 INFO L471 AbstractCegarLoop]: Abstraction has 26898 states and 38203 transitions. [2025-02-05 10:42:06,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 50.25) internal successors, (201), 4 states have internal predecessors, (201), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-02-05 10:42:06,631 INFO L276 IsEmpty]: Start isEmpty. Operand 26898 states and 38203 transitions. [2025-02-05 10:42:06,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 500 [2025-02-05 10:42:06,662 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:42:06,663 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1] [2025-02-05 10:42:06,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-02-05 10:42:06,663 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:42:06,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:42:06,663 INFO L85 PathProgramCache]: Analyzing trace with hash 2143043668, now seen corresponding path program 1 times [2025-02-05 10:42:06,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:42:06,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698067494] [2025-02-05 10:42:06,664 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:42:06,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:42:06,840 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 499 statements into 1 equivalence classes. [2025-02-05 10:42:06,880 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 499 of 499 statements. [2025-02-05 10:42:06,880 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:42:06,884 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:42:07,060 INFO L134 CoverageAnalysis]: Checked inductivity of 1459 backedges. 198 proven. 0 refuted. 0 times theorem prover too weak. 1261 trivial. 0 not checked. [2025-02-05 10:42:07,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:42:07,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698067494] [2025-02-05 10:42:07,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698067494] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:42:07,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:42:07,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 10:42:07,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200422168] [2025-02-05 10:42:07,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:42:07,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 10:42:07,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:42:07,061 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 10:42:07,062 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 10:42:07,062 INFO L87 Difference]: Start difference. First operand 26898 states and 38203 transitions. Second operand has 4 states, 4 states have (on average 50.75) internal successors, (203), 4 states have internal predecessors, (203), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-02-05 10:42:07,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:42:07,180 INFO L93 Difference]: Finished difference Result 53787 states and 76615 transitions. [2025-02-05 10:42:07,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 10:42:07,181 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 50.75) internal successors, (203), 4 states have internal predecessors, (203), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 499 [2025-02-05 10:42:07,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:42:07,206 INFO L225 Difference]: With dead ends: 53787 [2025-02-05 10:42:07,206 INFO L226 Difference]: Without dead ends: 27474 [2025-02-05 10:42:07,228 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 10:42:07,228 INFO L435 NwaCegarLoop]: 345 mSDtfsCounter, 1 mSDsluCounter, 682 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1027 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 10:42:07,229 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1027 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:42:07,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27474 states. [2025-02-05 10:42:07,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27474 to 27474. [2025-02-05 10:42:07,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27474 states, 27384 states have (on average 1.4101300029214139) internal successors, (38615), 27396 states have internal predecessors, (38615), 82 states have call successors, (82), 7 states have call predecessors, (82), 7 states have return successors, (82), 73 states have call predecessors, (82), 82 states have call successors, (82) [2025-02-05 10:42:07,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27474 states to 27474 states and 38779 transitions. [2025-02-05 10:42:07,484 INFO L78 Accepts]: Start accepts. Automaton has 27474 states and 38779 transitions. Word has length 499 [2025-02-05 10:42:07,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:42:07,484 INFO L471 AbstractCegarLoop]: Abstraction has 27474 states and 38779 transitions. [2025-02-05 10:42:07,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 50.75) internal successors, (203), 4 states have internal predecessors, (203), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-02-05 10:42:07,485 INFO L276 IsEmpty]: Start isEmpty. Operand 27474 states and 38779 transitions. [2025-02-05 10:42:07,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 500 [2025-02-05 10:42:07,508 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:42:07,508 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:42:07,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2025-02-05 10:42:07,508 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:42:07,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:42:07,509 INFO L85 PathProgramCache]: Analyzing trace with hash 964684438, now seen corresponding path program 1 times [2025-02-05 10:42:07,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:42:07,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503946770] [2025-02-05 10:42:07,509 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:42:07,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:42:07,714 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 499 statements into 1 equivalence classes. [2025-02-05 10:42:07,750 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 499 of 499 statements. [2025-02-05 10:42:07,750 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:42:07,750 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:42:07,960 INFO L134 CoverageAnalysis]: Checked inductivity of 1459 backedges. 326 proven. 0 refuted. 0 times theorem prover too weak. 1133 trivial. 0 not checked. [2025-02-05 10:42:07,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:42:07,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503946770] [2025-02-05 10:42:07,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503946770] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:42:07,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:42:07,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 10:42:07,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891371589] [2025-02-05 10:42:07,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:42:07,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 10:42:07,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:42:07,961 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 10:42:07,961 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 10:42:07,961 INFO L87 Difference]: Start difference. First operand 27474 states and 38779 transitions. Second operand has 4 states, 4 states have (on average 53.0) internal successors, (212), 4 states have internal predecessors, (212), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-02-05 10:42:08,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:42:08,078 INFO L93 Difference]: Finished difference Result 54939 states and 77575 transitions. [2025-02-05 10:42:08,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 10:42:08,078 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 53.0) internal successors, (212), 4 states have internal predecessors, (212), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 499 [2025-02-05 10:42:08,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:42:08,107 INFO L225 Difference]: With dead ends: 54939 [2025-02-05 10:42:08,107 INFO L226 Difference]: Without dead ends: 28050 [2025-02-05 10:42:08,130 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 10:42:08,130 INFO L435 NwaCegarLoop]: 348 mSDtfsCounter, 0 mSDsluCounter, 682 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1030 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 10:42:08,130 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1030 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:42:08,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28050 states. [2025-02-05 10:42:08,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28050 to 27858. [2025-02-05 10:42:08,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27858 states, 27768 states have (on average 1.3975439354652839) internal successors, (38807), 27780 states have internal predecessors, (38807), 82 states have call successors, (82), 7 states have call predecessors, (82), 7 states have return successors, (82), 73 states have call predecessors, (82), 82 states have call successors, (82) [2025-02-05 10:42:08,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27858 states to 27858 states and 38971 transitions. [2025-02-05 10:42:08,379 INFO L78 Accepts]: Start accepts. Automaton has 27858 states and 38971 transitions. Word has length 499 [2025-02-05 10:42:08,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:42:08,379 INFO L471 AbstractCegarLoop]: Abstraction has 27858 states and 38971 transitions. [2025-02-05 10:42:08,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 53.0) internal successors, (212), 4 states have internal predecessors, (212), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-02-05 10:42:08,380 INFO L276 IsEmpty]: Start isEmpty. Operand 27858 states and 38971 transitions. [2025-02-05 10:42:08,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 500 [2025-02-05 10:42:08,402 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:42:08,403 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:42:08,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2025-02-05 10:42:08,403 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:42:08,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:42:08,403 INFO L85 PathProgramCache]: Analyzing trace with hash 290617653, now seen corresponding path program 1 times [2025-02-05 10:42:08,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:42:08,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832659733] [2025-02-05 10:42:08,404 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:42:08,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:42:08,570 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 499 statements into 1 equivalence classes. [2025-02-05 10:42:08,605 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 499 of 499 statements. [2025-02-05 10:42:08,605 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:42:08,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:42:08,747 INFO L134 CoverageAnalysis]: Checked inductivity of 1459 backedges. 324 proven. 0 refuted. 0 times theorem prover too weak. 1135 trivial. 0 not checked. [2025-02-05 10:42:08,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:42:08,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832659733] [2025-02-05 10:42:08,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832659733] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:42:08,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:42:08,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 10:42:08,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116857151] [2025-02-05 10:42:08,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:42:08,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 10:42:08,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:42:08,748 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 10:42:08,748 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 10:42:08,748 INFO L87 Difference]: Start difference. First operand 27858 states and 38971 transitions. Second operand has 4 states, 4 states have (on average 52.75) internal successors, (211), 4 states have internal predecessors, (211), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-02-05 10:42:08,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:42:08,867 INFO L93 Difference]: Finished difference Result 55707 states and 78151 transitions. [2025-02-05 10:42:08,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 10:42:08,867 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 52.75) internal successors, (211), 4 states have internal predecessors, (211), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 499 [2025-02-05 10:42:08,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:42:08,897 INFO L225 Difference]: With dead ends: 55707 [2025-02-05 10:42:08,897 INFO L226 Difference]: Without dead ends: 28434 [2025-02-05 10:42:08,917 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 10:42:08,917 INFO L435 NwaCegarLoop]: 348 mSDtfsCounter, 0 mSDsluCounter, 683 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1031 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 10:42:08,917 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1031 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:42:08,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28434 states. [2025-02-05 10:42:09,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28434 to 28434. [2025-02-05 10:42:09,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28434 states, 28344 states have (on average 1.3759173017217048) internal successors, (38999), 28356 states have internal predecessors, (38999), 82 states have call successors, (82), 7 states have call predecessors, (82), 7 states have return successors, (82), 73 states have call predecessors, (82), 82 states have call successors, (82) [2025-02-05 10:42:09,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28434 states to 28434 states and 39163 transitions. [2025-02-05 10:42:09,182 INFO L78 Accepts]: Start accepts. Automaton has 28434 states and 39163 transitions. Word has length 499 [2025-02-05 10:42:09,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:42:09,183 INFO L471 AbstractCegarLoop]: Abstraction has 28434 states and 39163 transitions. [2025-02-05 10:42:09,183 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 52.75) internal successors, (211), 4 states have internal predecessors, (211), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-02-05 10:42:09,183 INFO L276 IsEmpty]: Start isEmpty. Operand 28434 states and 39163 transitions. [2025-02-05 10:42:09,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 500 [2025-02-05 10:42:09,207 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:42:09,207 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:42:09,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2025-02-05 10:42:09,208 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:42:09,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:42:09,208 INFO L85 PathProgramCache]: Analyzing trace with hash 526787476, now seen corresponding path program 1 times [2025-02-05 10:42:09,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:42:09,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036334747] [2025-02-05 10:42:09,208 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:42:09,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:42:09,358 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 499 statements into 1 equivalence classes. [2025-02-05 10:42:09,395 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 499 of 499 statements. [2025-02-05 10:42:09,396 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:42:09,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:42:09,620 INFO L134 CoverageAnalysis]: Checked inductivity of 1459 backedges. 367 proven. 0 refuted. 0 times theorem prover too weak. 1092 trivial. 0 not checked. [2025-02-05 10:42:09,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:42:09,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036334747] [2025-02-05 10:42:09,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036334747] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:42:09,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:42:09,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 10:42:09,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085534519] [2025-02-05 10:42:09,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:42:09,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 10:42:09,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:42:09,621 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 10:42:09,621 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 10:42:09,622 INFO L87 Difference]: Start difference. First operand 28434 states and 39163 transitions. Second operand has 4 states, 4 states have (on average 52.5) internal successors, (210), 4 states have internal predecessors, (210), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-02-05 10:42:09,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:42:09,728 INFO L93 Difference]: Finished difference Result 56475 states and 77767 transitions. [2025-02-05 10:42:09,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 10:42:09,728 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 52.5) internal successors, (210), 4 states have internal predecessors, (210), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 499 [2025-02-05 10:42:09,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:42:09,755 INFO L225 Difference]: With dead ends: 56475 [2025-02-05 10:42:09,756 INFO L226 Difference]: Without dead ends: 28626 [2025-02-05 10:42:09,778 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 10:42:09,778 INFO L435 NwaCegarLoop]: 345 mSDtfsCounter, 1 mSDsluCounter, 682 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1027 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 10:42:09,778 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1027 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:42:09,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28626 states. [2025-02-05 10:42:09,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28626 to 28626. [2025-02-05 10:42:10,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28626 states, 28536 states have (on average 1.3599313148303898) internal successors, (38807), 28548 states have internal predecessors, (38807), 82 states have call successors, (82), 7 states have call predecessors, (82), 7 states have return successors, (82), 73 states have call predecessors, (82), 82 states have call successors, (82) [2025-02-05 10:42:10,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28626 states to 28626 states and 38971 transitions. [2025-02-05 10:42:10,042 INFO L78 Accepts]: Start accepts. Automaton has 28626 states and 38971 transitions. Word has length 499 [2025-02-05 10:42:10,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:42:10,043 INFO L471 AbstractCegarLoop]: Abstraction has 28626 states and 38971 transitions. [2025-02-05 10:42:10,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 52.5) internal successors, (210), 4 states have internal predecessors, (210), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-02-05 10:42:10,043 INFO L276 IsEmpty]: Start isEmpty. Operand 28626 states and 38971 transitions. [2025-02-05 10:42:10,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 500 [2025-02-05 10:42:10,065 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:42:10,066 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:42:10,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2025-02-05 10:42:10,066 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:42:10,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:42:10,066 INFO L85 PathProgramCache]: Analyzing trace with hash 589619222, now seen corresponding path program 2 times [2025-02-05 10:42:10,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:42:10,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751841508] [2025-02-05 10:42:10,066 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 10:42:10,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:42:10,220 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 499 statements into 2 equivalence classes. [2025-02-05 10:42:10,258 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 499 of 499 statements. [2025-02-05 10:42:10,258 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 10:42:10,258 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:42:10,410 INFO L134 CoverageAnalysis]: Checked inductivity of 1459 backedges. 339 proven. 0 refuted. 0 times theorem prover too weak. 1120 trivial. 0 not checked. [2025-02-05 10:42:10,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:42:10,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751841508] [2025-02-05 10:42:10,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1751841508] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:42:10,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:42:10,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 10:42:10,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627411759] [2025-02-05 10:42:10,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:42:10,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 10:42:10,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:42:10,413 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 10:42:10,413 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 10:42:10,413 INFO L87 Difference]: Start difference. First operand 28626 states and 38971 transitions. Second operand has 4 states, 4 states have (on average 52.0) internal successors, (208), 4 states have internal predecessors, (208), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-02-05 10:42:10,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:42:10,525 INFO L93 Difference]: Finished difference Result 56475 states and 76807 transitions. [2025-02-05 10:42:10,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 10:42:10,525 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 52.0) internal successors, (208), 4 states have internal predecessors, (208), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 499 [2025-02-05 10:42:10,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:42:10,554 INFO L225 Difference]: With dead ends: 56475 [2025-02-05 10:42:10,554 INFO L226 Difference]: Without dead ends: 28434 [2025-02-05 10:42:10,576 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 10:42:10,577 INFO L435 NwaCegarLoop]: 345 mSDtfsCounter, 1 mSDsluCounter, 680 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1025 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 10:42:10,577 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1025 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:42:10,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28434 states. [2025-02-05 10:42:10,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28434 to 28434. [2025-02-05 10:42:10,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28434 states, 28344 states have (on average 1.3420476996895288) internal successors, (38039), 28356 states have internal predecessors, (38039), 82 states have call successors, (82), 7 states have call predecessors, (82), 7 states have return successors, (82), 73 states have call predecessors, (82), 82 states have call successors, (82) [2025-02-05 10:42:10,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28434 states to 28434 states and 38203 transitions. [2025-02-05 10:42:10,819 INFO L78 Accepts]: Start accepts. Automaton has 28434 states and 38203 transitions. Word has length 499 [2025-02-05 10:42:10,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:42:10,820 INFO L471 AbstractCegarLoop]: Abstraction has 28434 states and 38203 transitions. [2025-02-05 10:42:10,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 52.0) internal successors, (208), 4 states have internal predecessors, (208), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-02-05 10:42:10,820 INFO L276 IsEmpty]: Start isEmpty. Operand 28434 states and 38203 transitions. [2025-02-05 10:42:10,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 500 [2025-02-05 10:42:10,845 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:42:10,845 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:42:10,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2025-02-05 10:42:10,845 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:42:10,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:42:10,846 INFO L85 PathProgramCache]: Analyzing trace with hash 373755542, now seen corresponding path program 3 times [2025-02-05 10:42:10,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:42:10,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547004587] [2025-02-05 10:42:10,846 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-05 10:42:10,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:42:10,991 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 499 statements into 16 equivalence classes. [2025-02-05 10:42:11,096 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 165 of 499 statements. [2025-02-05 10:42:11,096 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-02-05 10:42:11,096 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:42:11,278 INFO L134 CoverageAnalysis]: Checked inductivity of 1459 backedges. 213 proven. 0 refuted. 0 times theorem prover too weak. 1246 trivial. 0 not checked. [2025-02-05 10:42:11,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:42:11,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547004587] [2025-02-05 10:42:11,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547004587] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:42:11,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:42:11,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 10:42:11,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041074723] [2025-02-05 10:42:11,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:42:11,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 10:42:11,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:42:11,279 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 10:42:11,279 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-05 10:42:11,279 INFO L87 Difference]: Start difference. First operand 28434 states and 38203 transitions. Second operand has 8 states, 8 states have (on average 25.375) internal successors, (203), 8 states have internal predecessors, (203), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-02-05 10:42:11,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:42:11,847 INFO L93 Difference]: Finished difference Result 114907 states and 154275 transitions. [2025-02-05 10:42:11,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-05 10:42:11,847 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 25.375) internal successors, (203), 8 states have internal predecessors, (203), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 499 [2025-02-05 10:42:11,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:42:11,931 INFO L225 Difference]: With dead ends: 114907 [2025-02-05 10:42:11,931 INFO L226 Difference]: Without dead ends: 87058 [2025-02-05 10:42:11,973 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2025-02-05 10:42:11,973 INFO L435 NwaCegarLoop]: 396 mSDtfsCounter, 450 mSDsluCounter, 1786 mSDsCounter, 0 mSdLazyCounter, 393 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 456 SdHoareTripleChecker+Valid, 2182 SdHoareTripleChecker+Invalid, 395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 393 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 10:42:11,973 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [456 Valid, 2182 Invalid, 395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 393 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 10:42:12,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87058 states. [2025-02-05 10:42:12,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87058 to 29202. [2025-02-05 10:42:12,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29202 states, 29112 states have (on average 1.333024182467711) internal successors, (38807), 29124 states have internal predecessors, (38807), 82 states have call successors, (82), 7 states have call predecessors, (82), 7 states have return successors, (82), 73 states have call predecessors, (82), 82 states have call successors, (82) [2025-02-05 10:42:12,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29202 states to 29202 states and 38971 transitions. [2025-02-05 10:42:12,411 INFO L78 Accepts]: Start accepts. Automaton has 29202 states and 38971 transitions. Word has length 499 [2025-02-05 10:42:12,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:42:12,412 INFO L471 AbstractCegarLoop]: Abstraction has 29202 states and 38971 transitions. [2025-02-05 10:42:12,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 25.375) internal successors, (203), 8 states have internal predecessors, (203), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-02-05 10:42:12,412 INFO L276 IsEmpty]: Start isEmpty. Operand 29202 states and 38971 transitions. [2025-02-05 10:42:12,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 500 [2025-02-05 10:42:12,434 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:42:12,435 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:42:12,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2025-02-05 10:42:12,435 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:42:12,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:42:12,436 INFO L85 PathProgramCache]: Analyzing trace with hash -1251713580, now seen corresponding path program 1 times [2025-02-05 10:42:12,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:42:12,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237031228] [2025-02-05 10:42:12,436 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:42:12,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:42:12,581 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 499 statements into 1 equivalence classes. [2025-02-05 10:42:12,617 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 499 of 499 statements. [2025-02-05 10:42:12,618 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:42:12,618 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:42:12,769 INFO L134 CoverageAnalysis]: Checked inductivity of 1459 backedges. 324 proven. 0 refuted. 0 times theorem prover too weak. 1135 trivial. 0 not checked. [2025-02-05 10:42:12,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:42:12,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237031228] [2025-02-05 10:42:12,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237031228] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:42:12,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:42:12,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 10:42:12,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570837504] [2025-02-05 10:42:12,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:42:12,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 10:42:12,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:42:12,771 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 10:42:12,771 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 10:42:12,771 INFO L87 Difference]: Start difference. First operand 29202 states and 38971 transitions. Second operand has 4 states, 4 states have (on average 52.75) internal successors, (211), 4 states have internal predecessors, (211), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-02-05 10:42:12,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:42:12,887 INFO L93 Difference]: Finished difference Result 58971 states and 78727 transitions. [2025-02-05 10:42:12,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 10:42:12,887 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 52.75) internal successors, (211), 4 states have internal predecessors, (211), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 499 [2025-02-05 10:42:12,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:42:12,917 INFO L225 Difference]: With dead ends: 58971 [2025-02-05 10:42:12,917 INFO L226 Difference]: Without dead ends: 30354 [2025-02-05 10:42:12,940 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 10:42:12,941 INFO L435 NwaCegarLoop]: 348 mSDtfsCounter, 0 mSDsluCounter, 682 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1030 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 10:42:12,941 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1030 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:42:12,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30354 states. [2025-02-05 10:42:13,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30354 to 29970. [2025-02-05 10:42:13,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29970 states, 29880 states have (on average 1.3244645247657296) internal successors, (39575), 29892 states have internal predecessors, (39575), 82 states have call successors, (82), 7 states have call predecessors, (82), 7 states have return successors, (82), 73 states have call predecessors, (82), 82 states have call successors, (82) [2025-02-05 10:42:13,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29970 states to 29970 states and 39739 transitions. [2025-02-05 10:42:13,203 INFO L78 Accepts]: Start accepts. Automaton has 29970 states and 39739 transitions. Word has length 499 [2025-02-05 10:42:13,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:42:13,203 INFO L471 AbstractCegarLoop]: Abstraction has 29970 states and 39739 transitions. [2025-02-05 10:42:13,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 52.75) internal successors, (211), 4 states have internal predecessors, (211), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-02-05 10:42:13,203 INFO L276 IsEmpty]: Start isEmpty. Operand 29970 states and 39739 transitions. [2025-02-05 10:42:13,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 500 [2025-02-05 10:42:13,227 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:42:13,227 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:42:13,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2025-02-05 10:42:13,227 INFO L396 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:42:13,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:42:13,228 INFO L85 PathProgramCache]: Analyzing trace with hash 1164469394, now seen corresponding path program 1 times [2025-02-05 10:42:13,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:42:13,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002169643] [2025-02-05 10:42:13,228 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:42:13,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:42:13,406 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 499 statements into 1 equivalence classes. [2025-02-05 10:42:13,443 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 499 of 499 statements. [2025-02-05 10:42:13,443 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:42:13,443 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:42:13,907 INFO L134 CoverageAnalysis]: Checked inductivity of 1459 backedges. 371 proven. 0 refuted. 0 times theorem prover too weak. 1088 trivial. 0 not checked. [2025-02-05 10:42:13,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:42:13,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002169643] [2025-02-05 10:42:13,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002169643] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:42:13,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:42:13,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 10:42:13,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565668058] [2025-02-05 10:42:13,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:42:13,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 10:42:13,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:42:13,909 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 10:42:13,909 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 10:42:13,909 INFO L87 Difference]: Start difference. First operand 29970 states and 39739 transitions. Second operand has 5 states, 5 states have (on average 51.6) internal successors, (258), 5 states have internal predecessors, (258), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-02-05 10:42:14,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:42:14,206 INFO L93 Difference]: Finished difference Result 64155 states and 84487 transitions. [2025-02-05 10:42:14,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 10:42:14,207 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 51.6) internal successors, (258), 5 states have internal predecessors, (258), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 499 [2025-02-05 10:42:14,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:42:14,242 INFO L225 Difference]: With dead ends: 64155 [2025-02-05 10:42:14,242 INFO L226 Difference]: Without dead ends: 34770 [2025-02-05 10:42:14,266 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-05 10:42:14,269 INFO L435 NwaCegarLoop]: 319 mSDtfsCounter, 67 mSDsluCounter, 607 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 926 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 10:42:14,269 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 926 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 10:42:14,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34770 states. [2025-02-05 10:42:14,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34770 to 31122. [2025-02-05 10:42:14,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31122 states, 31032 states have (on average 1.3124194379994845) internal successors, (40727), 31044 states have internal predecessors, (40727), 82 states have call successors, (82), 7 states have call predecessors, (82), 7 states have return successors, (82), 73 states have call predecessors, (82), 82 states have call successors, (82) [2025-02-05 10:42:14,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31122 states to 31122 states and 40891 transitions. [2025-02-05 10:42:14,615 INFO L78 Accepts]: Start accepts. Automaton has 31122 states and 40891 transitions. Word has length 499 [2025-02-05 10:42:14,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:42:14,616 INFO L471 AbstractCegarLoop]: Abstraction has 31122 states and 40891 transitions. [2025-02-05 10:42:14,616 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 51.6) internal successors, (258), 5 states have internal predecessors, (258), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-02-05 10:42:14,616 INFO L276 IsEmpty]: Start isEmpty. Operand 31122 states and 40891 transitions. [2025-02-05 10:42:14,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 500 [2025-02-05 10:42:14,640 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:42:14,640 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:42:14,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2025-02-05 10:42:14,640 INFO L396 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:42:14,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:42:14,641 INFO L85 PathProgramCache]: Analyzing trace with hash -437800075, now seen corresponding path program 2 times [2025-02-05 10:42:14,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:42:14,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603000375] [2025-02-05 10:42:14,641 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 10:42:14,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:42:14,807 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 499 statements into 2 equivalence classes. [2025-02-05 10:42:14,842 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 499 of 499 statements. [2025-02-05 10:42:14,842 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 10:42:14,842 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat