./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/chl-array-int-trans.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f8ab0bd5 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/chl-array-int-trans.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 5bb11505151393f96d52a572beff0352326876d897656a8082ae272a8f39e0b4 --- Real Ultimate output --- This is Ultimate 0.3.0-?-f8ab0bd-m [2025-03-13 21:41:50,818 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-13 21:41:50,870 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-13 21:41:50,875 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-13 21:41:50,875 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-13 21:41:50,888 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-13 21:41:50,888 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-13 21:41:50,888 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-13 21:41:50,889 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-13 21:41:50,889 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-13 21:41:50,889 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-13 21:41:50,889 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-13 21:41:50,889 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-13 21:41:50,889 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-13 21:41:50,889 INFO L153 SettingsManager]: * Use SBE=true [2025-03-13 21:41:50,889 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-13 21:41:50,889 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-13 21:41:50,889 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-13 21:41:50,890 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-13 21:41:50,890 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-13 21:41:50,890 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-13 21:41:50,890 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-13 21:41:50,890 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-13 21:41:50,890 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-13 21:41:50,890 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-13 21:41:50,890 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-13 21:41:50,890 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-13 21:41:50,890 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-13 21:41:50,890 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-13 21:41:50,891 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-13 21:41:50,891 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-13 21:41:50,891 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-13 21:41:50,891 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 21:41:50,891 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-13 21:41:50,891 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-13 21:41:50,891 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-13 21:41:50,891 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-13 21:41:50,891 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-13 21:41:50,891 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-13 21:41:50,891 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-13 21:41:50,891 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-13 21:41:50,891 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-13 21:41:50,892 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-13 21:41:50,892 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/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 -> 5bb11505151393f96d52a572beff0352326876d897656a8082ae272a8f39e0b4 [2025-03-13 21:41:51,088 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-13 21:41:51,095 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-13 21:41:51,097 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-13 21:41:51,097 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-13 21:41:51,097 INFO L274 PluginConnector]: CDTParser initialized [2025-03-13 21:41:51,098 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-array-int-trans.wvr.c [2025-03-13 21:41:52,187 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a2f549da5/3dd6e7cd9c534ee2b2a47f490f8b3618/FLAG4f2f14888 [2025-03-13 21:41:52,399 INFO L384 CDTParser]: Found 1 translation units. [2025-03-13 21:41:52,399 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-array-int-trans.wvr.c [2025-03-13 21:41:52,405 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a2f549da5/3dd6e7cd9c534ee2b2a47f490f8b3618/FLAG4f2f14888 [2025-03-13 21:41:52,753 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a2f549da5/3dd6e7cd9c534ee2b2a47f490f8b3618 [2025-03-13 21:41:52,754 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-13 21:41:52,755 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-13 21:41:52,756 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-13 21:41:52,756 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-13 21:41:52,759 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-13 21:41:52,759 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 09:41:52" (1/1) ... [2025-03-13 21:41:52,760 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@497ec798 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:41:52, skipping insertion in model container [2025-03-13 21:41:52,760 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 09:41:52" (1/1) ... [2025-03-13 21:41:52,769 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-13 21:41:52,893 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-array-int-trans.wvr.c[2767,2780] [2025-03-13 21:41:52,902 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 21:41:52,911 INFO L200 MainTranslator]: Completed pre-run [2025-03-13 21:41:52,930 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-array-int-trans.wvr.c[2767,2780] [2025-03-13 21:41:52,936 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 21:41:52,953 INFO L204 MainTranslator]: Completed translation [2025-03-13 21:41:52,953 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:41:52 WrapperNode [2025-03-13 21:41:52,954 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-13 21:41:52,954 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-13 21:41:52,954 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-13 21:41:52,954 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-13 21:41:52,959 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:41:52" (1/1) ... [2025-03-13 21:41:52,965 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:41:52" (1/1) ... [2025-03-13 21:41:52,991 INFO L138 Inliner]: procedures = 25, calls = 34, calls flagged for inlining = 13, calls inlined = 21, statements flattened = 252 [2025-03-13 21:41:52,992 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-13 21:41:52,993 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-13 21:41:52,993 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-13 21:41:52,993 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-13 21:41:52,999 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:41:52" (1/1) ... [2025-03-13 21:41:52,999 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:41:52" (1/1) ... [2025-03-13 21:41:53,001 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:41:52" (1/1) ... [2025-03-13 21:41:53,013 INFO L175 MemorySlicer]: Split 17 memory accesses to 2 slices as follows [2, 15]. 88 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 3 writes are split as follows [0, 3]. [2025-03-13 21:41:53,013 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:41:52" (1/1) ... [2025-03-13 21:41:53,013 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:41:52" (1/1) ... [2025-03-13 21:41:53,019 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:41:52" (1/1) ... [2025-03-13 21:41:53,021 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:41:52" (1/1) ... [2025-03-13 21:41:53,022 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:41:52" (1/1) ... [2025-03-13 21:41:53,022 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:41:52" (1/1) ... [2025-03-13 21:41:53,024 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-13 21:41:53,025 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-13 21:41:53,025 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-13 21:41:53,025 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-13 21:41:53,025 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:41:52" (1/1) ... [2025-03-13 21:41:53,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 21:41:53,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:41:53,050 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-13 21:41:53,052 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-13 21:41:53,068 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-13 21:41:53,068 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-13 21:41:53,068 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-13 21:41:53,068 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-13 21:41:53,068 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-13 21:41:53,068 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-13 21:41:53,068 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-13 21:41:53,068 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-13 21:41:53,068 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-13 21:41:53,068 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-13 21:41:53,068 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-13 21:41:53,068 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-13 21:41:53,068 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-13 21:41:53,069 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-13 21:41:53,069 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-13 21:41:53,069 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-13 21:41:53,069 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-13 21:41:53,146 INFO L256 CfgBuilder]: Building ICFG [2025-03-13 21:41:53,147 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-13 21:41:53,444 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-13 21:41:53,445 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-13 21:41:53,445 INFO L318 CfgBuilder]: Performing block encoding [2025-03-13 21:41:53,701 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-13 21:41:53,702 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 09:41:53 BoogieIcfgContainer [2025-03-13 21:41:53,702 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-13 21:41:53,703 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-13 21:41:53,703 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-13 21:41:53,708 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-13 21:41:53,708 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.03 09:41:52" (1/3) ... [2025-03-13 21:41:53,709 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63c2d41e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 09:41:53, skipping insertion in model container [2025-03-13 21:41:53,709 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:41:52" (2/3) ... [2025-03-13 21:41:53,709 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63c2d41e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 09:41:53, skipping insertion in model container [2025-03-13 21:41:53,709 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 09:41:53" (3/3) ... [2025-03-13 21:41:53,710 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-array-int-trans.wvr.c [2025-03-13 21:41:53,721 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-13 21:41:53,722 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-array-int-trans.wvr.c that has 4 procedures, 32 locations, 1 initial locations, 6 loop locations, and 1 error locations. [2025-03-13 21:41:53,722 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-13 21:41:53,773 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-13 21:41:53,794 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 40 transitions, 101 flow [2025-03-13 21:41:53,817 INFO L124 PetriNetUnfolderBase]: 9/37 cut-off events. [2025-03-13 21:41:53,818 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-13 21:41:53,820 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50 conditions, 37 events. 9/37 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 41 event pairs, 0 based on Foata normal form. 0/27 useless extension candidates. Maximal degree in co-relation 27. Up to 2 conditions per place. [2025-03-13 21:41:53,820 INFO L82 GeneralOperation]: Start removeDead. Operand has 41 places, 40 transitions, 101 flow [2025-03-13 21:41:53,822 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 37 places, 36 transitions, 90 flow [2025-03-13 21:41:53,827 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 21:41:53,835 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@60474e50, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 21:41:53,835 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-03-13 21:41:53,847 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 21:41:53,847 INFO L124 PetriNetUnfolderBase]: 9/35 cut-off events. [2025-03-13 21:41:53,847 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-13 21:41:53,847 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:41:53,848 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:41:53,849 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-03-13 21:41:53,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:41:53,853 INFO L85 PathProgramCache]: Analyzing trace with hash 2005823603, now seen corresponding path program 1 times [2025-03-13 21:41:53,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:41:53,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005268200] [2025-03-13 21:41:53,858 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:41:53,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:41:53,914 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-13 21:41:53,962 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-13 21:41:53,962 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:41:53,962 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:41:54,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:41:54,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:41:54,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005268200] [2025-03-13 21:41:54,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005268200] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:41:54,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:41:54,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-13 21:41:54,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105207899] [2025-03-13 21:41:54,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:41:54,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-13 21:41:54,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:41:54,367 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-13 21:41:54,368 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-13 21:41:54,408 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2025-03-13 21:41:54,410 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 36 transitions, 90 flow. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 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-03-13 21:41:54,410 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:41:54,411 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2025-03-13 21:41:54,411 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:41:54,947 INFO L124 PetriNetUnfolderBase]: 2301/3277 cut-off events. [2025-03-13 21:41:54,947 INFO L125 PetriNetUnfolderBase]: For 245/245 co-relation queries the response was YES. [2025-03-13 21:41:54,952 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6645 conditions, 3277 events. 2301/3277 cut-off events. For 245/245 co-relation queries the response was YES. Maximal size of possible extension queue 193. Compared 15363 event pairs, 362 based on Foata normal form. 1/2793 useless extension candidates. Maximal degree in co-relation 4067. Up to 1121 conditions per place. [2025-03-13 21:41:54,963 INFO L140 encePairwiseOnDemand]: 31/40 looper letters, 109 selfloop transitions, 13 changer transitions 2/128 dead transitions. [2025-03-13 21:41:54,964 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 128 transitions, 576 flow [2025-03-13 21:41:54,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-13 21:41:54,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-13 21:41:54,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 188 transitions. [2025-03-13 21:41:54,972 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5222222222222223 [2025-03-13 21:41:54,972 INFO L175 Difference]: Start difference. First operand has 37 places, 36 transitions, 90 flow. Second operand 9 states and 188 transitions. [2025-03-13 21:41:54,973 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 128 transitions, 576 flow [2025-03-13 21:41:54,977 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 128 transitions, 528 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-13 21:41:54,981 INFO L231 Difference]: Finished difference. Result has 42 places, 49 transitions, 156 flow [2025-03-13 21:41:54,982 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=156, PETRI_PLACES=42, PETRI_TRANSITIONS=49} [2025-03-13 21:41:54,984 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 5 predicate places. [2025-03-13 21:41:54,986 INFO L471 AbstractCegarLoop]: Abstraction has has 42 places, 49 transitions, 156 flow [2025-03-13 21:41:54,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 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-03-13 21:41:54,986 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:41:54,986 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:41:54,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-13 21:41:54,987 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-03-13 21:41:54,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:41:54,987 INFO L85 PathProgramCache]: Analyzing trace with hash 908609337, now seen corresponding path program 2 times [2025-03-13 21:41:54,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:41:54,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138365001] [2025-03-13 21:41:54,987 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:41:54,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:41:55,001 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 1 equivalence classes. [2025-03-13 21:41:55,011 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-13 21:41:55,011 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-13 21:41:55,012 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:41:55,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:41:55,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:41:55,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138365001] [2025-03-13 21:41:55,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138365001] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:41:55,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:41:55,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-13 21:41:55,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618060886] [2025-03-13 21:41:55,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:41:55,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-13 21:41:55,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:41:55,177 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-13 21:41:55,177 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-13 21:41:55,206 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2025-03-13 21:41:55,207 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 49 transitions, 156 flow. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 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-03-13 21:41:55,207 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:41:55,207 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2025-03-13 21:41:55,207 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:41:55,722 INFO L124 PetriNetUnfolderBase]: 2505/3630 cut-off events. [2025-03-13 21:41:55,722 INFO L125 PetriNetUnfolderBase]: For 507/507 co-relation queries the response was YES. [2025-03-13 21:41:55,725 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7872 conditions, 3630 events. 2505/3630 cut-off events. For 507/507 co-relation queries the response was YES. Maximal size of possible extension queue 211. Compared 18015 event pairs, 392 based on Foata normal form. 1/3469 useless extension candidates. Maximal degree in co-relation 5317. Up to 1093 conditions per place. [2025-03-13 21:41:55,734 INFO L140 encePairwiseOnDemand]: 28/40 looper letters, 111 selfloop transitions, 19 changer transitions 2/136 dead transitions. [2025-03-13 21:41:55,734 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 136 transitions, 628 flow [2025-03-13 21:41:55,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-13 21:41:55,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-13 21:41:55,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 208 transitions. [2025-03-13 21:41:55,736 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4727272727272727 [2025-03-13 21:41:55,736 INFO L175 Difference]: Start difference. First operand has 42 places, 49 transitions, 156 flow. Second operand 11 states and 208 transitions. [2025-03-13 21:41:55,736 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 136 transitions, 628 flow [2025-03-13 21:41:55,738 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 136 transitions, 626 flow, removed 1 selfloop flow, removed 0 redundant places. [2025-03-13 21:41:55,739 INFO L231 Difference]: Finished difference. Result has 56 places, 57 transitions, 250 flow [2025-03-13 21:41:55,739 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=250, PETRI_PLACES=56, PETRI_TRANSITIONS=57} [2025-03-13 21:41:55,739 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 19 predicate places. [2025-03-13 21:41:55,740 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 57 transitions, 250 flow [2025-03-13 21:41:55,740 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 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-03-13 21:41:55,740 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:41:55,740 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:41:55,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-13 21:41:55,740 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-03-13 21:41:55,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:41:55,741 INFO L85 PathProgramCache]: Analyzing trace with hash -1883219618, now seen corresponding path program 1 times [2025-03-13 21:41:55,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:41:55,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117252678] [2025-03-13 21:41:55,741 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:41:55,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:41:55,749 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-13 21:41:55,758 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-13 21:41:55,758 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:41:55,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:41:55,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:41:55,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:41:55,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117252678] [2025-03-13 21:41:55,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117252678] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:41:55,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:41:55,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 21:41:55,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148718829] [2025-03-13 21:41:55,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:41:55,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-13 21:41:55,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:41:55,847 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-13 21:41:55,847 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-13 21:41:55,855 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2025-03-13 21:41:55,855 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 57 transitions, 250 flow. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 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-03-13 21:41:55,855 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:41:55,855 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2025-03-13 21:41:55,855 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:41:56,216 INFO L124 PetriNetUnfolderBase]: 3522/5296 cut-off events. [2025-03-13 21:41:56,216 INFO L125 PetriNetUnfolderBase]: For 2642/2642 co-relation queries the response was YES. [2025-03-13 21:41:56,223 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12252 conditions, 5296 events. 3522/5296 cut-off events. For 2642/2642 co-relation queries the response was YES. Maximal size of possible extension queue 313. Compared 29435 event pairs, 1596 based on Foata normal form. 188/5216 useless extension candidates. Maximal degree in co-relation 8726. Up to 3233 conditions per place. [2025-03-13 21:41:56,238 INFO L140 encePairwiseOnDemand]: 35/40 looper letters, 88 selfloop transitions, 12 changer transitions 0/104 dead transitions. [2025-03-13 21:41:56,238 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 104 transitions, 621 flow [2025-03-13 21:41:56,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-13 21:41:56,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-13 21:41:56,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 106 transitions. [2025-03-13 21:41:56,240 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.53 [2025-03-13 21:41:56,240 INFO L175 Difference]: Start difference. First operand has 56 places, 57 transitions, 250 flow. Second operand 5 states and 106 transitions. [2025-03-13 21:41:56,240 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 104 transitions, 621 flow [2025-03-13 21:41:56,248 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 104 transitions, 596 flow, removed 4 selfloop flow, removed 4 redundant places. [2025-03-13 21:41:56,250 INFO L231 Difference]: Finished difference. Result has 59 places, 64 transitions, 326 flow [2025-03-13 21:41:56,250 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=231, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=326, PETRI_PLACES=59, PETRI_TRANSITIONS=64} [2025-03-13 21:41:56,251 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 22 predicate places. [2025-03-13 21:41:56,252 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 64 transitions, 326 flow [2025-03-13 21:41:56,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 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-03-13 21:41:56,252 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:41:56,252 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:41:56,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-13 21:41:56,253 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-03-13 21:41:56,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:41:56,253 INFO L85 PathProgramCache]: Analyzing trace with hash 1187041256, now seen corresponding path program 1 times [2025-03-13 21:41:56,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:41:56,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657212402] [2025-03-13 21:41:56,253 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:41:56,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:41:56,261 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-13 21:41:56,270 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-13 21:41:56,272 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:41:56,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:41:56,411 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:41:56,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:41:56,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657212402] [2025-03-13 21:41:56,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657212402] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:41:56,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1042619121] [2025-03-13 21:41:56,411 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:41:56,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:41:56,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:41:56,413 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 21:41:56,415 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-13 21:41:56,467 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-13 21:41:56,489 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-13 21:41:56,489 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:41:56,489 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:41:56,491 INFO L256 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-13 21:41:56,494 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:41:56,591 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:41:56,591 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:41:56,666 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:41:56,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1042619121] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-13 21:41:56,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-13 21:41:56,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7, 6] total 12 [2025-03-13 21:41:56,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970599344] [2025-03-13 21:41:56,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:41:56,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-13 21:41:56,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:41:56,668 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-13 21:41:56,669 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2025-03-13 21:41:56,690 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2025-03-13 21:41:56,690 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 64 transitions, 326 flow. Second operand has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 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-03-13 21:41:56,691 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:41:56,691 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2025-03-13 21:41:56,691 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:41:57,158 INFO L124 PetriNetUnfolderBase]: 3538/5280 cut-off events. [2025-03-13 21:41:57,158 INFO L125 PetriNetUnfolderBase]: For 3824/3824 co-relation queries the response was YES. [2025-03-13 21:41:57,164 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12835 conditions, 5280 events. 3538/5280 cut-off events. For 3824/3824 co-relation queries the response was YES. Maximal size of possible extension queue 309. Compared 28874 event pairs, 2040 based on Foata normal form. 1/5006 useless extension candidates. Maximal degree in co-relation 9325. Up to 3110 conditions per place. [2025-03-13 21:41:57,179 INFO L140 encePairwiseOnDemand]: 31/40 looper letters, 110 selfloop transitions, 8 changer transitions 2/124 dead transitions. [2025-03-13 21:41:57,180 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 124 transitions, 752 flow [2025-03-13 21:41:57,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-13 21:41:57,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-13 21:41:57,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 149 transitions. [2025-03-13 21:41:57,181 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5321428571428571 [2025-03-13 21:41:57,183 INFO L175 Difference]: Start difference. First operand has 59 places, 64 transitions, 326 flow. Second operand 7 states and 149 transitions. [2025-03-13 21:41:57,183 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 124 transitions, 752 flow [2025-03-13 21:41:57,186 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 124 transitions, 737 flow, removed 5 selfloop flow, removed 1 redundant places. [2025-03-13 21:41:57,188 INFO L231 Difference]: Finished difference. Result has 66 places, 66 transitions, 346 flow [2025-03-13 21:41:57,188 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=315, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=346, PETRI_PLACES=66, PETRI_TRANSITIONS=66} [2025-03-13 21:41:57,189 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 29 predicate places. [2025-03-13 21:41:57,189 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 66 transitions, 346 flow [2025-03-13 21:41:57,189 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 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-03-13 21:41:57,190 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:41:57,190 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:41:57,196 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-13 21:41:57,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:41:57,390 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-03-13 21:41:57,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:41:57,391 INFO L85 PathProgramCache]: Analyzing trace with hash 2104972634, now seen corresponding path program 1 times [2025-03-13 21:41:57,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:41:57,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692013125] [2025-03-13 21:41:57,391 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:41:57,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:41:57,397 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-13 21:41:57,402 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-13 21:41:57,402 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:41:57,402 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:41:57,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:41:57,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:41:57,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692013125] [2025-03-13 21:41:57,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692013125] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:41:57,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:41:57,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-13 21:41:57,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127137752] [2025-03-13 21:41:57,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:41:57,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-13 21:41:57,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:41:57,481 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-13 21:41:57,481 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-13 21:41:57,487 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2025-03-13 21:41:57,487 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 66 transitions, 346 flow. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 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-03-13 21:41:57,487 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:41:57,487 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2025-03-13 21:41:57,487 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:41:57,753 INFO L124 PetriNetUnfolderBase]: 2447/3767 cut-off events. [2025-03-13 21:41:57,753 INFO L125 PetriNetUnfolderBase]: For 2979/2979 co-relation queries the response was YES. [2025-03-13 21:41:57,759 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9431 conditions, 3767 events. 2447/3767 cut-off events. For 2979/2979 co-relation queries the response was YES. Maximal size of possible extension queue 251. Compared 20890 event pairs, 1094 based on Foata normal form. 172/3932 useless extension candidates. Maximal degree in co-relation 7253. Up to 1885 conditions per place. [2025-03-13 21:41:57,768 INFO L140 encePairwiseOnDemand]: 35/40 looper letters, 83 selfloop transitions, 6 changer transitions 3/96 dead transitions. [2025-03-13 21:41:57,769 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 96 transitions, 594 flow [2025-03-13 21:41:57,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-13 21:41:57,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-13 21:41:57,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 111 transitions. [2025-03-13 21:41:57,770 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.555 [2025-03-13 21:41:57,770 INFO L175 Difference]: Start difference. First operand has 66 places, 66 transitions, 346 flow. Second operand 5 states and 111 transitions. [2025-03-13 21:41:57,770 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 96 transitions, 594 flow [2025-03-13 21:41:57,774 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 96 transitions, 555 flow, removed 5 selfloop flow, removed 7 redundant places. [2025-03-13 21:41:57,775 INFO L231 Difference]: Finished difference. Result has 64 places, 58 transitions, 259 flow [2025-03-13 21:41:57,776 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=269, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=259, PETRI_PLACES=64, PETRI_TRANSITIONS=58} [2025-03-13 21:41:57,776 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 27 predicate places. [2025-03-13 21:41:57,776 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 58 transitions, 259 flow [2025-03-13 21:41:57,776 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 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-03-13 21:41:57,776 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:41:57,777 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] [2025-03-13 21:41:57,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-13 21:41:57,777 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-03-13 21:41:57,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:41:57,777 INFO L85 PathProgramCache]: Analyzing trace with hash 1601438273, now seen corresponding path program 1 times [2025-03-13 21:41:57,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:41:57,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686422606] [2025-03-13 21:41:57,778 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:41:57,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:41:57,785 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-13 21:41:57,793 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-13 21:41:57,795 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:41:57,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:41:57,934 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 21:41:57,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:41:57,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686422606] [2025-03-13 21:41:57,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686422606] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:41:57,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [798672667] [2025-03-13 21:41:57,935 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:41:57,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:41:57,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:41:57,936 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 21:41:57,937 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-13 21:41:57,990 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-13 21:41:58,012 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-13 21:41:58,012 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:41:58,012 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:41:58,013 INFO L256 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-13 21:41:58,015 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:41:58,101 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 21:41:58,101 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:41:58,188 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 21:41:58,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [798672667] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-13 21:41:58,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-13 21:41:58,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7, 6] total 16 [2025-03-13 21:41:58,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443099623] [2025-03-13 21:41:58,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:41:58,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 21:41:58,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:41:58,189 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 21:41:58,190 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2025-03-13 21:41:58,204 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2025-03-13 21:41:58,205 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 58 transitions, 259 flow. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 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-03-13 21:41:58,205 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:41:58,205 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2025-03-13 21:41:58,205 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:41:58,668 INFO L124 PetriNetUnfolderBase]: 4295/6534 cut-off events. [2025-03-13 21:41:58,668 INFO L125 PetriNetUnfolderBase]: For 4757/4757 co-relation queries the response was YES. [2025-03-13 21:41:58,675 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16014 conditions, 6534 events. 4295/6534 cut-off events. For 4757/4757 co-relation queries the response was YES. Maximal size of possible extension queue 401. Compared 38982 event pairs, 1121 based on Foata normal form. 1/6325 useless extension candidates. Maximal degree in co-relation 14187. Up to 2496 conditions per place. [2025-03-13 21:41:58,687 INFO L140 encePairwiseOnDemand]: 31/40 looper letters, 140 selfloop transitions, 22 changer transitions 3/169 dead transitions. [2025-03-13 21:41:58,687 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 169 transitions, 985 flow [2025-03-13 21:41:58,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-13 21:41:58,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-13 21:41:58,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 187 transitions. [2025-03-13 21:41:58,688 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.584375 [2025-03-13 21:41:58,688 INFO L175 Difference]: Start difference. First operand has 64 places, 58 transitions, 259 flow. Second operand 8 states and 187 transitions. [2025-03-13 21:41:58,689 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 169 transitions, 985 flow [2025-03-13 21:41:58,696 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 169 transitions, 965 flow, removed 4 selfloop flow, removed 3 redundant places. [2025-03-13 21:41:58,698 INFO L231 Difference]: Finished difference. Result has 72 places, 73 transitions, 434 flow [2025-03-13 21:41:58,698 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=246, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=434, PETRI_PLACES=72, PETRI_TRANSITIONS=73} [2025-03-13 21:41:58,699 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 35 predicate places. [2025-03-13 21:41:58,699 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 73 transitions, 434 flow [2025-03-13 21:41:58,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 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-03-13 21:41:58,699 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:41:58,699 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] [2025-03-13 21:41:58,706 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-13 21:41:58,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-03-13 21:41:58,900 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-03-13 21:41:58,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:41:58,901 INFO L85 PathProgramCache]: Analyzing trace with hash 239382805, now seen corresponding path program 1 times [2025-03-13 21:41:58,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:41:58,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287371740] [2025-03-13 21:41:58,901 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:41:58,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:41:58,910 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-13 21:41:58,918 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-13 21:41:58,918 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:41:58,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:41:59,012 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 21:41:59,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:41:59,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287371740] [2025-03-13 21:41:59,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287371740] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:41:59,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:41:59,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-13 21:41:59,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190049224] [2025-03-13 21:41:59,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:41:59,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-13 21:41:59,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:41:59,013 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-13 21:41:59,013 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-13 21:41:59,038 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2025-03-13 21:41:59,038 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 73 transitions, 434 flow. Second operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 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-03-13 21:41:59,038 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:41:59,038 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2025-03-13 21:41:59,038 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:41:59,828 INFO L124 PetriNetUnfolderBase]: 7812/11862 cut-off events. [2025-03-13 21:41:59,829 INFO L125 PetriNetUnfolderBase]: For 9255/9255 co-relation queries the response was YES. [2025-03-13 21:41:59,845 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30028 conditions, 11862 events. 7812/11862 cut-off events. For 9255/9255 co-relation queries the response was YES. Maximal size of possible extension queue 778. Compared 77139 event pairs, 1747 based on Foata normal form. 2/11486 useless extension candidates. Maximal degree in co-relation 26189. Up to 2890 conditions per place. [2025-03-13 21:41:59,870 INFO L140 encePairwiseOnDemand]: 29/40 looper letters, 186 selfloop transitions, 30 changer transitions 12/232 dead transitions. [2025-03-13 21:41:59,871 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 232 transitions, 1672 flow [2025-03-13 21:41:59,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-13 21:41:59,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-13 21:41:59,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 216 transitions. [2025-03-13 21:41:59,872 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.54 [2025-03-13 21:41:59,872 INFO L175 Difference]: Start difference. First operand has 72 places, 73 transitions, 434 flow. Second operand 10 states and 216 transitions. [2025-03-13 21:41:59,872 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 232 transitions, 1672 flow [2025-03-13 21:41:59,888 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 232 transitions, 1663 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-03-13 21:41:59,890 INFO L231 Difference]: Finished difference. Result has 86 places, 94 transitions, 732 flow [2025-03-13 21:41:59,890 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=425, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=732, PETRI_PLACES=86, PETRI_TRANSITIONS=94} [2025-03-13 21:41:59,890 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 49 predicate places. [2025-03-13 21:41:59,891 INFO L471 AbstractCegarLoop]: Abstraction has has 86 places, 94 transitions, 732 flow [2025-03-13 21:41:59,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 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-03-13 21:41:59,891 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:41:59,891 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] [2025-03-13 21:41:59,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-13 21:41:59,891 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-03-13 21:41:59,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:41:59,892 INFO L85 PathProgramCache]: Analyzing trace with hash -261526367, now seen corresponding path program 2 times [2025-03-13 21:41:59,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:41:59,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875864556] [2025-03-13 21:41:59,892 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:41:59,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:41:59,903 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-03-13 21:41:59,909 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 25 of 26 statements. [2025-03-13 21:41:59,910 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-13 21:41:59,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:42:00,018 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 21:42:00,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:42:00,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875864556] [2025-03-13 21:42:00,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875864556] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:42:00,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:42:00,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-13 21:42:00,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124197056] [2025-03-13 21:42:00,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:42:00,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-13 21:42:00,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:42:00,020 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-13 21:42:00,020 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-13 21:42:00,043 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2025-03-13 21:42:00,044 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 94 transitions, 732 flow. Second operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 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-03-13 21:42:00,044 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:42:00,044 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2025-03-13 21:42:00,044 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:42:01,031 INFO L124 PetriNetUnfolderBase]: 9390/14128 cut-off events. [2025-03-13 21:42:01,031 INFO L125 PetriNetUnfolderBase]: For 18244/18244 co-relation queries the response was YES. [2025-03-13 21:42:01,055 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39844 conditions, 14128 events. 9390/14128 cut-off events. For 18244/18244 co-relation queries the response was YES. Maximal size of possible extension queue 953. Compared 94152 event pairs, 2880 based on Foata normal form. 2/13683 useless extension candidates. Maximal degree in co-relation 34079. Up to 5044 conditions per place. [2025-03-13 21:42:01,083 INFO L140 encePairwiseOnDemand]: 29/40 looper letters, 140 selfloop transitions, 50 changer transitions 13/207 dead transitions. [2025-03-13 21:42:01,083 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 207 transitions, 1678 flow [2025-03-13 21:42:01,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-13 21:42:01,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-13 21:42:01,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 194 transitions. [2025-03-13 21:42:01,084 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5388888888888889 [2025-03-13 21:42:01,084 INFO L175 Difference]: Start difference. First operand has 86 places, 94 transitions, 732 flow. Second operand 9 states and 194 transitions. [2025-03-13 21:42:01,084 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 207 transitions, 1678 flow [2025-03-13 21:42:01,129 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 207 transitions, 1645 flow, removed 12 selfloop flow, removed 2 redundant places. [2025-03-13 21:42:01,131 INFO L231 Difference]: Finished difference. Result has 96 places, 109 transitions, 1029 flow [2025-03-13 21:42:01,131 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=703, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1029, PETRI_PLACES=96, PETRI_TRANSITIONS=109} [2025-03-13 21:42:01,132 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 59 predicate places. [2025-03-13 21:42:01,132 INFO L471 AbstractCegarLoop]: Abstraction has has 96 places, 109 transitions, 1029 flow [2025-03-13 21:42:01,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 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-03-13 21:42:01,132 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:42:01,132 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] [2025-03-13 21:42:01,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-13 21:42:01,133 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-03-13 21:42:01,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:42:01,133 INFO L85 PathProgramCache]: Analyzing trace with hash 1409981037, now seen corresponding path program 1 times [2025-03-13 21:42:01,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:42:01,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028651243] [2025-03-13 21:42:01,133 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:42:01,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:42:01,139 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-13 21:42:01,144 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-13 21:42:01,144 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:42:01,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:42:01,238 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 21:42:01,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:42:01,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028651243] [2025-03-13 21:42:01,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028651243] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:42:01,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:42:01,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-13 21:42:01,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919271164] [2025-03-13 21:42:01,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:42:01,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-13 21:42:01,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:42:01,239 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-13 21:42:01,240 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-13 21:42:01,260 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2025-03-13 21:42:01,260 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 109 transitions, 1029 flow. Second operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 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-03-13 21:42:01,260 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:42:01,261 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2025-03-13 21:42:01,261 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:42:02,574 INFO L124 PetriNetUnfolderBase]: 10880/16549 cut-off events. [2025-03-13 21:42:02,574 INFO L125 PetriNetUnfolderBase]: For 29122/29122 co-relation queries the response was YES. [2025-03-13 21:42:02,614 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49125 conditions, 16549 events. 10880/16549 cut-off events. For 29122/29122 co-relation queries the response was YES. Maximal size of possible extension queue 1096. Compared 115887 event pairs, 3927 based on Foata normal form. 8/16145 useless extension candidates. Maximal degree in co-relation 44729. Up to 7663 conditions per place. [2025-03-13 21:42:02,647 INFO L140 encePairwiseOnDemand]: 29/40 looper letters, 131 selfloop transitions, 9 changer transitions 84/228 dead transitions. [2025-03-13 21:42:02,647 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 228 transitions, 2162 flow [2025-03-13 21:42:02,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-13 21:42:02,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-13 21:42:02,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 188 transitions. [2025-03-13 21:42:02,649 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5222222222222223 [2025-03-13 21:42:02,649 INFO L175 Difference]: Start difference. First operand has 96 places, 109 transitions, 1029 flow. Second operand 9 states and 188 transitions. [2025-03-13 21:42:02,649 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 228 transitions, 2162 flow [2025-03-13 21:42:02,759 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 228 transitions, 2063 flow, removed 31 selfloop flow, removed 5 redundant places. [2025-03-13 21:42:02,760 INFO L231 Difference]: Finished difference. Result has 102 places, 97 transitions, 817 flow [2025-03-13 21:42:02,761 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=948, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=817, PETRI_PLACES=102, PETRI_TRANSITIONS=97} [2025-03-13 21:42:02,761 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 65 predicate places. [2025-03-13 21:42:02,761 INFO L471 AbstractCegarLoop]: Abstraction has has 102 places, 97 transitions, 817 flow [2025-03-13 21:42:02,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 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-03-13 21:42:02,761 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:42:02,761 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] [2025-03-13 21:42:02,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-13 21:42:02,762 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-03-13 21:42:02,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:42:02,762 INFO L85 PathProgramCache]: Analyzing trace with hash -1750826491, now seen corresponding path program 2 times [2025-03-13 21:42:02,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:42:02,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172058506] [2025-03-13 21:42:02,762 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:42:02,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:42:02,768 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-03-13 21:42:02,772 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 25 of 26 statements. [2025-03-13 21:42:02,772 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-13 21:42:02,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:42:02,945 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 21:42:02,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:42:02,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172058506] [2025-03-13 21:42:02,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172058506] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:42:02,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:42:02,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-13 21:42:02,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301992542] [2025-03-13 21:42:02,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:42:02,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-13 21:42:02,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:42:02,947 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-13 21:42:02,947 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-13 21:42:02,983 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2025-03-13 21:42:02,983 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 97 transitions, 817 flow. Second operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 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-03-13 21:42:02,983 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:42:02,983 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2025-03-13 21:42:02,983 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:42:04,130 INFO L124 PetriNetUnfolderBase]: 12094/18263 cut-off events. [2025-03-13 21:42:04,130 INFO L125 PetriNetUnfolderBase]: For 33518/33518 co-relation queries the response was YES. [2025-03-13 21:42:04,176 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56647 conditions, 18263 events. 12094/18263 cut-off events. For 33518/33518 co-relation queries the response was YES. Maximal size of possible extension queue 1209. Compared 128143 event pairs, 4642 based on Foata normal form. 8/17838 useless extension candidates. Maximal degree in co-relation 56453. Up to 7660 conditions per place. [2025-03-13 21:42:04,206 INFO L140 encePairwiseOnDemand]: 32/40 looper letters, 160 selfloop transitions, 9 changer transitions 69/242 dead transitions. [2025-03-13 21:42:04,206 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 242 transitions, 2281 flow [2025-03-13 21:42:04,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-13 21:42:04,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-13 21:42:04,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 181 transitions. [2025-03-13 21:42:04,207 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.565625 [2025-03-13 21:42:04,207 INFO L175 Difference]: Start difference. First operand has 102 places, 97 transitions, 817 flow. Second operand 8 states and 181 transitions. [2025-03-13 21:42:04,207 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 242 transitions, 2281 flow [2025-03-13 21:42:04,312 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 242 transitions, 2198 flow, removed 32 selfloop flow, removed 8 redundant places. [2025-03-13 21:42:04,313 INFO L231 Difference]: Finished difference. Result has 101 places, 99 transitions, 822 flow [2025-03-13 21:42:04,313 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=777, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=822, PETRI_PLACES=101, PETRI_TRANSITIONS=99} [2025-03-13 21:42:04,314 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 64 predicate places. [2025-03-13 21:42:04,314 INFO L471 AbstractCegarLoop]: Abstraction has has 101 places, 99 transitions, 822 flow [2025-03-13 21:42:04,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 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-03-13 21:42:04,314 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:42:04,314 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] [2025-03-13 21:42:04,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-13 21:42:04,314 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-03-13 21:42:04,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:42:04,315 INFO L85 PathProgramCache]: Analyzing trace with hash -1636684527, now seen corresponding path program 3 times [2025-03-13 21:42:04,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:42:04,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651551865] [2025-03-13 21:42:04,315 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-13 21:42:04,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:42:04,321 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 2 equivalence classes. [2025-03-13 21:42:04,326 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 25 of 26 statements. [2025-03-13 21:42:04,326 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-13 21:42:04,326 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:42:04,482 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 21:42:04,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:42:04,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651551865] [2025-03-13 21:42:04,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651551865] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:42:04,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:42:04,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-13 21:42:04,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217716596] [2025-03-13 21:42:04,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:42:04,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-13 21:42:04,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:42:04,484 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-13 21:42:04,484 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-13 21:42:04,506 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2025-03-13 21:42:04,507 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 99 transitions, 822 flow. Second operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 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-03-13 21:42:04,507 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:42:04,507 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2025-03-13 21:42:04,507 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:42:05,736 INFO L124 PetriNetUnfolderBase]: 11210/16994 cut-off events. [2025-03-13 21:42:05,736 INFO L125 PetriNetUnfolderBase]: For 31232/31232 co-relation queries the response was YES. [2025-03-13 21:42:05,784 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53332 conditions, 16994 events. 11210/16994 cut-off events. For 31232/31232 co-relation queries the response was YES. Maximal size of possible extension queue 1136. Compared 118407 event pairs, 4923 based on Foata normal form. 8/16593 useless extension candidates. Maximal degree in co-relation 53193. Up to 7660 conditions per place. [2025-03-13 21:42:05,816 INFO L140 encePairwiseOnDemand]: 32/40 looper letters, 130 selfloop transitions, 8 changer transitions 87/229 dead transitions. [2025-03-13 21:42:05,816 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 229 transitions, 2112 flow [2025-03-13 21:42:05,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-13 21:42:05,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-13 21:42:05,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 176 transitions. [2025-03-13 21:42:05,817 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.55 [2025-03-13 21:42:05,817 INFO L175 Difference]: Start difference. First operand has 101 places, 99 transitions, 822 flow. Second operand 8 states and 176 transitions. [2025-03-13 21:42:05,817 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 229 transitions, 2112 flow [2025-03-13 21:42:05,948 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 229 transitions, 2082 flow, removed 9 selfloop flow, removed 5 redundant places. [2025-03-13 21:42:05,950 INFO L231 Difference]: Finished difference. Result has 105 places, 99 transitions, 832 flow [2025-03-13 21:42:05,950 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=803, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=832, PETRI_PLACES=105, PETRI_TRANSITIONS=99} [2025-03-13 21:42:05,951 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 68 predicate places. [2025-03-13 21:42:05,951 INFO L471 AbstractCegarLoop]: Abstraction has has 105 places, 99 transitions, 832 flow [2025-03-13 21:42:05,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 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-03-13 21:42:05,951 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:42:05,951 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] [2025-03-13 21:42:05,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-13 21:42:05,951 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-03-13 21:42:05,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:42:05,951 INFO L85 PathProgramCache]: Analyzing trace with hash 1586830989, now seen corresponding path program 3 times [2025-03-13 21:42:05,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:42:05,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642010742] [2025-03-13 21:42:05,951 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-13 21:42:05,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:42:05,958 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 2 equivalence classes. [2025-03-13 21:42:05,964 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 25 of 26 statements. [2025-03-13 21:42:05,965 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-13 21:42:05,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:42:06,060 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 21:42:06,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:42:06,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642010742] [2025-03-13 21:42:06,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642010742] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:42:06,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:42:06,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-13 21:42:06,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990904518] [2025-03-13 21:42:06,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:42:06,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-13 21:42:06,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:42:06,061 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-13 21:42:06,062 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-13 21:42:06,089 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2025-03-13 21:42:06,089 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 99 transitions, 832 flow. Second operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 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-03-13 21:42:06,089 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:42:06,089 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2025-03-13 21:42:06,090 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:42:07,242 INFO L124 PetriNetUnfolderBase]: 8165/12340 cut-off events. [2025-03-13 21:42:07,242 INFO L125 PetriNetUnfolderBase]: For 22422/22422 co-relation queries the response was YES. [2025-03-13 21:42:07,275 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37917 conditions, 12340 events. 8165/12340 cut-off events. For 22422/22422 co-relation queries the response was YES. Maximal size of possible extension queue 795. Compared 80278 event pairs, 2703 based on Foata normal form. 2/11936 useless extension candidates. Maximal degree in co-relation 37796. Up to 3555 conditions per place. [2025-03-13 21:42:07,305 INFO L140 encePairwiseOnDemand]: 29/40 looper letters, 165 selfloop transitions, 33 changer transitions 19/221 dead transitions. [2025-03-13 21:42:07,305 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 221 transitions, 1977 flow [2025-03-13 21:42:07,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-13 21:42:07,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-13 21:42:07,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 197 transitions. [2025-03-13 21:42:07,306 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5472222222222223 [2025-03-13 21:42:07,306 INFO L175 Difference]: Start difference. First operand has 105 places, 99 transitions, 832 flow. Second operand 9 states and 197 transitions. [2025-03-13 21:42:07,306 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 221 transitions, 1977 flow [2025-03-13 21:42:07,362 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 221 transitions, 1925 flow, removed 12 selfloop flow, removed 7 redundant places. [2025-03-13 21:42:07,364 INFO L231 Difference]: Finished difference. Result has 107 places, 109 transitions, 1059 flow [2025-03-13 21:42:07,364 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=810, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1059, PETRI_PLACES=107, PETRI_TRANSITIONS=109} [2025-03-13 21:42:07,364 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 70 predicate places. [2025-03-13 21:42:07,364 INFO L471 AbstractCegarLoop]: Abstraction has has 107 places, 109 transitions, 1059 flow [2025-03-13 21:42:07,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 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-03-13 21:42:07,365 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:42:07,365 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-03-13 21:42:07,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-13 21:42:07,365 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-03-13 21:42:07,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:42:07,365 INFO L85 PathProgramCache]: Analyzing trace with hash -1287944002, now seen corresponding path program 1 times [2025-03-13 21:42:07,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:42:07,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725393406] [2025-03-13 21:42:07,366 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:42:07,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:42:07,373 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-13 21:42:07,378 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-13 21:42:07,378 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:42:07,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:42:07,431 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-13 21:42:07,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:42:07,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725393406] [2025-03-13 21:42:07,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725393406] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:42:07,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:42:07,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 21:42:07,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807551232] [2025-03-13 21:42:07,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:42:07,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-13 21:42:07,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:42:07,433 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-13 21:42:07,433 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-13 21:42:07,440 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2025-03-13 21:42:07,440 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 109 transitions, 1059 flow. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:42:07,440 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:42:07,440 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2025-03-13 21:42:07,440 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:42:07,895 INFO L124 PetriNetUnfolderBase]: 3646/5708 cut-off events. [2025-03-13 21:42:07,896 INFO L125 PetriNetUnfolderBase]: For 9964/9964 co-relation queries the response was YES. [2025-03-13 21:42:07,908 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16132 conditions, 5708 events. 3646/5708 cut-off events. For 9964/9964 co-relation queries the response was YES. Maximal size of possible extension queue 383. Compared 34763 event pairs, 1585 based on Foata normal form. 322/5801 useless extension candidates. Maximal degree in co-relation 15191. Up to 2779 conditions per place. [2025-03-13 21:42:07,915 INFO L140 encePairwiseOnDemand]: 34/40 looper letters, 49 selfloop transitions, 4 changer transitions 59/116 dead transitions. [2025-03-13 21:42:07,915 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 116 transitions, 982 flow [2025-03-13 21:42:07,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 21:42:07,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 21:42:07,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 115 transitions. [2025-03-13 21:42:07,917 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4791666666666667 [2025-03-13 21:42:07,917 INFO L175 Difference]: Start difference. First operand has 107 places, 109 transitions, 1059 flow. Second operand 6 states and 115 transitions. [2025-03-13 21:42:07,917 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 116 transitions, 982 flow [2025-03-13 21:42:07,935 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 116 transitions, 904 flow, removed 22 selfloop flow, removed 8 redundant places. [2025-03-13 21:42:07,936 INFO L231 Difference]: Finished difference. Result has 103 places, 57 transitions, 293 flow [2025-03-13 21:42:07,936 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=576, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=293, PETRI_PLACES=103, PETRI_TRANSITIONS=57} [2025-03-13 21:42:07,937 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 66 predicate places. [2025-03-13 21:42:07,937 INFO L471 AbstractCegarLoop]: Abstraction has has 103 places, 57 transitions, 293 flow [2025-03-13 21:42:07,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:42:07,938 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:42:07,938 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-03-13 21:42:07,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-13 21:42:07,939 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-03-13 21:42:07,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:42:07,940 INFO L85 PathProgramCache]: Analyzing trace with hash 1061742652, now seen corresponding path program 1 times [2025-03-13 21:42:07,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:42:07,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423539940] [2025-03-13 21:42:07,940 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:42:07,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:42:07,949 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-13 21:42:07,955 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-13 21:42:07,955 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:42:07,955 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:42:07,999 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-13 21:42:08,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:42:08,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423539940] [2025-03-13 21:42:08,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423539940] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:42:08,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:42:08,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 21:42:08,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59420946] [2025-03-13 21:42:08,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:42:08,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-13 21:42:08,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:42:08,002 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-13 21:42:08,002 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-13 21:42:08,013 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2025-03-13 21:42:08,013 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 57 transitions, 293 flow. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 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-03-13 21:42:08,013 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:42:08,013 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2025-03-13 21:42:08,013 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:42:08,346 INFO L124 PetriNetUnfolderBase]: 3237/4950 cut-off events. [2025-03-13 21:42:08,347 INFO L125 PetriNetUnfolderBase]: For 5557/5557 co-relation queries the response was YES. [2025-03-13 21:42:08,356 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13369 conditions, 4950 events. 3237/4950 cut-off events. For 5557/5557 co-relation queries the response was YES. Maximal size of possible extension queue 336. Compared 28357 event pairs, 457 based on Foata normal form. 1/4769 useless extension candidates. Maximal degree in co-relation 13339. Up to 1878 conditions per place. [2025-03-13 21:42:08,365 INFO L140 encePairwiseOnDemand]: 32/40 looper letters, 101 selfloop transitions, 23 changer transitions 1/129 dead transitions. [2025-03-13 21:42:08,365 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 129 transitions, 850 flow [2025-03-13 21:42:08,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 21:42:08,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 21:42:08,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 137 transitions. [2025-03-13 21:42:08,366 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5708333333333333 [2025-03-13 21:42:08,366 INFO L175 Difference]: Start difference. First operand has 103 places, 57 transitions, 293 flow. Second operand 6 states and 137 transitions. [2025-03-13 21:42:08,366 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 129 transitions, 850 flow [2025-03-13 21:42:08,384 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 129 transitions, 767 flow, removed 29 selfloop flow, removed 10 redundant places. [2025-03-13 21:42:08,385 INFO L231 Difference]: Finished difference. Result has 81 places, 74 transitions, 434 flow [2025-03-13 21:42:08,385 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=253, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=434, PETRI_PLACES=81, PETRI_TRANSITIONS=74} [2025-03-13 21:42:08,385 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 44 predicate places. [2025-03-13 21:42:08,385 INFO L471 AbstractCegarLoop]: Abstraction has has 81 places, 74 transitions, 434 flow [2025-03-13 21:42:08,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 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-03-13 21:42:08,385 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:42:08,385 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-03-13 21:42:08,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-13 21:42:08,385 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-13 21:42:08,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:42:08,386 INFO L85 PathProgramCache]: Analyzing trace with hash 2108218908, now seen corresponding path program 2 times [2025-03-13 21:42:08,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:42:08,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127305005] [2025-03-13 21:42:08,386 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:42:08,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:42:08,394 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-03-13 21:42:08,398 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 24 of 27 statements. [2025-03-13 21:42:08,398 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-13 21:42:08,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:42:08,437 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-13 21:42:08,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:42:08,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127305005] [2025-03-13 21:42:08,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1127305005] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:42:08,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:42:08,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 21:42:08,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741708987] [2025-03-13 21:42:08,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:42:08,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-13 21:42:08,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:42:08,440 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-13 21:42:08,440 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-13 21:42:08,449 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2025-03-13 21:42:08,450 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 74 transitions, 434 flow. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 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-03-13 21:42:08,450 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:42:08,450 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2025-03-13 21:42:08,450 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:42:08,817 INFO L124 PetriNetUnfolderBase]: 4191/6393 cut-off events. [2025-03-13 21:42:08,817 INFO L125 PetriNetUnfolderBase]: For 7235/7235 co-relation queries the response was YES. [2025-03-13 21:42:08,830 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17421 conditions, 6393 events. 4191/6393 cut-off events. For 7235/7235 co-relation queries the response was YES. Maximal size of possible extension queue 451. Compared 38697 event pairs, 559 based on Foata normal form. 1/6392 useless extension candidates. Maximal degree in co-relation 17395. Up to 2743 conditions per place. [2025-03-13 21:42:08,841 INFO L140 encePairwiseOnDemand]: 32/40 looper letters, 107 selfloop transitions, 27 changer transitions 1/139 dead transitions. [2025-03-13 21:42:08,841 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 139 transitions, 965 flow [2025-03-13 21:42:08,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 21:42:08,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 21:42:08,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 139 transitions. [2025-03-13 21:42:08,842 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5791666666666667 [2025-03-13 21:42:08,842 INFO L175 Difference]: Start difference. First operand has 81 places, 74 transitions, 434 flow. Second operand 6 states and 139 transitions. [2025-03-13 21:42:08,842 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 139 transitions, 965 flow [2025-03-13 21:42:08,852 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 139 transitions, 963 flow, removed 1 selfloop flow, removed 0 redundant places. [2025-03-13 21:42:08,853 INFO L231 Difference]: Finished difference. Result has 89 places, 84 transitions, 607 flow [2025-03-13 21:42:08,854 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=432, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=607, PETRI_PLACES=89, PETRI_TRANSITIONS=84} [2025-03-13 21:42:08,854 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 52 predicate places. [2025-03-13 21:42:08,854 INFO L471 AbstractCegarLoop]: Abstraction has has 89 places, 84 transitions, 607 flow [2025-03-13 21:42:08,854 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 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-03-13 21:42:08,854 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:42:08,854 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-03-13 21:42:08,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-13 21:42:08,854 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-13 21:42:08,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:42:08,855 INFO L85 PathProgramCache]: Analyzing trace with hash -1380773046, now seen corresponding path program 3 times [2025-03-13 21:42:08,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:42:08,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380973988] [2025-03-13 21:42:08,855 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-13 21:42:08,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:42:08,860 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 27 statements into 2 equivalence classes. [2025-03-13 21:42:08,863 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 24 of 27 statements. [2025-03-13 21:42:08,863 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-13 21:42:08,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:42:08,899 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-13 21:42:08,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:42:08,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380973988] [2025-03-13 21:42:08,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380973988] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:42:08,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:42:08,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 21:42:08,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616145753] [2025-03-13 21:42:08,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:42:08,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-13 21:42:08,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:42:08,901 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-13 21:42:08,901 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-13 21:42:08,908 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2025-03-13 21:42:08,908 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 84 transitions, 607 flow. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 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-03-13 21:42:08,908 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:42:08,909 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2025-03-13 21:42:08,909 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:42:09,396 INFO L124 PetriNetUnfolderBase]: 5278/8102 cut-off events. [2025-03-13 21:42:09,396 INFO L125 PetriNetUnfolderBase]: For 15357/15357 co-relation queries the response was YES. [2025-03-13 21:42:09,411 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23909 conditions, 8102 events. 5278/8102 cut-off events. For 15357/15357 co-relation queries the response was YES. Maximal size of possible extension queue 568. Compared 51405 event pairs, 635 based on Foata normal form. 1/8101 useless extension candidates. Maximal degree in co-relation 23879. Up to 3482 conditions per place. [2025-03-13 21:42:09,519 INFO L140 encePairwiseOnDemand]: 32/40 looper letters, 106 selfloop transitions, 44 changer transitions 1/155 dead transitions. [2025-03-13 21:42:09,519 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 155 transitions, 1259 flow [2025-03-13 21:42:09,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 21:42:09,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 21:42:09,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 135 transitions. [2025-03-13 21:42:09,520 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5625 [2025-03-13 21:42:09,520 INFO L175 Difference]: Start difference. First operand has 89 places, 84 transitions, 607 flow. Second operand 6 states and 135 transitions. [2025-03-13 21:42:09,520 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 155 transitions, 1259 flow [2025-03-13 21:42:09,539 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 155 transitions, 1225 flow, removed 3 selfloop flow, removed 2 redundant places. [2025-03-13 21:42:09,540 INFO L231 Difference]: Finished difference. Result has 95 places, 102 transitions, 908 flow [2025-03-13 21:42:09,540 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=579, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=908, PETRI_PLACES=95, PETRI_TRANSITIONS=102} [2025-03-13 21:42:09,541 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 58 predicate places. [2025-03-13 21:42:09,541 INFO L471 AbstractCegarLoop]: Abstraction has has 95 places, 102 transitions, 908 flow [2025-03-13 21:42:09,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 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-03-13 21:42:09,541 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:42:09,541 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-03-13 21:42:09,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-13 21:42:09,541 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-13 21:42:09,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:42:09,541 INFO L85 PathProgramCache]: Analyzing trace with hash -133923954, now seen corresponding path program 4 times [2025-03-13 21:42:09,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:42:09,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493604722] [2025-03-13 21:42:09,542 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-13 21:42:09,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:42:09,547 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 27 statements into 2 equivalence classes. [2025-03-13 21:42:09,548 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 21 of 27 statements. [2025-03-13 21:42:09,548 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-13 21:42:09,548 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:42:09,573 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-13 21:42:09,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:42:09,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493604722] [2025-03-13 21:42:09,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [493604722] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:42:09,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:42:09,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 21:42:09,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907311871] [2025-03-13 21:42:09,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:42:09,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-13 21:42:09,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:42:09,574 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-13 21:42:09,574 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-13 21:42:09,583 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2025-03-13 21:42:09,584 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 102 transitions, 908 flow. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 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-03-13 21:42:09,584 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:42:09,584 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2025-03-13 21:42:09,584 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:42:10,088 INFO L124 PetriNetUnfolderBase]: 5530/8558 cut-off events. [2025-03-13 21:42:10,088 INFO L125 PetriNetUnfolderBase]: For 25516/25516 co-relation queries the response was YES. [2025-03-13 21:42:10,107 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27517 conditions, 8558 events. 5530/8558 cut-off events. For 25516/25516 co-relation queries the response was YES. Maximal size of possible extension queue 595. Compared 54897 event pairs, 789 based on Foata normal form. 1/8557 useless extension candidates. Maximal degree in co-relation 27484. Up to 3208 conditions per place. [2025-03-13 21:42:10,124 INFO L140 encePairwiseOnDemand]: 32/40 looper letters, 118 selfloop transitions, 47 changer transitions 1/170 dead transitions. [2025-03-13 21:42:10,125 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 170 transitions, 1662 flow [2025-03-13 21:42:10,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 21:42:10,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 21:42:10,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 133 transitions. [2025-03-13 21:42:10,125 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5541666666666667 [2025-03-13 21:42:10,125 INFO L175 Difference]: Start difference. First operand has 95 places, 102 transitions, 908 flow. Second operand 6 states and 133 transitions. [2025-03-13 21:42:10,125 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 170 transitions, 1662 flow [2025-03-13 21:42:10,165 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 170 transitions, 1620 flow, removed 14 selfloop flow, removed 2 redundant places. [2025-03-13 21:42:10,166 INFO L231 Difference]: Finished difference. Result has 101 places, 115 transitions, 1202 flow [2025-03-13 21:42:10,166 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=872, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1202, PETRI_PLACES=101, PETRI_TRANSITIONS=115} [2025-03-13 21:42:10,167 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 64 predicate places. [2025-03-13 21:42:10,167 INFO L471 AbstractCegarLoop]: Abstraction has has 101 places, 115 transitions, 1202 flow [2025-03-13 21:42:10,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 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-03-13 21:42:10,167 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:42:10,167 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-03-13 21:42:10,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-13 21:42:10,167 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-13 21:42:10,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:42:10,167 INFO L85 PathProgramCache]: Analyzing trace with hash -580375088, now seen corresponding path program 5 times [2025-03-13 21:42:10,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:42:10,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833881570] [2025-03-13 21:42:10,168 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-13 21:42:10,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:42:10,174 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-03-13 21:42:10,178 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-03-13 21:42:10,178 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:42:10,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:42:10,212 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-13 21:42:10,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:42:10,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833881570] [2025-03-13 21:42:10,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833881570] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:42:10,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:42:10,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 21:42:10,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506331092] [2025-03-13 21:42:10,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:42:10,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-13 21:42:10,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:42:10,214 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-13 21:42:10,214 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-13 21:42:10,225 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2025-03-13 21:42:10,225 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 115 transitions, 1202 flow. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 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-03-13 21:42:10,225 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:42:10,225 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2025-03-13 21:42:10,225 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:42:10,772 INFO L124 PetriNetUnfolderBase]: 5530/8577 cut-off events. [2025-03-13 21:42:10,772 INFO L125 PetriNetUnfolderBase]: For 34082/34082 co-relation queries the response was YES. [2025-03-13 21:42:10,793 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29414 conditions, 8577 events. 5530/8577 cut-off events. For 34082/34082 co-relation queries the response was YES. Maximal size of possible extension queue 594. Compared 55607 event pairs, 688 based on Foata normal form. 1/8576 useless extension candidates. Maximal degree in co-relation 29378. Up to 3370 conditions per place. [2025-03-13 21:42:10,812 INFO L140 encePairwiseOnDemand]: 32/40 looper letters, 123 selfloop transitions, 46 changer transitions 1/174 dead transitions. [2025-03-13 21:42:10,813 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 174 transitions, 1836 flow [2025-03-13 21:42:10,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 21:42:10,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 21:42:10,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 137 transitions. [2025-03-13 21:42:10,813 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5708333333333333 [2025-03-13 21:42:10,813 INFO L175 Difference]: Start difference. First operand has 101 places, 115 transitions, 1202 flow. Second operand 6 states and 137 transitions. [2025-03-13 21:42:10,813 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 174 transitions, 1836 flow [2025-03-13 21:42:10,867 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 174 transitions, 1787 flow, removed 21 selfloop flow, removed 1 redundant places. [2025-03-13 21:42:10,868 INFO L231 Difference]: Finished difference. Result has 108 places, 122 transitions, 1400 flow [2025-03-13 21:42:10,868 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1161, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1400, PETRI_PLACES=108, PETRI_TRANSITIONS=122} [2025-03-13 21:42:10,869 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 71 predicate places. [2025-03-13 21:42:10,869 INFO L471 AbstractCegarLoop]: Abstraction has has 108 places, 122 transitions, 1400 flow [2025-03-13 21:42:10,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 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-03-13 21:42:10,869 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:42:10,869 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-03-13 21:42:10,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-13 21:42:10,869 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-13 21:42:10,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:42:10,869 INFO L85 PathProgramCache]: Analyzing trace with hash 225600254, now seen corresponding path program 6 times [2025-03-13 21:42:10,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:42:10,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624221141] [2025-03-13 21:42:10,869 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-13 21:42:10,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:42:10,877 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 27 statements into 2 equivalence classes. [2025-03-13 21:42:10,879 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 24 of 27 statements. [2025-03-13 21:42:10,880 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-13 21:42:10,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:42:10,912 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-13 21:42:10,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:42:10,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624221141] [2025-03-13 21:42:10,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624221141] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:42:10,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:42:10,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 21:42:10,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055067657] [2025-03-13 21:42:10,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:42:10,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-13 21:42:10,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:42:10,914 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-13 21:42:10,914 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-13 21:42:10,924 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2025-03-13 21:42:10,924 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 122 transitions, 1400 flow. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 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-03-13 21:42:10,924 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:42:10,924 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2025-03-13 21:42:10,924 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:42:11,529 INFO L124 PetriNetUnfolderBase]: 5530/8550 cut-off events. [2025-03-13 21:42:11,529 INFO L125 PetriNetUnfolderBase]: For 43118/43118 co-relation queries the response was YES. [2025-03-13 21:42:11,547 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30839 conditions, 8550 events. 5530/8550 cut-off events. For 43118/43118 co-relation queries the response was YES. Maximal size of possible extension queue 595. Compared 54914 event pairs, 803 based on Foata normal form. 1/8549 useless extension candidates. Maximal degree in co-relation 30799. Up to 3278 conditions per place. [2025-03-13 21:42:11,563 INFO L140 encePairwiseOnDemand]: 32/40 looper letters, 121 selfloop transitions, 57 changer transitions 1/183 dead transitions. [2025-03-13 21:42:11,563 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 183 transitions, 2114 flow [2025-03-13 21:42:11,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 21:42:11,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 21:42:11,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 133 transitions. [2025-03-13 21:42:11,564 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5541666666666667 [2025-03-13 21:42:11,564 INFO L175 Difference]: Start difference. First operand has 108 places, 122 transitions, 1400 flow. Second operand 6 states and 133 transitions. [2025-03-13 21:42:11,564 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 183 transitions, 2114 flow [2025-03-13 21:42:11,626 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 183 transitions, 2047 flow, removed 11 selfloop flow, removed 2 redundant places. [2025-03-13 21:42:11,628 INFO L231 Difference]: Finished difference. Result has 114 places, 135 transitions, 1720 flow [2025-03-13 21:42:11,628 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1344, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1720, PETRI_PLACES=114, PETRI_TRANSITIONS=135} [2025-03-13 21:42:11,628 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 77 predicate places. [2025-03-13 21:42:11,628 INFO L471 AbstractCegarLoop]: Abstraction has has 114 places, 135 transitions, 1720 flow [2025-03-13 21:42:11,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 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-03-13 21:42:11,628 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:42:11,628 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-03-13 21:42:11,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-13 21:42:11,629 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-13 21:42:11,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:42:11,629 INFO L85 PathProgramCache]: Analyzing trace with hash -69642054, now seen corresponding path program 1 times [2025-03-13 21:42:11,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:42:11,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620301814] [2025-03-13 21:42:11,629 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:42:11,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:42:11,637 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-13 21:42:11,642 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-13 21:42:11,643 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:42:11,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:42:11,719 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:42:11,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:42:11,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620301814] [2025-03-13 21:42:11,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620301814] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:42:11,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [383943413] [2025-03-13 21:42:11,720 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:42:11,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:42:11,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:42:11,722 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 21:42:11,724 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-13 21:42:11,775 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-13 21:42:11,797 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-13 21:42:11,797 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:42:11,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:42:11,799 INFO L256 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-13 21:42:11,800 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:42:11,871 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:42:11,871 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:42:11,940 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:42:11,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [383943413] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:42:11,940 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:42:11,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2025-03-13 21:42:11,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511604457] [2025-03-13 21:42:11,940 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:42:11,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-13 21:42:11,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:42:11,941 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-13 21:42:11,941 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2025-03-13 21:42:11,983 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2025-03-13 21:42:11,983 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 135 transitions, 1720 flow. Second operand has 14 states, 14 states have (on average 9.928571428571429) internal successors, (139), 14 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:42:11,983 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:42:11,983 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2025-03-13 21:42:11,984 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:42:13,025 INFO L124 PetriNetUnfolderBase]: 10023/15301 cut-off events. [2025-03-13 21:42:13,026 INFO L125 PetriNetUnfolderBase]: For 92481/92481 co-relation queries the response was YES. [2025-03-13 21:42:13,070 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57665 conditions, 15301 events. 10023/15301 cut-off events. For 92481/92481 co-relation queries the response was YES. Maximal size of possible extension queue 1036. Compared 105477 event pairs, 4297 based on Foata normal form. 10/15304 useless extension candidates. Maximal degree in co-relation 57622. Up to 6361 conditions per place. [2025-03-13 21:42:13,103 INFO L140 encePairwiseOnDemand]: 32/40 looper letters, 239 selfloop transitions, 27 changer transitions 26/296 dead transitions. [2025-03-13 21:42:13,103 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 296 transitions, 4228 flow [2025-03-13 21:42:13,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-13 21:42:13,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-13 21:42:13,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 181 transitions. [2025-03-13 21:42:13,104 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4113636363636364 [2025-03-13 21:42:13,104 INFO L175 Difference]: Start difference. First operand has 114 places, 135 transitions, 1720 flow. Second operand 11 states and 181 transitions. [2025-03-13 21:42:13,104 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 296 transitions, 4228 flow [2025-03-13 21:42:13,493 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 296 transitions, 4150 flow, removed 33 selfloop flow, removed 1 redundant places. [2025-03-13 21:42:13,495 INFO L231 Difference]: Finished difference. Result has 128 places, 139 transitions, 1817 flow [2025-03-13 21:42:13,496 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1687, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1817, PETRI_PLACES=128, PETRI_TRANSITIONS=139} [2025-03-13 21:42:13,496 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 91 predicate places. [2025-03-13 21:42:13,496 INFO L471 AbstractCegarLoop]: Abstraction has has 128 places, 139 transitions, 1817 flow [2025-03-13 21:42:13,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 9.928571428571429) internal successors, (139), 14 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:42:13,496 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:42:13,496 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] [2025-03-13 21:42:13,502 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-13 21:42:13,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:42:13,697 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-13 21:42:13,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:42:13,697 INFO L85 PathProgramCache]: Analyzing trace with hash -1417472299, now seen corresponding path program 1 times [2025-03-13 21:42:13,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:42:13,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139666267] [2025-03-13 21:42:13,698 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:42:13,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:42:13,704 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-13 21:42:13,708 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-13 21:42:13,709 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:42:13,709 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:42:13,830 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 21:42:13,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:42:13,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139666267] [2025-03-13 21:42:13,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139666267] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:42:13,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [701636082] [2025-03-13 21:42:13,831 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:42:13,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:42:13,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:42:13,834 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 21:42:13,835 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-13 21:42:13,890 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-13 21:42:13,914 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-13 21:42:13,915 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:42:13,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:42:13,916 INFO L256 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-13 21:42:13,917 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:42:14,031 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 21:42:14,031 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:42:14,134 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 21:42:14,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [701636082] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:42:14,135 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:42:14,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 18 [2025-03-13 21:42:14,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579291888] [2025-03-13 21:42:14,135 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:42:14,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-13 21:42:14,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:42:14,137 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-13 21:42:14,137 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2025-03-13 21:42:14,279 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2025-03-13 21:42:14,279 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 139 transitions, 1817 flow. Second operand has 18 states, 18 states have (on average 10.666666666666666) internal successors, (192), 18 states have internal predecessors, (192), 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-03-13 21:42:14,279 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:42:14,279 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2025-03-13 21:42:14,279 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:42:16,900 INFO L124 PetriNetUnfolderBase]: 17963/27126 cut-off events. [2025-03-13 21:42:16,900 INFO L125 PetriNetUnfolderBase]: For 164928/164928 co-relation queries the response was YES. [2025-03-13 21:42:17,039 INFO L83 FinitePrefix]: Finished finitePrefix Result has 104192 conditions, 27126 events. 17963/27126 cut-off events. For 164928/164928 co-relation queries the response was YES. Maximal size of possible extension queue 1746. Compared 198453 event pairs, 2964 based on Foata normal form. 8/27129 useless extension candidates. Maximal degree in co-relation 104143. Up to 11420 conditions per place. [2025-03-13 21:42:17,105 INFO L140 encePairwiseOnDemand]: 28/40 looper letters, 330 selfloop transitions, 90 changer transitions 8/432 dead transitions. [2025-03-13 21:42:17,105 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 432 transitions, 5736 flow [2025-03-13 21:42:17,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-13 21:42:17,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-03-13 21:42:17,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 336 transitions. [2025-03-13 21:42:17,107 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4421052631578947 [2025-03-13 21:42:17,107 INFO L175 Difference]: Start difference. First operand has 128 places, 139 transitions, 1817 flow. Second operand 19 states and 336 transitions. [2025-03-13 21:42:17,107 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 432 transitions, 5736 flow [2025-03-13 21:42:18,120 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 432 transitions, 5582 flow, removed 61 selfloop flow, removed 8 redundant places. [2025-03-13 21:42:18,123 INFO L231 Difference]: Finished difference. Result has 133 places, 201 transitions, 3115 flow [2025-03-13 21:42:18,124 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1751, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=3115, PETRI_PLACES=133, PETRI_TRANSITIONS=201} [2025-03-13 21:42:18,124 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 96 predicate places. [2025-03-13 21:42:18,124 INFO L471 AbstractCegarLoop]: Abstraction has has 133 places, 201 transitions, 3115 flow [2025-03-13 21:42:18,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 10.666666666666666) internal successors, (192), 18 states have internal predecessors, (192), 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-03-13 21:42:18,124 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:42:18,124 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] [2025-03-13 21:42:18,130 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-13 21:42:18,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:42:18,325 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-13 21:42:18,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:42:18,325 INFO L85 PathProgramCache]: Analyzing trace with hash -1691156213, now seen corresponding path program 1 times [2025-03-13 21:42:18,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:42:18,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409942171] [2025-03-13 21:42:18,325 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:42:18,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:42:18,330 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-13 21:42:18,334 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-13 21:42:18,334 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:42:18,334 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:42:18,375 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-13 21:42:18,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:42:18,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409942171] [2025-03-13 21:42:18,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409942171] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:42:18,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:42:18,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 21:42:18,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614085693] [2025-03-13 21:42:18,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:42:18,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-13 21:42:18,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:42:18,377 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-13 21:42:18,377 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-13 21:42:18,381 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2025-03-13 21:42:18,381 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 201 transitions, 3115 flow. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 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-03-13 21:42:18,381 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:42:18,381 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2025-03-13 21:42:18,381 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:42:20,226 INFO L124 PetriNetUnfolderBase]: 14923/22890 cut-off events. [2025-03-13 21:42:20,226 INFO L125 PetriNetUnfolderBase]: For 161357/161357 co-relation queries the response was YES. [2025-03-13 21:42:20,295 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86535 conditions, 22890 events. 14923/22890 cut-off events. For 161357/161357 co-relation queries the response was YES. Maximal size of possible extension queue 1564. Compared 168730 event pairs, 7802 based on Foata normal form. 564/23442 useless extension candidates. Maximal degree in co-relation 86482. Up to 17011 conditions per place. [2025-03-13 21:42:20,334 INFO L140 encePairwiseOnDemand]: 35/40 looper letters, 142 selfloop transitions, 6 changer transitions 81/233 dead transitions. [2025-03-13 21:42:20,334 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 233 transitions, 3673 flow [2025-03-13 21:42:20,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-13 21:42:20,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-13 21:42:20,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 98 transitions. [2025-03-13 21:42:20,335 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.49 [2025-03-13 21:42:20,335 INFO L175 Difference]: Start difference. First operand has 133 places, 201 transitions, 3115 flow. Second operand 5 states and 98 transitions. [2025-03-13 21:42:20,335 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 233 transitions, 3673 flow [2025-03-13 21:42:21,018 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 233 transitions, 3498 flow, removed 74 selfloop flow, removed 4 redundant places. [2025-03-13 21:42:21,020 INFO L231 Difference]: Finished difference. Result has 134 places, 152 transitions, 1973 flow [2025-03-13 21:42:21,020 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=2517, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=180, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=174, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1973, PETRI_PLACES=134, PETRI_TRANSITIONS=152} [2025-03-13 21:42:21,021 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 97 predicate places. [2025-03-13 21:42:21,021 INFO L471 AbstractCegarLoop]: Abstraction has has 134 places, 152 transitions, 1973 flow [2025-03-13 21:42:21,021 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 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-03-13 21:42:21,021 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:42:21,021 INFO L206 CegarLoopForPetriNet]: trace histogram [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] [2025-03-13 21:42:21,021 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-13 21:42:21,021 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-13 21:42:21,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:42:21,021 INFO L85 PathProgramCache]: Analyzing trace with hash -232130642, now seen corresponding path program 1 times [2025-03-13 21:42:21,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:42:21,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480274530] [2025-03-13 21:42:21,021 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:42:21,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:42:21,027 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-13 21:42:21,031 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-13 21:42:21,031 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:42:21,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:42:21,113 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 21:42:21,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:42:21,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480274530] [2025-03-13 21:42:21,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480274530] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:42:21,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1766847178] [2025-03-13 21:42:21,114 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:42:21,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:42:21,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:42:21,115 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 21:42:21,118 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-13 21:42:21,170 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-13 21:42:21,192 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-13 21:42:21,192 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:42:21,192 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:42:21,195 INFO L256 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-13 21:42:21,196 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:42:21,300 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 21:42:21,300 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:42:21,393 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 21:42:21,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1766847178] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:42:21,394 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:42:21,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 17 [2025-03-13 21:42:21,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825151214] [2025-03-13 21:42:21,394 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:42:21,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-13 21:42:21,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:42:21,394 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-13 21:42:21,395 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2025-03-13 21:42:21,439 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2025-03-13 21:42:21,440 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 152 transitions, 1973 flow. Second operand has 18 states, 18 states have (on average 9.88888888888889) internal successors, (178), 18 states have internal predecessors, (178), 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-03-13 21:42:21,440 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:42:21,440 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2025-03-13 21:42:21,440 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:42:23,490 INFO L124 PetriNetUnfolderBase]: 18409/27018 cut-off events. [2025-03-13 21:42:23,490 INFO L125 PetriNetUnfolderBase]: For 157077/157077 co-relation queries the response was YES. [2025-03-13 21:42:23,741 INFO L83 FinitePrefix]: Finished finitePrefix Result has 101302 conditions, 27018 events. 18409/27018 cut-off events. For 157077/157077 co-relation queries the response was YES. Maximal size of possible extension queue 1749. Compared 187175 event pairs, 8687 based on Foata normal form. 8/27018 useless extension candidates. Maximal degree in co-relation 101249. Up to 8507 conditions per place. [2025-03-13 21:42:23,816 INFO L140 encePairwiseOnDemand]: 31/40 looper letters, 324 selfloop transitions, 41 changer transitions 2/371 dead transitions. [2025-03-13 21:42:23,817 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 371 transitions, 5557 flow [2025-03-13 21:42:23,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-13 21:42:23,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-13 21:42:23,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 178 transitions. [2025-03-13 21:42:23,817 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.445 [2025-03-13 21:42:23,817 INFO L175 Difference]: Start difference. First operand has 134 places, 152 transitions, 1973 flow. Second operand 10 states and 178 transitions. [2025-03-13 21:42:23,817 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 371 transitions, 5557 flow [2025-03-13 21:42:25,141 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 371 transitions, 5413 flow, removed 64 selfloop flow, removed 7 redundant places. [2025-03-13 21:42:25,144 INFO L231 Difference]: Finished difference. Result has 130 places, 186 transitions, 2637 flow [2025-03-13 21:42:25,144 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1919, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2637, PETRI_PLACES=130, PETRI_TRANSITIONS=186} [2025-03-13 21:42:25,144 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 93 predicate places. [2025-03-13 21:42:25,145 INFO L471 AbstractCegarLoop]: Abstraction has has 130 places, 186 transitions, 2637 flow [2025-03-13 21:42:25,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 9.88888888888889) internal successors, (178), 18 states have internal predecessors, (178), 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-03-13 21:42:25,145 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:42:25,145 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:42:25,150 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-13 21:42:25,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-03-13 21:42:25,345 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-13 21:42:25,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:42:25,346 INFO L85 PathProgramCache]: Analyzing trace with hash -1561749924, now seen corresponding path program 1 times [2025-03-13 21:42:25,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:42:25,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93634825] [2025-03-13 21:42:25,346 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:42:25,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:42:25,352 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-13 21:42:25,358 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-13 21:42:25,358 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:42:25,358 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:42:25,466 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 21:42:25,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:42:25,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93634825] [2025-03-13 21:42:25,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93634825] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:42:25,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [70685958] [2025-03-13 21:42:25,467 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:42:25,467 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:42:25,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:42:25,469 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 21:42:25,470 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-13 21:42:25,524 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-13 21:42:25,550 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-13 21:42:25,550 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:42:25,550 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:42:25,552 INFO L256 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-13 21:42:25,553 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:42:25,650 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 21:42:25,650 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:42:25,741 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 21:42:25,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [70685958] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-13 21:42:25,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-13 21:42:25,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7, 6] total 13 [2025-03-13 21:42:25,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487896900] [2025-03-13 21:42:25,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:42:25,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-13 21:42:25,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:42:25,742 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-13 21:42:25,742 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2025-03-13 21:42:25,752 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 40 [2025-03-13 21:42:25,752 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 186 transitions, 2637 flow. Second operand has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 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-03-13 21:42:25,752 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:42:25,752 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 40 [2025-03-13 21:42:25,752 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:42:28,994 INFO L124 PetriNetUnfolderBase]: 26053/36737 cut-off events. [2025-03-13 21:42:28,994 INFO L125 PetriNetUnfolderBase]: For 215962/215962 co-relation queries the response was YES. [2025-03-13 21:42:29,332 INFO L83 FinitePrefix]: Finished finitePrefix Result has 133114 conditions, 36737 events. 26053/36737 cut-off events. For 215962/215962 co-relation queries the response was YES. Maximal size of possible extension queue 1894. Compared 237860 event pairs, 8986 based on Foata normal form. 0/35271 useless extension candidates. Maximal degree in co-relation 133062. Up to 19396 conditions per place. [2025-03-13 21:42:29,432 INFO L140 encePairwiseOnDemand]: 32/40 looper letters, 220 selfloop transitions, 40 changer transitions 0/263 dead transitions. [2025-03-13 21:42:29,432 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 263 transitions, 4206 flow [2025-03-13 21:42:29,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-13 21:42:29,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-13 21:42:29,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 95 transitions. [2025-03-13 21:42:29,436 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3392857142857143 [2025-03-13 21:42:29,436 INFO L175 Difference]: Start difference. First operand has 130 places, 186 transitions, 2637 flow. Second operand 7 states and 95 transitions. [2025-03-13 21:42:29,436 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 263 transitions, 4206 flow [2025-03-13 21:42:30,806 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 263 transitions, 4188 flow, removed 4 selfloop flow, removed 4 redundant places. [2025-03-13 21:42:30,809 INFO L231 Difference]: Finished difference. Result has 134 places, 187 transitions, 2769 flow [2025-03-13 21:42:30,810 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=2619, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=186, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2769, PETRI_PLACES=134, PETRI_TRANSITIONS=187} [2025-03-13 21:42:30,810 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 97 predicate places. [2025-03-13 21:42:30,810 INFO L471 AbstractCegarLoop]: Abstraction has has 134 places, 187 transitions, 2769 flow [2025-03-13 21:42:30,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 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-03-13 21:42:30,810 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:42:30,810 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] [2025-03-13 21:42:30,816 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-13 21:42:31,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:42:31,011 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-13 21:42:31,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:42:31,011 INFO L85 PathProgramCache]: Analyzing trace with hash 15997625, now seen corresponding path program 1 times [2025-03-13 21:42:31,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:42:31,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838986220] [2025-03-13 21:42:31,011 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:42:31,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:42:31,017 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-13 21:42:31,045 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-13 21:42:31,045 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:42:31,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:42:31,482 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-13 21:42:31,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:42:31,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838986220] [2025-03-13 21:42:31,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838986220] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:42:31,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:42:31,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-13 21:42:31,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611772592] [2025-03-13 21:42:31,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:42:31,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-13 21:42:31,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:42:31,483 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-13 21:42:31,484 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2025-03-13 21:42:31,503 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2025-03-13 21:42:31,504 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 187 transitions, 2769 flow. Second operand has 12 states, 12 states have (on average 9.416666666666666) internal successors, (113), 12 states have internal predecessors, (113), 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-03-13 21:42:31,504 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:42:31,504 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2025-03-13 21:42:31,504 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:42:39,617 INFO L124 PetriNetUnfolderBase]: 55753/82223 cut-off events. [2025-03-13 21:42:39,617 INFO L125 PetriNetUnfolderBase]: For 491646/493741 co-relation queries the response was YES. [2025-03-13 21:42:40,262 INFO L83 FinitePrefix]: Finished finitePrefix Result has 308820 conditions, 82223 events. 55753/82223 cut-off events. For 491646/493741 co-relation queries the response was YES. Maximal size of possible extension queue 4439. Compared 653624 event pairs, 14091 based on Foata normal form. 6/82223 useless extension candidates. Maximal degree in co-relation 308766. Up to 32441 conditions per place. [2025-03-13 21:42:40,513 INFO L140 encePairwiseOnDemand]: 27/40 looper letters, 366 selfloop transitions, 69 changer transitions 9/448 dead transitions. [2025-03-13 21:42:40,513 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 448 transitions, 7227 flow [2025-03-13 21:42:40,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-13 21:42:40,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-13 21:42:40,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 215 transitions. [2025-03-13 21:42:40,514 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4479166666666667 [2025-03-13 21:42:40,514 INFO L175 Difference]: Start difference. First operand has 134 places, 187 transitions, 2769 flow. Second operand 12 states and 215 transitions. [2025-03-13 21:42:40,514 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 448 transitions, 7227 flow [2025-03-13 21:42:43,482 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 448 transitions, 7134 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-13 21:42:43,485 INFO L231 Difference]: Finished difference. Result has 146 places, 228 transitions, 3675 flow [2025-03-13 21:42:43,486 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=2723, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=187, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=3675, PETRI_PLACES=146, PETRI_TRANSITIONS=228} [2025-03-13 21:42:43,486 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 109 predicate places. [2025-03-13 21:42:43,486 INFO L471 AbstractCegarLoop]: Abstraction has has 146 places, 228 transitions, 3675 flow [2025-03-13 21:42:43,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.416666666666666) internal successors, (113), 12 states have internal predecessors, (113), 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-03-13 21:42:43,486 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:42:43,486 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] [2025-03-13 21:42:43,486 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-13 21:42:43,486 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-13 21:42:43,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:42:43,487 INFO L85 PathProgramCache]: Analyzing trace with hash -2056673539, now seen corresponding path program 2 times [2025-03-13 21:42:43,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:42:43,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851069982] [2025-03-13 21:42:43,487 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:42:43,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:42:43,493 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-03-13 21:42:43,516 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 27 of 30 statements. [2025-03-13 21:42:43,517 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-13 21:42:43,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:42:43,870 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-13 21:42:43,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:42:43,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851069982] [2025-03-13 21:42:43,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851069982] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:42:43,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:42:43,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-13 21:42:43,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976909883] [2025-03-13 21:42:43,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:42:43,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-13 21:42:43,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:42:43,871 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-13 21:42:43,871 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2025-03-13 21:42:43,896 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2025-03-13 21:42:43,897 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 228 transitions, 3675 flow. Second operand has 12 states, 12 states have (on average 9.416666666666666) internal successors, (113), 12 states have internal predecessors, (113), 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-03-13 21:42:43,897 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:42:43,897 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2025-03-13 21:42:43,897 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:42:53,247 INFO L124 PetriNetUnfolderBase]: 60043/88490 cut-off events. [2025-03-13 21:42:53,248 INFO L125 PetriNetUnfolderBase]: For 625433/627753 co-relation queries the response was YES.