./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/parallel-misc-3-extended.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/parallel-misc-3-extended.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 8cea87724a542982ff884c708bfc22195aa1904db80300e5b965108c3d86cb2f --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 01:15:18,595 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 01:15:18,646 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:15:18,649 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 01:15:18,649 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 01:15:18,665 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 01:15:18,666 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 01:15:18,666 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 01:15:18,667 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 01:15:18,667 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 01:15:18,667 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 01:15:18,667 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 01:15:18,667 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 01:15:18,668 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 01:15:18,668 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 01:15:18,668 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 01:15:18,668 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 01:15:18,669 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 01:15:18,669 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 01:15:18,669 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 01:15:18,669 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 01:15:18,669 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 01:15:18,669 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 01:15:18,669 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 01:15:18,670 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 01:15:18,670 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 01:15:18,670 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 01:15:18,670 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 01:15:18,670 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 01:15:18,670 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 01:15:18,670 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 01:15:18,670 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 01:15:18,670 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 01:15:18,671 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 01:15:18,671 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 01:15:18,671 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 01:15:18,671 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 01:15:18,671 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 01:15:18,671 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 01:15:18,671 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 01:15:18,671 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 01:15:18,671 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 01:15:18,671 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 01:15:18,672 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 -> 8cea87724a542982ff884c708bfc22195aa1904db80300e5b965108c3d86cb2f [2025-02-08 01:15:18,901 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 01:15:18,906 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 01:15:18,908 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 01:15:18,908 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 01:15:18,909 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 01:15:18,909 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/parallel-misc-3-extended.wvr.c [2025-02-08 01:15:20,052 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1d75900ab/02361c802dc44f37a0b61eb2c8ece78f/FLAG54f434941 [2025-02-08 01:15:20,282 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 01:15:20,287 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/parallel-misc-3-extended.wvr.c [2025-02-08 01:15:20,298 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1d75900ab/02361c802dc44f37a0b61eb2c8ece78f/FLAG54f434941 [2025-02-08 01:15:20,344 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1d75900ab/02361c802dc44f37a0b61eb2c8ece78f [2025-02-08 01:15:20,347 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 01:15:20,348 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 01:15:20,351 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 01:15:20,351 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 01:15:20,354 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 01:15:20,355 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 01:15:20" (1/1) ... [2025-02-08 01:15:20,357 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a292954 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:15:20, skipping insertion in model container [2025-02-08 01:15:20,357 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 01:15:20" (1/1) ... [2025-02-08 01:15:20,367 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 01:15:20,498 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/parallel-misc-3-extended.wvr.c[2421,2434] [2025-02-08 01:15:20,502 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 01:15:20,513 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 01:15:20,532 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/parallel-misc-3-extended.wvr.c[2421,2434] [2025-02-08 01:15:20,532 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 01:15:20,543 INFO L204 MainTranslator]: Completed translation [2025-02-08 01:15:20,543 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:15:20 WrapperNode [2025-02-08 01:15:20,543 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 01:15:20,545 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 01:15:20,545 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 01:15:20,545 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 01:15:20,549 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:15:20" (1/1) ... [2025-02-08 01:15:20,559 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:15:20" (1/1) ... [2025-02-08 01:15:20,572 INFO L138 Inliner]: procedures = 19, calls = 10, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 52 [2025-02-08 01:15:20,573 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 01:15:20,574 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 01:15:20,574 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 01:15:20,574 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 01:15:20,580 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:15:20" (1/1) ... [2025-02-08 01:15:20,580 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:15:20" (1/1) ... [2025-02-08 01:15:20,583 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:15:20" (1/1) ... [2025-02-08 01:15:20,593 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-08 01:15:20,594 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:15:20" (1/1) ... [2025-02-08 01:15:20,594 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:15:20" (1/1) ... [2025-02-08 01:15:20,598 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:15:20" (1/1) ... [2025-02-08 01:15:20,599 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:15:20" (1/1) ... [2025-02-08 01:15:20,599 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:15:20" (1/1) ... [2025-02-08 01:15:20,600 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:15:20" (1/1) ... [2025-02-08 01:15:20,604 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 01:15:20,606 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 01:15:20,606 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 01:15:20,606 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 01:15:20,607 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:15:20" (1/1) ... [2025-02-08 01:15:20,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 01:15:20,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:15:20,632 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:15:20,639 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:15:20,656 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 01:15:20,656 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-08 01:15:20,656 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-08 01:15:20,656 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-08 01:15:20,656 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-08 01:15:20,656 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-02-08 01:15:20,656 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-02-08 01:15:20,656 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 01:15:20,657 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 01:15:20,657 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 01:15:20,658 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:15:20,728 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 01:15:20,730 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 01:15:20,921 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 01:15:20,922 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 01:15:21,036 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 01:15:21,037 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 01:15:21,037 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:15:21 BoogieIcfgContainer [2025-02-08 01:15:21,037 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 01:15:21,039 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 01:15:21,039 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 01:15:21,042 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 01:15:21,042 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 01:15:20" (1/3) ... [2025-02-08 01:15:21,043 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ab9f1a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 01:15:21, skipping insertion in model container [2025-02-08 01:15:21,043 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:15:20" (2/3) ... [2025-02-08 01:15:21,043 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ab9f1a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 01:15:21, skipping insertion in model container [2025-02-08 01:15:21,043 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:15:21" (3/3) ... [2025-02-08 01:15:21,044 INFO L128 eAbstractionObserver]: Analyzing ICFG parallel-misc-3-extended.wvr.c [2025-02-08 01:15:21,054 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 01:15:21,055 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG parallel-misc-3-extended.wvr.c that has 4 procedures, 37 locations, 1 initial locations, 3 loop locations, and 1 error locations. [2025-02-08 01:15:21,055 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 01:15:21,110 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-02-08 01:15:21,138 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 46 places, 42 transitions, 105 flow [2025-02-08 01:15:21,171 INFO L124 PetriNetUnfolderBase]: 6/39 cut-off events. [2025-02-08 01:15:21,173 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-02-08 01:15:21,176 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52 conditions, 39 events. 6/39 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 80 event pairs, 0 based on Foata normal form. 0/32 useless extension candidates. Maximal degree in co-relation 35. Up to 2 conditions per place. [2025-02-08 01:15:21,177 INFO L82 GeneralOperation]: Start removeDead. Operand has 46 places, 42 transitions, 105 flow [2025-02-08 01:15:21,181 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 42 places, 38 transitions, 94 flow [2025-02-08 01:15:21,191 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 01:15:21,203 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;@20500b4b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 01:15:21,203 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-02-08 01:15:21,213 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 01:15:21,213 INFO L124 PetriNetUnfolderBase]: 6/37 cut-off events. [2025-02-08 01:15:21,213 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-02-08 01:15:21,214 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:15:21,216 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:15:21,216 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:15:21,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:15:21,221 INFO L85 PathProgramCache]: Analyzing trace with hash 294504517, now seen corresponding path program 1 times [2025-02-08 01:15:21,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:15:21,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882606113] [2025-02-08 01:15:21,227 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:15:21,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:15:21,288 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-08 01:15:21,313 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-08 01:15:21,315 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:15:21,316 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:15:21,423 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:15:21,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:15:21,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882606113] [2025-02-08 01:15:21,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882606113] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:15:21,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:15:21,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 01:15:21,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294090723] [2025-02-08 01:15:21,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:15:21,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 01:15:21,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:15:21,454 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 01:15:21,454 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 01:15:21,455 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 42 [2025-02-08 01:15:21,457 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 38 transitions, 94 flow. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 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:15:21,457 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:15:21,457 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 42 [2025-02-08 01:15:21,458 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:15:21,720 INFO L124 PetriNetUnfolderBase]: 996/1607 cut-off events. [2025-02-08 01:15:21,720 INFO L125 PetriNetUnfolderBase]: For 85/85 co-relation queries the response was YES. [2025-02-08 01:15:21,726 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2944 conditions, 1607 events. 996/1607 cut-off events. For 85/85 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 8097 event pairs, 94 based on Foata normal form. 1/1450 useless extension candidates. Maximal degree in co-relation 2669. Up to 1177 conditions per place. [2025-02-08 01:15:21,735 INFO L140 encePairwiseOnDemand]: 34/42 looper letters, 32 selfloop transitions, 7 changer transitions 1/55 dead transitions. [2025-02-08 01:15:21,736 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 55 transitions, 223 flow [2025-02-08 01:15:21,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 01:15:21,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 01:15:21,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 95 transitions. [2025-02-08 01:15:21,747 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.753968253968254 [2025-02-08 01:15:21,749 INFO L175 Difference]: Start difference. First operand has 42 places, 38 transitions, 94 flow. Second operand 3 states and 95 transitions. [2025-02-08 01:15:21,750 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 55 transitions, 223 flow [2025-02-08 01:15:21,755 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 55 transitions, 201 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-02-08 01:15:21,759 INFO L231 Difference]: Finished difference. Result has 39 places, 44 transitions, 129 flow [2025-02-08 01:15:21,762 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=129, PETRI_PLACES=39, PETRI_TRANSITIONS=44} [2025-02-08 01:15:21,765 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, -3 predicate places. [2025-02-08 01:15:21,766 INFO L471 AbstractCegarLoop]: Abstraction has has 39 places, 44 transitions, 129 flow [2025-02-08 01:15:21,767 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 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:15:21,767 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:15:21,767 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] [2025-02-08 01:15:21,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 01:15:21,768 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:15:21,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:15:21,769 INFO L85 PathProgramCache]: Analyzing trace with hash 1689991743, now seen corresponding path program 1 times [2025-02-08 01:15:21,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:15:21,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380906753] [2025-02-08 01:15:21,769 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:15:21,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:15:21,781 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-08 01:15:21,804 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-08 01:15:21,805 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:15:21,805 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:15:21,894 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:15:21,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:15:21,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380906753] [2025-02-08 01:15:21,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380906753] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:15:21,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:15:21,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 01:15:21,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14200546] [2025-02-08 01:15:21,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:15:21,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 01:15:21,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:15:21,895 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 01:15:21,895 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 01:15:21,899 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 42 [2025-02-08 01:15:21,900 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 44 transitions, 129 flow. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 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:15:21,900 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:15:21,900 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 42 [2025-02-08 01:15:21,900 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:15:22,110 INFO L124 PetriNetUnfolderBase]: 1142/1797 cut-off events. [2025-02-08 01:15:22,111 INFO L125 PetriNetUnfolderBase]: For 545/545 co-relation queries the response was YES. [2025-02-08 01:15:22,116 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4023 conditions, 1797 events. 1142/1797 cut-off events. For 545/545 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 9184 event pairs, 171 based on Foata normal form. 48/1680 useless extension candidates. Maximal degree in co-relation 2810. Up to 900 conditions per place. [2025-02-08 01:15:22,127 INFO L140 encePairwiseOnDemand]: 39/42 looper letters, 43 selfloop transitions, 2 changer transitions 0/60 dead transitions. [2025-02-08 01:15:22,127 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 60 transitions, 265 flow [2025-02-08 01:15:22,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 01:15:22,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 01:15:22,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 94 transitions. [2025-02-08 01:15:22,130 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.746031746031746 [2025-02-08 01:15:22,130 INFO L175 Difference]: Start difference. First operand has 39 places, 44 transitions, 129 flow. Second operand 3 states and 94 transitions. [2025-02-08 01:15:22,130 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 60 transitions, 265 flow [2025-02-08 01:15:22,132 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 60 transitions, 256 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-02-08 01:15:22,133 INFO L231 Difference]: Finished difference. Result has 41 places, 45 transitions, 132 flow [2025-02-08 01:15:22,133 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=132, PETRI_PLACES=41, PETRI_TRANSITIONS=45} [2025-02-08 01:15:22,133 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, -1 predicate places. [2025-02-08 01:15:22,133 INFO L471 AbstractCegarLoop]: Abstraction has has 41 places, 45 transitions, 132 flow [2025-02-08 01:15:22,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 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:15:22,133 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:15:22,134 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:15:22,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 01:15:22,134 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:15:22,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:15:22,134 INFO L85 PathProgramCache]: Analyzing trace with hash 991090152, now seen corresponding path program 1 times [2025-02-08 01:15:22,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:15:22,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438892712] [2025-02-08 01:15:22,134 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:15:22,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:15:22,146 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-08 01:15:22,157 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-08 01:15:22,157 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:15:22,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:15:22,217 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:15:22,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:15:22,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438892712] [2025-02-08 01:15:22,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438892712] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:15:22,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:15:22,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 01:15:22,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971671044] [2025-02-08 01:15:22,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:15:22,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 01:15:22,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:15:22,218 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 01:15:22,218 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 01:15:22,221 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 42 [2025-02-08 01:15:22,222 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 45 transitions, 132 flow. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 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:15:22,222 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:15:22,222 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 42 [2025-02-08 01:15:22,222 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:15:22,412 INFO L124 PetriNetUnfolderBase]: 1223/1996 cut-off events. [2025-02-08 01:15:22,412 INFO L125 PetriNetUnfolderBase]: For 833/833 co-relation queries the response was YES. [2025-02-08 01:15:22,416 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4627 conditions, 1996 events. 1223/1996 cut-off events. For 833/833 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 11111 event pairs, 198 based on Foata normal form. 71/1830 useless extension candidates. Maximal degree in co-relation 2690. Up to 1041 conditions per place. [2025-02-08 01:15:22,425 INFO L140 encePairwiseOnDemand]: 39/42 looper letters, 44 selfloop transitions, 2 changer transitions 0/61 dead transitions. [2025-02-08 01:15:22,425 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 61 transitions, 277 flow [2025-02-08 01:15:22,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 01:15:22,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 01:15:22,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 93 transitions. [2025-02-08 01:15:22,426 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7380952380952381 [2025-02-08 01:15:22,426 INFO L175 Difference]: Start difference. First operand has 41 places, 45 transitions, 132 flow. Second operand 3 states and 93 transitions. [2025-02-08 01:15:22,426 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 61 transitions, 277 flow [2025-02-08 01:15:22,427 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 61 transitions, 274 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 01:15:22,427 INFO L231 Difference]: Finished difference. Result has 43 places, 46 transitions, 142 flow [2025-02-08 01:15:22,427 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=142, PETRI_PLACES=43, PETRI_TRANSITIONS=46} [2025-02-08 01:15:22,428 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 1 predicate places. [2025-02-08 01:15:22,428 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 46 transitions, 142 flow [2025-02-08 01:15:22,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 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:15:22,428 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:15:22,428 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] [2025-02-08 01:15:22,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 01:15:22,428 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:15:22,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:15:22,429 INFO L85 PathProgramCache]: Analyzing trace with hash -1922756450, now seen corresponding path program 1 times [2025-02-08 01:15:22,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:15:22,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058435566] [2025-02-08 01:15:22,429 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:15:22,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:15:22,436 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-08 01:15:22,449 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-08 01:15:22,450 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:15:22,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:15:22,563 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:15:22,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:15:22,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058435566] [2025-02-08 01:15:22,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058435566] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:15:22,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:15:22,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 01:15:22,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407365057] [2025-02-08 01:15:22,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:15:22,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 01:15:22,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:15:22,564 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 01:15:22,564 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 01:15:22,569 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 42 [2025-02-08 01:15:22,569 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 46 transitions, 142 flow. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 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:15:22,569 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:15:22,569 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 42 [2025-02-08 01:15:22,569 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:15:22,736 INFO L124 PetriNetUnfolderBase]: 1373/2164 cut-off events. [2025-02-08 01:15:22,736 INFO L125 PetriNetUnfolderBase]: For 908/908 co-relation queries the response was YES. [2025-02-08 01:15:22,741 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5321 conditions, 2164 events. 1373/2164 cut-off events. For 908/908 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 11976 event pairs, 204 based on Foata normal form. 64/2067 useless extension candidates. Maximal degree in co-relation 1998. Up to 1336 conditions per place. [2025-02-08 01:15:22,771 INFO L140 encePairwiseOnDemand]: 39/42 looper letters, 43 selfloop transitions, 2 changer transitions 0/59 dead transitions. [2025-02-08 01:15:22,771 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 59 transitions, 274 flow [2025-02-08 01:15:22,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 01:15:22,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 01:15:22,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 90 transitions. [2025-02-08 01:15:22,772 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7142857142857143 [2025-02-08 01:15:22,772 INFO L175 Difference]: Start difference. First operand has 43 places, 46 transitions, 142 flow. Second operand 3 states and 90 transitions. [2025-02-08 01:15:22,772 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 59 transitions, 274 flow [2025-02-08 01:15:22,773 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 59 transitions, 272 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 01:15:22,774 INFO L231 Difference]: Finished difference. Result has 45 places, 45 transitions, 144 flow [2025-02-08 01:15:22,774 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=144, PETRI_PLACES=45, PETRI_TRANSITIONS=45} [2025-02-08 01:15:22,774 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 3 predicate places. [2025-02-08 01:15:22,774 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 45 transitions, 144 flow [2025-02-08 01:15:22,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 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:15:22,775 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:15:22,775 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] [2025-02-08 01:15:22,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 01:15:22,775 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:15:22,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:15:22,775 INFO L85 PathProgramCache]: Analyzing trace with hash 1370217662, now seen corresponding path program 1 times [2025-02-08 01:15:22,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:15:22,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478610960] [2025-02-08 01:15:22,775 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:15:22,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:15:22,781 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-08 01:15:22,787 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-08 01:15:22,787 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:15:22,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:15:22,854 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:15:22,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:15:22,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478610960] [2025-02-08 01:15:22,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478610960] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:15:22,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:15:22,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 01:15:22,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24360050] [2025-02-08 01:15:22,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:15:22,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 01:15:22,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:15:22,855 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 01:15:22,855 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 01:15:22,858 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 42 [2025-02-08 01:15:22,858 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 45 transitions, 144 flow. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 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:15:22,858 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:15:22,859 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 42 [2025-02-08 01:15:22,859 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:15:23,069 INFO L124 PetriNetUnfolderBase]: 1328/2207 cut-off events. [2025-02-08 01:15:23,069 INFO L125 PetriNetUnfolderBase]: For 1234/1234 co-relation queries the response was YES. [2025-02-08 01:15:23,075 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5540 conditions, 2207 events. 1328/2207 cut-off events. For 1234/1234 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 12822 event pairs, 321 based on Foata normal form. 76/2085 useless extension candidates. Maximal degree in co-relation 2076. Up to 986 conditions per place. [2025-02-08 01:15:23,088 INFO L140 encePairwiseOnDemand]: 39/42 looper letters, 44 selfloop transitions, 2 changer transitions 0/61 dead transitions. [2025-02-08 01:15:23,088 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 61 transitions, 297 flow [2025-02-08 01:15:23,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 01:15:23,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 01:15:23,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 92 transitions. [2025-02-08 01:15:23,089 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7301587301587301 [2025-02-08 01:15:23,090 INFO L175 Difference]: Start difference. First operand has 45 places, 45 transitions, 144 flow. Second operand 3 states and 92 transitions. [2025-02-08 01:15:23,090 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 61 transitions, 297 flow [2025-02-08 01:15:23,091 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 61 transitions, 291 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 01:15:23,092 INFO L231 Difference]: Finished difference. Result has 46 places, 46 transitions, 152 flow [2025-02-08 01:15:23,092 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=152, PETRI_PLACES=46, PETRI_TRANSITIONS=46} [2025-02-08 01:15:23,092 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 4 predicate places. [2025-02-08 01:15:23,092 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 46 transitions, 152 flow [2025-02-08 01:15:23,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 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:15:23,093 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:15:23,093 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:15:23,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 01:15:23,093 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:15:23,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:15:23,094 INFO L85 PathProgramCache]: Analyzing trace with hash 45520110, now seen corresponding path program 1 times [2025-02-08 01:15:23,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:15:23,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637036280] [2025-02-08 01:15:23,094 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:15:23,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:15:23,103 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-08 01:15:23,118 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-08 01:15:23,118 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:15:23,119 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:15:23,308 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:15:23,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:15:23,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637036280] [2025-02-08 01:15:23,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637036280] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:15:23,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:15:23,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 01:15:23,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528626941] [2025-02-08 01:15:23,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:15:23,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 01:15:23,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:15:23,310 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 01:15:23,311 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 01:15:23,317 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 42 [2025-02-08 01:15:23,318 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 46 transitions, 152 flow. Second operand has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 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:15:23,318 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:15:23,318 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 42 [2025-02-08 01:15:23,318 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:15:23,626 INFO L124 PetriNetUnfolderBase]: 2703/4126 cut-off events. [2025-02-08 01:15:23,626 INFO L125 PetriNetUnfolderBase]: For 1919/2007 co-relation queries the response was YES. [2025-02-08 01:15:23,633 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10788 conditions, 4126 events. 2703/4126 cut-off events. For 1919/2007 co-relation queries the response was YES. Maximal size of possible extension queue 179. Compared 22841 event pairs, 492 based on Foata normal form. 64/3944 useless extension candidates. Maximal degree in co-relation 4834. Up to 1613 conditions per place. [2025-02-08 01:15:23,652 INFO L140 encePairwiseOnDemand]: 37/42 looper letters, 64 selfloop transitions, 5 changer transitions 0/82 dead transitions. [2025-02-08 01:15:23,652 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 82 transitions, 416 flow [2025-02-08 01:15:23,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 01:15:23,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 01:15:23,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 124 transitions. [2025-02-08 01:15:23,653 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7380952380952381 [2025-02-08 01:15:23,653 INFO L175 Difference]: Start difference. First operand has 46 places, 46 transitions, 152 flow. Second operand 4 states and 124 transitions. [2025-02-08 01:15:23,653 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 82 transitions, 416 flow [2025-02-08 01:15:23,655 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 82 transitions, 412 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 01:15:23,655 INFO L231 Difference]: Finished difference. Result has 50 places, 48 transitions, 182 flow [2025-02-08 01:15:23,655 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=182, PETRI_PLACES=50, PETRI_TRANSITIONS=48} [2025-02-08 01:15:23,656 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 8 predicate places. [2025-02-08 01:15:23,656 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 48 transitions, 182 flow [2025-02-08 01:15:23,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 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:15:23,656 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:15:23,656 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:15:23,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 01:15:23,659 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:15:23,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:15:23,659 INFO L85 PathProgramCache]: Analyzing trace with hash -615856146, now seen corresponding path program 1 times [2025-02-08 01:15:23,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:15:23,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87074706] [2025-02-08 01:15:23,660 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:15:23,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:15:23,668 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-02-08 01:15:23,691 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-02-08 01:15:23,692 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:15:23,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:15:23,861 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:15:23,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:15:23,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87074706] [2025-02-08 01:15:23,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87074706] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:15:23,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:15:23,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 01:15:23,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40154252] [2025-02-08 01:15:23,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:15:23,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 01:15:23,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:15:23,863 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 01:15:23,863 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 01:15:23,867 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 42 [2025-02-08 01:15:23,867 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 48 transitions, 182 flow. Second operand has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 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:15:23,867 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:15:23,867 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 42 [2025-02-08 01:15:23,868 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:15:24,292 INFO L124 PetriNetUnfolderBase]: 4428/6355 cut-off events. [2025-02-08 01:15:24,292 INFO L125 PetriNetUnfolderBase]: For 5698/6308 co-relation queries the response was YES. [2025-02-08 01:15:24,301 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18474 conditions, 6355 events. 4428/6355 cut-off events. For 5698/6308 co-relation queries the response was YES. Maximal size of possible extension queue 265. Compared 35725 event pairs, 1044 based on Foata normal form. 270/6391 useless extension candidates. Maximal degree in co-relation 10191. Up to 2411 conditions per place. [2025-02-08 01:15:24,325 INFO L140 encePairwiseOnDemand]: 38/42 looper letters, 68 selfloop transitions, 5 changer transitions 0/87 dead transitions. [2025-02-08 01:15:24,325 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 87 transitions, 498 flow [2025-02-08 01:15:24,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 01:15:24,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 01:15:24,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 121 transitions. [2025-02-08 01:15:24,326 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7202380952380952 [2025-02-08 01:15:24,326 INFO L175 Difference]: Start difference. First operand has 50 places, 48 transitions, 182 flow. Second operand 4 states and 121 transitions. [2025-02-08 01:15:24,326 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 87 transitions, 498 flow [2025-02-08 01:15:24,328 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 87 transitions, 492 flow, removed 3 selfloop flow, removed 0 redundant places. [2025-02-08 01:15:24,329 INFO L231 Difference]: Finished difference. Result has 54 places, 51 transitions, 210 flow [2025-02-08 01:15:24,331 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=210, PETRI_PLACES=54, PETRI_TRANSITIONS=51} [2025-02-08 01:15:24,332 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 12 predicate places. [2025-02-08 01:15:24,332 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 51 transitions, 210 flow [2025-02-08 01:15:24,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 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:15:24,332 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:15:24,332 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:15:24,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 01:15:24,332 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:15:24,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:15:24,333 INFO L85 PathProgramCache]: Analyzing trace with hash 1728765306, now seen corresponding path program 1 times [2025-02-08 01:15:24,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:15:24,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198486876] [2025-02-08 01:15:24,333 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:15:24,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:15:24,339 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-02-08 01:15:24,351 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-02-08 01:15:24,351 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:15:24,351 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:15:24,495 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-02-08 01:15:24,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:15:24,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198486876] [2025-02-08 01:15:24,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198486876] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:15:24,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:15:24,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 01:15:24,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200994969] [2025-02-08 01:15:24,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:15:24,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 01:15:24,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:15:24,497 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 01:15:24,497 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 01:15:24,502 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 42 [2025-02-08 01:15:24,502 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 51 transitions, 210 flow. Second operand has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 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:15:24,502 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:15:24,502 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 42 [2025-02-08 01:15:24,503 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:15:25,179 INFO L124 PetriNetUnfolderBase]: 6271/9089 cut-off events. [2025-02-08 01:15:25,179 INFO L125 PetriNetUnfolderBase]: For 11801/12773 co-relation queries the response was YES. [2025-02-08 01:15:25,191 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27744 conditions, 9089 events. 6271/9089 cut-off events. For 11801/12773 co-relation queries the response was YES. Maximal size of possible extension queue 373. Compared 54922 event pairs, 1732 based on Foata normal form. 571/9207 useless extension candidates. Maximal degree in co-relation 15841. Up to 3291 conditions per place. [2025-02-08 01:15:25,222 INFO L140 encePairwiseOnDemand]: 37/42 looper letters, 71 selfloop transitions, 5 changer transitions 0/91 dead transitions. [2025-02-08 01:15:25,222 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 91 transitions, 562 flow [2025-02-08 01:15:25,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 01:15:25,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 01:15:25,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 120 transitions. [2025-02-08 01:15:25,224 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7142857142857143 [2025-02-08 01:15:25,224 INFO L175 Difference]: Start difference. First operand has 54 places, 51 transitions, 210 flow. Second operand 4 states and 120 transitions. [2025-02-08 01:15:25,224 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 91 transitions, 562 flow [2025-02-08 01:15:25,228 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 91 transitions, 556 flow, removed 3 selfloop flow, removed 0 redundant places. [2025-02-08 01:15:25,230 INFO L231 Difference]: Finished difference. Result has 59 places, 53 transitions, 240 flow [2025-02-08 01:15:25,231 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=204, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=240, PETRI_PLACES=59, PETRI_TRANSITIONS=53} [2025-02-08 01:15:25,231 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 17 predicate places. [2025-02-08 01:15:25,233 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 53 transitions, 240 flow [2025-02-08 01:15:25,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 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:15:25,233 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:15:25,233 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:15:25,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 01:15:25,234 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:15:25,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:15:25,234 INFO L85 PathProgramCache]: Analyzing trace with hash 229312332, now seen corresponding path program 1 times [2025-02-08 01:15:25,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:15:25,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104266083] [2025-02-08 01:15:25,234 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:15:25,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:15:25,241 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-02-08 01:15:25,257 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-02-08 01:15:25,259 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:15:25,259 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:15:25,404 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 01:15:25,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:15:25,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104266083] [2025-02-08 01:15:25,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104266083] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 01:15:25,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [284228652] [2025-02-08 01:15:25,405 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:15:25,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:15:25,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:15:25,408 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 01:15:25,410 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-08 01:15:25,451 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-02-08 01:15:25,472 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-02-08 01:15:25,473 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:15:25,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:15:25,475 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-02-08 01:15:25,478 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 01:15:25,562 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 01:15:25,562 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 01:15:25,625 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 01:15:25,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [284228652] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 01:15:25,625 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 01:15:25,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 4 [2025-02-08 01:15:25,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223458182] [2025-02-08 01:15:25,625 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 01:15:25,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 01:15:25,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:15:25,626 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 01:15:25,626 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 01:15:25,626 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 42 [2025-02-08 01:15:25,626 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 53 transitions, 240 flow. Second operand has 5 states, 5 states have (on average 23.2) internal successors, (116), 5 states have internal predecessors, (116), 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:15:25,626 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:15:25,626 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 42 [2025-02-08 01:15:25,626 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:15:27,259 INFO L124 PetriNetUnfolderBase]: 13709/22568 cut-off events. [2025-02-08 01:15:27,259 INFO L125 PetriNetUnfolderBase]: For 30961/32804 co-relation queries the response was YES. [2025-02-08 01:15:27,332 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69436 conditions, 22568 events. 13709/22568 cut-off events. For 30961/32804 co-relation queries the response was YES. Maximal size of possible extension queue 615. Compared 162170 event pairs, 2553 based on Foata normal form. 878/23146 useless extension candidates. Maximal degree in co-relation 17380. Up to 8575 conditions per place. [2025-02-08 01:15:27,444 INFO L140 encePairwiseOnDemand]: 34/42 looper letters, 99 selfloop transitions, 22 changer transitions 1/140 dead transitions. [2025-02-08 01:15:27,444 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 140 transitions, 907 flow [2025-02-08 01:15:27,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 01:15:27,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 01:15:27,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 176 transitions. [2025-02-08 01:15:27,445 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8380952380952381 [2025-02-08 01:15:27,445 INFO L175 Difference]: Start difference. First operand has 59 places, 53 transitions, 240 flow. Second operand 5 states and 176 transitions. [2025-02-08 01:15:27,445 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 140 transitions, 907 flow [2025-02-08 01:15:27,454 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 140 transitions, 899 flow, removed 4 selfloop flow, removed 0 redundant places. [2025-02-08 01:15:27,456 INFO L231 Difference]: Finished difference. Result has 64 places, 71 transitions, 381 flow [2025-02-08 01:15:27,456 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=238, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=381, PETRI_PLACES=64, PETRI_TRANSITIONS=71} [2025-02-08 01:15:27,457 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 22 predicate places. [2025-02-08 01:15:27,457 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 71 transitions, 381 flow [2025-02-08 01:15:27,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.2) internal successors, (116), 5 states have internal predecessors, (116), 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:15:27,457 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:15:27,457 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:15:27,467 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-08 01:15:27,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:15:27,663 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:15:27,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:15:27,663 INFO L85 PathProgramCache]: Analyzing trace with hash 1025567126, now seen corresponding path program 2 times [2025-02-08 01:15:27,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:15:27,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370269670] [2025-02-08 01:15:27,664 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 01:15:27,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:15:27,673 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 44 statements into 2 equivalence classes. [2025-02-08 01:15:27,700 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 44 of 44 statements. [2025-02-08 01:15:27,700 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 01:15:27,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:15:27,827 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:15:27,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:15:27,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370269670] [2025-02-08 01:15:27,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370269670] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 01:15:27,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2142906] [2025-02-08 01:15:27,828 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 01:15:27,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:15:27,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:15:27,830 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 01:15:27,831 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-08 01:15:27,871 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 44 statements into 2 equivalence classes. [2025-02-08 01:15:27,975 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 44 of 44 statements. [2025-02-08 01:15:27,975 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 01:15:27,975 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:15:27,976 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-02-08 01:15:27,980 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 01:15:28,042 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:15:28,042 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 01:15:28,096 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:15:28,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2142906] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 01:15:28,097 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 01:15:28,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 5 [2025-02-08 01:15:28,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934227331] [2025-02-08 01:15:28,097 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 01:15:28,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 01:15:28,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:15:28,098 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 01:15:28,098 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 01:15:28,098 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 42 [2025-02-08 01:15:28,098 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 71 transitions, 381 flow. Second operand has 6 states, 6 states have (on average 22.333333333333332) internal successors, (134), 6 states have internal predecessors, (134), 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:15:28,098 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:15:28,098 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 42 [2025-02-08 01:15:28,098 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:15:31,129 INFO L124 PetriNetUnfolderBase]: 25739/42357 cut-off events. [2025-02-08 01:15:31,129 INFO L125 PetriNetUnfolderBase]: For 77446/81090 co-relation queries the response was YES. [2025-02-08 01:15:31,279 INFO L83 FinitePrefix]: Finished finitePrefix Result has 145233 conditions, 42357 events. 25739/42357 cut-off events. For 77446/81090 co-relation queries the response was YES. Maximal size of possible extension queue 1286. Compared 339011 event pairs, 3099 based on Foata normal form. 1762/43575 useless extension candidates. Maximal degree in co-relation 36369. Up to 14115 conditions per place. [2025-02-08 01:15:31,616 INFO L140 encePairwiseOnDemand]: 34/42 looper letters, 123 selfloop transitions, 46 changer transitions 1/188 dead transitions. [2025-02-08 01:15:31,616 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 188 transitions, 1337 flow [2025-02-08 01:15:31,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 01:15:31,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 01:15:31,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 215 transitions. [2025-02-08 01:15:31,617 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8531746031746031 [2025-02-08 01:15:31,617 INFO L175 Difference]: Start difference. First operand has 64 places, 71 transitions, 381 flow. Second operand 6 states and 215 transitions. [2025-02-08 01:15:31,617 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 188 transitions, 1337 flow [2025-02-08 01:15:31,642 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 188 transitions, 1253 flow, removed 42 selfloop flow, removed 0 redundant places. [2025-02-08 01:15:31,644 INFO L231 Difference]: Finished difference. Result has 70 places, 95 transitions, 569 flow [2025-02-08 01:15:31,644 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=345, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=569, PETRI_PLACES=70, PETRI_TRANSITIONS=95} [2025-02-08 01:15:31,645 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 28 predicate places. [2025-02-08 01:15:31,645 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 95 transitions, 569 flow [2025-02-08 01:15:31,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.333333333333332) internal successors, (134), 6 states have internal predecessors, (134), 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:15:31,645 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:15:31,645 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:15:31,651 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-08 01:15:31,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:15:31,846 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:15:31,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:15:31,846 INFO L85 PathProgramCache]: Analyzing trace with hash 987352908, now seen corresponding path program 3 times [2025-02-08 01:15:31,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:15:31,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912497856] [2025-02-08 01:15:31,847 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 01:15:31,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:15:31,854 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 44 statements into 2 equivalence classes. [2025-02-08 01:15:31,881 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 44 of 44 statements. [2025-02-08 01:15:31,882 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-02-08 01:15:31,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:15:32,004 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:15:32,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:15:32,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912497856] [2025-02-08 01:15:32,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1912497856] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 01:15:32,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [35218850] [2025-02-08 01:15:32,004 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 01:15:32,004 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:15:32,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:15:32,007 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 01:15:32,009 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-08 01:15:32,044 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 44 statements into 2 equivalence classes. [2025-02-08 01:15:32,063 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 44 of 44 statements. [2025-02-08 01:15:32,063 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-02-08 01:15:32,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:15:32,066 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-02-08 01:15:32,067 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 01:15:32,118 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:15:32,118 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 01:15:32,162 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:15:32,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [35218850] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 01:15:32,162 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 01:15:32,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 6 [2025-02-08 01:15:32,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962009944] [2025-02-08 01:15:32,162 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 01:15:32,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 01:15:32,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:15:32,162 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 01:15:32,163 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-08 01:15:32,163 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 42 [2025-02-08 01:15:32,163 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 95 transitions, 569 flow. Second operand has 7 states, 7 states have (on average 21.714285714285715) internal successors, (152), 7 states have internal predecessors, (152), 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:15:32,163 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:15:32,163 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 42 [2025-02-08 01:15:32,163 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:15:37,242 INFO L124 PetriNetUnfolderBase]: 41804/69041 cut-off events. [2025-02-08 01:15:37,242 INFO L125 PetriNetUnfolderBase]: For 134012/139815 co-relation queries the response was YES. [2025-02-08 01:15:37,485 INFO L83 FinitePrefix]: Finished finitePrefix Result has 239718 conditions, 69041 events. 41804/69041 cut-off events. For 134012/139815 co-relation queries the response was YES. Maximal size of possible extension queue 2260. Compared 596583 event pairs, 4295 based on Foata normal form. 2872/70887 useless extension candidates. Maximal degree in co-relation 63486. Up to 20701 conditions per place. [2025-02-08 01:15:37,744 INFO L140 encePairwiseOnDemand]: 34/42 looper letters, 146 selfloop transitions, 76 changer transitions 1/241 dead transitions. [2025-02-08 01:15:37,745 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 241 transitions, 1790 flow [2025-02-08 01:15:37,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 01:15:37,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-08 01:15:37,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 254 transitions. [2025-02-08 01:15:37,746 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8639455782312925 [2025-02-08 01:15:37,746 INFO L175 Difference]: Start difference. First operand has 70 places, 95 transitions, 569 flow. Second operand 7 states and 254 transitions. [2025-02-08 01:15:37,746 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 241 transitions, 1790 flow [2025-02-08 01:15:37,804 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 241 transitions, 1683 flow, removed 47 selfloop flow, removed 1 redundant places. [2025-02-08 01:15:37,806 INFO L231 Difference]: Finished difference. Result has 76 places, 125 transitions, 847 flow [2025-02-08 01:15:37,806 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=530, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=847, PETRI_PLACES=76, PETRI_TRANSITIONS=125} [2025-02-08 01:15:37,806 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 34 predicate places. [2025-02-08 01:15:37,806 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 125 transitions, 847 flow [2025-02-08 01:15:37,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.714285714285715) internal successors, (152), 7 states have internal predecessors, (152), 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:15:37,806 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:15:37,806 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:15:37,812 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-08 01:15:38,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:15:38,007 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:15:38,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:15:38,008 INFO L85 PathProgramCache]: Analyzing trace with hash 1230344730, now seen corresponding path program 4 times [2025-02-08 01:15:38,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:15:38,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912251842] [2025-02-08 01:15:38,008 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 01:15:38,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:15:38,017 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 44 statements into 2 equivalence classes. [2025-02-08 01:15:38,026 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 44 of 44 statements. [2025-02-08 01:15:38,026 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-08 01:15:38,026 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:15:38,118 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:15:38,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:15:38,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912251842] [2025-02-08 01:15:38,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912251842] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 01:15:38,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [76583777] [2025-02-08 01:15:38,119 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 01:15:38,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:15:38,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:15:38,121 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 01:15:38,122 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-08 01:15:38,153 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 44 statements into 2 equivalence classes. [2025-02-08 01:15:38,170 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 44 of 44 statements. [2025-02-08 01:15:38,170 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-08 01:15:38,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:15:38,171 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-02-08 01:15:38,173 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 01:15:38,219 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:15:38,219 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 01:15:38,274 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:15:38,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [76583777] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 01:15:38,274 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 01:15:38,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 5 [2025-02-08 01:15:38,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121463183] [2025-02-08 01:15:38,274 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 01:15:38,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 01:15:38,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:15:38,275 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 01:15:38,275 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 01:15:38,275 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 42 [2025-02-08 01:15:38,275 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 125 transitions, 847 flow. Second operand has 6 states, 6 states have (on average 22.333333333333332) internal successors, (134), 6 states have internal predecessors, (134), 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:15:38,275 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:15:38,275 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 42 [2025-02-08 01:15:38,275 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:15:45,352 INFO L124 PetriNetUnfolderBase]: 53504/87439 cut-off events. [2025-02-08 01:15:45,352 INFO L125 PetriNetUnfolderBase]: For 207994/215159 co-relation queries the response was YES. [2025-02-08 01:15:45,676 INFO L83 FinitePrefix]: Finished finitePrefix Result has 320274 conditions, 87439 events. 53504/87439 cut-off events. For 207994/215159 co-relation queries the response was YES. Maximal size of possible extension queue 2784. Compared 773598 event pairs, 11051 based on Foata normal form. 3466/89070 useless extension candidates. Maximal degree in co-relation 95414. Up to 58694 conditions per place. [2025-02-08 01:15:46,143 INFO L140 encePairwiseOnDemand]: 34/42 looper letters, 185 selfloop transitions, 54 changer transitions 1/258 dead transitions. [2025-02-08 01:15:46,143 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 258 transitions, 2128 flow [2025-02-08 01:15:46,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 01:15:46,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 01:15:46,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 211 transitions. [2025-02-08 01:15:46,144 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8373015873015873 [2025-02-08 01:15:46,144 INFO L175 Difference]: Start difference. First operand has 76 places, 125 transitions, 847 flow. Second operand 6 states and 211 transitions. [2025-02-08 01:15:46,144 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 258 transitions, 2128 flow [2025-02-08 01:15:46,242 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 258 transitions, 2014 flow, removed 40 selfloop flow, removed 1 redundant places. [2025-02-08 01:15:46,245 INFO L231 Difference]: Finished difference. Result has 83 places, 175 transitions, 1352 flow [2025-02-08 01:15:46,245 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=799, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1352, PETRI_PLACES=83, PETRI_TRANSITIONS=175} [2025-02-08 01:15:46,245 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 41 predicate places. [2025-02-08 01:15:46,245 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 175 transitions, 1352 flow [2025-02-08 01:15:46,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.333333333333332) internal successors, (134), 6 states have internal predecessors, (134), 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:15:46,245 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:15:46,246 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:15:46,251 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-08 01:15:46,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-02-08 01:15:46,450 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:15:46,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:15:46,450 INFO L85 PathProgramCache]: Analyzing trace with hash -1789339216, now seen corresponding path program 5 times [2025-02-08 01:15:46,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:15:46,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253346455] [2025-02-08 01:15:46,450 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-08 01:15:46,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:15:46,456 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 44 statements into 3 equivalence classes. [2025-02-08 01:15:46,468 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 44 of 44 statements. [2025-02-08 01:15:46,469 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-02-08 01:15:46,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:15:46,576 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:15:46,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:15:46,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253346455] [2025-02-08 01:15:46,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253346455] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 01:15:46,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [744082266] [2025-02-08 01:15:46,577 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-08 01:15:46,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:15:46,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:15:46,579 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 01:15:46,580 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-08 01:15:46,614 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 44 statements into 3 equivalence classes. [2025-02-08 01:15:46,632 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 44 of 44 statements. [2025-02-08 01:15:46,632 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-02-08 01:15:46,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:15:46,633 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-02-08 01:15:46,634 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 01:15:46,735 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:15:46,735 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 01:15:46,782 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:15:46,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [744082266] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 01:15:46,783 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 01:15:46,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 7 [2025-02-08 01:15:46,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460572282] [2025-02-08 01:15:46,783 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 01:15:46,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 01:15:46,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:15:46,784 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 01:15:46,784 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-08 01:15:46,784 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 42 [2025-02-08 01:15:46,784 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 175 transitions, 1352 flow. Second operand has 8 states, 8 states have (on average 21.25) internal successors, (170), 8 states have internal predecessors, (170), 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:15:46,784 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:15:46,784 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 42 [2025-02-08 01:15:46,784 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:15:56,618 INFO L124 PetriNetUnfolderBase]: 72115/118458 cut-off events. [2025-02-08 01:15:56,618 INFO L125 PetriNetUnfolderBase]: For 291538/301854 co-relation queries the response was YES. [2025-02-08 01:15:57,072 INFO L83 FinitePrefix]: Finished finitePrefix Result has 433815 conditions, 118458 events. 72115/118458 cut-off events. For 291538/301854 co-relation queries the response was YES. Maximal size of possible extension queue 4178. Compared 1096521 event pairs, 6960 based on Foata normal form. 5043/121517 useless extension candidates. Maximal degree in co-relation 145648. Up to 23338 conditions per place. [2025-02-08 01:15:57,519 INFO L140 encePairwiseOnDemand]: 34/42 looper letters, 170 selfloop transitions, 162 changer transitions 1/351 dead transitions. [2025-02-08 01:15:57,520 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 351 transitions, 2954 flow [2025-02-08 01:15:57,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 01:15:57,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-08 01:15:57,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 293 transitions. [2025-02-08 01:15:57,521 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8720238095238095 [2025-02-08 01:15:57,521 INFO L175 Difference]: Start difference. First operand has 83 places, 175 transitions, 1352 flow. Second operand 8 states and 293 transitions. [2025-02-08 01:15:57,521 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 351 transitions, 2954 flow [2025-02-08 01:15:57,682 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 351 transitions, 2942 flow, removed 6 selfloop flow, removed 0 redundant places. [2025-02-08 01:15:57,685 INFO L231 Difference]: Finished difference. Result has 91 places, 211 transitions, 1953 flow [2025-02-08 01:15:57,686 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1340, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=175, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=132, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1953, PETRI_PLACES=91, PETRI_TRANSITIONS=211} [2025-02-08 01:15:57,686 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 49 predicate places. [2025-02-08 01:15:57,686 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 211 transitions, 1953 flow [2025-02-08 01:15:57,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 21.25) internal successors, (170), 8 states have internal predecessors, (170), 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:15:57,686 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:15:57,687 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:15:57,692 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-08 01:15:57,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-02-08 01:15:57,891 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:15:57,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:15:57,891 INFO L85 PathProgramCache]: Analyzing trace with hash 157416422, now seen corresponding path program 6 times [2025-02-08 01:15:57,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:15:57,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772095473] [2025-02-08 01:15:57,891 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-08 01:15:57,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:15:57,897 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 48 statements into 2 equivalence classes. [2025-02-08 01:15:57,914 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 44 of 48 statements. [2025-02-08 01:15:57,915 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-02-08 01:15:57,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:15:58,288 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:15:58,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:15:58,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772095473] [2025-02-08 01:15:58,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772095473] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:15:58,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:15:58,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 01:15:58,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441181034] [2025-02-08 01:15:58,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:15:58,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 01:15:58,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:15:58,290 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 01:15:58,290 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2025-02-08 01:15:58,296 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 42 [2025-02-08 01:15:58,296 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 211 transitions, 1953 flow. Second operand has 8 states, 8 states have (on average 19.25) internal successors, (154), 8 states have internal predecessors, (154), 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:15:58,296 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:15:58,296 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 42 [2025-02-08 01:15:58,296 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand