./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/popl20-two-queue.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/popl20-two-queue.wvr.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2b29a4c23931df07495caab7fd70ec22fec28fcea21b47e1c8eb19fb44a778d8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 01:20:49,159 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 01:20:49,210 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-08 01:20:49,217 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 01:20:49,217 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 01:20:49,236 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 01:20:49,237 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 01:20:49,237 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 01:20:49,237 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 01:20:49,237 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 01:20:49,237 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 01:20:49,237 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 01:20:49,237 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 01:20:49,237 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 01:20:49,237 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 01:20:49,238 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 01:20:49,238 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 01:20:49,238 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 01:20:49,238 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 01:20:49,238 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 01:20:49,238 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 01:20:49,238 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 01:20:49,238 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 01:20:49,238 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 01:20:49,238 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 01:20:49,238 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 01:20:49,238 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 01:20:49,238 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 01:20:49,238 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 01:20:49,238 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 01:20:49,238 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 01:20:49,238 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 01:20:49,238 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 01:20:49,238 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 01:20:49,238 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 01:20:49,239 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 01:20:49,239 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 01:20:49,239 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 01:20:49,239 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 01:20:49,239 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 01:20:49,239 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 01:20:49,239 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 01:20:49,239 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 01:20:49,239 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 -> 2b29a4c23931df07495caab7fd70ec22fec28fcea21b47e1c8eb19fb44a778d8 [2025-02-08 01:20:49,437 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 01:20:49,446 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 01:20:49,448 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 01:20:49,449 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 01:20:49,449 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 01:20:49,451 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-two-queue.wvr.c [2025-02-08 01:20:50,607 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bd99b71f6/d6681f2fb9a6493490a7df628f6bb7b1/FLAGc4858c571 [2025-02-08 01:20:50,879 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 01:20:50,880 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/popl20-two-queue.wvr.c [2025-02-08 01:20:50,887 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bd99b71f6/d6681f2fb9a6493490a7df628f6bb7b1/FLAGc4858c571 [2025-02-08 01:20:51,191 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bd99b71f6/d6681f2fb9a6493490a7df628f6bb7b1 [2025-02-08 01:20:51,195 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 01:20:51,196 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 01:20:51,197 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 01:20:51,197 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 01:20:51,202 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 01:20:51,202 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 01:20:51" (1/1) ... [2025-02-08 01:20:51,203 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@689ed7cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:20:51, skipping insertion in model container [2025-02-08 01:20:51,203 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 01:20:51" (1/1) ... [2025-02-08 01:20:51,216 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 01:20:51,336 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/weaver/popl20-two-queue.wvr.c[3013,3026] [2025-02-08 01:20:51,346 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 01:20:51,354 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 01:20:51,369 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/weaver/popl20-two-queue.wvr.c[3013,3026] [2025-02-08 01:20:51,371 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 01:20:51,381 INFO L204 MainTranslator]: Completed translation [2025-02-08 01:20:51,381 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:20:51 WrapperNode [2025-02-08 01:20:51,381 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 01:20:51,382 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 01:20:51,382 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 01:20:51,382 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 01:20:51,386 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:20:51" (1/1) ... [2025-02-08 01:20:51,391 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:20:51" (1/1) ... [2025-02-08 01:20:51,404 INFO L138 Inliner]: procedures = 23, calls = 33, calls flagged for inlining = 13, calls inlined = 15, statements flattened = 186 [2025-02-08 01:20:51,405 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 01:20:51,405 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 01:20:51,405 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 01:20:51,405 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 01:20:51,410 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:20:51" (1/1) ... [2025-02-08 01:20:51,410 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:20:51" (1/1) ... [2025-02-08 01:20:51,412 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:20:51" (1/1) ... [2025-02-08 01:20:51,420 INFO L175 MemorySlicer]: Split 8 memory accesses to 2 slices as follows [2, 6]. 75 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 2 writes are split as follows [0, 2]. [2025-02-08 01:20:51,420 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:20:51" (1/1) ... [2025-02-08 01:20:51,420 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:20:51" (1/1) ... [2025-02-08 01:20:51,424 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:20:51" (1/1) ... [2025-02-08 01:20:51,424 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:20:51" (1/1) ... [2025-02-08 01:20:51,425 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:20:51" (1/1) ... [2025-02-08 01:20:51,426 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:20:51" (1/1) ... [2025-02-08 01:20:51,427 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 01:20:51,428 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 01:20:51,428 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 01:20:51,428 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 01:20:51,429 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:20:51" (1/1) ... [2025-02-08 01:20:51,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 01:20:51,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:20:51,452 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-08 01:20:51,461 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-08 01:20:51,475 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 01:20:51,475 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-08 01:20:51,475 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-08 01:20:51,475 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-08 01:20:51,475 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-08 01:20:51,475 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 01:20:51,475 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 01:20:51,475 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 01:20:51,475 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-08 01:20:51,475 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-02-08 01:20:51,475 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-02-08 01:20:51,476 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 01:20:51,476 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 01:20:51,476 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 01:20:51,476 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-08 01:20:51,476 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-08 01:20:51,477 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-08 01:20:51,572 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 01:20:51,573 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 01:20:51,804 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 01:20:51,804 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 01:20:51,981 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 01:20:51,982 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 01:20:51,982 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:20:51 BoogieIcfgContainer [2025-02-08 01:20:51,983 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 01:20:51,984 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 01:20:51,984 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 01:20:51,987 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 01:20:51,988 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 01:20:51" (1/3) ... [2025-02-08 01:20:51,988 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17e0daf8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 01:20:51, skipping insertion in model container [2025-02-08 01:20:51,988 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:20:51" (2/3) ... [2025-02-08 01:20:51,988 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17e0daf8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 01:20:51, skipping insertion in model container [2025-02-08 01:20:51,988 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:20:51" (3/3) ... [2025-02-08 01:20:51,989 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-two-queue.wvr.c [2025-02-08 01:20:51,999 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 01:20:52,000 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-two-queue.wvr.c that has 3 procedures, 25 locations, 1 initial locations, 4 loop locations, and 1 error locations. [2025-02-08 01:20:52,001 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 01:20:52,036 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-02-08 01:20:52,061 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 31 places, 28 transitions, 70 flow [2025-02-08 01:20:52,083 INFO L124 PetriNetUnfolderBase]: 4/26 cut-off events. [2025-02-08 01:20:52,086 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-08 01:20:52,088 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35 conditions, 26 events. 4/26 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 34 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 17. Up to 2 conditions per place. [2025-02-08 01:20:52,088 INFO L82 GeneralOperation]: Start removeDead. Operand has 31 places, 28 transitions, 70 flow [2025-02-08 01:20:52,091 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 28 places, 25 transitions, 62 flow [2025-02-08 01:20:52,096 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 01:20:52,108 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;@15f0e060, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 01:20:52,108 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-02-08 01:20:52,118 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 01:20:52,118 INFO L124 PetriNetUnfolderBase]: 4/24 cut-off events. [2025-02-08 01:20:52,118 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-08 01:20:52,118 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:20:52,119 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:20:52,119 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-02-08 01:20:52,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:20:52,124 INFO L85 PathProgramCache]: Analyzing trace with hash 1679533597, now seen corresponding path program 1 times [2025-02-08 01:20:52,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:20:52,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404554499] [2025-02-08 01:20:52,131 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:20:52,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:20:52,211 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-08 01:20:52,244 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-08 01:20:52,244 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:20:52,245 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:20:52,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:20:52,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:20:52,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404554499] [2025-02-08 01:20:52,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404554499] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:20:52,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:20:52,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 01:20:52,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855061227] [2025-02-08 01:20:52,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:20:52,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 01:20:52,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:20:52,513 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 01:20:52,514 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 01:20:52,528 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 28 [2025-02-08 01:20:52,530 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 25 transitions, 62 flow. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:20:52,530 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:20:52,530 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 28 [2025-02-08 01:20:52,531 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:20:52,637 INFO L124 PetriNetUnfolderBase]: 141/263 cut-off events. [2025-02-08 01:20:52,638 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2025-02-08 01:20:52,639 INFO L83 FinitePrefix]: Finished finitePrefix Result has 528 conditions, 263 events. 141/263 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1065 event pairs, 26 based on Foata normal form. 1/253 useless extension candidates. Maximal degree in co-relation 458. Up to 181 conditions per place. [2025-02-08 01:20:52,642 INFO L140 encePairwiseOnDemand]: 24/28 looper letters, 27 selfloop transitions, 3 changer transitions 1/36 dead transitions. [2025-02-08 01:20:52,643 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 36 transitions, 155 flow [2025-02-08 01:20:52,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 01:20:52,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 01:20:52,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 53 transitions. [2025-02-08 01:20:52,651 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6309523809523809 [2025-02-08 01:20:52,652 INFO L175 Difference]: Start difference. First operand has 28 places, 25 transitions, 62 flow. Second operand 3 states and 53 transitions. [2025-02-08 01:20:52,653 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 36 transitions, 155 flow [2025-02-08 01:20:52,656 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 36 transitions, 141 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-02-08 01:20:52,658 INFO L231 Difference]: Finished difference. Result has 27 places, 27 transitions, 73 flow [2025-02-08 01:20:52,660 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=73, PETRI_PLACES=27, PETRI_TRANSITIONS=27} [2025-02-08 01:20:52,663 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, -1 predicate places. [2025-02-08 01:20:52,663 INFO L471 AbstractCegarLoop]: Abstraction has has 27 places, 27 transitions, 73 flow [2025-02-08 01:20:52,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:20:52,663 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:20:52,664 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:20:52,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 01:20:52,664 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-02-08 01:20:52,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:20:52,665 INFO L85 PathProgramCache]: Analyzing trace with hash 1377364840, now seen corresponding path program 1 times [2025-02-08 01:20:52,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:20:52,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333988727] [2025-02-08 01:20:52,665 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:20:52,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:20:52,677 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-08 01:20:52,688 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-08 01:20:52,688 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:20:52,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:20:52,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:20:52,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:20:52,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333988727] [2025-02-08 01:20:52,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333988727] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:20:52,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:20:52,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 01:20:52,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405505480] [2025-02-08 01:20:52,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:20:52,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 01:20:52,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:20:52,772 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 01:20:52,772 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 01:20:52,772 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 28 [2025-02-08 01:20:52,772 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 27 transitions, 73 flow. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:20:52,773 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:20:52,773 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 28 [2025-02-08 01:20:52,773 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:20:52,842 INFO L124 PetriNetUnfolderBase]: 105/206 cut-off events. [2025-02-08 01:20:52,842 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2025-02-08 01:20:52,842 INFO L83 FinitePrefix]: Finished finitePrefix Result has 435 conditions, 206 events. 105/206 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 732 event pairs, 22 based on Foata normal form. 6/202 useless extension candidates. Maximal degree in co-relation 120. Up to 143 conditions per place. [2025-02-08 01:20:52,843 INFO L140 encePairwiseOnDemand]: 25/28 looper letters, 25 selfloop transitions, 2 changer transitions 2/34 dead transitions. [2025-02-08 01:20:52,843 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 34 transitions, 147 flow [2025-02-08 01:20:52,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 01:20:52,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 01:20:52,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 49 transitions. [2025-02-08 01:20:52,847 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5833333333333334 [2025-02-08 01:20:52,847 INFO L175 Difference]: Start difference. First operand has 27 places, 27 transitions, 73 flow. Second operand 3 states and 49 transitions. [2025-02-08 01:20:52,847 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 34 transitions, 147 flow [2025-02-08 01:20:52,848 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 34 transitions, 144 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 01:20:52,848 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 82 flow [2025-02-08 01:20:52,848 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=82, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2025-02-08 01:20:52,849 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 1 predicate places. [2025-02-08 01:20:52,849 INFO L471 AbstractCegarLoop]: Abstraction has has 29 places, 28 transitions, 82 flow [2025-02-08 01:20:52,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:20:52,849 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:20:52,849 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:20:52,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 01:20:52,849 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-02-08 01:20:52,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:20:52,849 INFO L85 PathProgramCache]: Analyzing trace with hash -2007423936, now seen corresponding path program 1 times [2025-02-08 01:20:52,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:20:52,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538167670] [2025-02-08 01:20:52,850 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:20:52,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:20:52,865 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-08 01:20:52,874 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-08 01:20:52,877 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:20:52,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:20:52,946 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:20:52,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:20:52,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538167670] [2025-02-08 01:20:52,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538167670] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:20:52,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:20:52,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 01:20:52,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025525640] [2025-02-08 01:20:52,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:20:52,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 01:20:52,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:20:52,948 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 01:20:52,948 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 01:20:52,948 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 28 [2025-02-08 01:20:52,948 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 28 transitions, 82 flow. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:20:52,948 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:20:52,948 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 28 [2025-02-08 01:20:52,949 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:20:53,023 INFO L124 PetriNetUnfolderBase]: 80/164 cut-off events. [2025-02-08 01:20:53,024 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2025-02-08 01:20:53,025 INFO L83 FinitePrefix]: Finished finitePrefix Result has 371 conditions, 164 events. 80/164 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 487 event pairs, 28 based on Foata normal form. 5/161 useless extension candidates. Maximal degree in co-relation 244. Up to 112 conditions per place. [2025-02-08 01:20:53,027 INFO L140 encePairwiseOnDemand]: 25/28 looper letters, 26 selfloop transitions, 2 changer transitions 4/37 dead transitions. [2025-02-08 01:20:53,027 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 37 transitions, 170 flow [2025-02-08 01:20:53,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 01:20:53,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 01:20:53,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 51 transitions. [2025-02-08 01:20:53,029 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6071428571428571 [2025-02-08 01:20:53,029 INFO L175 Difference]: Start difference. First operand has 29 places, 28 transitions, 82 flow. Second operand 3 states and 51 transitions. [2025-02-08 01:20:53,029 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 37 transitions, 170 flow [2025-02-08 01:20:53,030 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 37 transitions, 167 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 01:20:53,030 INFO L231 Difference]: Finished difference. Result has 31 places, 29 transitions, 92 flow [2025-02-08 01:20:53,031 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=92, PETRI_PLACES=31, PETRI_TRANSITIONS=29} [2025-02-08 01:20:53,032 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 3 predicate places. [2025-02-08 01:20:53,032 INFO L471 AbstractCegarLoop]: Abstraction has has 31 places, 29 transitions, 92 flow [2025-02-08 01:20:53,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:20:53,032 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:20:53,032 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:20:53,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 01:20:53,033 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-02-08 01:20:53,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:20:53,033 INFO L85 PathProgramCache]: Analyzing trace with hash 1030349047, now seen corresponding path program 1 times [2025-02-08 01:20:53,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:20:53,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862413526] [2025-02-08 01:20:53,034 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:20:53,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:20:53,045 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-08 01:20:53,059 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-08 01:20:53,061 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:20:53,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:20:53,143 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 01:20:53,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:20:53,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862413526] [2025-02-08 01:20:53,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862413526] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:20:53,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:20:53,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 01:20:53,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199123472] [2025-02-08 01:20:53,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:20:53,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 01:20:53,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:20:53,145 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 01:20:53,145 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 01:20:53,145 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 28 [2025-02-08 01:20:53,146 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 29 transitions, 92 flow. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:20:53,146 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:20:53,146 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 28 [2025-02-08 01:20:53,146 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:20:53,251 INFO L124 PetriNetUnfolderBase]: 96/218 cut-off events. [2025-02-08 01:20:53,251 INFO L125 PetriNetUnfolderBase]: For 67/67 co-relation queries the response was YES. [2025-02-08 01:20:53,252 INFO L83 FinitePrefix]: Finished finitePrefix Result has 503 conditions, 218 events. 96/218 cut-off events. For 67/67 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 821 event pairs, 67 based on Foata normal form. 3/208 useless extension candidates. Maximal degree in co-relation 266. Up to 150 conditions per place. [2025-02-08 01:20:53,253 INFO L140 encePairwiseOnDemand]: 22/28 looper letters, 23 selfloop transitions, 2 changer transitions 14/44 dead transitions. [2025-02-08 01:20:53,253 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 44 transitions, 207 flow [2025-02-08 01:20:53,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 01:20:53,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 01:20:53,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 71 transitions. [2025-02-08 01:20:53,255 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5071428571428571 [2025-02-08 01:20:53,255 INFO L175 Difference]: Start difference. First operand has 31 places, 29 transitions, 92 flow. Second operand 5 states and 71 transitions. [2025-02-08 01:20:53,255 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 44 transitions, 207 flow [2025-02-08 01:20:53,256 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 44 transitions, 204 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 01:20:53,258 INFO L231 Difference]: Finished difference. Result has 37 places, 30 transitions, 108 flow [2025-02-08 01:20:53,258 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=108, PETRI_PLACES=37, PETRI_TRANSITIONS=30} [2025-02-08 01:20:53,258 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 9 predicate places. [2025-02-08 01:20:53,258 INFO L471 AbstractCegarLoop]: Abstraction has has 37 places, 30 transitions, 108 flow [2025-02-08 01:20:53,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:20:53,259 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:20:53,259 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:20:53,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 01:20:53,259 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-02-08 01:20:53,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:20:53,260 INFO L85 PathProgramCache]: Analyzing trace with hash 762214193, now seen corresponding path program 1 times [2025-02-08 01:20:53,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:20:53,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768052791] [2025-02-08 01:20:53,260 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:20:53,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:20:53,269 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-08 01:20:53,281 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-08 01:20:53,282 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:20:53,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:20:53,352 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 01:20:53,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:20:53,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768052791] [2025-02-08 01:20:53,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768052791] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:20:53,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:20:53,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 01:20:53,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109173052] [2025-02-08 01:20:53,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:20:53,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 01:20:53,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:20:53,353 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 01:20:53,354 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 01:20:53,354 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 28 [2025-02-08 01:20:53,354 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 30 transitions, 108 flow. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:20:53,354 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:20:53,354 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 28 [2025-02-08 01:20:53,354 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:20:53,418 INFO L124 PetriNetUnfolderBase]: 93/211 cut-off events. [2025-02-08 01:20:53,419 INFO L125 PetriNetUnfolderBase]: For 91/91 co-relation queries the response was YES. [2025-02-08 01:20:53,419 INFO L83 FinitePrefix]: Finished finitePrefix Result has 499 conditions, 211 events. 93/211 cut-off events. For 91/91 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 771 event pairs, 66 based on Foata normal form. 7/206 useless extension candidates. Maximal degree in co-relation 480. Up to 151 conditions per place. [2025-02-08 01:20:53,420 INFO L140 encePairwiseOnDemand]: 24/28 looper letters, 24 selfloop transitions, 2 changer transitions 10/41 dead transitions. [2025-02-08 01:20:53,420 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 41 transitions, 214 flow [2025-02-08 01:20:53,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 01:20:53,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 01:20:53,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 60 transitions. [2025-02-08 01:20:53,420 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5357142857142857 [2025-02-08 01:20:53,421 INFO L175 Difference]: Start difference. First operand has 37 places, 30 transitions, 108 flow. Second operand 4 states and 60 transitions. [2025-02-08 01:20:53,421 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 41 transitions, 214 flow [2025-02-08 01:20:53,421 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 41 transitions, 198 flow, removed 7 selfloop flow, removed 3 redundant places. [2025-02-08 01:20:53,422 INFO L231 Difference]: Finished difference. Result has 37 places, 31 transitions, 112 flow [2025-02-08 01:20:53,422 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=112, PETRI_PLACES=37, PETRI_TRANSITIONS=31} [2025-02-08 01:20:53,422 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 9 predicate places. [2025-02-08 01:20:53,422 INFO L471 AbstractCegarLoop]: Abstraction has has 37 places, 31 transitions, 112 flow [2025-02-08 01:20:53,422 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:20:53,423 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:20:53,423 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:20:53,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 01:20:53,423 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-02-08 01:20:53,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:20:53,423 INFO L85 PathProgramCache]: Analyzing trace with hash -1688505301, now seen corresponding path program 1 times [2025-02-08 01:20:53,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:20:53,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890421610] [2025-02-08 01:20:53,423 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:20:53,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:20:53,434 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-08 01:20:53,466 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-08 01:20:53,466 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:20:53,466 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:20:54,679 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:20:54,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:20:54,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890421610] [2025-02-08 01:20:54,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890421610] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 01:20:54,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [283234231] [2025-02-08 01:20:54,679 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:20:54,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:20:54,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:20:54,683 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-08 01:20:54,696 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-08 01:20:54,747 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-08 01:20:54,774 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-08 01:20:54,774 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:20:54,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:20:54,780 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-02-08 01:20:54,786 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 01:20:54,924 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2025-02-08 01:20:55,558 INFO L349 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2025-02-08 01:20:55,558 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 20 [2025-02-08 01:20:55,631 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 01:20:55,631 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 01:20:56,593 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 01:20:56,593 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 318 treesize of output 324 [2025-02-08 01:20:57,106 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 01:20:57,106 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 16 [2025-02-08 01:20:57,122 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-02-08 01:20:57,122 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 1 [2025-02-08 01:20:57,131 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 01:20:57,132 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2025-02-08 01:20:57,140 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 01:20:57,141 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2025-02-08 01:20:57,383 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 01:20:57,383 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 34 [2025-02-08 01:20:57,416 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 01:20:57,417 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 19 [2025-02-08 01:20:57,424 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 01:20:57,424 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 26 [2025-02-08 01:20:57,434 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 01:20:57,434 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 26 [2025-02-08 01:20:57,444 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 01:20:57,444 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 26 [2025-02-08 01:20:57,461 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 01:20:57,461 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 87 treesize of output 77 [2025-02-08 01:20:57,639 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 01:20:57,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [283234231] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 01:20:57,639 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 01:20:57,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 13] total 38 [2025-02-08 01:20:57,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2147165787] [2025-02-08 01:20:57,639 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 01:20:57,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2025-02-08 01:20:57,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:20:57,640 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2025-02-08 01:20:57,641 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=1346, Unknown=0, NotChecked=0, Total=1482 [2025-02-08 01:20:57,667 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-02-08 01:20:57,667 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 31 transitions, 112 flow. Second operand has 39 states, 39 states have (on average 6.641025641025641) internal successors, (259), 39 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:20:57,667 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:20:57,667 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-02-08 01:20:57,667 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:21:02,466 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-08 01:21:08,016 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-02-08 01:21:10,760 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.46s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-08 01:21:21,102 INFO L124 PetriNetUnfolderBase]: 1095/2000 cut-off events. [2025-02-08 01:21:21,102 INFO L125 PetriNetUnfolderBase]: For 394/394 co-relation queries the response was YES. [2025-02-08 01:21:21,105 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4723 conditions, 2000 events. 1095/2000 cut-off events. For 394/394 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 10694 event pairs, 34 based on Foata normal form. 4/1707 useless extension candidates. Maximal degree in co-relation 3655. Up to 360 conditions per place. [2025-02-08 01:21:21,115 INFO L140 encePairwiseOnDemand]: 12/28 looper letters, 282 selfloop transitions, 218 changer transitions 36/539 dead transitions. [2025-02-08 01:21:21,116 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 539 transitions, 2624 flow [2025-02-08 01:21:21,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2025-02-08 01:21:21,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2025-02-08 01:21:21,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 1001 transitions. [2025-02-08 01:21:21,123 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.39285714285714285 [2025-02-08 01:21:21,123 INFO L175 Difference]: Start difference. First operand has 37 places, 31 transitions, 112 flow. Second operand 91 states and 1001 transitions. [2025-02-08 01:21:21,123 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 539 transitions, 2624 flow [2025-02-08 01:21:21,131 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 539 transitions, 2606 flow, removed 7 selfloop flow, removed 2 redundant places. [2025-02-08 01:21:21,138 INFO L231 Difference]: Finished difference. Result has 162 places, 254 transitions, 1622 flow [2025-02-08 01:21:21,139 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=10, PETRI_DIFFERENCE_SUBTRAHEND_STATES=91, PETRI_FLOW=1622, PETRI_PLACES=162, PETRI_TRANSITIONS=254} [2025-02-08 01:21:21,145 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 134 predicate places. [2025-02-08 01:21:21,145 INFO L471 AbstractCegarLoop]: Abstraction has has 162 places, 254 transitions, 1622 flow [2025-02-08 01:21:21,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 6.641025641025641) internal successors, (259), 39 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:21:21,145 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:21:21,145 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:21:21,151 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-08 01:21:21,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:21:21,346 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-02-08 01:21:21,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:21:21,347 INFO L85 PathProgramCache]: Analyzing trace with hash 1538769965, now seen corresponding path program 2 times [2025-02-08 01:21:21,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:21:21,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940219408] [2025-02-08 01:21:21,348 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 01:21:21,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:21:21,369 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-02-08 01:21:21,412 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 23 of 25 statements. [2025-02-08 01:21:21,412 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 01:21:21,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:21:22,010 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 01:21:22,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:21:22,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940219408] [2025-02-08 01:21:22,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940219408] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:21:22,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:21:22,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-08 01:21:22,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537864116] [2025-02-08 01:21:22,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:21:22,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-08 01:21:22,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:21:22,011 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-08 01:21:22,011 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2025-02-08 01:21:22,023 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-02-08 01:21:22,024 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 254 transitions, 1622 flow. Second operand has 12 states, 12 states have (on average 6.833333333333333) internal successors, (82), 12 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:21:22,024 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:21:22,024 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-02-08 01:21:22,024 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:21:22,546 INFO L124 PetriNetUnfolderBase]: 1200/2163 cut-off events. [2025-02-08 01:21:22,546 INFO L125 PetriNetUnfolderBase]: For 22614/22614 co-relation queries the response was YES. [2025-02-08 01:21:22,554 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11150 conditions, 2163 events. 1200/2163 cut-off events. For 22614/22614 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 11813 event pairs, 193 based on Foata normal form. 2/2142 useless extension candidates. Maximal degree in co-relation 10785. Up to 1744 conditions per place. [2025-02-08 01:21:22,563 INFO L140 encePairwiseOnDemand]: 17/28 looper letters, 257 selfloop transitions, 58 changer transitions 3/321 dead transitions. [2025-02-08 01:21:22,563 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 321 transitions, 2788 flow [2025-02-08 01:21:22,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-08 01:21:22,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-02-08 01:21:22,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 130 transitions. [2025-02-08 01:21:22,564 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.42207792207792205 [2025-02-08 01:21:22,565 INFO L175 Difference]: Start difference. First operand has 162 places, 254 transitions, 1622 flow. Second operand 11 states and 130 transitions. [2025-02-08 01:21:22,565 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 321 transitions, 2788 flow [2025-02-08 01:21:22,637 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 321 transitions, 2486 flow, removed 139 selfloop flow, removed 5 redundant places. [2025-02-08 01:21:22,642 INFO L231 Difference]: Finished difference. Result has 169 places, 282 transitions, 1732 flow [2025-02-08 01:21:22,643 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=1360, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=254, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=201, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1732, PETRI_PLACES=169, PETRI_TRANSITIONS=282} [2025-02-08 01:21:22,644 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 141 predicate places. [2025-02-08 01:21:22,645 INFO L471 AbstractCegarLoop]: Abstraction has has 169 places, 282 transitions, 1732 flow [2025-02-08 01:21:22,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.833333333333333) internal successors, (82), 12 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:21:22,645 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:21:22,645 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:21:22,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 01:21:22,645 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-02-08 01:21:22,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:21:22,646 INFO L85 PathProgramCache]: Analyzing trace with hash 914000547, now seen corresponding path program 3 times [2025-02-08 01:21:22,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:21:22,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116296174] [2025-02-08 01:21:22,646 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 01:21:22,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:21:22,658 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 2 equivalence classes. [2025-02-08 01:21:22,671 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 23 of 25 statements. [2025-02-08 01:21:22,674 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-08 01:21:22,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:21:22,968 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 01:21:22,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:21:22,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116296174] [2025-02-08 01:21:22,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116296174] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:21:22,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:21:22,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-08 01:21:22,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897210578] [2025-02-08 01:21:22,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:21:22,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-08 01:21:22,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:21:22,970 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-08 01:21:22,970 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2025-02-08 01:21:23,000 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-02-08 01:21:23,001 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 282 transitions, 1732 flow. Second operand has 12 states, 12 states have (on average 6.833333333333333) internal successors, (82), 12 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:21:23,001 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:21:23,001 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-02-08 01:21:23,002 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:21:23,535 INFO L124 PetriNetUnfolderBase]: 1316/2361 cut-off events. [2025-02-08 01:21:23,536 INFO L125 PetriNetUnfolderBase]: For 24846/24846 co-relation queries the response was YES. [2025-02-08 01:21:23,545 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12141 conditions, 2361 events. 1316/2361 cut-off events. For 24846/24846 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 13146 event pairs, 211 based on Foata normal form. 2/2340 useless extension candidates. Maximal degree in co-relation 11781. Up to 1971 conditions per place. [2025-02-08 01:21:23,556 INFO L140 encePairwiseOnDemand]: 17/28 looper letters, 278 selfloop transitions, 58 changer transitions 3/342 dead transitions. [2025-02-08 01:21:23,556 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 342 transitions, 2903 flow [2025-02-08 01:21:23,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-08 01:21:23,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-02-08 01:21:23,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 130 transitions. [2025-02-08 01:21:23,558 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.42207792207792205 [2025-02-08 01:21:23,558 INFO L175 Difference]: Start difference. First operand has 169 places, 282 transitions, 1732 flow. Second operand 11 states and 130 transitions. [2025-02-08 01:21:23,558 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 342 transitions, 2903 flow [2025-02-08 01:21:23,618 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 342 transitions, 2828 flow, removed 34 selfloop flow, removed 1 redundant places. [2025-02-08 01:21:23,623 INFO L231 Difference]: Finished difference. Result has 183 places, 305 transitions, 2050 flow [2025-02-08 01:21:23,623 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=1675, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=282, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=226, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2050, PETRI_PLACES=183, PETRI_TRANSITIONS=305} [2025-02-08 01:21:23,625 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 155 predicate places. [2025-02-08 01:21:23,625 INFO L471 AbstractCegarLoop]: Abstraction has has 183 places, 305 transitions, 2050 flow [2025-02-08 01:21:23,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.833333333333333) internal successors, (82), 12 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:21:23,625 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:21:23,626 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:21:23,626 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 01:21:23,626 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-02-08 01:21:23,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:21:23,626 INFO L85 PathProgramCache]: Analyzing trace with hash -1973871451, now seen corresponding path program 4 times [2025-02-08 01:21:23,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:21:23,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022287451] [2025-02-08 01:21:23,626 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 01:21:23,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:21:23,633 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-02-08 01:21:23,658 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-02-08 01:21:23,659 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-08 01:21:23,659 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:21:24,713 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:21:24,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:21:24,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022287451] [2025-02-08 01:21:24,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022287451] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 01:21:24,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [388809339] [2025-02-08 01:21:24,714 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 01:21:24,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:21:24,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:21:24,716 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-08 01:21:24,717 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-08 01:21:24,759 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-02-08 01:21:24,786 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-02-08 01:21:24,786 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-08 01:21:24,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:21:24,787 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-02-08 01:21:24,791 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 01:21:24,883 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2025-02-08 01:21:25,222 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 01:21:25,222 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 34 [2025-02-08 01:21:25,434 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 01:21:25,434 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 01:21:26,368 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 01:21:26,369 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 318 treesize of output 324 [2025-02-08 01:21:27,098 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 01:21:27,099 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 16 [2025-02-08 01:21:27,114 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 01:21:27,116 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2025-02-08 01:21:27,131 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-02-08 01:21:27,132 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 1 [2025-02-08 01:21:27,964 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 01:21:27,965 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 34 [2025-02-08 01:21:27,998 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 01:21:27,999 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 26 [2025-02-08 01:21:28,013 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 01:21:28,013 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 19 [2025-02-08 01:21:28,025 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 01:21:28,025 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 19 [2025-02-08 01:21:28,053 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-02-08 01:21:28,054 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 1 [2025-02-08 01:21:28,065 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 01:21:28,065 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 87 treesize of output 77 [2025-02-08 01:21:28,320 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 01:21:28,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [388809339] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 01:21:28,322 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 01:21:28,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 37 [2025-02-08 01:21:28,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656411538] [2025-02-08 01:21:28,322 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 01:21:28,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2025-02-08 01:21:28,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:21:28,324 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-02-08 01:21:28,325 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=1269, Unknown=0, NotChecked=0, Total=1406 [2025-02-08 01:21:28,418 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-02-08 01:21:28,418 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 305 transitions, 2050 flow. Second operand has 38 states, 38 states have (on average 6.684210526315789) internal successors, (254), 38 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:21:28,418 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:21:28,418 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-02-08 01:21:28,418 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:21:32,837 INFO L124 PetriNetUnfolderBase]: 1748/3109 cut-off events. [2025-02-08 01:21:32,837 INFO L125 PetriNetUnfolderBase]: For 34226/34226 co-relation queries the response was YES. [2025-02-08 01:21:32,851 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16425 conditions, 3109 events. 1748/3109 cut-off events. For 34226/34226 co-relation queries the response was YES. Maximal size of possible extension queue 207. Compared 18568 event pairs, 88 based on Foata normal form. 10/3095 useless extension candidates. Maximal degree in co-relation 15952. Up to 1238 conditions per place. [2025-02-08 01:21:32,864 INFO L140 encePairwiseOnDemand]: 12/28 looper letters, 270 selfloop transitions, 276 changer transitions 6/555 dead transitions. [2025-02-08 01:21:32,864 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 555 transitions, 4965 flow [2025-02-08 01:21:32,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2025-02-08 01:21:32,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2025-02-08 01:21:32,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 430 transitions. [2025-02-08 01:21:32,867 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3656462585034014 [2025-02-08 01:21:32,867 INFO L175 Difference]: Start difference. First operand has 183 places, 305 transitions, 2050 flow. Second operand 42 states and 430 transitions. [2025-02-08 01:21:32,868 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 224 places, 555 transitions, 4965 flow [2025-02-08 01:21:32,952 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 220 places, 555 transitions, 4909 flow, removed 11 selfloop flow, removed 4 redundant places. [2025-02-08 01:21:32,963 INFO L231 Difference]: Finished difference. Result has 232 places, 418 transitions, 3946 flow [2025-02-08 01:21:32,964 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=1998, PETRI_DIFFERENCE_MINUEND_PLACES=179, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=305, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=168, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=42, PETRI_FLOW=3946, PETRI_PLACES=232, PETRI_TRANSITIONS=418} [2025-02-08 01:21:32,966 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 204 predicate places. [2025-02-08 01:21:32,966 INFO L471 AbstractCegarLoop]: Abstraction has has 232 places, 418 transitions, 3946 flow [2025-02-08 01:21:32,966 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 6.684210526315789) internal successors, (254), 38 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:21:32,966 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:21:32,966 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:21:32,974 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-08 01:21:33,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:21:33,167 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-02-08 01:21:33,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:21:33,168 INFO L85 PathProgramCache]: Analyzing trace with hash 1974918641, now seen corresponding path program 5 times [2025-02-08 01:21:33,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:21:33,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450060311] [2025-02-08 01:21:33,168 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-08 01:21:33,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:21:33,177 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-02-08 01:21:33,187 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-02-08 01:21:33,188 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 01:21:33,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:21:34,349 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:21:34,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:21:34,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450060311] [2025-02-08 01:21:34,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1450060311] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 01:21:34,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1285400597] [2025-02-08 01:21:34,349 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-08 01:21:34,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:21:34,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:21:34,352 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-08 01:21:34,353 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-08 01:21:34,391 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-02-08 01:21:34,408 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-02-08 01:21:34,408 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 01:21:34,408 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:21:34,410 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-02-08 01:21:34,411 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 01:21:34,491 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-08 01:21:34,826 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 01:21:34,826 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 01:21:35,234 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 01:21:35,234 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 147 treesize of output 145 [2025-02-08 01:21:35,281 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 01:21:35,282 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 29 [2025-02-08 01:21:35,329 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 01:21:35,329 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 47 [2025-02-08 01:21:35,479 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 01:21:35,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1285400597] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 01:21:35,479 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 01:21:35,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11, 11] total 34 [2025-02-08 01:21:35,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888399238] [2025-02-08 01:21:35,480 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 01:21:35,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-02-08 01:21:35,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:21:35,481 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-02-08 01:21:35,482 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=1078, Unknown=0, NotChecked=0, Total=1190 [2025-02-08 01:21:35,840 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-02-08 01:21:35,841 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 232 places, 418 transitions, 3946 flow. Second operand has 35 states, 35 states have (on average 6.8) internal successors, (238), 35 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:21:35,841 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:21:35,841 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-02-08 01:21:35,841 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:21:40,576 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-02-08 01:21:44,680 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-02-08 01:21:48,748 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-02-08 01:21:52,757 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-02-08 01:21:54,313 INFO L124 PetriNetUnfolderBase]: 1930/3420 cut-off events. [2025-02-08 01:21:54,313 INFO L125 PetriNetUnfolderBase]: For 55944/55944 co-relation queries the response was YES. [2025-02-08 01:21:54,327 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22081 conditions, 3420 events. 1930/3420 cut-off events. For 55944/55944 co-relation queries the response was YES. Maximal size of possible extension queue 228. Compared 20743 event pairs, 215 based on Foata normal form. 2/3418 useless extension candidates. Maximal degree in co-relation 21523. Up to 1739 conditions per place. [2025-02-08 01:21:54,344 INFO L140 encePairwiseOnDemand]: 14/28 looper letters, 335 selfloop transitions, 238 changer transitions 5/581 dead transitions. [2025-02-08 01:21:54,344 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 268 places, 581 transitions, 6884 flow [2025-02-08 01:21:54,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2025-02-08 01:21:54,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2025-02-08 01:21:54,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 377 transitions. [2025-02-08 01:21:54,352 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3638996138996139 [2025-02-08 01:21:54,352 INFO L175 Difference]: Start difference. First operand has 232 places, 418 transitions, 3946 flow. Second operand 37 states and 377 transitions. [2025-02-08 01:21:54,352 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 268 places, 581 transitions, 6884 flow [2025-02-08 01:21:54,480 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 243 places, 581 transitions, 6571 flow, removed 80 selfloop flow, removed 25 redundant places. [2025-02-08 01:21:54,486 INFO L231 Difference]: Finished difference. Result has 251 places, 468 transitions, 5165 flow [2025-02-08 01:21:54,486 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=3655, PETRI_DIFFERENCE_MINUEND_PLACES=207, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=418, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=194, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=207, PETRI_DIFFERENCE_SUBTRAHEND_STATES=37, PETRI_FLOW=5165, PETRI_PLACES=251, PETRI_TRANSITIONS=468} [2025-02-08 01:21:54,487 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 223 predicate places. [2025-02-08 01:21:54,487 INFO L471 AbstractCegarLoop]: Abstraction has has 251 places, 468 transitions, 5165 flow [2025-02-08 01:21:54,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 6.8) internal successors, (238), 35 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:21:54,487 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:21:54,487 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:21:54,493 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-08 01:21:54,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:21:54,688 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-02-08 01:21:54,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:21:54,689 INFO L85 PathProgramCache]: Analyzing trace with hash 484780605, now seen corresponding path program 6 times [2025-02-08 01:21:54,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:21:54,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366457474] [2025-02-08 01:21:54,689 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-08 01:21:54,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:21:54,698 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 25 statements into 2 equivalence classes. [2025-02-08 01:21:54,715 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 23 of 25 statements. [2025-02-08 01:21:54,716 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-02-08 01:21:54,716 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:21:54,977 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 01:21:54,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:21:54,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366457474] [2025-02-08 01:21:54,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366457474] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:21:54,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:21:54,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-08 01:21:54,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419752760] [2025-02-08 01:21:54,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:21:54,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-08 01:21:54,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:21:54,978 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-08 01:21:54,978 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2025-02-08 01:21:55,002 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-02-08 01:21:55,003 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 251 places, 468 transitions, 5165 flow. Second operand has 12 states, 12 states have (on average 6.833333333333333) internal successors, (82), 12 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:21:55,003 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:21:55,003 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-02-08 01:21:55,003 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:21:55,727 INFO L124 PetriNetUnfolderBase]: 2015/3562 cut-off events. [2025-02-08 01:21:55,727 INFO L125 PetriNetUnfolderBase]: For 68782/68782 co-relation queries the response was YES. [2025-02-08 01:21:55,744 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25032 conditions, 3562 events. 2015/3562 cut-off events. For 68782/68782 co-relation queries the response was YES. Maximal size of possible extension queue 250. Compared 21770 event pairs, 335 based on Foata normal form. 1/3555 useless extension candidates. Maximal degree in co-relation 24436. Up to 3258 conditions per place. [2025-02-08 01:21:55,756 INFO L140 encePairwiseOnDemand]: 17/28 looper letters, 475 selfloop transitions, 39 changer transitions 3/520 dead transitions. [2025-02-08 01:21:55,756 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 262 places, 520 transitions, 6883 flow [2025-02-08 01:21:55,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-08 01:21:55,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-02-08 01:21:55,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 140 transitions. [2025-02-08 01:21:55,759 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2025-02-08 01:21:55,759 INFO L175 Difference]: Start difference. First operand has 251 places, 468 transitions, 5165 flow. Second operand 12 states and 140 transitions. [2025-02-08 01:21:55,759 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 262 places, 520 transitions, 6883 flow [2025-02-08 01:21:56,011 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 241 places, 520 transitions, 6663 flow, removed 79 selfloop flow, removed 21 redundant places. [2025-02-08 01:21:56,016 INFO L231 Difference]: Finished difference. Result has 247 places, 483 transitions, 5309 flow [2025-02-08 01:21:56,017 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=4959, PETRI_DIFFERENCE_MINUEND_PLACES=230, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=468, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=432, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=5309, PETRI_PLACES=247, PETRI_TRANSITIONS=483} [2025-02-08 01:21:56,017 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 219 predicate places. [2025-02-08 01:21:56,017 INFO L471 AbstractCegarLoop]: Abstraction has has 247 places, 483 transitions, 5309 flow [2025-02-08 01:21:56,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.833333333333333) internal successors, (82), 12 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:21:56,017 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:21:56,017 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:21:56,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 01:21:56,017 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-02-08 01:21:56,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:21:56,018 INFO L85 PathProgramCache]: Analyzing trace with hash -1909610751, now seen corresponding path program 7 times [2025-02-08 01:21:56,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:21:56,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482037505] [2025-02-08 01:21:56,018 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-08 01:21:56,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:21:56,023 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-08 01:21:56,030 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-08 01:21:56,030 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:21:56,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:21:56,994 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:21:56,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:21:56,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482037505] [2025-02-08 01:21:56,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1482037505] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 01:21:56,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1212451484] [2025-02-08 01:21:56,994 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-08 01:21:56,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:21:56,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:21:56,996 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-08 01:21:57,000 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-08 01:21:57,038 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-08 01:21:57,056 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-08 01:21:57,056 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:21:57,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:21:57,057 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-02-08 01:21:57,059 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 01:21:57,147 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2025-02-08 01:21:57,685 INFO L349 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2025-02-08 01:21:57,685 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 20 [2025-02-08 01:21:57,786 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 01:21:57,786 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 01:21:58,912 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 01:21:58,912 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 318 treesize of output 324 [2025-02-08 01:21:59,945 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 01:21:59,946 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 16 [2025-02-08 01:21:59,965 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-02-08 01:21:59,965 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 1 [2025-02-08 01:21:59,977 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 01:21:59,977 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2025-02-08 01:22:00,430 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 01:22:00,430 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 27 [2025-02-08 01:22:00,448 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 01:22:00,449 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 19 [2025-02-08 01:22:00,466 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-02-08 01:22:00,466 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 1 [2025-02-08 01:22:00,494 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 01:22:00,495 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 34 [2025-02-08 01:22:00,529 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 01:22:00,530 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 12 [2025-02-08 01:22:00,540 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 01:22:00,540 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2025-02-08 01:22:00,556 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 01:22:00,557 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2025-02-08 01:22:00,584 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 01:22:00,584 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 26 [2025-02-08 01:22:00,596 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 01:22:00,596 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 26 [2025-02-08 01:22:00,610 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 01:22:00,611 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 121 treesize of output 99 [2025-02-08 01:22:00,815 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 01:22:00,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1212451484] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 01:22:00,815 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 01:22:00,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 13] total 38 [2025-02-08 01:22:00,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113913983] [2025-02-08 01:22:00,815 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 01:22:00,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2025-02-08 01:22:00,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:22:00,816 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2025-02-08 01:22:00,817 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=1342, Unknown=0, NotChecked=0, Total=1482 [2025-02-08 01:22:00,931 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-02-08 01:22:00,932 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 247 places, 483 transitions, 5309 flow. Second operand has 39 states, 39 states have (on average 6.615384615384615) internal successors, (258), 39 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:22:00,932 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:22:00,932 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-02-08 01:22:00,932 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:22:27,001 INFO L124 PetriNetUnfolderBase]: 4203/7434 cut-off events. [2025-02-08 01:22:27,001 INFO L125 PetriNetUnfolderBase]: For 146323/146323 co-relation queries the response was YES. [2025-02-08 01:22:27,042 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52524 conditions, 7434 events. 4203/7434 cut-off events. For 146323/146323 co-relation queries the response was YES. Maximal size of possible extension queue 453. Compared 51996 event pairs, 189 based on Foata normal form. 17/7447 useless extension candidates. Maximal degree in co-relation 51600. Up to 1386 conditions per place. [2025-02-08 01:22:27,109 INFO L140 encePairwiseOnDemand]: 12/28 looper letters, 547 selfloop transitions, 897 changer transitions 21/1468 dead transitions. [2025-02-08 01:22:27,110 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 357 places, 1468 transitions, 20040 flow [2025-02-08 01:22:27,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2025-02-08 01:22:27,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2025-02-08 01:22:27,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 1220 transitions. [2025-02-08 01:22:27,120 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.38220551378446116 [2025-02-08 01:22:27,120 INFO L175 Difference]: Start difference. First operand has 247 places, 483 transitions, 5309 flow. Second operand 114 states and 1220 transitions. [2025-02-08 01:22:27,120 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 357 places, 1468 transitions, 20040 flow [2025-02-08 01:22:27,639 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 353 places, 1468 transitions, 19884 flow, removed 61 selfloop flow, removed 4 redundant places. [2025-02-08 01:22:27,654 INFO L231 Difference]: Finished difference. Result has 401 places, 1071 transitions, 16050 flow [2025-02-08 01:22:27,655 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=5160, PETRI_DIFFERENCE_MINUEND_PLACES=240, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=475, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=353, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=114, PETRI_FLOW=16050, PETRI_PLACES=401, PETRI_TRANSITIONS=1071} [2025-02-08 01:22:27,656 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 373 predicate places. [2025-02-08 01:22:27,657 INFO L471 AbstractCegarLoop]: Abstraction has has 401 places, 1071 transitions, 16050 flow [2025-02-08 01:22:27,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 6.615384615384615) internal successors, (258), 39 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:22:27,658 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:22:27,658 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:22:27,664 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-08 01:22:27,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-02-08 01:22:27,862 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-02-08 01:22:27,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:22:27,863 INFO L85 PathProgramCache]: Analyzing trace with hash 210072545, now seen corresponding path program 8 times [2025-02-08 01:22:27,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:22:27,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690596570] [2025-02-08 01:22:27,863 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 01:22:27,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:22:27,870 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-02-08 01:22:27,879 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 23 of 25 statements. [2025-02-08 01:22:27,880 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 01:22:27,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:22:28,173 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 01:22:28,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:22:28,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690596570] [2025-02-08 01:22:28,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690596570] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:22:28,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:22:28,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-08 01:22:28,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328025198] [2025-02-08 01:22:28,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:22:28,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-08 01:22:28,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:22:28,174 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-08 01:22:28,174 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2025-02-08 01:22:28,198 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-02-08 01:22:28,198 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 401 places, 1071 transitions, 16050 flow. Second operand has 12 states, 12 states have (on average 6.833333333333333) internal successors, (82), 12 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:22:28,198 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:22:28,198 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-02-08 01:22:28,199 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand