./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/popl20-more-queue-add-3-nl.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-more-queue-add-3-nl.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 5dd003755f1e361f3bbf00c3bfecbc1131b6df98a7806f5bb08971966b13d6ac --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 01:18:24,641 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 01:18:24,725 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:18:24,730 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 01:18:24,731 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 01:18:24,750 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 01:18:24,750 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 01:18:24,751 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 01:18:24,755 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 01:18:24,755 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 01:18:24,755 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 01:18:24,755 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 01:18:24,755 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 01:18:24,755 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 01:18:24,755 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 01:18:24,756 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 01:18:24,756 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 01:18:24,756 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 01:18:24,756 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 01:18:24,756 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 01:18:24,756 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 01:18:24,756 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 01:18:24,756 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 01:18:24,756 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 01:18:24,756 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 01:18:24,756 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 01:18:24,756 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 01:18:24,756 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 01:18:24,757 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 01:18:24,757 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 01:18:24,757 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 01:18:24,757 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 01:18:24,757 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 01:18:24,757 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 01:18:24,757 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 01:18:24,757 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 01:18:24,757 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 01:18:24,757 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 01:18:24,757 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 01:18:24,757 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 01:18:24,757 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 01:18:24,758 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 01:18:24,758 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 01:18:24,758 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 -> 5dd003755f1e361f3bbf00c3bfecbc1131b6df98a7806f5bb08971966b13d6ac [2025-02-08 01:18:25,051 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 01:18:25,063 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 01:18:25,065 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 01:18:25,066 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 01:18:25,067 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 01:18:25,068 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-more-queue-add-3-nl.wvr.c [2025-02-08 01:18:26,399 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/55313d282/1b51ae9d8e154bad86eadab247634eb6/FLAGc479f2980 [2025-02-08 01:18:26,699 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 01:18:26,699 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-queue-add-3-nl.wvr.c [2025-02-08 01:18:26,711 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/55313d282/1b51ae9d8e154bad86eadab247634eb6/FLAGc479f2980 [2025-02-08 01:18:26,972 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/55313d282/1b51ae9d8e154bad86eadab247634eb6 [2025-02-08 01:18:26,974 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 01:18:26,976 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 01:18:26,977 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 01:18:26,977 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 01:18:26,982 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 01:18:26,983 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 01:18:26" (1/1) ... [2025-02-08 01:18:26,984 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f9fcaa6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:18:26, skipping insertion in model container [2025-02-08 01:18:26,984 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 01:18:26" (1/1) ... [2025-02-08 01:18:27,003 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 01:18:27,153 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-more-queue-add-3-nl.wvr.c[3654,3667] [2025-02-08 01:18:27,160 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 01:18:27,168 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 01:18:27,198 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-more-queue-add-3-nl.wvr.c[3654,3667] [2025-02-08 01:18:27,200 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 01:18:27,214 INFO L204 MainTranslator]: Completed translation [2025-02-08 01:18:27,215 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:18:27 WrapperNode [2025-02-08 01:18:27,215 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 01:18:27,216 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 01:18:27,216 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 01:18:27,216 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 01:18:27,221 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:18:27" (1/1) ... [2025-02-08 01:18:27,226 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:18:27" (1/1) ... [2025-02-08 01:18:27,251 INFO L138 Inliner]: procedures = 25, calls = 40, calls flagged for inlining = 16, calls inlined = 18, statements flattened = 237 [2025-02-08 01:18:27,252 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 01:18:27,252 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 01:18:27,252 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 01:18:27,252 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 01:18:27,260 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:18:27" (1/1) ... [2025-02-08 01:18:27,261 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:18:27" (1/1) ... [2025-02-08 01:18:27,263 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:18:27" (1/1) ... [2025-02-08 01:18:27,279 INFO L175 MemorySlicer]: Split 9 memory accesses to 2 slices as follows [2, 7]. 78 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:18:27,279 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:18:27" (1/1) ... [2025-02-08 01:18:27,279 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:18:27" (1/1) ... [2025-02-08 01:18:27,288 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:18:27" (1/1) ... [2025-02-08 01:18:27,289 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:18:27" (1/1) ... [2025-02-08 01:18:27,290 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:18:27" (1/1) ... [2025-02-08 01:18:27,296 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:18:27" (1/1) ... [2025-02-08 01:18:27,298 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 01:18:27,299 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 01:18:27,299 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 01:18:27,299 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 01:18:27,300 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:18:27" (1/1) ... [2025-02-08 01:18:27,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 01:18:27,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:18:27,328 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:18:27,331 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:18:27,347 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 01:18:27,348 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-08 01:18:27,348 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-08 01:18:27,348 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-08 01:18:27,348 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-08 01:18:27,348 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-02-08 01:18:27,348 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-02-08 01:18:27,348 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 01:18:27,348 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 01:18:27,348 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 01:18:27,348 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-08 01:18:27,348 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-02-08 01:18:27,348 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-02-08 01:18:27,348 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 01:18:27,348 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 01:18:27,348 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 01:18:27,348 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-08 01:18:27,348 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-08 01:18:27,350 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:18:27,470 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 01:18:27,473 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 01:18:27,957 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 01:18:27,958 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 01:18:28,304 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 01:18:28,304 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 01:18:28,304 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:18:28 BoogieIcfgContainer [2025-02-08 01:18:28,304 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 01:18:28,307 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 01:18:28,307 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 01:18:28,311 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 01:18:28,312 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 01:18:26" (1/3) ... [2025-02-08 01:18:28,312 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11b7b96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 01:18:28, skipping insertion in model container [2025-02-08 01:18:28,312 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:18:27" (2/3) ... [2025-02-08 01:18:28,313 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11b7b96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 01:18:28, skipping insertion in model container [2025-02-08 01:18:28,313 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:18:28" (3/3) ... [2025-02-08 01:18:28,314 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-more-queue-add-3-nl.wvr.c [2025-02-08 01:18:28,330 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 01:18:28,331 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-more-queue-add-3-nl.wvr.c that has 4 procedures, 38 locations, 1 initial locations, 5 loop locations, and 1 error locations. [2025-02-08 01:18:28,332 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 01:18:28,397 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-02-08 01:18:28,437 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 44 transitions, 109 flow [2025-02-08 01:18:28,480 INFO L124 PetriNetUnfolderBase]: 7/41 cut-off events. [2025-02-08 01:18:28,485 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-02-08 01:18:28,492 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54 conditions, 41 events. 7/41 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 72 event pairs, 0 based on Foata normal form. 0/33 useless extension candidates. Maximal degree in co-relation 33. Up to 2 conditions per place. [2025-02-08 01:18:28,493 INFO L82 GeneralOperation]: Start removeDead. Operand has 47 places, 44 transitions, 109 flow [2025-02-08 01:18:28,496 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 43 places, 40 transitions, 98 flow [2025-02-08 01:18:28,507 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 01:18:28,522 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;@4206dc5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 01:18:28,522 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-02-08 01:18:28,548 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 01:18:28,548 INFO L124 PetriNetUnfolderBase]: 7/39 cut-off events. [2025-02-08 01:18:28,548 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-02-08 01:18:28,548 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:18:28,549 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:18:28,550 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 01:18:28,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:18:28,559 INFO L85 PathProgramCache]: Analyzing trace with hash 1884664808, now seen corresponding path program 1 times [2025-02-08 01:18:28,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:18:28,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927020686] [2025-02-08 01:18:28,567 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:18:28,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:18:28,658 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-08 01:18:28,706 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-08 01:18:28,708 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:18:28,708 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:18:28,840 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:18:28,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:18:28,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927020686] [2025-02-08 01:18:28,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927020686] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:18:28,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:18:28,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 01:18:28,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473497354] [2025-02-08 01:18:28,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:18:28,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-08 01:18:28,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:18:28,876 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-08 01:18:28,877 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 01:18:28,879 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 44 [2025-02-08 01:18:28,881 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 40 transitions, 98 flow. Second operand has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 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:18:28,882 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:18:28,882 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 44 [2025-02-08 01:18:28,882 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:18:29,248 INFO L124 PetriNetUnfolderBase]: 1088/1721 cut-off events. [2025-02-08 01:18:29,249 INFO L125 PetriNetUnfolderBase]: For 115/115 co-relation queries the response was YES. [2025-02-08 01:18:29,261 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3300 conditions, 1721 events. 1088/1721 cut-off events. For 115/115 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 8024 event pairs, 892 based on Foata normal form. 156/1718 useless extension candidates. Maximal degree in co-relation 3064. Up to 1453 conditions per place. [2025-02-08 01:18:29,277 INFO L140 encePairwiseOnDemand]: 42/44 looper letters, 30 selfloop transitions, 0 changer transitions 0/38 dead transitions. [2025-02-08 01:18:29,278 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 38 transitions, 154 flow [2025-02-08 01:18:29,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-08 01:18:29,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-02-08 01:18:29,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 54 transitions. [2025-02-08 01:18:29,291 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6136363636363636 [2025-02-08 01:18:29,293 INFO L175 Difference]: Start difference. First operand has 43 places, 40 transitions, 98 flow. Second operand 2 states and 54 transitions. [2025-02-08 01:18:29,294 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 38 transitions, 154 flow [2025-02-08 01:18:29,301 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 38 transitions, 142 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-02-08 01:18:29,304 INFO L231 Difference]: Finished difference. Result has 38 places, 38 transitions, 82 flow [2025-02-08 01:18:29,307 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=82, PETRI_PLACES=38, PETRI_TRANSITIONS=38} [2025-02-08 01:18:29,311 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, -5 predicate places. [2025-02-08 01:18:29,312 INFO L471 AbstractCegarLoop]: Abstraction has has 38 places, 38 transitions, 82 flow [2025-02-08 01:18:29,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 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:18:29,313 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:18:29,313 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, 1, 1, 1, 1, 1, 1] [2025-02-08 01:18:29,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 01:18:29,313 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 01:18:29,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:18:29,314 INFO L85 PathProgramCache]: Analyzing trace with hash -1022763741, now seen corresponding path program 1 times [2025-02-08 01:18:29,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:18:29,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057709066] [2025-02-08 01:18:29,314 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:18:29,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:18:29,336 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-08 01:18:29,353 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-08 01:18:29,353 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:18:29,354 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:18:29,605 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:18:29,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:18:29,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057709066] [2025-02-08 01:18:29,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057709066] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:18:29,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:18:29,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 01:18:29,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507979789] [2025-02-08 01:18:29,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:18:29,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 01:18:29,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:18:29,608 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 01:18:29,608 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 01:18:29,608 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 44 [2025-02-08 01:18:29,609 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 38 transitions, 82 flow. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 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:18:29,609 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:18:29,609 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 44 [2025-02-08 01:18:29,609 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:18:29,838 INFO L124 PetriNetUnfolderBase]: 1046/1647 cut-off events. [2025-02-08 01:18:29,838 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2025-02-08 01:18:29,843 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3157 conditions, 1647 events. 1046/1647 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 7423 event pairs, 271 based on Foata normal form. 33/1594 useless extension candidates. Maximal degree in co-relation 3154. Up to 1273 conditions per place. [2025-02-08 01:18:29,852 INFO L140 encePairwiseOnDemand]: 40/44 looper letters, 40 selfloop transitions, 3 changer transitions 0/51 dead transitions. [2025-02-08 01:18:29,853 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 51 transitions, 196 flow [2025-02-08 01:18:29,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 01:18:29,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 01:18:29,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 77 transitions. [2025-02-08 01:18:29,855 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5833333333333334 [2025-02-08 01:18:29,855 INFO L175 Difference]: Start difference. First operand has 38 places, 38 transitions, 82 flow. Second operand 3 states and 77 transitions. [2025-02-08 01:18:29,855 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 51 transitions, 196 flow [2025-02-08 01:18:29,856 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 51 transitions, 196 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 01:18:29,858 INFO L231 Difference]: Finished difference. Result has 41 places, 40 transitions, 101 flow [2025-02-08 01:18:29,858 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=101, PETRI_PLACES=41, PETRI_TRANSITIONS=40} [2025-02-08 01:18:29,858 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, -2 predicate places. [2025-02-08 01:18:29,859 INFO L471 AbstractCegarLoop]: Abstraction has has 41 places, 40 transitions, 101 flow [2025-02-08 01:18:29,859 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 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:18:29,859 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:18:29,859 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, 1, 1, 1, 1, 1, 1] [2025-02-08 01:18:29,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 01:18:29,859 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 01:18:29,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:18:29,860 INFO L85 PathProgramCache]: Analyzing trace with hash -1067214863, now seen corresponding path program 2 times [2025-02-08 01:18:29,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:18:29,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399393467] [2025-02-08 01:18:29,860 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 01:18:29,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:18:29,881 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 1 equivalence classes. [2025-02-08 01:18:29,901 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-08 01:18:29,901 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 01:18:29,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:18:30,046 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:18:30,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:18:30,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399393467] [2025-02-08 01:18:30,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399393467] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:18:30,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:18:30,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 01:18:30,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474687241] [2025-02-08 01:18:30,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:18:30,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 01:18:30,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:18:30,048 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 01:18:30,048 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 01:18:30,048 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 44 [2025-02-08 01:18:30,048 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 40 transitions, 101 flow. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 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:18:30,049 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:18:30,049 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 44 [2025-02-08 01:18:30,049 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:18:30,255 INFO L124 PetriNetUnfolderBase]: 900/1499 cut-off events. [2025-02-08 01:18:30,255 INFO L125 PetriNetUnfolderBase]: For 260/263 co-relation queries the response was YES. [2025-02-08 01:18:30,260 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3118 conditions, 1499 events. 900/1499 cut-off events. For 260/263 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 6853 event pairs, 304 based on Foata normal form. 26/1445 useless extension candidates. Maximal degree in co-relation 3113. Up to 880 conditions per place. [2025-02-08 01:18:30,269 INFO L140 encePairwiseOnDemand]: 41/44 looper letters, 42 selfloop transitions, 2 changer transitions 0/52 dead transitions. [2025-02-08 01:18:30,269 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 52 transitions, 221 flow [2025-02-08 01:18:30,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 01:18:30,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 01:18:30,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 76 transitions. [2025-02-08 01:18:30,273 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5757575757575758 [2025-02-08 01:18:30,273 INFO L175 Difference]: Start difference. First operand has 41 places, 40 transitions, 101 flow. Second operand 3 states and 76 transitions. [2025-02-08 01:18:30,273 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 52 transitions, 221 flow [2025-02-08 01:18:30,274 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 52 transitions, 218 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 01:18:30,275 INFO L231 Difference]: Finished difference. Result has 43 places, 41 transitions, 110 flow [2025-02-08 01:18:30,275 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=110, PETRI_PLACES=43, PETRI_TRANSITIONS=41} [2025-02-08 01:18:30,277 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 0 predicate places. [2025-02-08 01:18:30,278 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 41 transitions, 110 flow [2025-02-08 01:18:30,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 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:18:30,278 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:18:30,278 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, 1, 1, 1, 1, 1, 1] [2025-02-08 01:18:30,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 01:18:30,278 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 01:18:30,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:18:30,279 INFO L85 PathProgramCache]: Analyzing trace with hash 21045273, now seen corresponding path program 3 times [2025-02-08 01:18:30,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:18:30,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984348338] [2025-02-08 01:18:30,280 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 01:18:30,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:18:30,298 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 31 statements into 1 equivalence classes. [2025-02-08 01:18:30,331 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-08 01:18:30,331 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-08 01:18:30,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:18:30,529 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:18:30,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:18:30,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984348338] [2025-02-08 01:18:30,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984348338] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:18:30,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:18:30,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 01:18:30,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465913524] [2025-02-08 01:18:30,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:18:30,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 01:18:30,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:18:30,531 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 01:18:30,531 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 01:18:30,531 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 44 [2025-02-08 01:18:30,532 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 41 transitions, 110 flow. Second operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:18:30,532 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:18:30,532 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 44 [2025-02-08 01:18:30,532 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:18:30,766 INFO L124 PetriNetUnfolderBase]: 948/1600 cut-off events. [2025-02-08 01:18:30,766 INFO L125 PetriNetUnfolderBase]: For 362/364 co-relation queries the response was YES. [2025-02-08 01:18:30,769 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3470 conditions, 1600 events. 948/1600 cut-off events. For 362/364 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 7369 event pairs, 700 based on Foata normal form. 27/1545 useless extension candidates. Maximal degree in co-relation 3464. Up to 1275 conditions per place. [2025-02-08 01:18:30,775 INFO L140 encePairwiseOnDemand]: 39/44 looper letters, 32 selfloop transitions, 2 changer transitions 13/55 dead transitions. [2025-02-08 01:18:30,775 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 55 transitions, 235 flow [2025-02-08 01:18:30,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 01:18:30,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 01:18:30,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 90 transitions. [2025-02-08 01:18:30,777 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5113636363636364 [2025-02-08 01:18:30,777 INFO L175 Difference]: Start difference. First operand has 43 places, 41 transitions, 110 flow. Second operand 4 states and 90 transitions. [2025-02-08 01:18:30,777 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 55 transitions, 235 flow [2025-02-08 01:18:30,778 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 55 transitions, 233 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 01:18:30,778 INFO L231 Difference]: Finished difference. Result has 47 places, 42 transitions, 124 flow [2025-02-08 01:18:30,779 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=124, PETRI_PLACES=47, PETRI_TRANSITIONS=42} [2025-02-08 01:18:30,779 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 4 predicate places. [2025-02-08 01:18:30,779 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 42 transitions, 124 flow [2025-02-08 01:18:30,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:18:30,780 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:18:30,781 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, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:18:30,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 01:18:30,781 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 01:18:30,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:18:30,782 INFO L85 PathProgramCache]: Analyzing trace with hash 1625698709, now seen corresponding path program 1 times [2025-02-08 01:18:30,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:18:30,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259168034] [2025-02-08 01:18:30,782 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:18:30,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:18:30,794 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-02-08 01:18:30,813 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-02-08 01:18:30,813 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:18:30,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:18:30,968 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:18:30,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:18:30,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259168034] [2025-02-08 01:18:30,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259168034] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:18:30,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:18:30,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 01:18:30,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053153281] [2025-02-08 01:18:30,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:18:30,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 01:18:30,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:18:30,969 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 01:18:30,970 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 01:18:30,970 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 44 [2025-02-08 01:18:30,970 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 42 transitions, 124 flow. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 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:18:30,970 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:18:30,970 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 44 [2025-02-08 01:18:30,970 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:18:31,237 INFO L124 PetriNetUnfolderBase]: 1142/1926 cut-off events. [2025-02-08 01:18:31,237 INFO L125 PetriNetUnfolderBase]: For 549/554 co-relation queries the response was YES. [2025-02-08 01:18:31,243 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4247 conditions, 1926 events. 1142/1926 cut-off events. For 549/554 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 9370 event pairs, 855 based on Foata normal form. 32/1875 useless extension candidates. Maximal degree in co-relation 4239. Up to 1276 conditions per place. [2025-02-08 01:18:31,251 INFO L140 encePairwiseOnDemand]: 40/44 looper letters, 33 selfloop transitions, 2 changer transitions 19/62 dead transitions. [2025-02-08 01:18:31,251 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 62 transitions, 290 flow [2025-02-08 01:18:31,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 01:18:31,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 01:18:31,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 93 transitions. [2025-02-08 01:18:31,254 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5284090909090909 [2025-02-08 01:18:31,255 INFO L175 Difference]: Start difference. First operand has 47 places, 42 transitions, 124 flow. Second operand 4 states and 93 transitions. [2025-02-08 01:18:31,255 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 62 transitions, 290 flow [2025-02-08 01:18:31,260 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 62 transitions, 278 flow, removed 5 selfloop flow, removed 2 redundant places. [2025-02-08 01:18:31,261 INFO L231 Difference]: Finished difference. Result has 49 places, 43 transitions, 130 flow [2025-02-08 01:18:31,261 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=130, PETRI_PLACES=49, PETRI_TRANSITIONS=43} [2025-02-08 01:18:31,262 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 6 predicate places. [2025-02-08 01:18:31,262 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 43 transitions, 130 flow [2025-02-08 01:18:31,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 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:18:31,262 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:18:31,262 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:18:31,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 01:18:31,262 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 01:18:31,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:18:31,263 INFO L85 PathProgramCache]: Analyzing trace with hash -1844380215, now seen corresponding path program 1 times [2025-02-08 01:18:31,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:18:31,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377232000] [2025-02-08 01:18:31,263 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:18:31,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:18:31,279 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-02-08 01:18:31,334 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-02-08 01:18:31,335 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:18:31,335 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:18:32,550 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:18:32,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:18:32,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377232000] [2025-02-08 01:18:32,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377232000] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:18:32,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:18:32,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-08 01:18:32,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362403492] [2025-02-08 01:18:32,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:18:32,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-08 01:18:32,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:18:32,553 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-08 01:18:32,553 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-02-08 01:18:32,603 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2025-02-08 01:18:32,604 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 43 transitions, 130 flow. Second operand has 11 states, 11 states have (on average 12.636363636363637) internal successors, (139), 11 states have internal predecessors, (139), 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:18:32,604 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:18:32,604 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2025-02-08 01:18:32,604 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:18:33,314 INFO L124 PetriNetUnfolderBase]: 1302/2208 cut-off events. [2025-02-08 01:18:33,315 INFO L125 PetriNetUnfolderBase]: For 566/566 co-relation queries the response was YES. [2025-02-08 01:18:33,318 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4832 conditions, 2208 events. 1302/2208 cut-off events. For 566/566 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 11606 event pairs, 135 based on Foata normal form. 1/2145 useless extension candidates. Maximal degree in co-relation 4823. Up to 1406 conditions per place. [2025-02-08 01:18:33,326 INFO L140 encePairwiseOnDemand]: 32/44 looper letters, 99 selfloop transitions, 25 changer transitions 3/134 dead transitions. [2025-02-08 01:18:33,326 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 134 transitions, 641 flow [2025-02-08 01:18:33,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-08 01:18:33,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-02-08 01:18:33,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 245 transitions. [2025-02-08 01:18:33,329 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4640151515151515 [2025-02-08 01:18:33,329 INFO L175 Difference]: Start difference. First operand has 49 places, 43 transitions, 130 flow. Second operand 12 states and 245 transitions. [2025-02-08 01:18:33,329 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 134 transitions, 641 flow [2025-02-08 01:18:33,335 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 134 transitions, 625 flow, removed 7 selfloop flow, removed 2 redundant places. [2025-02-08 01:18:33,336 INFO L231 Difference]: Finished difference. Result has 62 places, 65 transitions, 260 flow [2025-02-08 01:18:33,336 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=260, PETRI_PLACES=62, PETRI_TRANSITIONS=65} [2025-02-08 01:18:33,337 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 19 predicate places. [2025-02-08 01:18:33,337 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 65 transitions, 260 flow [2025-02-08 01:18:33,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 12.636363636363637) internal successors, (139), 11 states have internal predecessors, (139), 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:18:33,337 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:18:33,337 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:18:33,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 01:18:33,338 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 01:18:33,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:18:33,339 INFO L85 PathProgramCache]: Analyzing trace with hash 352152721, now seen corresponding path program 2 times [2025-02-08 01:18:33,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:18:33,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335361870] [2025-02-08 01:18:33,339 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 01:18:33,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:18:33,352 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-02-08 01:18:33,383 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 31 of 33 statements. [2025-02-08 01:18:33,384 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 01:18:33,384 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:18:34,265 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:18:34,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:18:34,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335361870] [2025-02-08 01:18:34,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335361870] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:18:34,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:18:34,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-08 01:18:34,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877615060] [2025-02-08 01:18:34,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:18:34,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-08 01:18:34,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:18:34,266 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-08 01:18:34,266 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-02-08 01:18:34,307 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2025-02-08 01:18:34,308 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 65 transitions, 260 flow. Second operand has 11 states, 11 states have (on average 12.636363636363637) internal successors, (139), 11 states have internal predecessors, (139), 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:18:34,308 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:18:34,308 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2025-02-08 01:18:34,308 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:18:34,934 INFO L124 PetriNetUnfolderBase]: 1463/2522 cut-off events. [2025-02-08 01:18:34,934 INFO L125 PetriNetUnfolderBase]: For 1508/1508 co-relation queries the response was YES. [2025-02-08 01:18:34,941 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6652 conditions, 2522 events. 1463/2522 cut-off events. For 1508/1508 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 13763 event pairs, 430 based on Foata normal form. 1/2454 useless extension candidates. Maximal degree in co-relation 6639. Up to 1741 conditions per place. [2025-02-08 01:18:34,954 INFO L140 encePairwiseOnDemand]: 32/44 looper letters, 98 selfloop transitions, 33 changer transitions 3/141 dead transitions. [2025-02-08 01:18:34,954 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 141 transitions, 815 flow [2025-02-08 01:18:34,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-08 01:18:34,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-02-08 01:18:34,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 224 transitions. [2025-02-08 01:18:34,956 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4628099173553719 [2025-02-08 01:18:34,956 INFO L175 Difference]: Start difference. First operand has 62 places, 65 transitions, 260 flow. Second operand 11 states and 224 transitions. [2025-02-08 01:18:34,956 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 141 transitions, 815 flow [2025-02-08 01:18:34,960 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 141 transitions, 810 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 01:18:34,962 INFO L231 Difference]: Finished difference. Result has 77 places, 86 transitions, 484 flow [2025-02-08 01:18:34,962 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=256, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=484, PETRI_PLACES=77, PETRI_TRANSITIONS=86} [2025-02-08 01:18:34,963 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 34 predicate places. [2025-02-08 01:18:34,963 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 86 transitions, 484 flow [2025-02-08 01:18:34,963 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 12.636363636363637) internal successors, (139), 11 states have internal predecessors, (139), 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:18:34,963 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:18:34,963 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:18:34,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 01:18:34,963 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 01:18:34,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:18:34,964 INFO L85 PathProgramCache]: Analyzing trace with hash 65459193, now seen corresponding path program 3 times [2025-02-08 01:18:34,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:18:34,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212433031] [2025-02-08 01:18:34,964 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 01:18:34,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:18:34,975 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 33 statements into 2 equivalence classes. [2025-02-08 01:18:35,011 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 31 of 33 statements. [2025-02-08 01:18:35,011 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-08 01:18:35,012 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:18:35,784 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:18:35,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:18:35,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212433031] [2025-02-08 01:18:35,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212433031] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:18:35,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:18:35,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-08 01:18:35,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861045098] [2025-02-08 01:18:35,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:18:35,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-08 01:18:35,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:18:35,786 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-08 01:18:35,786 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-02-08 01:18:35,843 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2025-02-08 01:18:35,843 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 86 transitions, 484 flow. Second operand has 11 states, 11 states have (on average 12.636363636363637) internal successors, (139), 11 states have internal predecessors, (139), 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:18:35,844 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:18:35,844 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2025-02-08 01:18:35,844 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:18:36,542 INFO L124 PetriNetUnfolderBase]: 1576/2768 cut-off events. [2025-02-08 01:18:36,542 INFO L125 PetriNetUnfolderBase]: For 3298/3310 co-relation queries the response was YES. [2025-02-08 01:18:36,552 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8090 conditions, 2768 events. 1576/2768 cut-off events. For 3298/3310 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 15791 event pairs, 306 based on Foata normal form. 4/2692 useless extension candidates. Maximal degree in co-relation 8069. Up to 1798 conditions per place. [2025-02-08 01:18:36,565 INFO L140 encePairwiseOnDemand]: 32/44 looper letters, 111 selfloop transitions, 39 changer transitions 3/160 dead transitions. [2025-02-08 01:18:36,566 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 160 transitions, 1073 flow [2025-02-08 01:18:36,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-08 01:18:36,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-02-08 01:18:36,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 245 transitions. [2025-02-08 01:18:36,567 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4640151515151515 [2025-02-08 01:18:36,568 INFO L175 Difference]: Start difference. First operand has 77 places, 86 transitions, 484 flow. Second operand 12 states and 245 transitions. [2025-02-08 01:18:36,568 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 160 transitions, 1073 flow [2025-02-08 01:18:36,577 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 160 transitions, 1055 flow, removed 8 selfloop flow, removed 1 redundant places. [2025-02-08 01:18:36,580 INFO L231 Difference]: Finished difference. Result has 90 places, 92 transitions, 609 flow [2025-02-08 01:18:36,580 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=468, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=609, PETRI_PLACES=90, PETRI_TRANSITIONS=92} [2025-02-08 01:18:36,581 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 47 predicate places. [2025-02-08 01:18:36,581 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 92 transitions, 609 flow [2025-02-08 01:18:36,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 12.636363636363637) internal successors, (139), 11 states have internal predecessors, (139), 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:18:36,581 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:18:36,581 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:18:36,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 01:18:36,582 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 01:18:36,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:18:36,582 INFO L85 PathProgramCache]: Analyzing trace with hash -1397027845, now seen corresponding path program 4 times [2025-02-08 01:18:36,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:18:36,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100622721] [2025-02-08 01:18:36,583 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 01:18:36,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:18:36,601 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 33 statements into 2 equivalence classes. [2025-02-08 01:18:36,623 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-02-08 01:18:36,623 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-08 01:18:36,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:18:37,256 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:18:37,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:18:37,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100622721] [2025-02-08 01:18:37,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100622721] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:18:37,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:18:37,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-08 01:18:37,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649438680] [2025-02-08 01:18:37,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:18:37,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-08 01:18:37,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:18:37,258 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-08 01:18:37,258 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-02-08 01:18:37,303 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 44 [2025-02-08 01:18:37,304 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 92 transitions, 609 flow. Second operand has 11 states, 11 states have (on average 11.636363636363637) internal successors, (128), 11 states have internal predecessors, (128), 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:18:37,304 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:18:37,304 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 44 [2025-02-08 01:18:37,304 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:18:38,119 INFO L124 PetriNetUnfolderBase]: 1941/3385 cut-off events. [2025-02-08 01:18:38,119 INFO L125 PetriNetUnfolderBase]: For 6596/6620 co-relation queries the response was YES. [2025-02-08 01:18:38,130 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10517 conditions, 3385 events. 1941/3385 cut-off events. For 6596/6620 co-relation queries the response was YES. Maximal size of possible extension queue 166. Compared 20196 event pairs, 450 based on Foata normal form. 7/3276 useless extension candidates. Maximal degree in co-relation 10492. Up to 2176 conditions per place. [2025-02-08 01:18:38,172 INFO L140 encePairwiseOnDemand]: 32/44 looper letters, 121 selfloop transitions, 43 changer transitions 3/173 dead transitions. [2025-02-08 01:18:38,173 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 173 transitions, 1288 flow [2025-02-08 01:18:38,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-08 01:18:38,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-02-08 01:18:38,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 239 transitions. [2025-02-08 01:18:38,175 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45265151515151514 [2025-02-08 01:18:38,175 INFO L175 Difference]: Start difference. First operand has 90 places, 92 transitions, 609 flow. Second operand 12 states and 239 transitions. [2025-02-08 01:18:38,175 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 173 transitions, 1288 flow [2025-02-08 01:18:38,191 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 173 transitions, 1218 flow, removed 13 selfloop flow, removed 7 redundant places. [2025-02-08 01:18:38,194 INFO L231 Difference]: Finished difference. Result has 97 places, 101 transitions, 721 flow [2025-02-08 01:18:38,194 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=539, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=721, PETRI_PLACES=97, PETRI_TRANSITIONS=101} [2025-02-08 01:18:38,195 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 54 predicate places. [2025-02-08 01:18:38,196 INFO L471 AbstractCegarLoop]: Abstraction has has 97 places, 101 transitions, 721 flow [2025-02-08 01:18:38,196 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.636363636363637) internal successors, (128), 11 states have internal predecessors, (128), 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:18:38,196 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:18:38,196 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:18:38,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 01:18:38,197 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 01:18:38,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:18:38,197 INFO L85 PathProgramCache]: Analyzing trace with hash -1806724673, now seen corresponding path program 5 times [2025-02-08 01:18:38,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:18:38,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728670568] [2025-02-08 01:18:38,199 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-08 01:18:38,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:18:38,210 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-02-08 01:18:38,232 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-02-08 01:18:38,234 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 01:18:38,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:18:38,888 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:18:38,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:18:38,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728670568] [2025-02-08 01:18:38,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728670568] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:18:38,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:18:38,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-08 01:18:38,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028870557] [2025-02-08 01:18:38,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:18:38,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-08 01:18:38,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:18:38,889 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-08 01:18:38,889 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-02-08 01:18:38,933 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2025-02-08 01:18:38,934 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 101 transitions, 721 flow. Second operand has 11 states, 11 states have (on average 12.636363636363637) internal successors, (139), 11 states have internal predecessors, (139), 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:18:38,934 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:18:38,934 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2025-02-08 01:18:38,934 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:18:39,537 INFO L124 PetriNetUnfolderBase]: 1743/3097 cut-off events. [2025-02-08 01:18:39,537 INFO L125 PetriNetUnfolderBase]: For 7692/7716 co-relation queries the response was YES. [2025-02-08 01:18:39,547 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10251 conditions, 3097 events. 1743/3097 cut-off events. For 7692/7716 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 18571 event pairs, 410 based on Foata normal form. 16/3005 useless extension candidates. Maximal degree in co-relation 10222. Up to 2171 conditions per place. [2025-02-08 01:18:39,558 INFO L140 encePairwiseOnDemand]: 32/44 looper letters, 116 selfloop transitions, 38 changer transitions 3/164 dead transitions. [2025-02-08 01:18:39,559 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 164 transitions, 1293 flow [2025-02-08 01:18:39,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-08 01:18:39,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-02-08 01:18:39,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 236 transitions. [2025-02-08 01:18:39,560 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.44696969696969696 [2025-02-08 01:18:39,560 INFO L175 Difference]: Start difference. First operand has 97 places, 101 transitions, 721 flow. Second operand 12 states and 236 transitions. [2025-02-08 01:18:39,560 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 164 transitions, 1293 flow [2025-02-08 01:18:39,576 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 164 transitions, 1205 flow, removed 23 selfloop flow, removed 6 redundant places. [2025-02-08 01:18:39,578 INFO L231 Difference]: Finished difference. Result has 104 places, 104 transitions, 742 flow [2025-02-08 01:18:39,578 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=633, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=742, PETRI_PLACES=104, PETRI_TRANSITIONS=104} [2025-02-08 01:18:39,579 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 61 predicate places. [2025-02-08 01:18:39,579 INFO L471 AbstractCegarLoop]: Abstraction has has 104 places, 104 transitions, 742 flow [2025-02-08 01:18:39,579 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 12.636363636363637) internal successors, (139), 11 states have internal predecessors, (139), 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:18:39,579 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:18:39,579 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:18:39,579 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 01:18:39,580 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 01:18:39,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:18:39,580 INFO L85 PathProgramCache]: Analyzing trace with hash 120154107, now seen corresponding path program 6 times [2025-02-08 01:18:39,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:18:39,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772680247] [2025-02-08 01:18:39,581 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-08 01:18:39,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:18:39,590 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 33 statements into 2 equivalence classes. [2025-02-08 01:18:39,604 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 31 of 33 statements. [2025-02-08 01:18:39,604 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-02-08 01:18:39,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:18:40,234 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:18:40,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:18:40,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772680247] [2025-02-08 01:18:40,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [772680247] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:18:40,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:18:40,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-08 01:18:40,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031724650] [2025-02-08 01:18:40,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:18:40,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-08 01:18:40,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:18:40,236 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-08 01:18:40,236 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-02-08 01:18:40,278 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2025-02-08 01:18:40,278 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 104 transitions, 742 flow. Second operand has 11 states, 11 states have (on average 12.636363636363637) internal successors, (139), 11 states have internal predecessors, (139), 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:18:40,278 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:18:40,278 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2025-02-08 01:18:40,278 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:18:40,978 INFO L124 PetriNetUnfolderBase]: 1865/3328 cut-off events. [2025-02-08 01:18:40,979 INFO L125 PetriNetUnfolderBase]: For 8372/8396 co-relation queries the response was YES. [2025-02-08 01:18:40,991 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11053 conditions, 3328 events. 1865/3328 cut-off events. For 8372/8396 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 20461 event pairs, 612 based on Foata normal form. 7/3215 useless extension candidates. Maximal degree in co-relation 11021. Up to 2438 conditions per place. [2025-02-08 01:18:41,007 INFO L140 encePairwiseOnDemand]: 32/44 looper letters, 123 selfloop transitions, 36 changer transitions 3/169 dead transitions. [2025-02-08 01:18:41,007 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 169 transitions, 1421 flow [2025-02-08 01:18:41,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-08 01:18:41,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-02-08 01:18:41,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 223 transitions. [2025-02-08 01:18:41,010 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4607438016528926 [2025-02-08 01:18:41,011 INFO L175 Difference]: Start difference. First operand has 104 places, 104 transitions, 742 flow. Second operand 11 states and 223 transitions. [2025-02-08 01:18:41,011 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 169 transitions, 1421 flow [2025-02-08 01:18:41,032 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 169 transitions, 1335 flow, removed 6 selfloop flow, removed 9 redundant places. [2025-02-08 01:18:41,035 INFO L231 Difference]: Finished difference. Result has 110 places, 115 transitions, 889 flow [2025-02-08 01:18:41,035 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=658, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=889, PETRI_PLACES=110, PETRI_TRANSITIONS=115} [2025-02-08 01:18:41,036 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 67 predicate places. [2025-02-08 01:18:41,036 INFO L471 AbstractCegarLoop]: Abstraction has has 110 places, 115 transitions, 889 flow [2025-02-08 01:18:41,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 12.636363636363637) internal successors, (139), 11 states have internal predecessors, (139), 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:18:41,036 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:18:41,037 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:18:41,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 01:18:41,037 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 01:18:41,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:18:41,039 INFO L85 PathProgramCache]: Analyzing trace with hash -1705401573, now seen corresponding path program 7 times [2025-02-08 01:18:41,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:18:41,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606935029] [2025-02-08 01:18:41,039 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-08 01:18:41,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:18:41,048 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-02-08 01:18:41,066 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-02-08 01:18:41,067 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:18:41,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:18:41,668 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:18:41,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:18:41,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606935029] [2025-02-08 01:18:41,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606935029] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:18:41,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:18:41,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-08 01:18:41,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611404620] [2025-02-08 01:18:41,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:18:41,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-08 01:18:41,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:18:41,670 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-08 01:18:41,670 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-02-08 01:18:41,721 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2025-02-08 01:18:41,722 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 115 transitions, 889 flow. Second operand has 11 states, 11 states have (on average 12.636363636363637) internal successors, (139), 11 states have internal predecessors, (139), 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:18:41,722 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:18:41,723 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2025-02-08 01:18:41,723 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:18:42,421 INFO L124 PetriNetUnfolderBase]: 2005/3579 cut-off events. [2025-02-08 01:18:42,421 INFO L125 PetriNetUnfolderBase]: For 13987/14023 co-relation queries the response was YES. [2025-02-08 01:18:42,435 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12645 conditions, 3579 events. 2005/3579 cut-off events. For 13987/14023 co-relation queries the response was YES. Maximal size of possible extension queue 199. Compared 22360 event pairs, 592 based on Foata normal form. 9/3460 useless extension candidates. Maximal degree in co-relation 12608. Up to 2643 conditions per place. [2025-02-08 01:18:42,449 INFO L140 encePairwiseOnDemand]: 32/44 looper letters, 132 selfloop transitions, 36 changer transitions 3/178 dead transitions. [2025-02-08 01:18:42,449 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 178 transitions, 1604 flow [2025-02-08 01:18:42,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-08 01:18:42,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-02-08 01:18:42,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 220 transitions. [2025-02-08 01:18:42,451 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45454545454545453 [2025-02-08 01:18:42,451 INFO L175 Difference]: Start difference. First operand has 110 places, 115 transitions, 889 flow. Second operand 11 states and 220 transitions. [2025-02-08 01:18:42,451 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 178 transitions, 1604 flow [2025-02-08 01:18:42,486 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 178 transitions, 1517 flow, removed 36 selfloop flow, removed 2 redundant places. [2025-02-08 01:18:42,490 INFO L231 Difference]: Finished difference. Result has 122 places, 124 transitions, 1035 flow [2025-02-08 01:18:42,491 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=802, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1035, PETRI_PLACES=122, PETRI_TRANSITIONS=124} [2025-02-08 01:18:42,491 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 79 predicate places. [2025-02-08 01:18:42,492 INFO L471 AbstractCegarLoop]: Abstraction has has 122 places, 124 transitions, 1035 flow [2025-02-08 01:18:42,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 12.636363636363637) internal successors, (139), 11 states have internal predecessors, (139), 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:18:42,493 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:18:42,493 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:18:42,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 01:18:42,493 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 01:18:42,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:18:42,494 INFO L85 PathProgramCache]: Analyzing trace with hash 413748573, now seen corresponding path program 8 times [2025-02-08 01:18:42,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:18:42,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515851465] [2025-02-08 01:18:42,494 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 01:18:42,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:18:42,506 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-02-08 01:18:42,521 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 31 of 33 statements. [2025-02-08 01:18:42,522 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 01:18:42,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:18:43,095 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:18:43,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:18:43,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515851465] [2025-02-08 01:18:43,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515851465] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:18:43,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:18:43,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-08 01:18:43,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381427620] [2025-02-08 01:18:43,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:18:43,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-08 01:18:43,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:18:43,097 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-08 01:18:43,097 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-02-08 01:18:43,129 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2025-02-08 01:18:43,130 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 124 transitions, 1035 flow. Second operand has 11 states, 11 states have (on average 12.636363636363637) internal successors, (139), 11 states have internal predecessors, (139), 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:18:43,130 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:18:43,130 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2025-02-08 01:18:43,130 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:18:43,760 INFO L124 PetriNetUnfolderBase]: 2137/3834 cut-off events. [2025-02-08 01:18:43,760 INFO L125 PetriNetUnfolderBase]: For 22599/22645 co-relation queries the response was YES. [2025-02-08 01:18:43,771 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14419 conditions, 3834 events. 2137/3834 cut-off events. For 22599/22645 co-relation queries the response was YES. Maximal size of possible extension queue 223. Compared 24558 event pairs, 663 based on Foata normal form. 11/3720 useless extension candidates. Maximal degree in co-relation 14377. Up to 2847 conditions per place. [2025-02-08 01:18:43,786 INFO L140 encePairwiseOnDemand]: 32/44 looper letters, 143 selfloop transitions, 36 changer transitions 3/189 dead transitions. [2025-02-08 01:18:43,786 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 189 transitions, 1804 flow [2025-02-08 01:18:43,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-08 01:18:43,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-02-08 01:18:43,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 222 transitions. [2025-02-08 01:18:43,788 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45867768595041325 [2025-02-08 01:18:43,788 INFO L175 Difference]: Start difference. First operand has 122 places, 124 transitions, 1035 flow. Second operand 11 states and 222 transitions. [2025-02-08 01:18:43,788 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 189 transitions, 1804 flow [2025-02-08 01:18:43,830 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 189 transitions, 1676 flow, removed 47 selfloop flow, removed 5 redundant places. [2025-02-08 01:18:43,833 INFO L231 Difference]: Finished difference. Result has 130 places, 133 transitions, 1121 flow [2025-02-08 01:18:43,833 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=907, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1121, PETRI_PLACES=130, PETRI_TRANSITIONS=133} [2025-02-08 01:18:43,834 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 87 predicate places. [2025-02-08 01:18:43,834 INFO L471 AbstractCegarLoop]: Abstraction has has 130 places, 133 transitions, 1121 flow [2025-02-08 01:18:43,834 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 12.636363636363637) internal successors, (139), 11 states have internal predecessors, (139), 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:18:43,834 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:18:43,834 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:18:43,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-08 01:18:43,835 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 01:18:43,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:18:43,835 INFO L85 PathProgramCache]: Analyzing trace with hash 1848076673, now seen corresponding path program 9 times [2025-02-08 01:18:43,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:18:43,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509665093] [2025-02-08 01:18:43,835 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 01:18:43,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:18:43,843 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 33 statements into 2 equivalence classes. [2025-02-08 01:18:43,854 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 31 of 33 statements. [2025-02-08 01:18:43,854 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-08 01:18:43,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:18:44,396 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:18:44,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:18:44,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509665093] [2025-02-08 01:18:44,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509665093] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:18:44,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:18:44,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-08 01:18:44,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14708686] [2025-02-08 01:18:44,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:18:44,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-08 01:18:44,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:18:44,399 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-08 01:18:44,399 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-02-08 01:18:44,444 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2025-02-08 01:18:44,445 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 133 transitions, 1121 flow. Second operand has 11 states, 11 states have (on average 12.636363636363637) internal successors, (139), 11 states have internal predecessors, (139), 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:18:44,445 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:18:44,445 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2025-02-08 01:18:44,445 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:18:45,252 INFO L124 PetriNetUnfolderBase]: 2303/4119 cut-off events. [2025-02-08 01:18:45,252 INFO L125 PetriNetUnfolderBase]: For 29414/29496 co-relation queries the response was YES. [2025-02-08 01:18:45,271 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16217 conditions, 4119 events. 2303/4119 cut-off events. For 29414/29496 co-relation queries the response was YES. Maximal size of possible extension queue 254. Compared 26788 event pairs, 722 based on Foata normal form. 9/3988 useless extension candidates. Maximal degree in co-relation 16171. Up to 3056 conditions per place. [2025-02-08 01:18:45,285 INFO L140 encePairwiseOnDemand]: 32/44 looper letters, 151 selfloop transitions, 37 changer transitions 3/198 dead transitions. [2025-02-08 01:18:45,285 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 198 transitions, 1941 flow [2025-02-08 01:18:45,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-08 01:18:45,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-02-08 01:18:45,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 225 transitions. [2025-02-08 01:18:45,287 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.46487603305785125 [2025-02-08 01:18:45,287 INFO L175 Difference]: Start difference. First operand has 130 places, 133 transitions, 1121 flow. Second operand 11 states and 225 transitions. [2025-02-08 01:18:45,287 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 198 transitions, 1941 flow [2025-02-08 01:18:45,325 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 198 transitions, 1811 flow, removed 48 selfloop flow, removed 5 redundant places. [2025-02-08 01:18:45,327 INFO L231 Difference]: Finished difference. Result has 138 places, 140 transitions, 1223 flow [2025-02-08 01:18:45,327 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=991, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1223, PETRI_PLACES=138, PETRI_TRANSITIONS=140} [2025-02-08 01:18:45,328 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 95 predicate places. [2025-02-08 01:18:45,328 INFO L471 AbstractCegarLoop]: Abstraction has has 138 places, 140 transitions, 1223 flow [2025-02-08 01:18:45,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 12.636363636363637) internal successors, (139), 11 states have internal predecessors, (139), 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:18:45,328 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:18:45,328 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:18:45,328 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-08 01:18:45,328 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 01:18:45,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:18:45,329 INFO L85 PathProgramCache]: Analyzing trace with hash -97732673, now seen corresponding path program 10 times [2025-02-08 01:18:45,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:18:45,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637601641] [2025-02-08 01:18:45,329 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 01:18:45,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:18:45,337 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 33 statements into 2 equivalence classes. [2025-02-08 01:18:45,356 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-02-08 01:18:45,357 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-08 01:18:45,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:18:45,747 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:18:45,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:18:45,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637601641] [2025-02-08 01:18:45,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637601641] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:18:45,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:18:45,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-08 01:18:45,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622936342] [2025-02-08 01:18:45,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:18:45,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-08 01:18:45,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:18:45,750 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-08 01:18:45,750 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-02-08 01:18:45,766 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 44 [2025-02-08 01:18:45,767 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 140 transitions, 1223 flow. Second operand has 11 states, 11 states have (on average 11.636363636363637) internal successors, (128), 11 states have internal predecessors, (128), 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:18:45,767 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:18:45,767 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 44 [2025-02-08 01:18:45,767 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:18:46,565 INFO L124 PetriNetUnfolderBase]: 2562/4519 cut-off events. [2025-02-08 01:18:46,566 INFO L125 PetriNetUnfolderBase]: For 37265/37411 co-relation queries the response was YES. [2025-02-08 01:18:46,583 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18042 conditions, 4519 events. 2562/4519 cut-off events. For 37265/37411 co-relation queries the response was YES. Maximal size of possible extension queue 281. Compared 29393 event pairs, 916 based on Foata normal form. 23/4394 useless extension candidates. Maximal degree in co-relation 17992. Up to 3537 conditions per place. [2025-02-08 01:18:46,597 INFO L140 encePairwiseOnDemand]: 32/44 looper letters, 147 selfloop transitions, 36 changer transitions 4/193 dead transitions. [2025-02-08 01:18:46,597 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 193 transitions, 1897 flow [2025-02-08 01:18:46,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-08 01:18:46,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-02-08 01:18:46,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 203 transitions. [2025-02-08 01:18:46,599 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4194214876033058 [2025-02-08 01:18:46,599 INFO L175 Difference]: Start difference. First operand has 138 places, 140 transitions, 1223 flow. Second operand 11 states and 203 transitions. [2025-02-08 01:18:46,599 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 193 transitions, 1897 flow [2025-02-08 01:18:46,657 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 193 transitions, 1755 flow, removed 52 selfloop flow, removed 6 redundant places. [2025-02-08 01:18:46,660 INFO L231 Difference]: Finished difference. Result has 145 places, 146 transitions, 1250 flow [2025-02-08 01:18:46,661 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=1081, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1250, PETRI_PLACES=145, PETRI_TRANSITIONS=146} [2025-02-08 01:18:46,661 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 102 predicate places. [2025-02-08 01:18:46,661 INFO L471 AbstractCegarLoop]: Abstraction has has 145 places, 146 transitions, 1250 flow [2025-02-08 01:18:46,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.636363636363637) internal successors, (128), 11 states have internal predecessors, (128), 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:18:46,662 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:18:46,662 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:18:46,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-08 01:18:46,662 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 01:18:46,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:18:46,663 INFO L85 PathProgramCache]: Analyzing trace with hash 405291667, now seen corresponding path program 11 times [2025-02-08 01:18:46,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:18:46,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712258551] [2025-02-08 01:18:46,663 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-08 01:18:46,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:18:46,673 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-02-08 01:18:46,693 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-02-08 01:18:46,693 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 01:18:46,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:18:47,201 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:18:47,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:18:47,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712258551] [2025-02-08 01:18:47,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712258551] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:18:47,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:18:47,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-08 01:18:47,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530993365] [2025-02-08 01:18:47,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:18:47,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-08 01:18:47,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:18:47,203 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-08 01:18:47,203 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-02-08 01:18:47,253 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2025-02-08 01:18:47,254 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 146 transitions, 1250 flow. Second operand has 11 states, 11 states have (on average 12.636363636363637) internal successors, (139), 11 states have internal predecessors, (139), 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:18:47,254 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:18:47,254 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2025-02-08 01:18:47,254 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:18:48,055 INFO L124 PetriNetUnfolderBase]: 2515/4467 cut-off events. [2025-02-08 01:18:48,055 INFO L125 PetriNetUnfolderBase]: For 36214/36296 co-relation queries the response was YES. [2025-02-08 01:18:48,073 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18007 conditions, 4467 events. 2515/4467 cut-off events. For 36214/36296 co-relation queries the response was YES. Maximal size of possible extension queue 299. Compared 29565 event pairs, 846 based on Foata normal form. 29/4362 useless extension candidates. Maximal degree in co-relation 17953. Up to 3319 conditions per place. [2025-02-08 01:18:48,085 INFO L140 encePairwiseOnDemand]: 32/44 looper letters, 156 selfloop transitions, 42 changer transitions 3/208 dead transitions. [2025-02-08 01:18:48,085 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 208 transitions, 2100 flow [2025-02-08 01:18:48,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-08 01:18:48,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-02-08 01:18:48,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 223 transitions. [2025-02-08 01:18:48,087 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4607438016528926 [2025-02-08 01:18:48,087 INFO L175 Difference]: Start difference. First operand has 145 places, 146 transitions, 1250 flow. Second operand 11 states and 223 transitions. [2025-02-08 01:18:48,087 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 208 transitions, 2100 flow [2025-02-08 01:18:48,139 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 208 transitions, 1990 flow, removed 35 selfloop flow, removed 6 redundant places. [2025-02-08 01:18:48,142 INFO L231 Difference]: Finished difference. Result has 152 places, 153 transitions, 1415 flow [2025-02-08 01:18:48,142 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=1140, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1415, PETRI_PLACES=152, PETRI_TRANSITIONS=153} [2025-02-08 01:18:48,144 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 109 predicate places. [2025-02-08 01:18:48,144 INFO L471 AbstractCegarLoop]: Abstraction has has 152 places, 153 transitions, 1415 flow [2025-02-08 01:18:48,144 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 12.636363636363637) internal successors, (139), 11 states have internal predecessors, (139), 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:18:48,144 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:18:48,144 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:18:48,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-08 01:18:48,145 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 01:18:48,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:18:48,145 INFO L85 PathProgramCache]: Analyzing trace with hash -693604997, now seen corresponding path program 12 times [2025-02-08 01:18:48,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:18:48,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000994399] [2025-02-08 01:18:48,145 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-08 01:18:48,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:18:48,155 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 33 statements into 2 equivalence classes. [2025-02-08 01:18:48,169 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 31 of 33 statements. [2025-02-08 01:18:48,173 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-02-08 01:18:48,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:18:48,545 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:18:48,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:18:48,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000994399] [2025-02-08 01:18:48,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000994399] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:18:48,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:18:48,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-08 01:18:48,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479180425] [2025-02-08 01:18:48,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:18:48,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-08 01:18:48,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:18:48,547 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-08 01:18:48,547 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-02-08 01:18:48,581 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2025-02-08 01:18:48,583 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 153 transitions, 1415 flow. Second operand has 11 states, 11 states have (on average 12.636363636363637) internal successors, (139), 11 states have internal predecessors, (139), 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:18:48,583 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:18:48,583 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2025-02-08 01:18:48,583 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:18:49,355 INFO L124 PetriNetUnfolderBase]: 2515/4471 cut-off events. [2025-02-08 01:18:49,355 INFO L125 PetriNetUnfolderBase]: For 42505/42571 co-relation queries the response was YES. [2025-02-08 01:18:49,366 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18639 conditions, 4471 events. 2515/4471 cut-off events. For 42505/42571 co-relation queries the response was YES. Maximal size of possible extension queue 299. Compared 29523 event pairs, 878 based on Foata normal form. 19/4350 useless extension candidates. Maximal degree in co-relation 18581. Up to 3477 conditions per place. [2025-02-08 01:18:49,376 INFO L140 encePairwiseOnDemand]: 32/44 looper letters, 161 selfloop transitions, 37 changer transitions 4/209 dead transitions. [2025-02-08 01:18:49,376 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 209 transitions, 2146 flow [2025-02-08 01:18:49,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-08 01:18:49,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-02-08 01:18:49,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 219 transitions. [2025-02-08 01:18:49,378 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4524793388429752 [2025-02-08 01:18:49,378 INFO L175 Difference]: Start difference. First operand has 152 places, 153 transitions, 1415 flow. Second operand 11 states and 219 transitions. [2025-02-08 01:18:49,378 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 209 transitions, 2146 flow [2025-02-08 01:18:49,443 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 209 transitions, 1978 flow, removed 64 selfloop flow, removed 6 redundant places. [2025-02-08 01:18:49,445 INFO L231 Difference]: Finished difference. Result has 158 places, 157 transitions, 1374 flow [2025-02-08 01:18:49,446 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=1247, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1374, PETRI_PLACES=158, PETRI_TRANSITIONS=157} [2025-02-08 01:18:49,446 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 115 predicate places. [2025-02-08 01:18:49,446 INFO L471 AbstractCegarLoop]: Abstraction has has 158 places, 157 transitions, 1374 flow [2025-02-08 01:18:49,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 12.636363636363637) internal successors, (139), 11 states have internal predecessors, (139), 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:18:49,446 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:18:49,446 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:18:49,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-08 01:18:49,447 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 01:18:49,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:18:49,447 INFO L85 PathProgramCache]: Analyzing trace with hash 1159106147, now seen corresponding path program 13 times [2025-02-08 01:18:49,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:18:49,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164213666] [2025-02-08 01:18:49,448 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-08 01:18:49,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:18:49,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-02-08 01:18:49,471 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-02-08 01:18:49,472 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:18:49,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:18:50,003 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:18:50,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:18:50,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164213666] [2025-02-08 01:18:50,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164213666] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:18:50,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:18:50,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-08 01:18:50,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954606034] [2025-02-08 01:18:50,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:18:50,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-08 01:18:50,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:18:50,006 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-08 01:18:50,007 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-02-08 01:18:50,046 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2025-02-08 01:18:50,046 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 157 transitions, 1374 flow. Second operand has 11 states, 11 states have (on average 12.636363636363637) internal successors, (139), 11 states have internal predecessors, (139), 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:18:50,046 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:18:50,046 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2025-02-08 01:18:50,046 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:18:50,673 INFO L124 PetriNetUnfolderBase]: 2551/4531 cut-off events. [2025-02-08 01:18:50,673 INFO L125 PetriNetUnfolderBase]: For 37866/37954 co-relation queries the response was YES. [2025-02-08 01:18:50,690 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18286 conditions, 4531 events. 2551/4531 cut-off events. For 37866/37954 co-relation queries the response was YES. Maximal size of possible extension queue 310. Compared 30121 event pairs, 944 based on Foata normal form. 35/4422 useless extension candidates. Maximal degree in co-relation 18225. Up to 3608 conditions per place. [2025-02-08 01:18:50,700 INFO L140 encePairwiseOnDemand]: 32/44 looper letters, 159 selfloop transitions, 37 changer transitions 3/206 dead transitions. [2025-02-08 01:18:50,700 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 206 transitions, 2038 flow [2025-02-08 01:18:50,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-08 01:18:50,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-02-08 01:18:50,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 212 transitions. [2025-02-08 01:18:50,702 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4380165289256198 [2025-02-08 01:18:50,702 INFO L175 Difference]: Start difference. First operand has 158 places, 157 transitions, 1374 flow. Second operand 11 states and 212 transitions. [2025-02-08 01:18:50,702 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 206 transitions, 2038 flow [2025-02-08 01:18:50,756 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 206 transitions, 1932 flow, removed 18 selfloop flow, removed 8 redundant places. [2025-02-08 01:18:50,758 INFO L231 Difference]: Finished difference. Result has 162 places, 160 transitions, 1392 flow [2025-02-08 01:18:50,758 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=1268, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1392, PETRI_PLACES=162, PETRI_TRANSITIONS=160} [2025-02-08 01:18:50,759 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 119 predicate places. [2025-02-08 01:18:50,759 INFO L471 AbstractCegarLoop]: Abstraction has has 162 places, 160 transitions, 1392 flow [2025-02-08 01:18:50,759 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 12.636363636363637) internal successors, (139), 11 states have internal predecessors, (139), 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:18:50,759 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:18:50,759 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:18:50,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-08 01:18:50,759 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 01:18:50,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:18:50,760 INFO L85 PathProgramCache]: Analyzing trace with hash 13359507, now seen corresponding path program 14 times [2025-02-08 01:18:50,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:18:50,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554730533] [2025-02-08 01:18:50,760 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 01:18:50,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:18:50,767 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-02-08 01:18:50,778 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 31 of 33 statements. [2025-02-08 01:18:50,778 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 01:18:50,778 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:18:51,179 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:18:51,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:18:51,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554730533] [2025-02-08 01:18:51,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554730533] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:18:51,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:18:51,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-08 01:18:51,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619906080] [2025-02-08 01:18:51,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:18:51,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-08 01:18:51,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:18:51,181 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-08 01:18:51,182 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-02-08 01:18:51,217 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2025-02-08 01:18:51,217 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 160 transitions, 1392 flow. Second operand has 11 states, 11 states have (on average 12.636363636363637) internal successors, (139), 11 states have internal predecessors, (139), 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:18:51,217 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:18:51,217 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2025-02-08 01:18:51,217 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:18:52,082 INFO L124 PetriNetUnfolderBase]: 2551/4553 cut-off events. [2025-02-08 01:18:52,083 INFO L125 PetriNetUnfolderBase]: For 37783/37871 co-relation queries the response was YES. [2025-02-08 01:18:52,111 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18233 conditions, 4553 events. 2551/4553 cut-off events. For 37783/37871 co-relation queries the response was YES. Maximal size of possible extension queue 319. Compared 30600 event pairs, 860 based on Foata normal form. 35/4444 useless extension candidates. Maximal degree in co-relation 18170. Up to 3542 conditions per place. [2025-02-08 01:18:52,245 INFO L140 encePairwiseOnDemand]: 32/44 looper letters, 162 selfloop transitions, 41 changer transitions 4/214 dead transitions. [2025-02-08 01:18:52,245 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 214 transitions, 2099 flow [2025-02-08 01:18:52,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-08 01:18:52,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-02-08 01:18:52,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 218 transitions. [2025-02-08 01:18:52,247 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45041322314049587 [2025-02-08 01:18:52,247 INFO L175 Difference]: Start difference. First operand has 162 places, 160 transitions, 1392 flow. Second operand 11 states and 218 transitions. [2025-02-08 01:18:52,247 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 214 transitions, 2099 flow [2025-02-08 01:18:52,330 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 214 transitions, 1995 flow, removed 17 selfloop flow, removed 8 redundant places. [2025-02-08 01:18:52,333 INFO L231 Difference]: Finished difference. Result has 166 places, 164 transitions, 1436 flow [2025-02-08 01:18:52,333 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=1288, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1436, PETRI_PLACES=166, PETRI_TRANSITIONS=164} [2025-02-08 01:18:52,334 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 123 predicate places. [2025-02-08 01:18:52,334 INFO L471 AbstractCegarLoop]: Abstraction has has 166 places, 164 transitions, 1436 flow [2025-02-08 01:18:52,334 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 12.636363636363637) internal successors, (139), 11 states have internal predecessors, (139), 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:18:52,334 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:18:52,334 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:18:52,334 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-08 01:18:52,334 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 01:18:52,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:18:52,335 INFO L85 PathProgramCache]: Analyzing trace with hash -1170761885, now seen corresponding path program 15 times [2025-02-08 01:18:52,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:18:52,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912914822] [2025-02-08 01:18:52,335 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 01:18:52,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:18:52,346 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 33 statements into 2 equivalence classes. [2025-02-08 01:18:52,365 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 31 of 33 statements. [2025-02-08 01:18:52,369 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-08 01:18:52,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:18:52,770 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:18:52,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:18:52,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912914822] [2025-02-08 01:18:52,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912914822] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:18:52,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:18:52,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-08 01:18:52,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642600593] [2025-02-08 01:18:52,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:18:52,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-08 01:18:52,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:18:52,773 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-08 01:18:52,773 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-02-08 01:18:52,799 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2025-02-08 01:18:52,800 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 164 transitions, 1436 flow. Second operand has 11 states, 11 states have (on average 12.636363636363637) internal successors, (139), 11 states have internal predecessors, (139), 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:18:52,800 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:18:52,800 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2025-02-08 01:18:52,800 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:18:53,448 INFO L124 PetriNetUnfolderBase]: 2551/4542 cut-off events. [2025-02-08 01:18:53,448 INFO L125 PetriNetUnfolderBase]: For 38468/38556 co-relation queries the response was YES. [2025-02-08 01:18:53,465 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18324 conditions, 4542 events. 2551/4542 cut-off events. For 38468/38556 co-relation queries the response was YES. Maximal size of possible extension queue 311. Compared 30235 event pairs, 951 based on Foata normal form. 27/4425 useless extension candidates. Maximal degree in co-relation 18259. Up to 3620 conditions per place. [2025-02-08 01:18:53,478 INFO L140 encePairwiseOnDemand]: 32/44 looper letters, 165 selfloop transitions, 35 changer transitions 3/210 dead transitions. [2025-02-08 01:18:53,478 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 210 transitions, 2080 flow [2025-02-08 01:18:53,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-08 01:18:53,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-02-08 01:18:53,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 209 transitions. [2025-02-08 01:18:53,479 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4318181818181818 [2025-02-08 01:18:53,479 INFO L175 Difference]: Start difference. First operand has 166 places, 164 transitions, 1436 flow. Second operand 11 states and 209 transitions. [2025-02-08 01:18:53,479 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 210 transitions, 2080 flow [2025-02-08 01:18:53,532 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 210 transitions, 1954 flow, removed 24 selfloop flow, removed 8 redundant places. [2025-02-08 01:18:53,534 INFO L231 Difference]: Finished difference. Result has 170 places, 166 transitions, 1404 flow [2025-02-08 01:18:53,534 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=1310, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=164, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1404, PETRI_PLACES=170, PETRI_TRANSITIONS=166} [2025-02-08 01:18:53,534 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 127 predicate places. [2025-02-08 01:18:53,535 INFO L471 AbstractCegarLoop]: Abstraction has has 170 places, 166 transitions, 1404 flow [2025-02-08 01:18:53,535 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 12.636363636363637) internal successors, (139), 11 states have internal predecessors, (139), 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:18:53,535 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:18:53,535 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:18:53,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-08 01:18:53,535 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 01:18:53,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:18:53,535 INFO L85 PathProgramCache]: Analyzing trace with hash 35891421, now seen corresponding path program 16 times [2025-02-08 01:18:53,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:18:53,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443360164] [2025-02-08 01:18:53,536 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 01:18:53,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:18:53,542 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 33 statements into 2 equivalence classes. [2025-02-08 01:18:53,554 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-02-08 01:18:53,554 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-08 01:18:53,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:18:54,048 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:18:54,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:18:54,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443360164] [2025-02-08 01:18:54,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443360164] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:18:54,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:18:54,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-08 01:18:54,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443174104] [2025-02-08 01:18:54,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:18:54,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-08 01:18:54,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:18:54,049 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-08 01:18:54,049 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-02-08 01:18:54,083 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 44 [2025-02-08 01:18:54,084 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 166 transitions, 1404 flow. Second operand has 11 states, 11 states have (on average 11.636363636363637) internal successors, (128), 11 states have internal predecessors, (128), 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:18:54,084 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:18:54,084 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 44 [2025-02-08 01:18:54,084 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:18:54,956 INFO L124 PetriNetUnfolderBase]: 2990/5299 cut-off events. [2025-02-08 01:18:54,957 INFO L125 PetriNetUnfolderBase]: For 51320/51392 co-relation queries the response was YES. [2025-02-08 01:18:54,983 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21874 conditions, 5299 events. 2990/5299 cut-off events. For 51320/51392 co-relation queries the response was YES. Maximal size of possible extension queue 374. Compared 36498 event pairs, 1028 based on Foata normal form. 15/5148 useless extension candidates. Maximal degree in co-relation 21807. Up to 3897 conditions per place. [2025-02-08 01:18:55,000 INFO L140 encePairwiseOnDemand]: 32/44 looper letters, 194 selfloop transitions, 44 changer transitions 3/247 dead transitions. [2025-02-08 01:18:55,000 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 247 transitions, 2515 flow [2025-02-08 01:18:55,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-08 01:18:55,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-02-08 01:18:55,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 237 transitions. [2025-02-08 01:18:55,001 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.44886363636363635 [2025-02-08 01:18:55,001 INFO L175 Difference]: Start difference. First operand has 170 places, 166 transitions, 1404 flow. Second operand 12 states and 237 transitions. [2025-02-08 01:18:55,001 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 247 transitions, 2515 flow [2025-02-08 01:18:55,091 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 247 transitions, 2447 flow, removed 1 selfloop flow, removed 8 redundant places. [2025-02-08 01:18:55,094 INFO L231 Difference]: Finished difference. Result has 177 places, 178 transitions, 1677 flow [2025-02-08 01:18:55,095 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=1336, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1677, PETRI_PLACES=177, PETRI_TRANSITIONS=178} [2025-02-08 01:18:55,095 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 134 predicate places. [2025-02-08 01:18:55,095 INFO L471 AbstractCegarLoop]: Abstraction has has 177 places, 178 transitions, 1677 flow [2025-02-08 01:18:55,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.636363636363637) internal successors, (128), 11 states have internal predecessors, (128), 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:18:55,095 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:18:55,095 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:18:55,095 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-08 01:18:55,095 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 01:18:55,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:18:55,096 INFO L85 PathProgramCache]: Analyzing trace with hash 490703023, now seen corresponding path program 17 times [2025-02-08 01:18:55,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:18:55,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134220304] [2025-02-08 01:18:55,096 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-08 01:18:55,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:18:55,104 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-02-08 01:18:55,127 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-02-08 01:18:55,128 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 01:18:55,128 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:18:55,592 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:18:55,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:18:55,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134220304] [2025-02-08 01:18:55,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134220304] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:18:55,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:18:55,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-08 01:18:55,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138250168] [2025-02-08 01:18:55,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:18:55,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-08 01:18:55,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:18:55,594 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-08 01:18:55,594 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-02-08 01:18:55,622 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2025-02-08 01:18:55,622 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 178 transitions, 1677 flow. Second operand has 11 states, 11 states have (on average 12.636363636363637) internal successors, (139), 11 states have internal predecessors, (139), 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:18:55,623 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:18:55,623 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2025-02-08 01:18:55,623 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:18:56,308 INFO L124 PetriNetUnfolderBase]: 2991/5365 cut-off events. [2025-02-08 01:18:56,308 INFO L125 PetriNetUnfolderBase]: For 66247/66399 co-relation queries the response was YES. [2025-02-08 01:18:56,333 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23779 conditions, 5365 events. 2991/5365 cut-off events. For 66247/66399 co-relation queries the response was YES. Maximal size of possible extension queue 392. Compared 37628 event pairs, 978 based on Foata normal form. 43/5250 useless extension candidates. Maximal degree in co-relation 23708. Up to 3842 conditions per place. [2025-02-08 01:18:56,346 INFO L140 encePairwiseOnDemand]: 32/44 looper letters, 190 selfloop transitions, 54 changer transitions 3/254 dead transitions. [2025-02-08 01:18:56,346 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 254 transitions, 2858 flow [2025-02-08 01:18:56,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-08 01:18:56,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-02-08 01:18:56,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 246 transitions. [2025-02-08 01:18:56,347 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4659090909090909 [2025-02-08 01:18:56,348 INFO L175 Difference]: Start difference. First operand has 177 places, 178 transitions, 1677 flow. Second operand 12 states and 246 transitions. [2025-02-08 01:18:56,348 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 254 transitions, 2858 flow [2025-02-08 01:18:56,418 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 254 transitions, 2630 flow, removed 97 selfloop flow, removed 5 redundant places. [2025-02-08 01:18:56,420 INFO L231 Difference]: Finished difference. Result has 187 places, 189 transitions, 1860 flow [2025-02-08 01:18:56,421 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=1471, PETRI_DIFFERENCE_MINUEND_PLACES=172, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=178, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1860, PETRI_PLACES=187, PETRI_TRANSITIONS=189} [2025-02-08 01:18:56,421 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 144 predicate places. [2025-02-08 01:18:56,421 INFO L471 AbstractCegarLoop]: Abstraction has has 187 places, 189 transitions, 1860 flow [2025-02-08 01:18:56,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 12.636363636363637) internal successors, (139), 11 states have internal predecessors, (139), 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:18:56,421 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:18:56,421 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:18:56,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-08 01:18:56,421 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 01:18:56,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:18:56,422 INFO L85 PathProgramCache]: Analyzing trace with hash -439518087, now seen corresponding path program 18 times [2025-02-08 01:18:56,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:18:56,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929551314] [2025-02-08 01:18:56,422 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-08 01:18:56,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:18:56,428 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 33 statements into 2 equivalence classes. [2025-02-08 01:18:56,436 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 31 of 33 statements. [2025-02-08 01:18:56,436 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-02-08 01:18:56,436 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:18:56,896 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:18:56,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:18:56,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929551314] [2025-02-08 01:18:56,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929551314] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:18:56,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:18:56,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-08 01:18:56,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913828913] [2025-02-08 01:18:56,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:18:56,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-08 01:18:56,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:18:56,900 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-08 01:18:56,900 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-02-08 01:18:56,939 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2025-02-08 01:18:56,939 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 189 transitions, 1860 flow. Second operand has 11 states, 11 states have (on average 12.636363636363637) internal successors, (139), 11 states have internal predecessors, (139), 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:18:56,939 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:18:56,939 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2025-02-08 01:18:56,940 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:18:57,858 INFO L124 PetriNetUnfolderBase]: 3087/5531 cut-off events. [2025-02-08 01:18:57,858 INFO L125 PetriNetUnfolderBase]: For 79078/79200 co-relation queries the response was YES. [2025-02-08 01:18:57,883 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25289 conditions, 5531 events. 3087/5531 cut-off events. For 79078/79200 co-relation queries the response was YES. Maximal size of possible extension queue 408. Compared 39111 event pairs, 1076 based on Foata normal form. 19/5391 useless extension candidates. Maximal degree in co-relation 25213. Up to 4114 conditions per place. [2025-02-08 01:18:57,897 INFO L140 encePairwiseOnDemand]: 32/44 looper letters, 199 selfloop transitions, 49 changer transitions 3/258 dead transitions. [2025-02-08 01:18:57,897 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 258 transitions, 2928 flow [2025-02-08 01:18:57,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-08 01:18:57,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-02-08 01:18:57,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 243 transitions. [2025-02-08 01:18:57,898 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4602272727272727 [2025-02-08 01:18:57,898 INFO L175 Difference]: Start difference. First operand has 187 places, 189 transitions, 1860 flow. Second operand 12 states and 243 transitions. [2025-02-08 01:18:57,898 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 198 places, 258 transitions, 2928 flow [2025-02-08 01:18:58,027 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 258 transitions, 2713 flow, removed 83 selfloop flow, removed 7 redundant places. [2025-02-08 01:18:58,029 INFO L231 Difference]: Finished difference. Result has 194 places, 195 transitions, 1913 flow [2025-02-08 01:18:58,029 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=1649, PETRI_DIFFERENCE_MINUEND_PLACES=180, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=189, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=141, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1913, PETRI_PLACES=194, PETRI_TRANSITIONS=195} [2025-02-08 01:18:58,030 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 151 predicate places. [2025-02-08 01:18:58,030 INFO L471 AbstractCegarLoop]: Abstraction has has 194 places, 195 transitions, 1913 flow [2025-02-08 01:18:58,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 12.636363636363637) internal successors, (139), 11 states have internal predecessors, (139), 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:18:58,030 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:18:58,030 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:18:58,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-08 01:18:58,030 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 01:18:58,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:18:58,031 INFO L85 PathProgramCache]: Analyzing trace with hash -260436479, now seen corresponding path program 19 times [2025-02-08 01:18:58,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:18:58,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968548857] [2025-02-08 01:18:58,032 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-08 01:18:58,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:18:58,038 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-02-08 01:18:58,053 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-02-08 01:18:58,053 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:18:58,053 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:18:58,386 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:18:58,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:18:58,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968548857] [2025-02-08 01:18:58,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968548857] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:18:58,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:18:58,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-08 01:18:58,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825343523] [2025-02-08 01:18:58,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:18:58,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-08 01:18:58,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:18:58,388 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-08 01:18:58,388 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-02-08 01:18:58,426 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2025-02-08 01:18:58,426 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 195 transitions, 1913 flow. Second operand has 11 states, 11 states have (on average 12.636363636363637) internal successors, (139), 11 states have internal predecessors, (139), 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:18:58,426 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:18:58,426 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2025-02-08 01:18:58,426 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:18:59,159 INFO L124 PetriNetUnfolderBase]: 3087/5549 cut-off events. [2025-02-08 01:18:59,159 INFO L125 PetriNetUnfolderBase]: For 77737/77825 co-relation queries the response was YES. [2025-02-08 01:18:59,185 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25113 conditions, 5549 events. 3087/5549 cut-off events. For 77737/77825 co-relation queries the response was YES. Maximal size of possible extension queue 417. Compared 39405 event pairs, 1096 based on Foata normal form. 35/5423 useless extension candidates. Maximal degree in co-relation 25034. Up to 4191 conditions per place. [2025-02-08 01:18:59,199 INFO L140 encePairwiseOnDemand]: 32/44 looper letters, 196 selfloop transitions, 51 changer transitions 4/258 dead transitions. [2025-02-08 01:18:59,199 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 258 transitions, 2855 flow [2025-02-08 01:18:59,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-08 01:18:59,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-02-08 01:18:59,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 240 transitions. [2025-02-08 01:18:59,200 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45454545454545453 [2025-02-08 01:18:59,200 INFO L175 Difference]: Start difference. First operand has 194 places, 195 transitions, 1913 flow. Second operand 12 states and 240 transitions. [2025-02-08 01:18:59,200 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 205 places, 258 transitions, 2855 flow [2025-02-08 01:18:59,326 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 197 places, 258 transitions, 2698 flow, removed 53 selfloop flow, removed 8 redundant places. [2025-02-08 01:18:59,329 INFO L231 Difference]: Finished difference. Result has 199 places, 199 transitions, 1936 flow [2025-02-08 01:18:59,329 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=1756, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=195, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1936, PETRI_PLACES=199, PETRI_TRANSITIONS=199} [2025-02-08 01:18:59,329 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 156 predicate places. [2025-02-08 01:18:59,329 INFO L471 AbstractCegarLoop]: Abstraction has has 199 places, 199 transitions, 1936 flow [2025-02-08 01:18:59,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 12.636363636363637) internal successors, (139), 11 states have internal predecessors, (139), 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:18:59,330 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:18:59,330 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:18:59,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-02-08 01:18:59,330 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 01:18:59,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:18:59,330 INFO L85 PathProgramCache]: Analyzing trace with hash 134135777, now seen corresponding path program 20 times [2025-02-08 01:18:59,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:18:59,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647039174] [2025-02-08 01:18:59,330 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 01:18:59,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:18:59,338 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-02-08 01:18:59,349 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 31 of 33 statements. [2025-02-08 01:18:59,349 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 01:18:59,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:18:59,766 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:18:59,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:18:59,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647039174] [2025-02-08 01:18:59,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [647039174] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:18:59,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:18:59,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-08 01:18:59,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221803913] [2025-02-08 01:18:59,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:18:59,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-08 01:18:59,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:18:59,768 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-08 01:18:59,768 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-02-08 01:18:59,805 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2025-02-08 01:18:59,805 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 199 transitions, 1936 flow. Second operand has 11 states, 11 states have (on average 12.636363636363637) internal successors, (139), 11 states have internal predecessors, (139), 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:18:59,805 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:18:59,805 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2025-02-08 01:18:59,805 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:19:00,646 INFO L124 PetriNetUnfolderBase]: 3293/5883 cut-off events. [2025-02-08 01:19:00,646 INFO L125 PetriNetUnfolderBase]: For 92445/92712 co-relation queries the response was YES. [2025-02-08 01:19:00,675 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27738 conditions, 5883 events. 3293/5883 cut-off events. For 92445/92712 co-relation queries the response was YES. Maximal size of possible extension queue 464. Compared 42278 event pairs, 1321 based on Foata normal form. 41/5740 useless extension candidates. Maximal degree in co-relation 27657. Up to 4637 conditions per place. [2025-02-08 01:19:00,690 INFO L140 encePairwiseOnDemand]: 32/44 looper letters, 220 selfloop transitions, 37 changer transitions 3/267 dead transitions. [2025-02-08 01:19:00,690 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 267 transitions, 3165 flow [2025-02-08 01:19:00,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-08 01:19:00,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-02-08 01:19:00,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 228 transitions. [2025-02-08 01:19:00,691 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.47107438016528924 [2025-02-08 01:19:00,691 INFO L175 Difference]: Start difference. First operand has 199 places, 199 transitions, 1936 flow. Second operand 11 states and 228 transitions. [2025-02-08 01:19:00,691 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 209 places, 267 transitions, 3165 flow [2025-02-08 01:19:00,804 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 200 places, 267 transitions, 3007 flow, removed 29 selfloop flow, removed 9 redundant places. [2025-02-08 01:19:00,806 INFO L231 Difference]: Finished difference. Result has 204 places, 209 transitions, 2143 flow [2025-02-08 01:19:00,807 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=1788, PETRI_DIFFERENCE_MINUEND_PLACES=190, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=199, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=165, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2143, PETRI_PLACES=204, PETRI_TRANSITIONS=209} [2025-02-08 01:19:00,807 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 161 predicate places. [2025-02-08 01:19:00,807 INFO L471 AbstractCegarLoop]: Abstraction has has 204 places, 209 transitions, 2143 flow [2025-02-08 01:19:00,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 12.636363636363637) internal successors, (139), 11 states have internal predecessors, (139), 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:19:00,807 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:19:00,807 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:19:00,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-02-08 01:19:00,807 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 01:19:00,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:19:00,808 INFO L85 PathProgramCache]: Analyzing trace with hash -604758891, now seen corresponding path program 21 times [2025-02-08 01:19:00,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:19:00,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014176044] [2025-02-08 01:19:00,808 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 01:19:00,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:19:00,813 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 33 statements into 2 equivalence classes. [2025-02-08 01:19:00,820 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 31 of 33 statements. [2025-02-08 01:19:00,820 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-08 01:19:00,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:19:01,132 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:19:01,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:19:01,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014176044] [2025-02-08 01:19:01,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014176044] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:19:01,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:19:01,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-08 01:19:01,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342137267] [2025-02-08 01:19:01,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:19:01,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-08 01:19:01,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:19:01,133 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-08 01:19:01,133 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-02-08 01:19:01,163 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2025-02-08 01:19:01,163 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 209 transitions, 2143 flow. Second operand has 11 states, 11 states have (on average 12.636363636363637) internal successors, (139), 11 states have internal predecessors, (139), 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:19:01,163 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:19:01,164 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2025-02-08 01:19:01,164 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:19:01,890 INFO L124 PetriNetUnfolderBase]: 3354/6005 cut-off events. [2025-02-08 01:19:01,891 INFO L125 PetriNetUnfolderBase]: For 109425/109820 co-relation queries the response was YES. [2025-02-08 01:19:01,921 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28643 conditions, 6005 events. 3354/6005 cut-off events. For 109425/109820 co-relation queries the response was YES. Maximal size of possible extension queue 463. Compared 43197 event pairs, 1407 based on Foata normal form. 55/5870 useless extension candidates. Maximal degree in co-relation 28558. Up to 4876 conditions per place. [2025-02-08 01:19:01,937 INFO L140 encePairwiseOnDemand]: 32/44 looper letters, 214 selfloop transitions, 36 changer transitions 4/261 dead transitions. [2025-02-08 01:19:01,937 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 261 transitions, 3089 flow [2025-02-08 01:19:01,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-08 01:19:01,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-02-08 01:19:01,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 215 transitions. [2025-02-08 01:19:01,938 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.44421487603305787 [2025-02-08 01:19:01,938 INFO L175 Difference]: Start difference. First operand has 204 places, 209 transitions, 2143 flow. Second operand 11 states and 215 transitions. [2025-02-08 01:19:01,938 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 214 places, 261 transitions, 3089 flow [2025-02-08 01:19:02,062 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 209 places, 261 transitions, 2849 flow, removed 103 selfloop flow, removed 5 redundant places. [2025-02-08 01:19:02,064 INFO L231 Difference]: Finished difference. Result has 212 places, 215 transitions, 2128 flow [2025-02-08 01:19:02,065 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=1923, PETRI_DIFFERENCE_MINUEND_PLACES=199, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=209, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=176, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2128, PETRI_PLACES=212, PETRI_TRANSITIONS=215} [2025-02-08 01:19:02,065 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 169 predicate places. [2025-02-08 01:19:02,065 INFO L471 AbstractCegarLoop]: Abstraction has has 212 places, 215 transitions, 2128 flow [2025-02-08 01:19:02,065 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 12.636363636363637) internal successors, (139), 11 states have internal predecessors, (139), 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:19:02,065 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:19:02,065 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:19:02,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-02-08 01:19:02,066 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 01:19:02,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:19:02,066 INFO L85 PathProgramCache]: Analyzing trace with hash 1233161987, now seen corresponding path program 22 times [2025-02-08 01:19:02,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:19:02,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304235757] [2025-02-08 01:19:02,066 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 01:19:02,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:19:02,072 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 33 statements into 2 equivalence classes. [2025-02-08 01:19:02,081 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-02-08 01:19:02,081 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-08 01:19:02,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:19:02,492 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:19:02,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:19:02,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304235757] [2025-02-08 01:19:02,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [304235757] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:19:02,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:19:02,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-08 01:19:02,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652664571] [2025-02-08 01:19:02,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:19:02,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-08 01:19:02,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:19:02,496 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-08 01:19:02,496 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-02-08 01:19:02,530 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 44 [2025-02-08 01:19:02,530 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 212 places, 215 transitions, 2128 flow. Second operand has 11 states, 11 states have (on average 11.636363636363637) internal successors, (128), 11 states have internal predecessors, (128), 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:19:02,530 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:19:02,530 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 44 [2025-02-08 01:19:02,530 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:19:03,497 INFO L124 PetriNetUnfolderBase]: 3709/6579 cut-off events. [2025-02-08 01:19:03,497 INFO L125 PetriNetUnfolderBase]: For 99959/100178 co-relation queries the response was YES. [2025-02-08 01:19:03,533 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30468 conditions, 6579 events. 3709/6579 cut-off events. For 99959/100178 co-relation queries the response was YES. Maximal size of possible extension queue 507. Compared 47653 event pairs, 1512 based on Foata normal form. 61/6434 useless extension candidates. Maximal degree in co-relation 30379. Up to 5145 conditions per place. [2025-02-08 01:19:03,551 INFO L140 encePairwiseOnDemand]: 32/44 looper letters, 234 selfloop transitions, 44 changer transitions 3/287 dead transitions. [2025-02-08 01:19:03,551 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 222 places, 287 transitions, 3382 flow [2025-02-08 01:19:03,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-08 01:19:03,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-02-08 01:19:03,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 226 transitions. [2025-02-08 01:19:03,552 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4669421487603306 [2025-02-08 01:19:03,552 INFO L175 Difference]: Start difference. First operand has 212 places, 215 transitions, 2128 flow. Second operand 11 states and 226 transitions. [2025-02-08 01:19:03,552 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 222 places, 287 transitions, 3382 flow [2025-02-08 01:19:03,719 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 216 places, 287 transitions, 3238 flow, removed 52 selfloop flow, removed 6 redundant places. [2025-02-08 01:19:03,722 INFO L231 Difference]: Finished difference. Result has 220 places, 224 transitions, 2376 flow [2025-02-08 01:19:03,722 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=1984, PETRI_DIFFERENCE_MINUEND_PLACES=206, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=215, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=175, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2376, PETRI_PLACES=220, PETRI_TRANSITIONS=224} [2025-02-08 01:19:03,723 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 177 predicate places. [2025-02-08 01:19:03,723 INFO L471 AbstractCegarLoop]: Abstraction has has 220 places, 224 transitions, 2376 flow [2025-02-08 01:19:03,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.636363636363637) internal successors, (128), 11 states have internal predecessors, (128), 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:19:03,723 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:19:03,723 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:19:03,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-02-08 01:19:03,723 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 01:19:03,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:19:03,724 INFO L85 PathProgramCache]: Analyzing trace with hash -980849651, now seen corresponding path program 23 times [2025-02-08 01:19:03,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:19:03,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724325034] [2025-02-08 01:19:03,724 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-08 01:19:03,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:19:03,730 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-02-08 01:19:03,741 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-02-08 01:19:03,742 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 01:19:03,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:19:04,219 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:19:04,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:19:04,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724325034] [2025-02-08 01:19:04,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724325034] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:19:04,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:19:04,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-08 01:19:04,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038775366] [2025-02-08 01:19:04,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:19:04,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-08 01:19:04,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:19:04,221 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-08 01:19:04,221 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-02-08 01:19:04,255 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2025-02-08 01:19:04,256 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 220 places, 224 transitions, 2376 flow. Second operand has 11 states, 11 states have (on average 12.636363636363637) internal successors, (139), 11 states have internal predecessors, (139), 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:19:04,256 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:19:04,256 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2025-02-08 01:19:04,256 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:19:05,079 INFO L124 PetriNetUnfolderBase]: 3624/6501 cut-off events. [2025-02-08 01:19:05,080 INFO L125 PetriNetUnfolderBase]: For 118672/118899 co-relation queries the response was YES. [2025-02-08 01:19:05,119 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31406 conditions, 6501 events. 3624/6501 cut-off events. For 118672/118899 co-relation queries the response was YES. Maximal size of possible extension queue 519. Compared 47817 event pairs, 1521 based on Foata normal form. 51/6340 useless extension candidates. Maximal degree in co-relation 31312. Up to 5241 conditions per place. [2025-02-08 01:19:05,139 INFO L140 encePairwiseOnDemand]: 32/44 looper letters, 243 selfloop transitions, 35 changer transitions 3/288 dead transitions. [2025-02-08 01:19:05,139 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 230 places, 288 transitions, 3650 flow [2025-02-08 01:19:05,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-08 01:19:05,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-02-08 01:19:05,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 225 transitions. [2025-02-08 01:19:05,140 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.46487603305785125 [2025-02-08 01:19:05,140 INFO L175 Difference]: Start difference. First operand has 220 places, 224 transitions, 2376 flow. Second operand 11 states and 225 transitions. [2025-02-08 01:19:05,140 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 230 places, 288 transitions, 3650 flow [2025-02-08 01:19:05,464 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 225 places, 288 transitions, 3416 flow, removed 98 selfloop flow, removed 5 redundant places. [2025-02-08 01:19:05,467 INFO L231 Difference]: Finished difference. Result has 229 places, 231 transitions, 2474 flow [2025-02-08 01:19:05,467 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=2148, PETRI_DIFFERENCE_MINUEND_PLACES=215, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=224, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=192, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2474, PETRI_PLACES=229, PETRI_TRANSITIONS=231} [2025-02-08 01:19:05,467 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 186 predicate places. [2025-02-08 01:19:05,467 INFO L471 AbstractCegarLoop]: Abstraction has has 229 places, 231 transitions, 2474 flow [2025-02-08 01:19:05,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 12.636363636363637) internal successors, (139), 11 states have internal predecessors, (139), 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:19:05,468 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:19:05,468 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:19:05,468 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-02-08 01:19:05,468 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 01:19:05,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:19:05,468 INFO L85 PathProgramCache]: Analyzing trace with hash 2115165951, now seen corresponding path program 24 times [2025-02-08 01:19:05,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:19:05,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194884370] [2025-02-08 01:19:05,469 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-08 01:19:05,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:19:05,475 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 33 statements into 2 equivalence classes. [2025-02-08 01:19:05,482 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 31 of 33 statements. [2025-02-08 01:19:05,482 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-02-08 01:19:05,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:19:05,871 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:19:05,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:19:05,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194884370] [2025-02-08 01:19:05,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194884370] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:19:05,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:19:05,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-08 01:19:05,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786698045] [2025-02-08 01:19:05,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:19:05,872 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-08 01:19:05,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:19:05,873 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-08 01:19:05,873 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-02-08 01:19:05,896 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2025-02-08 01:19:05,896 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 229 places, 231 transitions, 2474 flow. Second operand has 11 states, 11 states have (on average 12.636363636363637) internal successors, (139), 11 states have internal predecessors, (139), 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:19:05,896 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:19:05,897 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2025-02-08 01:19:05,897 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:19:06,857 INFO L124 PetriNetUnfolderBase]: 3729/6708 cut-off events. [2025-02-08 01:19:06,857 INFO L125 PetriNetUnfolderBase]: For 135467/135702 co-relation queries the response was YES. [2025-02-08 01:19:06,893 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32503 conditions, 6708 events. 3729/6708 cut-off events. For 135467/135702 co-relation queries the response was YES. Maximal size of possible extension queue 558. Compared 50138 event pairs, 1582 based on Foata normal form. 53/6541 useless extension candidates. Maximal degree in co-relation 32404. Up to 5419 conditions per place. [2025-02-08 01:19:06,909 INFO L140 encePairwiseOnDemand]: 32/44 looper letters, 249 selfloop transitions, 35 changer transitions 3/294 dead transitions. [2025-02-08 01:19:06,909 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 239 places, 294 transitions, 3690 flow [2025-02-08 01:19:06,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-08 01:19:06,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-02-08 01:19:06,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 225 transitions. [2025-02-08 01:19:06,910 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.46487603305785125 [2025-02-08 01:19:06,910 INFO L175 Difference]: Start difference. First operand has 229 places, 231 transitions, 2474 flow. Second operand 11 states and 225 transitions. [2025-02-08 01:19:06,910 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 239 places, 294 transitions, 3690 flow [2025-02-08 01:19:07,121 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 234 places, 294 transitions, 3468 flow, removed 94 selfloop flow, removed 5 redundant places. [2025-02-08 01:19:07,125 INFO L231 Difference]: Finished difference. Result has 237 places, 237 transitions, 2511 flow [2025-02-08 01:19:07,125 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=2252, PETRI_DIFFERENCE_MINUEND_PLACES=224, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=231, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=197, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2511, PETRI_PLACES=237, PETRI_TRANSITIONS=237} [2025-02-08 01:19:07,126 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 194 predicate places. [2025-02-08 01:19:07,126 INFO L471 AbstractCegarLoop]: Abstraction has has 237 places, 237 transitions, 2511 flow [2025-02-08 01:19:07,126 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 12.636363636363637) internal successors, (139), 11 states have internal predecessors, (139), 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:19:07,126 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:19:07,126 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:19:07,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-02-08 01:19:07,126 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 01:19:07,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:19:07,127 INFO L85 PathProgramCache]: Analyzing trace with hash -1133730927, now seen corresponding path program 25 times [2025-02-08 01:19:07,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:19:07,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18682223] [2025-02-08 01:19:07,127 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-08 01:19:07,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:19:07,133 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-02-08 01:19:07,140 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-02-08 01:19:07,141 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:19:07,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:19:07,495 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:19:07,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:19:07,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18682223] [2025-02-08 01:19:07,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18682223] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:19:07,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:19:07,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-08 01:19:07,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960272278] [2025-02-08 01:19:07,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:19:07,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-08 01:19:07,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:19:07,497 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-08 01:19:07,497 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-02-08 01:19:07,527 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2025-02-08 01:19:07,528 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 237 places, 237 transitions, 2511 flow. Second operand has 11 states, 11 states have (on average 12.636363636363637) internal successors, (139), 11 states have internal predecessors, (139), 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:19:07,528 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:19:07,528 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2025-02-08 01:19:07,528 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:19:08,637 INFO L124 PetriNetUnfolderBase]: 3729/6711 cut-off events. [2025-02-08 01:19:08,637 INFO L125 PetriNetUnfolderBase]: For 133997/134227 co-relation queries the response was YES. [2025-02-08 01:19:08,680 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32214 conditions, 6711 events. 3729/6711 cut-off events. For 133997/134227 co-relation queries the response was YES. Maximal size of possible extension queue 542. Compared 49954 event pairs, 1626 based on Foata normal form. 59/6547 useless extension candidates. Maximal degree in co-relation 32111. Up to 5496 conditions per place. [2025-02-08 01:19:08,703 INFO L140 encePairwiseOnDemand]: 32/44 looper letters, 245 selfloop transitions, 34 changer transitions 3/289 dead transitions. [2025-02-08 01:19:08,703 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 247 places, 289 transitions, 3534 flow [2025-02-08 01:19:08,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-08 01:19:08,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-02-08 01:19:08,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 216 transitions. [2025-02-08 01:19:08,704 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4462809917355372 [2025-02-08 01:19:08,704 INFO L175 Difference]: Start difference. First operand has 237 places, 237 transitions, 2511 flow. Second operand 11 states and 216 transitions. [2025-02-08 01:19:08,704 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 247 places, 289 transitions, 3534 flow [2025-02-08 01:19:08,955 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 241 places, 289 transitions, 3349 flow, removed 74 selfloop flow, removed 6 redundant places. [2025-02-08 01:19:08,958 INFO L231 Difference]: Finished difference. Result has 243 places, 240 transitions, 2459 flow [2025-02-08 01:19:08,958 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=2326, PETRI_DIFFERENCE_MINUEND_PLACES=231, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=237, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=204, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2459, PETRI_PLACES=243, PETRI_TRANSITIONS=240} [2025-02-08 01:19:08,959 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 200 predicate places. [2025-02-08 01:19:08,959 INFO L471 AbstractCegarLoop]: Abstraction has has 243 places, 240 transitions, 2459 flow [2025-02-08 01:19:08,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 12.636363636363637) internal successors, (139), 11 states have internal predecessors, (139), 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:19:08,959 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:19:08,959 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:19:08,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-02-08 01:19:08,959 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 01:19:08,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:19:08,960 INFO L85 PathProgramCache]: Analyzing trace with hash 631216965, now seen corresponding path program 26 times [2025-02-08 01:19:08,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:19:08,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495193140] [2025-02-08 01:19:08,960 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 01:19:08,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:19:08,968 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-02-08 01:19:08,978 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 31 of 33 statements. [2025-02-08 01:19:08,978 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 01:19:08,978 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:19:09,432 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:19:09,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:19:09,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495193140] [2025-02-08 01:19:09,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495193140] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:19:09,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:19:09,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-08 01:19:09,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272301010] [2025-02-08 01:19:09,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:19:09,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-08 01:19:09,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:19:09,433 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-08 01:19:09,433 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-02-08 01:19:09,455 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2025-02-08 01:19:09,456 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 243 places, 240 transitions, 2459 flow. Second operand has 11 states, 11 states have (on average 12.636363636363637) internal successors, (139), 11 states have internal predecessors, (139), 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:19:09,456 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:19:09,456 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2025-02-08 01:19:09,456 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:19:10,365 INFO L124 PetriNetUnfolderBase]: 3825/6903 cut-off events. [2025-02-08 01:19:10,365 INFO L125 PetriNetUnfolderBase]: For 139908/140121 co-relation queries the response was YES. [2025-02-08 01:19:10,402 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33313 conditions, 6903 events. 3825/6903 cut-off events. For 139908/140121 co-relation queries the response was YES. Maximal size of possible extension queue 562. Compared 51951 event pairs, 1656 based on Foata normal form. 48/6726 useless extension candidates. Maximal degree in co-relation 33207. Up to 5579 conditions per place. [2025-02-08 01:19:10,419 INFO L140 encePairwiseOnDemand]: 32/44 looper letters, 256 selfloop transitions, 36 changer transitions 3/302 dead transitions. [2025-02-08 01:19:10,419 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 253 places, 302 transitions, 3714 flow [2025-02-08 01:19:10,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-08 01:19:10,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-02-08 01:19:10,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 225 transitions. [2025-02-08 01:19:10,420 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.46487603305785125 [2025-02-08 01:19:10,420 INFO L175 Difference]: Start difference. First operand has 243 places, 240 transitions, 2459 flow. Second operand 11 states and 225 transitions. [2025-02-08 01:19:10,420 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 253 places, 302 transitions, 3714 flow [2025-02-08 01:19:10,659 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 245 places, 302 transitions, 3586 flow, removed 32 selfloop flow, removed 8 redundant places. [2025-02-08 01:19:10,662 INFO L231 Difference]: Finished difference. Result has 248 places, 246 transitions, 2606 flow [2025-02-08 01:19:10,663 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=2331, PETRI_DIFFERENCE_MINUEND_PLACES=235, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=240, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=205, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2606, PETRI_PLACES=248, PETRI_TRANSITIONS=246} [2025-02-08 01:19:10,663 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 205 predicate places. [2025-02-08 01:19:10,663 INFO L471 AbstractCegarLoop]: Abstraction has has 248 places, 246 transitions, 2606 flow [2025-02-08 01:19:10,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 12.636363636363637) internal successors, (139), 11 states have internal predecessors, (139), 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:19:10,663 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:19:10,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:19:10,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-02-08 01:19:10,664 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 01:19:10,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:19:10,664 INFO L85 PathProgramCache]: Analyzing trace with hash -1682140909, now seen corresponding path program 27 times [2025-02-08 01:19:10,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:19:10,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041347968] [2025-02-08 01:19:10,664 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 01:19:10,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:19:10,671 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 33 statements into 2 equivalence classes. [2025-02-08 01:19:10,677 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 31 of 33 statements. [2025-02-08 01:19:10,678 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-08 01:19:10,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:19:11,023 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:19:11,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:19:11,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041347968] [2025-02-08 01:19:11,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041347968] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:19:11,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:19:11,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-08 01:19:11,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019525145] [2025-02-08 01:19:11,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:19:11,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-08 01:19:11,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:19:11,025 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-08 01:19:11,025 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-02-08 01:19:11,057 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2025-02-08 01:19:11,057 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 248 places, 246 transitions, 2606 flow. Second operand has 11 states, 11 states have (on average 12.636363636363637) internal successors, (139), 11 states have internal predecessors, (139), 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:19:11,057 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:19:11,057 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2025-02-08 01:19:11,058 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:19:12,060 INFO L124 PetriNetUnfolderBase]: 3825/6899 cut-off events. [2025-02-08 01:19:12,060 INFO L125 PetriNetUnfolderBase]: For 149500/149713 co-relation queries the response was YES. [2025-02-08 01:19:12,091 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33691 conditions, 6899 events. 3825/6899 cut-off events. For 149500/149713 co-relation queries the response was YES. Maximal size of possible extension queue 581. Compared 52109 event pairs, 1659 based on Foata normal form. 54/6721 useless extension candidates. Maximal degree in co-relation 33582. Up to 5617 conditions per place. [2025-02-08 01:19:12,106 INFO L140 encePairwiseOnDemand]: 32/44 looper letters, 254 selfloop transitions, 37 changer transitions 4/302 dead transitions. [2025-02-08 01:19:12,106 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 258 places, 302 transitions, 3685 flow [2025-02-08 01:19:12,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-08 01:19:12,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-02-08 01:19:12,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 222 transitions. [2025-02-08 01:19:12,107 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45867768595041325 [2025-02-08 01:19:12,107 INFO L175 Difference]: Start difference. First operand has 248 places, 246 transitions, 2606 flow. Second operand 11 states and 222 transitions. [2025-02-08 01:19:12,107 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 258 places, 302 transitions, 3685 flow [2025-02-08 01:19:12,296 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 252 places, 302 transitions, 3485 flow, removed 81 selfloop flow, removed 6 redundant places. [2025-02-08 01:19:12,299 INFO L231 Difference]: Finished difference. Result has 254 places, 250 transitions, 2555 flow [2025-02-08 01:19:12,299 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=2406, PETRI_DIFFERENCE_MINUEND_PLACES=242, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=246, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=211, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2555, PETRI_PLACES=254, PETRI_TRANSITIONS=250} [2025-02-08 01:19:12,299 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 211 predicate places. [2025-02-08 01:19:12,299 INFO L471 AbstractCegarLoop]: Abstraction has has 254 places, 250 transitions, 2555 flow [2025-02-08 01:19:12,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 12.636363636363637) internal successors, (139), 11 states have internal predecessors, (139), 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:19:12,300 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:19:12,300 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:19:12,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-02-08 01:19:12,300 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 01:19:12,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:19:12,300 INFO L85 PathProgramCache]: Analyzing trace with hash 1175382859, now seen corresponding path program 28 times [2025-02-08 01:19:12,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:19:12,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729890745] [2025-02-08 01:19:12,300 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 01:19:12,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:19:12,305 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 33 statements into 2 equivalence classes. [2025-02-08 01:19:12,313 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-02-08 01:19:12,314 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-08 01:19:12,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:19:12,691 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:19:12,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:19:12,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729890745] [2025-02-08 01:19:12,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1729890745] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:19:12,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:19:12,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-08 01:19:12,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501267730] [2025-02-08 01:19:12,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:19:12,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-08 01:19:12,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:19:12,693 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-08 01:19:12,694 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-02-08 01:19:12,714 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 44 [2025-02-08 01:19:12,715 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 254 places, 250 transitions, 2555 flow. Second operand has 11 states, 11 states have (on average 11.636363636363637) internal successors, (128), 11 states have internal predecessors, (128), 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:19:12,715 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:19:12,715 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 44 [2025-02-08 01:19:12,715 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:19:13,942 INFO L124 PetriNetUnfolderBase]: 4059/7273 cut-off events. [2025-02-08 01:19:13,942 INFO L125 PetriNetUnfolderBase]: For 149061/149298 co-relation queries the response was YES. [2025-02-08 01:19:13,972 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34798 conditions, 7273 events. 4059/7273 cut-off events. For 149061/149298 co-relation queries the response was YES. Maximal size of possible extension queue 588. Compared 54636 event pairs, 1801 based on Foata normal form. 70/7097 useless extension candidates. Maximal degree in co-relation 34686. Up to 5990 conditions per place. [2025-02-08 01:19:13,987 INFO L140 encePairwiseOnDemand]: 32/44 looper letters, 255 selfloop transitions, 37 changer transitions 3/301 dead transitions. [2025-02-08 01:19:13,988 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 264 places, 301 transitions, 3557 flow [2025-02-08 01:19:13,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-08 01:19:13,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-02-08 01:19:13,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 207 transitions. [2025-02-08 01:19:13,988 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.42768595041322316 [2025-02-08 01:19:13,988 INFO L175 Difference]: Start difference. First operand has 254 places, 250 transitions, 2555 flow. Second operand 11 states and 207 transitions. [2025-02-08 01:19:13,988 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 264 places, 301 transitions, 3557 flow [2025-02-08 01:19:14,238 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 256 places, 301 transitions, 3423 flow, removed 32 selfloop flow, removed 8 redundant places. [2025-02-08 01:19:14,242 INFO L231 Difference]: Finished difference. Result has 258 places, 253 transitions, 2567 flow [2025-02-08 01:19:14,242 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=2421, PETRI_DIFFERENCE_MINUEND_PLACES=246, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=250, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=214, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2567, PETRI_PLACES=258, PETRI_TRANSITIONS=253} [2025-02-08 01:19:14,243 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 215 predicate places. [2025-02-08 01:19:14,243 INFO L471 AbstractCegarLoop]: Abstraction has has 258 places, 253 transitions, 2567 flow [2025-02-08 01:19:14,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.636363636363637) internal successors, (128), 11 states have internal predecessors, (128), 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:19:14,243 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:19:14,243 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:19:14,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-02-08 01:19:14,243 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 01:19:14,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:19:14,244 INFO L85 PathProgramCache]: Analyzing trace with hash 841229827, now seen corresponding path program 29 times [2025-02-08 01:19:14,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:19:14,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625326289] [2025-02-08 01:19:14,244 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-08 01:19:14,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:19:14,249 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-02-08 01:19:14,256 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-02-08 01:19:14,256 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 01:19:14,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:19:14,620 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:19:14,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:19:14,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625326289] [2025-02-08 01:19:14,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625326289] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:19:14,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:19:14,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-08 01:19:14,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470142105] [2025-02-08 01:19:14,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:19:14,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-08 01:19:14,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:19:14,622 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-08 01:19:14,622 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-02-08 01:19:14,665 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2025-02-08 01:19:14,666 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 258 places, 253 transitions, 2567 flow. Second operand has 11 states, 11 states have (on average 12.636363636363637) internal successors, (139), 11 states have internal predecessors, (139), 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:19:14,666 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:19:14,666 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2025-02-08 01:19:14,666 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:19:15,671 INFO L124 PetriNetUnfolderBase]: 3861/6996 cut-off events. [2025-02-08 01:19:15,671 INFO L125 PetriNetUnfolderBase]: For 139959/140196 co-relation queries the response was YES. [2025-02-08 01:19:15,720 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33204 conditions, 6996 events. 3861/6996 cut-off events. For 139959/140196 co-relation queries the response was YES. Maximal size of possible extension queue 577. Compared 53028 event pairs, 1677 based on Foata normal form. 70/6836 useless extension candidates. Maximal degree in co-relation 33090. Up to 5682 conditions per place. [2025-02-08 01:19:15,738 INFO L140 encePairwiseOnDemand]: 32/44 looper letters, 255 selfloop transitions, 41 changer transitions 4/307 dead transitions. [2025-02-08 01:19:15,738 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 268 places, 307 transitions, 3602 flow [2025-02-08 01:19:15,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-08 01:19:15,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-02-08 01:19:15,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 221 transitions. [2025-02-08 01:19:15,739 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45661157024793386 [2025-02-08 01:19:15,739 INFO L175 Difference]: Start difference. First operand has 258 places, 253 transitions, 2567 flow. Second operand 11 states and 221 transitions. [2025-02-08 01:19:15,739 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 268 places, 307 transitions, 3602 flow [2025-02-08 01:19:16,133 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 260 places, 307 transitions, 3478 flow, removed 27 selfloop flow, removed 8 redundant places. [2025-02-08 01:19:16,136 INFO L231 Difference]: Finished difference. Result has 262 places, 257 transitions, 2613 flow [2025-02-08 01:19:16,137 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=2443, PETRI_DIFFERENCE_MINUEND_PLACES=250, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=253, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=214, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2613, PETRI_PLACES=262, PETRI_TRANSITIONS=257} [2025-02-08 01:19:16,137 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 219 predicate places. [2025-02-08 01:19:16,137 INFO L471 AbstractCegarLoop]: Abstraction has has 262 places, 257 transitions, 2613 flow [2025-02-08 01:19:16,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 12.636363636363637) internal successors, (139), 11 states have internal predecessors, (139), 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:19:16,137 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:19:16,137 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:19:16,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-02-08 01:19:16,137 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 01:19:16,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:19:16,138 INFO L85 PathProgramCache]: Analyzing trace with hash -1074733113, now seen corresponding path program 30 times [2025-02-08 01:19:16,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:19:16,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248803954] [2025-02-08 01:19:16,138 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-08 01:19:16,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:19:16,143 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 33 statements into 2 equivalence classes. [2025-02-08 01:19:16,150 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 31 of 33 statements. [2025-02-08 01:19:16,150 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-02-08 01:19:16,150 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:19:16,540 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:19:16,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:19:16,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248803954] [2025-02-08 01:19:16,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248803954] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:19:16,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:19:16,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-08 01:19:16,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577503422] [2025-02-08 01:19:16,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:19:16,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-08 01:19:16,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:19:16,541 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-08 01:19:16,541 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-02-08 01:19:16,561 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2025-02-08 01:19:16,561 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 262 places, 257 transitions, 2613 flow. Second operand has 11 states, 11 states have (on average 12.636363636363637) internal successors, (139), 11 states have internal predecessors, (139), 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:19:16,561 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:19:16,561 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2025-02-08 01:19:16,561 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:19:17,824 INFO L124 PetriNetUnfolderBase]: 3861/6988 cut-off events. [2025-02-08 01:19:17,824 INFO L125 PetriNetUnfolderBase]: For 140455/140692 co-relation queries the response was YES. [2025-02-08 01:19:17,864 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33249 conditions, 6988 events. 3861/6988 cut-off events. For 140455/140692 co-relation queries the response was YES. Maximal size of possible extension queue 577. Compared 52935 event pairs, 1720 based on Foata normal form. 62/6814 useless extension candidates. Maximal degree in co-relation 33133. Up to 5760 conditions per place. [2025-02-08 01:19:17,879 INFO L140 encePairwiseOnDemand]: 32/44 looper letters, 258 selfloop transitions, 35 changer transitions 3/303 dead transitions. [2025-02-08 01:19:17,880 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 272 places, 303 transitions, 3563 flow [2025-02-08 01:19:17,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-08 01:19:17,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-02-08 01:19:17,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 212 transitions. [2025-02-08 01:19:17,881 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4380165289256198 [2025-02-08 01:19:17,881 INFO L175 Difference]: Start difference. First operand has 262 places, 257 transitions, 2613 flow. Second operand 11 states and 212 transitions. [2025-02-08 01:19:17,881 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 272 places, 303 transitions, 3563 flow [2025-02-08 01:19:18,100 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 264 places, 303 transitions, 3409 flow, removed 38 selfloop flow, removed 8 redundant places. [2025-02-08 01:19:18,103 INFO L231 Difference]: Finished difference. Result has 266 places, 259 transitions, 2553 flow [2025-02-08 01:19:18,103 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=2459, PETRI_DIFFERENCE_MINUEND_PLACES=254, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=257, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=222, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2553, PETRI_PLACES=266, PETRI_TRANSITIONS=259} [2025-02-08 01:19:18,103 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 223 predicate places. [2025-02-08 01:19:18,103 INFO L471 AbstractCegarLoop]: Abstraction has has 266 places, 259 transitions, 2553 flow [2025-02-08 01:19:18,103 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 12.636363636363637) internal successors, (139), 11 states have internal predecessors, (139), 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:19:18,103 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:19:18,104 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:19:18,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-02-08 01:19:18,104 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 01:19:18,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:19:18,104 INFO L85 PathProgramCache]: Analyzing trace with hash -1712656131, now seen corresponding path program 31 times [2025-02-08 01:19:18,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:19:18,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122822815] [2025-02-08 01:19:18,104 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-08 01:19:18,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:19:18,109 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-02-08 01:19:18,116 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-02-08 01:19:18,116 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:19:18,116 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:19:18,469 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:19:18,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:19:18,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122822815] [2025-02-08 01:19:18,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122822815] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:19:18,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:19:18,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-08 01:19:18,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83327381] [2025-02-08 01:19:18,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:19:18,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-08 01:19:18,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:19:18,470 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-08 01:19:18,470 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-02-08 01:19:18,505 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2025-02-08 01:19:18,506 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 266 places, 259 transitions, 2553 flow. Second operand has 11 states, 11 states have (on average 12.636363636363637) internal successors, (139), 11 states have internal predecessors, (139), 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:19:18,506 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:19:18,506 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2025-02-08 01:19:18,506 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:19:19,642 INFO L124 PetriNetUnfolderBase]: 3992/7227 cut-off events. [2025-02-08 01:19:19,642 INFO L125 PetriNetUnfolderBase]: For 153958/154223 co-relation queries the response was YES. [2025-02-08 01:19:19,692 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34921 conditions, 7227 events. 3992/7227 cut-off events. For 153958/154223 co-relation queries the response was YES. Maximal size of possible extension queue 601. Compared 55123 event pairs, 1764 based on Foata normal form. 54/7040 useless extension candidates. Maximal degree in co-relation 34803. Up to 5873 conditions per place. [2025-02-08 01:19:19,713 INFO L140 encePairwiseOnDemand]: 32/44 looper letters, 274 selfloop transitions, 35 changer transitions 3/319 dead transitions. [2025-02-08 01:19:19,713 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 276 places, 319 transitions, 4026 flow [2025-02-08 01:19:19,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-08 01:19:19,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-02-08 01:19:19,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 222 transitions. [2025-02-08 01:19:19,714 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45867768595041325 [2025-02-08 01:19:19,714 INFO L175 Difference]: Start difference. First operand has 266 places, 259 transitions, 2553 flow. Second operand 11 states and 222 transitions. [2025-02-08 01:19:19,714 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 276 places, 319 transitions, 4026 flow [2025-02-08 01:19:19,992 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 268 places, 319 transitions, 3958 flow, removed 1 selfloop flow, removed 8 redundant places. [2025-02-08 01:19:19,995 INFO L231 Difference]: Finished difference. Result has 272 places, 268 transitions, 2964 flow [2025-02-08 01:19:19,995 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=2485, PETRI_DIFFERENCE_MINUEND_PLACES=258, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=259, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=229, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2964, PETRI_PLACES=272, PETRI_TRANSITIONS=268} [2025-02-08 01:19:19,995 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 229 predicate places. [2025-02-08 01:19:19,995 INFO L471 AbstractCegarLoop]: Abstraction has has 272 places, 268 transitions, 2964 flow [2025-02-08 01:19:19,996 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 12.636363636363637) internal successors, (139), 11 states have internal predecessors, (139), 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:19:19,996 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:19:19,996 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:19:19,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-02-08 01:19:19,996 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 01:19:19,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:19:19,997 INFO L85 PathProgramCache]: Analyzing trace with hash -1380312047, now seen corresponding path program 32 times [2025-02-08 01:19:19,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:19:19,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731409102] [2025-02-08 01:19:19,997 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 01:19:19,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:19:20,002 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-02-08 01:19:20,009 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 31 of 33 statements. [2025-02-08 01:19:20,010 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 01:19:20,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:19:20,416 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:19:20,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:19:20,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731409102] [2025-02-08 01:19:20,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1731409102] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:19:20,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:19:20,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-08 01:19:20,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903990726] [2025-02-08 01:19:20,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:19:20,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-08 01:19:20,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:19:20,418 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-08 01:19:20,418 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-02-08 01:19:20,447 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2025-02-08 01:19:20,448 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 272 places, 268 transitions, 2964 flow. Second operand has 11 states, 11 states have (on average 12.636363636363637) internal successors, (139), 11 states have internal predecessors, (139), 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:19:20,448 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:19:20,448 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2025-02-08 01:19:20,448 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:19:21,561 INFO L124 PetriNetUnfolderBase]: 4154/7510 cut-off events. [2025-02-08 01:19:21,561 INFO L125 PetriNetUnfolderBase]: For 212231/212696 co-relation queries the response was YES. [2025-02-08 01:19:21,612 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38778 conditions, 7510 events. 4154/7510 cut-off events. For 212231/212696 co-relation queries the response was YES. Maximal size of possible extension queue 632. Compared 57767 event pairs, 1805 based on Foata normal form. 54/7312 useless extension candidates. Maximal degree in co-relation 38656. Up to 6059 conditions per place. [2025-02-08 01:19:21,632 INFO L140 encePairwiseOnDemand]: 32/44 looper letters, 286 selfloop transitions, 36 changer transitions 3/332 dead transitions. [2025-02-08 01:19:21,632 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 282 places, 332 transitions, 4471 flow [2025-02-08 01:19:21,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-08 01:19:21,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-02-08 01:19:21,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 227 transitions. [2025-02-08 01:19:21,633 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4690082644628099 [2025-02-08 01:19:21,633 INFO L175 Difference]: Start difference. First operand has 272 places, 268 transitions, 2964 flow. Second operand 11 states and 227 transitions. [2025-02-08 01:19:21,633 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 282 places, 332 transitions, 4471 flow [2025-02-08 01:19:21,958 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 277 places, 332 transitions, 4137 flow, removed 151 selfloop flow, removed 5 redundant places. [2025-02-08 01:19:21,962 INFO L231 Difference]: Finished difference. Result has 281 places, 277 transitions, 3073 flow [2025-02-08 01:19:21,962 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=2630, PETRI_DIFFERENCE_MINUEND_PLACES=267, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=268, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=235, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3073, PETRI_PLACES=281, PETRI_TRANSITIONS=277} [2025-02-08 01:19:21,962 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 238 predicate places. [2025-02-08 01:19:21,962 INFO L471 AbstractCegarLoop]: Abstraction has has 281 places, 277 transitions, 3073 flow [2025-02-08 01:19:21,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 12.636363636363637) internal successors, (139), 11 states have internal predecessors, (139), 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:19:21,962 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:19:21,963 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:19:21,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-02-08 01:19:21,963 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 01:19:21,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:19:21,963 INFO L85 PathProgramCache]: Analyzing trace with hash 764987971, now seen corresponding path program 33 times [2025-02-08 01:19:21,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:19:21,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115672307] [2025-02-08 01:19:21,963 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 01:19:21,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:19:21,970 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 33 statements into 2 equivalence classes. [2025-02-08 01:19:21,979 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 31 of 33 statements. [2025-02-08 01:19:21,979 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-08 01:19:21,979 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:19:22,275 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:19:22,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:19:22,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115672307] [2025-02-08 01:19:22,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115672307] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:19:22,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:19:22,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-08 01:19:22,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241631113] [2025-02-08 01:19:22,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:19:22,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-08 01:19:22,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:19:22,276 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-08 01:19:22,276 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-02-08 01:19:22,296 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2025-02-08 01:19:22,296 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 281 places, 277 transitions, 3073 flow. Second operand has 11 states, 11 states have (on average 12.636363636363637) internal successors, (139), 11 states have internal predecessors, (139), 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:19:22,296 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:19:22,296 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2025-02-08 01:19:22,296 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:19:23,498 INFO L124 PetriNetUnfolderBase]: 4215/7620 cut-off events. [2025-02-08 01:19:23,498 INFO L125 PetriNetUnfolderBase]: For 224169/224670 co-relation queries the response was YES. [2025-02-08 01:19:23,538 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39131 conditions, 7620 events. 4215/7620 cut-off events. For 224169/224670 co-relation queries the response was YES. Maximal size of possible extension queue 647. Compared 58947 event pairs, 1895 based on Foata normal form. 68/7432 useless extension candidates. Maximal degree in co-relation 39004. Up to 6298 conditions per place. [2025-02-08 01:19:23,556 INFO L140 encePairwiseOnDemand]: 32/44 looper letters, 280 selfloop transitions, 35 changer transitions 4/326 dead transitions. [2025-02-08 01:19:23,556 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 291 places, 326 transitions, 4199 flow [2025-02-08 01:19:23,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-08 01:19:23,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-02-08 01:19:23,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 214 transitions. [2025-02-08 01:19:23,557 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.44214876033057854 [2025-02-08 01:19:23,557 INFO L175 Difference]: Start difference. First operand has 281 places, 277 transitions, 3073 flow. Second operand 11 states and 214 transitions. [2025-02-08 01:19:23,557 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 291 places, 326 transitions, 4199 flow [2025-02-08 01:19:23,930 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 286 places, 326 transitions, 3899 flow, removed 134 selfloop flow, removed 5 redundant places. [2025-02-08 01:19:23,934 INFO L231 Difference]: Finished difference. Result has 289 places, 283 transitions, 3028 flow [2025-02-08 01:19:23,934 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=2773, PETRI_DIFFERENCE_MINUEND_PLACES=276, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=277, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=245, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3028, PETRI_PLACES=289, PETRI_TRANSITIONS=283} [2025-02-08 01:19:23,934 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 246 predicate places. [2025-02-08 01:19:23,934 INFO L471 AbstractCegarLoop]: Abstraction has has 289 places, 283 transitions, 3028 flow [2025-02-08 01:19:23,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 12.636363636363637) internal successors, (139), 11 states have internal predecessors, (139), 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:19:23,934 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:19:23,934 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:19:23,935 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-02-08 01:19:23,935 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 01:19:23,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:19:23,935 INFO L85 PathProgramCache]: Analyzing trace with hash -1728937693, now seen corresponding path program 34 times [2025-02-08 01:19:23,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:19:23,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905875036] [2025-02-08 01:19:23,935 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 01:19:23,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:19:23,940 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 33 statements into 2 equivalence classes. [2025-02-08 01:19:23,948 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-02-08 01:19:23,948 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-08 01:19:23,948 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:19:24,343 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:19:24,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:19:24,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905875036] [2025-02-08 01:19:24,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905875036] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:19:24,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:19:24,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-08 01:19:24,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134288145] [2025-02-08 01:19:24,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:19:24,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-08 01:19:24,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:19:24,345 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-08 01:19:24,345 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-02-08 01:19:24,386 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 44 [2025-02-08 01:19:24,386 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 289 places, 283 transitions, 3028 flow. Second operand has 11 states, 11 states have (on average 11.636363636363637) internal successors, (128), 11 states have internal predecessors, (128), 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:19:24,386 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:19:24,386 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 44 [2025-02-08 01:19:24,386 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:19:25,890 INFO L124 PetriNetUnfolderBase]: 4585/8202 cut-off events. [2025-02-08 01:19:25,890 INFO L125 PetriNetUnfolderBase]: For 235115/235403 co-relation queries the response was YES. [2025-02-08 01:19:25,953 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41803 conditions, 8202 events. 4585/8202 cut-off events. For 235115/235403 co-relation queries the response was YES. Maximal size of possible extension queue 690. Compared 63149 event pairs, 2037 based on Foata normal form. 74/8011 useless extension candidates. Maximal degree in co-relation 41672. Up to 6567 conditions per place. [2025-02-08 01:19:25,981 INFO L140 encePairwiseOnDemand]: 32/44 looper letters, 301 selfloop transitions, 43 changer transitions 3/353 dead transitions. [2025-02-08 01:19:25,981 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 299 places, 353 transitions, 4602 flow [2025-02-08 01:19:25,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-08 01:19:25,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-02-08 01:19:25,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 226 transitions. [2025-02-08 01:19:25,982 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4669421487603306 [2025-02-08 01:19:25,982 INFO L175 Difference]: Start difference. First operand has 289 places, 283 transitions, 3028 flow. Second operand 11 states and 226 transitions. [2025-02-08 01:19:25,982 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 299 places, 353 transitions, 4602 flow [2025-02-08 01:19:26,507 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 293 places, 353 transitions, 4386 flow, removed 89 selfloop flow, removed 6 redundant places. [2025-02-08 01:19:26,511 INFO L231 Difference]: Finished difference. Result has 297 places, 292 transitions, 3324 flow [2025-02-08 01:19:26,511 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=2812, PETRI_DIFFERENCE_MINUEND_PLACES=283, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=283, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=244, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3324, PETRI_PLACES=297, PETRI_TRANSITIONS=292} [2025-02-08 01:19:26,511 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 254 predicate places. [2025-02-08 01:19:26,511 INFO L471 AbstractCegarLoop]: Abstraction has has 297 places, 292 transitions, 3324 flow [2025-02-08 01:19:26,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.636363636363637) internal successors, (128), 11 states have internal predecessors, (128), 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:19:26,512 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:19:26,512 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:19:26,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-02-08 01:19:26,512 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 01:19:26,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:19:26,512 INFO L85 PathProgramCache]: Analyzing trace with hash 456877541, now seen corresponding path program 35 times [2025-02-08 01:19:26,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:19:26,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606070089] [2025-02-08 01:19:26,513 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-08 01:19:26,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:19:26,519 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-02-08 01:19:26,530 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-02-08 01:19:26,531 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 01:19:26,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:19:27,084 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:19:27,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:19:27,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606070089] [2025-02-08 01:19:27,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606070089] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:19:27,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:19:27,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-08 01:19:27,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782505605] [2025-02-08 01:19:27,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:19:27,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-08 01:19:27,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:19:27,086 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-08 01:19:27,086 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-02-08 01:19:27,126 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2025-02-08 01:19:27,126 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 297 places, 292 transitions, 3324 flow. Second operand has 11 states, 11 states have (on average 12.636363636363637) internal successors, (139), 11 states have internal predecessors, (139), 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:19:27,126 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:19:27,126 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2025-02-08 01:19:27,126 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:19:28,682 INFO L124 PetriNetUnfolderBase]: 4450/8025 cut-off events. [2025-02-08 01:19:28,683 INFO L125 PetriNetUnfolderBase]: For 259156/259447 co-relation queries the response was YES. [2025-02-08 01:19:28,752 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42165 conditions, 8025 events. 4450/8025 cut-off events. For 259156/259447 co-relation queries the response was YES. Maximal size of possible extension queue 695. Compared 62624 event pairs, 2023 based on Foata normal form. 63/7827 useless extension candidates. Maximal degree in co-relation 42029. Up to 6589 conditions per place. [2025-02-08 01:19:28,782 INFO L140 encePairwiseOnDemand]: 32/44 looper letters, 307 selfloop transitions, 34 changer transitions 3/351 dead transitions. [2025-02-08 01:19:28,782 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 307 places, 351 transitions, 4745 flow [2025-02-08 01:19:28,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-08 01:19:28,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-02-08 01:19:28,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 224 transitions. [2025-02-08 01:19:28,783 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4628099173553719 [2025-02-08 01:19:28,783 INFO L175 Difference]: Start difference. First operand has 297 places, 292 transitions, 3324 flow. Second operand 11 states and 224 transitions. [2025-02-08 01:19:28,783 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 307 places, 351 transitions, 4745 flow [2025-02-08 01:19:29,353 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 302 places, 351 transitions, 4419 flow, removed 145 selfloop flow, removed 5 redundant places. [2025-02-08 01:19:29,357 INFO L231 Difference]: Finished difference. Result has 305 places, 297 transitions, 3310 flow [2025-02-08 01:19:29,357 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=3002, PETRI_DIFFERENCE_MINUEND_PLACES=292, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=292, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=259, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3310, PETRI_PLACES=305, PETRI_TRANSITIONS=297} [2025-02-08 01:19:29,357 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 262 predicate places. [2025-02-08 01:19:29,357 INFO L471 AbstractCegarLoop]: Abstraction has has 305 places, 297 transitions, 3310 flow [2025-02-08 01:19:29,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 12.636363636363637) internal successors, (139), 11 states have internal predecessors, (139), 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:19:29,358 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:19:29,358 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:19:29,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-02-08 01:19:29,358 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 01:19:29,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:19:29,359 INFO L85 PathProgramCache]: Analyzing trace with hash 199136689, now seen corresponding path program 36 times [2025-02-08 01:19:29,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:19:29,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66165180] [2025-02-08 01:19:29,359 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-08 01:19:29,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:19:29,367 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 33 statements into 2 equivalence classes. [2025-02-08 01:19:29,377 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 31 of 33 statements. [2025-02-08 01:19:29,377 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-02-08 01:19:29,377 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:19:29,789 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:19:29,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:19:29,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66165180] [2025-02-08 01:19:29,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66165180] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:19:29,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:19:29,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-08 01:19:29,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025943130] [2025-02-08 01:19:29,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:19:29,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-08 01:19:29,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:19:29,790 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-08 01:19:29,790 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-02-08 01:19:29,811 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2025-02-08 01:19:29,812 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 305 places, 297 transitions, 3310 flow. Second operand has 11 states, 11 states have (on average 12.636363636363637) internal successors, (139), 11 states have internal predecessors, (139), 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:19:29,812 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:19:29,812 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2025-02-08 01:19:29,812 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:19:30,980 INFO L124 PetriNetUnfolderBase]: 4450/8014 cut-off events. [2025-02-08 01:19:30,980 INFO L125 PetriNetUnfolderBase]: For 248058/248345 co-relation queries the response was YES. [2025-02-08 01:19:31,040 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41021 conditions, 8014 events. 4450/8014 cut-off events. For 248058/248345 co-relation queries the response was YES. Maximal size of possible extension queue 696. Compared 62414 event pairs, 2047 based on Foata normal form. 69/7818 useless extension candidates. Maximal degree in co-relation 40881. Up to 6666 conditions per place. [2025-02-08 01:19:31,063 INFO L140 encePairwiseOnDemand]: 32/44 looper letters, 303 selfloop transitions, 33 changer transitions 3/346 dead transitions. [2025-02-08 01:19:31,063 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 315 places, 346 transitions, 4481 flow [2025-02-08 01:19:31,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-08 01:19:31,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-02-08 01:19:31,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 215 transitions. [2025-02-08 01:19:31,064 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.44421487603305787 [2025-02-08 01:19:31,064 INFO L175 Difference]: Start difference. First operand has 305 places, 297 transitions, 3310 flow. Second operand 11 states and 215 transitions. [2025-02-08 01:19:31,065 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 315 places, 346 transitions, 4481 flow [2025-02-08 01:19:31,470 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 309 places, 346 transitions, 4236 flow, removed 105 selfloop flow, removed 6 redundant places. [2025-02-08 01:19:31,475 INFO L231 Difference]: Finished difference. Result has 311 places, 300 transitions, 3216 flow [2025-02-08 01:19:31,475 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=3065, PETRI_DIFFERENCE_MINUEND_PLACES=299, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=297, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=265, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3216, PETRI_PLACES=311, PETRI_TRANSITIONS=300} [2025-02-08 01:19:31,476 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 268 predicate places. [2025-02-08 01:19:31,476 INFO L471 AbstractCegarLoop]: Abstraction has has 311 places, 300 transitions, 3216 flow [2025-02-08 01:19:31,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 12.636363636363637) internal successors, (139), 11 states have internal predecessors, (139), 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:19:31,476 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:19:31,476 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:19:31,477 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2025-02-08 01:19:31,477 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 01:19:31,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:19:31,477 INFO L85 PathProgramCache]: Analyzing trace with hash 1964084581, now seen corresponding path program 37 times [2025-02-08 01:19:31,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:19:31,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936300342] [2025-02-08 01:19:31,477 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-08 01:19:31,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:19:31,484 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-02-08 01:19:31,491 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-02-08 01:19:31,491 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:19:31,491 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:19:31,822 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:19:31,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:19:31,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936300342] [2025-02-08 01:19:31,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936300342] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:19:31,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:19:31,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-08 01:19:31,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534989677] [2025-02-08 01:19:31,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:19:31,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-08 01:19:31,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:19:31,823 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-08 01:19:31,823 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-02-08 01:19:31,840 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2025-02-08 01:19:31,841 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 311 places, 300 transitions, 3216 flow. Second operand has 11 states, 11 states have (on average 12.636363636363637) internal successors, (139), 11 states have internal predecessors, (139), 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:19:31,841 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:19:31,841 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2025-02-08 01:19:31,841 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:19:32,996 INFO L124 PetriNetUnfolderBase]: 4513/8140 cut-off events. [2025-02-08 01:19:32,996 INFO L125 PetriNetUnfolderBase]: For 249874/250141 co-relation queries the response was YES. [2025-02-08 01:19:33,063 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41524 conditions, 8140 events. 4513/8140 cut-off events. For 249874/250141 co-relation queries the response was YES. Maximal size of possible extension queue 698. Compared 63639 event pairs, 2097 based on Foata normal form. 58/7937 useless extension candidates. Maximal degree in co-relation 41381. Up to 6681 conditions per place. [2025-02-08 01:19:33,086 INFO L140 encePairwiseOnDemand]: 32/44 looper letters, 313 selfloop transitions, 35 changer transitions 3/358 dead transitions. [2025-02-08 01:19:33,086 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 321 places, 358 transitions, 4666 flow [2025-02-08 01:19:33,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-08 01:19:33,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-02-08 01:19:33,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 224 transitions. [2025-02-08 01:19:33,088 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4628099173553719 [2025-02-08 01:19:33,088 INFO L175 Difference]: Start difference. First operand has 311 places, 300 transitions, 3216 flow. Second operand 11 states and 224 transitions. [2025-02-08 01:19:33,088 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 321 places, 358 transitions, 4666 flow [2025-02-08 01:19:33,518 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 313 places, 358 transitions, 4542 flow, removed 31 selfloop flow, removed 8 redundant places. [2025-02-08 01:19:33,522 INFO L231 Difference]: Finished difference. Result has 316 places, 305 transitions, 3414 flow [2025-02-08 01:19:33,523 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=3092, PETRI_DIFFERENCE_MINUEND_PLACES=303, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=300, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=266, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3414, PETRI_PLACES=316, PETRI_TRANSITIONS=305} [2025-02-08 01:19:33,523 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 273 predicate places. [2025-02-08 01:19:33,523 INFO L471 AbstractCegarLoop]: Abstraction has has 316 places, 305 transitions, 3414 flow [2025-02-08 01:19:33,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 12.636363636363637) internal successors, (139), 11 states have internal predecessors, (139), 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:19:33,523 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:19:33,524 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:19:33,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2025-02-08 01:19:33,524 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 01:19:33,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:19:33,525 INFO L85 PathProgramCache]: Analyzing trace with hash -349273293, now seen corresponding path program 38 times [2025-02-08 01:19:33,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:19:33,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233847462] [2025-02-08 01:19:33,525 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 01:19:33,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:19:33,535 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-02-08 01:19:33,543 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 31 of 33 statements. [2025-02-08 01:19:33,544 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 01:19:33,544 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:19:33,831 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:19:33,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:19:33,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233847462] [2025-02-08 01:19:33,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233847462] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:19:33,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:19:33,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-08 01:19:33,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238420786] [2025-02-08 01:19:33,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:19:33,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-08 01:19:33,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:19:33,832 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-08 01:19:33,832 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-02-08 01:19:33,859 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2025-02-08 01:19:33,860 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 316 places, 305 transitions, 3414 flow. Second operand has 11 states, 11 states have (on average 12.636363636363637) internal successors, (139), 11 states have internal predecessors, (139), 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:19:33,860 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:19:33,860 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2025-02-08 01:19:33,860 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:19:35,028 INFO L124 PetriNetUnfolderBase]: 4513/8148 cut-off events. [2025-02-08 01:19:35,028 INFO L125 PetriNetUnfolderBase]: For 262605/262872 co-relation queries the response was YES. [2025-02-08 01:19:35,097 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41883 conditions, 8148 events. 4513/8148 cut-off events. For 262605/262872 co-relation queries the response was YES. Maximal size of possible extension queue 703. Compared 63745 event pairs, 2092 based on Foata normal form. 64/7950 useless extension candidates. Maximal degree in co-relation 41737. Up to 6719 conditions per place. [2025-02-08 01:19:35,121 INFO L140 encePairwiseOnDemand]: 32/44 looper letters, 311 selfloop transitions, 36 changer transitions 4/358 dead transitions. [2025-02-08 01:19:35,121 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 326 places, 358 transitions, 4637 flow [2025-02-08 01:19:35,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-08 01:19:35,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-02-08 01:19:35,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 221 transitions. [2025-02-08 01:19:35,122 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45661157024793386 [2025-02-08 01:19:35,122 INFO L175 Difference]: Start difference. First operand has 316 places, 305 transitions, 3414 flow. Second operand 11 states and 221 transitions. [2025-02-08 01:19:35,122 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 326 places, 358 transitions, 4637 flow [2025-02-08 01:19:35,785 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 320 places, 358 transitions, 4377 flow, removed 112 selfloop flow, removed 6 redundant places. [2025-02-08 01:19:35,790 INFO L231 Difference]: Finished difference. Result has 322 places, 309 transitions, 3321 flow [2025-02-08 01:19:35,790 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=3154, PETRI_DIFFERENCE_MINUEND_PLACES=310, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=305, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=271, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3321, PETRI_PLACES=322, PETRI_TRANSITIONS=309} [2025-02-08 01:19:35,790 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 279 predicate places. [2025-02-08 01:19:35,790 INFO L471 AbstractCegarLoop]: Abstraction has has 322 places, 309 transitions, 3321 flow [2025-02-08 01:19:35,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 12.636363636363637) internal successors, (139), 11 states have internal predecessors, (139), 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:19:35,791 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:19:35,791 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:19:35,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2025-02-08 01:19:35,791 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 01:19:35,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:19:35,792 INFO L85 PathProgramCache]: Analyzing trace with hash -1224140559, now seen corresponding path program 39 times [2025-02-08 01:19:35,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:19:35,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145620611] [2025-02-08 01:19:35,792 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 01:19:35,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:19:35,799 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 33 statements into 2 equivalence classes. [2025-02-08 01:19:35,805 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 31 of 33 statements. [2025-02-08 01:19:35,805 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-08 01:19:35,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:19:36,065 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:19:36,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:19:36,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145620611] [2025-02-08 01:19:36,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145620611] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:19:36,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:19:36,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-08 01:19:36,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227265721] [2025-02-08 01:19:36,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:19:36,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-08 01:19:36,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:19:36,066 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-08 01:19:36,066 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-02-08 01:19:36,090 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2025-02-08 01:19:36,091 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 322 places, 309 transitions, 3321 flow. Second operand has 11 states, 11 states have (on average 12.636363636363637) internal successors, (139), 11 states have internal predecessors, (139), 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:19:36,091 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:19:36,091 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2025-02-08 01:19:36,091 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:19:37,374 INFO L124 PetriNetUnfolderBase]: 4513/8146 cut-off events. [2025-02-08 01:19:37,374 INFO L125 PetriNetUnfolderBase]: For 247642/247933 co-relation queries the response was YES. [2025-02-08 01:19:37,433 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41046 conditions, 8146 events. 4513/8146 cut-off events. For 247642/247933 co-relation queries the response was YES. Maximal size of possible extension queue 704. Compared 63732 event pairs, 2088 based on Foata normal form. 80/7966 useless extension candidates. Maximal degree in co-relation 40897. Up to 6715 conditions per place. [2025-02-08 01:19:37,457 INFO L140 encePairwiseOnDemand]: 32/44 looper letters, 309 selfloop transitions, 40 changer transitions 4/360 dead transitions. [2025-02-08 01:19:37,457 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 332 places, 360 transitions, 4474 flow [2025-02-08 01:19:37,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-08 01:19:37,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-02-08 01:19:37,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 220 transitions. [2025-02-08 01:19:37,458 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45454545454545453 [2025-02-08 01:19:37,458 INFO L175 Difference]: Start difference. First operand has 322 places, 309 transitions, 3321 flow. Second operand 11 states and 220 transitions. [2025-02-08 01:19:37,458 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 332 places, 360 transitions, 4474 flow [2025-02-08 01:19:37,935 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 324 places, 360 transitions, 4310 flow, removed 48 selfloop flow, removed 8 redundant places. [2025-02-08 01:19:37,940 INFO L231 Difference]: Finished difference. Result has 326 places, 313 transitions, 3343 flow [2025-02-08 01:19:37,940 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=3157, PETRI_DIFFERENCE_MINUEND_PLACES=314, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=309, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=271, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3343, PETRI_PLACES=326, PETRI_TRANSITIONS=313} [2025-02-08 01:19:37,940 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 283 predicate places. [2025-02-08 01:19:37,940 INFO L471 AbstractCegarLoop]: Abstraction has has 326 places, 313 transitions, 3343 flow [2025-02-08 01:19:37,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 12.636363636363637) internal successors, (139), 11 states have internal predecessors, (139), 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:19:37,941 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:19:37,941 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:19:37,941 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2025-02-08 01:19:37,941 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 01:19:37,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:19:37,941 INFO L85 PathProgramCache]: Analyzing trace with hash -1146479967, now seen corresponding path program 40 times [2025-02-08 01:19:37,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:19:37,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572909058] [2025-02-08 01:19:37,941 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 01:19:37,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:19:37,948 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 33 statements into 2 equivalence classes. [2025-02-08 01:19:37,954 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-02-08 01:19:37,954 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-08 01:19:37,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:19:38,256 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:19:38,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:19:38,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572909058] [2025-02-08 01:19:38,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572909058] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:19:38,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:19:38,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-08 01:19:38,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697783008] [2025-02-08 01:19:38,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:19:38,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-08 01:19:38,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:19:38,257 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-08 01:19:38,257 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-02-08 01:19:38,288 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 44 [2025-02-08 01:19:38,289 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 326 places, 313 transitions, 3343 flow. Second operand has 11 states, 11 states have (on average 11.636363636363637) internal successors, (128), 11 states have internal predecessors, (128), 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:19:38,289 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:19:38,289 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 44 [2025-02-08 01:19:38,289 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand