./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/chl-word-trans.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 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-word-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 9cb2b0cbecf02e8cce2fd890595fb88c3204482a27ce7ac6f4ef6fb92949d747 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 02:19:51,907 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 02:19:51,971 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 02:19:51,979 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 02:19:51,979 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 02:19:51,997 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 02:19:51,999 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 02:19:51,999 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 02:19:51,999 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 02:19:51,999 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 02:19:52,000 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 02:19:52,000 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 02:19:52,000 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 02:19:52,001 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 02:19:52,001 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 02:19:52,001 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 02:19:52,001 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 02:19:52,001 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 02:19:52,001 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 02:19:52,001 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 02:19:52,001 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 02:19:52,002 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 02:19:52,002 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 02:19:52,002 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 02:19:52,002 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 02:19:52,002 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 02:19:52,002 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 02:19:52,002 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 02:19:52,002 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 02:19:52,002 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 02:19:52,003 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 02:19:52,003 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 02:19:52,003 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 02:19:52,003 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 02:19:52,003 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 02:19:52,003 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 02:19:52,003 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 02:19:52,003 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 02:19:52,003 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 02:19:52,004 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 02:19:52,004 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 02:19:52,004 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 02:19:52,004 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 02:19:52,004 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 -> 9cb2b0cbecf02e8cce2fd890595fb88c3204482a27ce7ac6f4ef6fb92949d747 [2025-03-04 02:19:52,226 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 02:19:52,230 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 02:19:52,233 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 02:19:52,234 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 02:19:52,234 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 02:19:52,235 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-word-trans.wvr.c [2025-03-04 02:19:53,365 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/425e20441/2312e84bd4114b03a744ff7d399c7378/FLAGdd209aea4 [2025-03-04 02:19:53,566 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 02:19:53,567 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-word-trans.wvr.c [2025-03-04 02:19:53,572 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/425e20441/2312e84bd4114b03a744ff7d399c7378/FLAGdd209aea4 [2025-03-04 02:19:53,925 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/425e20441/2312e84bd4114b03a744ff7d399c7378 [2025-03-04 02:19:53,927 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 02:19:53,928 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 02:19:53,929 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 02:19:53,929 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 02:19:53,933 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 02:19:53,933 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:19:53" (1/1) ... [2025-03-04 02:19:53,934 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@609b7b87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:19:53, skipping insertion in model container [2025-03-04 02:19:53,934 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:19:53" (1/1) ... [2025-03-04 02:19:53,946 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 02:19:54,084 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-word-trans.wvr.c[3331,3344] [2025-03-04 02:19:54,096 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 02:19:54,103 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 02:19:54,129 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-word-trans.wvr.c[3331,3344] [2025-03-04 02:19:54,136 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 02:19:54,150 INFO L204 MainTranslator]: Completed translation [2025-03-04 02:19:54,150 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:19:54 WrapperNode [2025-03-04 02:19:54,150 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 02:19:54,151 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 02:19:54,151 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 02:19:54,151 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 02:19:54,159 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:19:54" (1/1) ... [2025-03-04 02:19:54,164 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:19:54" (1/1) ... [2025-03-04 02:19:54,184 INFO L138 Inliner]: procedures = 24, calls = 29, calls flagged for inlining = 8, calls inlined = 12, statements flattened = 156 [2025-03-04 02:19:54,184 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 02:19:54,185 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 02:19:54,185 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 02:19:54,185 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 02:19:54,191 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:19:54" (1/1) ... [2025-03-04 02:19:54,192 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:19:54" (1/1) ... [2025-03-04 02:19:54,194 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:19:54" (1/1) ... [2025-03-04 02:19:54,213 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-04 02:19:54,217 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:19:54" (1/1) ... [2025-03-04 02:19:54,217 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:19:54" (1/1) ... [2025-03-04 02:19:54,222 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:19:54" (1/1) ... [2025-03-04 02:19:54,225 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:19:54" (1/1) ... [2025-03-04 02:19:54,226 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:19:54" (1/1) ... [2025-03-04 02:19:54,228 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:19:54" (1/1) ... [2025-03-04 02:19:54,230 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 02:19:54,231 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 02:19:54,231 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 02:19:54,231 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 02:19:54,232 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:19:54" (1/1) ... [2025-03-04 02:19:54,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 02:19:54,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:19:54,254 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-04 02:19:54,257 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-04 02:19:54,273 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 02:19:54,273 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-04 02:19:54,273 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-04 02:19:54,273 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-04 02:19:54,273 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-04 02:19:54,273 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-04 02:19:54,273 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-04 02:19:54,273 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 02:19:54,274 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 02:19:54,274 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 02:19:54,274 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 02:19:54,274 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 02:19:54,274 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 02:19:54,274 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 02:19:54,274 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 02:19:54,274 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 02:19:54,275 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 02:19:54,386 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 02:19:54,388 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 02:19:54,735 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 02:19:54,735 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 02:19:54,937 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 02:19:54,937 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 02:19:54,937 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:19:54 BoogieIcfgContainer [2025-03-04 02:19:54,937 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 02:19:54,939 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 02:19:54,939 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 02:19:54,942 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 02:19:54,943 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 02:19:53" (1/3) ... [2025-03-04 02:19:54,943 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38fce88b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:19:54, skipping insertion in model container [2025-03-04 02:19:54,943 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:19:54" (2/3) ... [2025-03-04 02:19:54,944 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38fce88b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:19:54, skipping insertion in model container [2025-03-04 02:19:54,944 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:19:54" (3/3) ... [2025-03-04 02:19:54,944 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-word-trans.wvr.c [2025-03-04 02:19:54,954 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 02:19:54,956 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-word-trans.wvr.c that has 4 procedures, 38 locations, 1 initial locations, 6 loop locations, and 1 error locations. [2025-03-04 02:19:54,956 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 02:19:55,012 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-04 02:19:55,039 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 49 transitions, 119 flow [2025-03-04 02:19:55,063 INFO L124 PetriNetUnfolderBase]: 12/46 cut-off events. [2025-03-04 02:19:55,067 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-04 02:19:55,070 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59 conditions, 46 events. 12/46 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 74 event pairs, 0 based on Foata normal form. 0/33 useless extension candidates. Maximal degree in co-relation 36. Up to 2 conditions per place. [2025-03-04 02:19:55,072 INFO L82 GeneralOperation]: Start removeDead. Operand has 47 places, 49 transitions, 119 flow [2025-03-04 02:19:55,074 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 43 places, 45 transitions, 108 flow [2025-03-04 02:19:55,083 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 02:19:55,091 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;@24928edc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 02:19:55,093 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-03-04 02:19:55,111 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 02:19:55,113 INFO L124 PetriNetUnfolderBase]: 12/44 cut-off events. [2025-03-04 02:19:55,113 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-04 02:19:55,114 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:19:55,114 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-04 02:19:55,114 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-04 02:19:55,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:19:55,119 INFO L85 PathProgramCache]: Analyzing trace with hash -857301232, now seen corresponding path program 1 times [2025-03-04 02:19:55,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:19:55,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609408899] [2025-03-04 02:19:55,124 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:19:55,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:19:55,180 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-04 02:19:55,227 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 02:19:55,227 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:19:55,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:19:55,628 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-04 02:19:55,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:19:55,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609408899] [2025-03-04 02:19:55,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609408899] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:19:55,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:19:55,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 02:19:55,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168499917] [2025-03-04 02:19:55,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:19:55,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 02:19:55,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:19:55,651 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 02:19:55,652 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 02:19:55,653 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 49 [2025-03-04 02:19:55,654 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 45 transitions, 108 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-04 02:19:55,654 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:19:55,654 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 49 [2025-03-04 02:19:55,655 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:19:56,237 INFO L124 PetriNetUnfolderBase]: 3083/4271 cut-off events. [2025-03-04 02:19:56,237 INFO L125 PetriNetUnfolderBase]: For 236/236 co-relation queries the response was YES. [2025-03-04 02:19:56,247 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8609 conditions, 4271 events. 3083/4271 cut-off events. For 236/236 co-relation queries the response was YES. Maximal size of possible extension queue 198. Compared 17973 event pairs, 1440 based on Foata normal form. 1/3480 useless extension candidates. Maximal degree in co-relation 7989. Up to 3035 conditions per place. [2025-03-04 02:19:56,266 INFO L140 encePairwiseOnDemand]: 42/49 looper letters, 79 selfloop transitions, 5 changer transitions 5/93 dead transitions. [2025-03-04 02:19:56,266 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 93 transitions, 409 flow [2025-03-04 02:19:56,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 02:19:56,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 02:19:56,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 125 transitions. [2025-03-04 02:19:56,277 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5102040816326531 [2025-03-04 02:19:56,278 INFO L175 Difference]: Start difference. First operand has 43 places, 45 transitions, 108 flow. Second operand 5 states and 125 transitions. [2025-03-04 02:19:56,279 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 93 transitions, 409 flow [2025-03-04 02:19:56,288 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 93 transitions, 379 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-04 02:19:56,291 INFO L231 Difference]: Finished difference. Result has 44 places, 49 transitions, 135 flow [2025-03-04 02:19:56,293 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=135, PETRI_PLACES=44, PETRI_TRANSITIONS=49} [2025-03-04 02:19:56,296 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 1 predicate places. [2025-03-04 02:19:56,298 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 49 transitions, 135 flow [2025-03-04 02:19:56,298 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-04 02:19:56,298 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:19:56,298 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-04 02:19:56,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 02:19:56,299 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-04 02:19:56,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:19:56,301 INFO L85 PathProgramCache]: Analyzing trace with hash -167815958, now seen corresponding path program 2 times [2025-03-04 02:19:56,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:19:56,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6194765] [2025-03-04 02:19:56,301 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:19:56,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:19:56,316 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 1 equivalence classes. [2025-03-04 02:19:56,329 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 02:19:56,330 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 02:19:56,330 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:19:56,521 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-04 02:19:56,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:19:56,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6194765] [2025-03-04 02:19:56,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6194765] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:19:56,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:19:56,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 02:19:56,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757396111] [2025-03-04 02:19:56,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:19:56,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 02:19:56,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:19:56,522 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 02:19:56,523 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 02:19:56,523 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 49 [2025-03-04 02:19:56,523 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 49 transitions, 135 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-04 02:19:56,523 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:19:56,523 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 49 [2025-03-04 02:19:56,523 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:19:57,064 INFO L124 PetriNetUnfolderBase]: 4113/5809 cut-off events. [2025-03-04 02:19:57,064 INFO L125 PetriNetUnfolderBase]: For 1272/1272 co-relation queries the response was YES. [2025-03-04 02:19:57,072 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12653 conditions, 5809 events. 4113/5809 cut-off events. For 1272/1272 co-relation queries the response was YES. Maximal size of possible extension queue 291. Compared 28187 event pairs, 2025 based on Foata normal form. 1/5302 useless extension candidates. Maximal degree in co-relation 9380. Up to 3982 conditions per place. [2025-03-04 02:19:57,090 INFO L140 encePairwiseOnDemand]: 42/49 looper letters, 91 selfloop transitions, 6 changer transitions 3/104 dead transitions. [2025-03-04 02:19:57,090 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 104 transitions, 473 flow [2025-03-04 02:19:57,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 02:19:57,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 02:19:57,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 131 transitions. [2025-03-04 02:19:57,092 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5346938775510204 [2025-03-04 02:19:57,093 INFO L175 Difference]: Start difference. First operand has 44 places, 49 transitions, 135 flow. Second operand 5 states and 131 transitions. [2025-03-04 02:19:57,093 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 104 transitions, 473 flow [2025-03-04 02:19:57,098 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 104 transitions, 464 flow, removed 3 selfloop flow, removed 1 redundant places. [2025-03-04 02:19:57,100 INFO L231 Difference]: Finished difference. Result has 50 places, 54 transitions, 185 flow [2025-03-04 02:19:57,101 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=185, PETRI_PLACES=50, PETRI_TRANSITIONS=54} [2025-03-04 02:19:57,101 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 7 predicate places. [2025-03-04 02:19:57,102 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 54 transitions, 185 flow [2025-03-04 02:19:57,102 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-04 02:19:57,102 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:19:57,102 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-04 02:19:57,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 02:19:57,103 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-04 02:19:57,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:19:57,103 INFO L85 PathProgramCache]: Analyzing trace with hash -865469760, now seen corresponding path program 3 times [2025-03-04 02:19:57,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:19:57,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951065966] [2025-03-04 02:19:57,104 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:19:57,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:19:57,113 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 24 statements into 1 equivalence classes. [2025-03-04 02:19:57,126 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 02:19:57,126 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-04 02:19:57,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:19:57,273 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-04 02:19:57,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:19:57,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951065966] [2025-03-04 02:19:57,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951065966] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:19:57,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:19:57,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 02:19:57,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270369087] [2025-03-04 02:19:57,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:19:57,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 02:19:57,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:19:57,274 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 02:19:57,274 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 02:19:57,274 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 49 [2025-03-04 02:19:57,274 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 54 transitions, 185 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-04 02:19:57,274 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:19:57,274 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 49 [2025-03-04 02:19:57,274 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:19:57,885 INFO L124 PetriNetUnfolderBase]: 5322/7640 cut-off events. [2025-03-04 02:19:57,885 INFO L125 PetriNetUnfolderBase]: For 3700/3700 co-relation queries the response was YES. [2025-03-04 02:19:57,894 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18022 conditions, 7640 events. 5322/7640 cut-off events. For 3700/3700 co-relation queries the response was YES. Maximal size of possible extension queue 422. Compared 40297 event pairs, 2665 based on Foata normal form. 1/7421 useless extension candidates. Maximal degree in co-relation 12889. Up to 4828 conditions per place. [2025-03-04 02:19:57,922 INFO L140 encePairwiseOnDemand]: 39/49 looper letters, 90 selfloop transitions, 17 changer transitions 1/112 dead transitions. [2025-03-04 02:19:57,922 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 112 transitions, 575 flow [2025-03-04 02:19:57,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 02:19:57,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 02:19:57,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 135 transitions. [2025-03-04 02:19:57,923 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5510204081632653 [2025-03-04 02:19:57,923 INFO L175 Difference]: Start difference. First operand has 50 places, 54 transitions, 185 flow. Second operand 5 states and 135 transitions. [2025-03-04 02:19:57,923 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 112 transitions, 575 flow [2025-03-04 02:19:57,939 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 112 transitions, 566 flow, removed 3 selfloop flow, removed 1 redundant places. [2025-03-04 02:19:57,940 INFO L231 Difference]: Finished difference. Result has 56 places, 64 transitions, 312 flow [2025-03-04 02:19:57,940 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=182, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=312, PETRI_PLACES=56, PETRI_TRANSITIONS=64} [2025-03-04 02:19:57,942 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 13 predicate places. [2025-03-04 02:19:57,942 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 64 transitions, 312 flow [2025-03-04 02:19:57,942 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-04 02:19:57,942 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:19:57,943 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-04 02:19:57,943 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 02:19:57,943 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-04 02:19:57,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:19:57,944 INFO L85 PathProgramCache]: Analyzing trace with hash -282444556, now seen corresponding path program 4 times [2025-03-04 02:19:57,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:19:57,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235138914] [2025-03-04 02:19:57,944 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 02:19:57,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:19:57,954 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 24 statements into 2 equivalence classes. [2025-03-04 02:19:57,959 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 21 of 24 statements. [2025-03-04 02:19:57,959 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-04 02:19:57,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:19:58,063 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-04 02:19:58,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:19:58,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235138914] [2025-03-04 02:19:58,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235138914] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:19:58,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:19:58,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 02:19:58,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679261937] [2025-03-04 02:19:58,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:19:58,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 02:19:58,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:19:58,064 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 02:19:58,064 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 02:19:58,064 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 49 [2025-03-04 02:19:58,064 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 64 transitions, 312 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-04 02:19:58,064 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:19:58,064 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 49 [2025-03-04 02:19:58,064 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:19:58,722 INFO L124 PetriNetUnfolderBase]: 5933/8536 cut-off events. [2025-03-04 02:19:58,722 INFO L125 PetriNetUnfolderBase]: For 10731/10759 co-relation queries the response was YES. [2025-03-04 02:19:58,732 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23161 conditions, 8536 events. 5933/8536 cut-off events. For 10731/10759 co-relation queries the response was YES. Maximal size of possible extension queue 495. Compared 46843 event pairs, 2853 based on Foata normal form. 1/8266 useless extension candidates. Maximal degree in co-relation 15654. Up to 5334 conditions per place. [2025-03-04 02:19:58,754 INFO L140 encePairwiseOnDemand]: 39/49 looper letters, 105 selfloop transitions, 19 changer transitions 2/130 dead transitions. [2025-03-04 02:19:58,755 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 130 transitions, 815 flow [2025-03-04 02:19:58,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 02:19:58,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 02:19:58,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 137 transitions. [2025-03-04 02:19:58,757 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5591836734693878 [2025-03-04 02:19:58,757 INFO L175 Difference]: Start difference. First operand has 56 places, 64 transitions, 312 flow. Second operand 5 states and 137 transitions. [2025-03-04 02:19:58,758 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 130 transitions, 815 flow [2025-03-04 02:19:58,782 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 130 transitions, 785 flow, removed 12 selfloop flow, removed 1 redundant places. [2025-03-04 02:19:58,784 INFO L231 Difference]: Finished difference. Result has 62 places, 78 transitions, 490 flow [2025-03-04 02:19:58,784 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=292, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=490, PETRI_PLACES=62, PETRI_TRANSITIONS=78} [2025-03-04 02:19:58,785 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 19 predicate places. [2025-03-04 02:19:58,785 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 78 transitions, 490 flow [2025-03-04 02:19:58,785 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-04 02:19:58,785 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:19:58,785 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-04 02:19:58,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 02:19:58,786 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-04 02:19:58,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:19:58,787 INFO L85 PathProgramCache]: Analyzing trace with hash -396364416, now seen corresponding path program 5 times [2025-03-04 02:19:58,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:19:58,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357627977] [2025-03-04 02:19:58,787 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 02:19:58,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:19:58,796 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 24 statements into 1 equivalence classes. [2025-03-04 02:19:58,804 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 02:19:58,807 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 02:19:58,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:19:58,970 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-04 02:19:58,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:19:58,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357627977] [2025-03-04 02:19:58,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357627977] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:19:58,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:19:58,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 02:19:58,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121661505] [2025-03-04 02:19:58,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:19:58,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 02:19:58,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:19:58,972 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 02:19:58,972 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 02:19:58,972 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 49 [2025-03-04 02:19:58,972 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 78 transitions, 490 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-04 02:19:58,972 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:19:58,972 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 49 [2025-03-04 02:19:58,973 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:19:59,612 INFO L124 PetriNetUnfolderBase]: 5913/8484 cut-off events. [2025-03-04 02:19:59,612 INFO L125 PetriNetUnfolderBase]: For 17772/17826 co-relation queries the response was YES. [2025-03-04 02:19:59,627 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25749 conditions, 8484 events. 5913/8484 cut-off events. For 17772/17826 co-relation queries the response was YES. Maximal size of possible extension queue 487. Compared 45991 event pairs, 3000 based on Foata normal form. 1/8439 useless extension candidates. Maximal degree in co-relation 21050. Up to 5557 conditions per place. [2025-03-04 02:19:59,653 INFO L140 encePairwiseOnDemand]: 42/49 looper letters, 111 selfloop transitions, 10 changer transitions 3/128 dead transitions. [2025-03-04 02:19:59,653 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 128 transitions, 946 flow [2025-03-04 02:19:59,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 02:19:59,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 02:19:59,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 129 transitions. [2025-03-04 02:19:59,654 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5265306122448979 [2025-03-04 02:19:59,654 INFO L175 Difference]: Start difference. First operand has 62 places, 78 transitions, 490 flow. Second operand 5 states and 129 transitions. [2025-03-04 02:19:59,654 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 128 transitions, 946 flow [2025-03-04 02:19:59,692 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 128 transitions, 897 flow, removed 23 selfloop flow, removed 1 redundant places. [2025-03-04 02:19:59,694 INFO L231 Difference]: Finished difference. Result has 67 places, 78 transitions, 496 flow [2025-03-04 02:19:59,694 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=466, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=496, PETRI_PLACES=67, PETRI_TRANSITIONS=78} [2025-03-04 02:19:59,695 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 24 predicate places. [2025-03-04 02:19:59,695 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 78 transitions, 496 flow [2025-03-04 02:19:59,695 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-04 02:19:59,695 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:19:59,695 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-04 02:19:59,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 02:19:59,695 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-04 02:19:59,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:19:59,696 INFO L85 PathProgramCache]: Analyzing trace with hash -494025906, now seen corresponding path program 6 times [2025-03-04 02:19:59,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:19:59,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318397153] [2025-03-04 02:19:59,696 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 02:19:59,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:19:59,704 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 24 statements into 1 equivalence classes. [2025-03-04 02:19:59,710 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 02:19:59,710 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-04 02:19:59,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:19:59,826 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-04 02:19:59,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:19:59,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318397153] [2025-03-04 02:19:59,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318397153] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:19:59,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:19:59,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 02:19:59,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561651282] [2025-03-04 02:19:59,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:19:59,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 02:19:59,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:19:59,828 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 02:19:59,828 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 02:19:59,828 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 49 [2025-03-04 02:19:59,828 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 78 transitions, 496 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-04 02:19:59,828 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:19:59,828 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 49 [2025-03-04 02:19:59,828 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:20:00,596 INFO L124 PetriNetUnfolderBase]: 6253/8975 cut-off events. [2025-03-04 02:20:00,596 INFO L125 PetriNetUnfolderBase]: For 18044/18044 co-relation queries the response was YES. [2025-03-04 02:20:00,611 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26989 conditions, 8975 events. 6253/8975 cut-off events. For 18044/18044 co-relation queries the response was YES. Maximal size of possible extension queue 513. Compared 48921 event pairs, 2118 based on Foata normal form. 1/8954 useless extension candidates. Maximal degree in co-relation 26517. Up to 4246 conditions per place. [2025-03-04 02:20:00,631 INFO L140 encePairwiseOnDemand]: 39/49 looper letters, 97 selfloop transitions, 35 changer transitions 2/138 dead transitions. [2025-03-04 02:20:00,631 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 138 transitions, 1020 flow [2025-03-04 02:20:00,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 02:20:00,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 02:20:00,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 134 transitions. [2025-03-04 02:20:00,632 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5469387755102041 [2025-03-04 02:20:00,633 INFO L175 Difference]: Start difference. First operand has 67 places, 78 transitions, 496 flow. Second operand 5 states and 134 transitions. [2025-03-04 02:20:00,633 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 138 transitions, 1020 flow [2025-03-04 02:20:00,661 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 138 transitions, 991 flow, removed 8 selfloop flow, removed 3 redundant places. [2025-03-04 02:20:00,663 INFO L231 Difference]: Finished difference. Result has 71 places, 90 transitions, 698 flow [2025-03-04 02:20:00,663 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=473, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=698, PETRI_PLACES=71, PETRI_TRANSITIONS=90} [2025-03-04 02:20:00,664 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 28 predicate places. [2025-03-04 02:20:00,664 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 90 transitions, 698 flow [2025-03-04 02:20:00,664 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-04 02:20:00,664 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:20:00,664 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:20:00,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 02:20:00,664 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-04 02:20:00,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:20:00,665 INFO L85 PathProgramCache]: Analyzing trace with hash -1106372436, now seen corresponding path program 1 times [2025-03-04 02:20:00,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:20:00,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904355200] [2025-03-04 02:20:00,665 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:20:00,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:20:00,671 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-04 02:20:00,676 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 02:20:00,677 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:20:00,677 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:20:00,794 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-04 02:20:00,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:20:00,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904355200] [2025-03-04 02:20:00,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904355200] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:20:00,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:20:00,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 02:20:00,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278107766] [2025-03-04 02:20:00,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:20:00,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 02:20:00,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:20:00,795 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 02:20:00,795 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-04 02:20:00,802 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 49 [2025-03-04 02:20:00,803 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 90 transitions, 698 flow. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 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-04 02:20:00,803 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:20:00,803 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 49 [2025-03-04 02:20:00,803 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:20:01,589 INFO L124 PetriNetUnfolderBase]: 10382/14609 cut-off events. [2025-03-04 02:20:01,589 INFO L125 PetriNetUnfolderBase]: For 42718/42746 co-relation queries the response was YES. [2025-03-04 02:20:01,617 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49112 conditions, 14609 events. 10382/14609 cut-off events. For 42718/42746 co-relation queries the response was YES. Maximal size of possible extension queue 788. Compared 82153 event pairs, 3631 based on Foata normal form. 5/14588 useless extension candidates. Maximal degree in co-relation 44263. Up to 5751 conditions per place. [2025-03-04 02:20:01,730 INFO L140 encePairwiseOnDemand]: 39/49 looper letters, 149 selfloop transitions, 25 changer transitions 34/212 dead transitions. [2025-03-04 02:20:01,731 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 212 transitions, 1998 flow [2025-03-04 02:20:01,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 02:20:01,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 02:20:01,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 171 transitions. [2025-03-04 02:20:01,732 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.49854227405247814 [2025-03-04 02:20:01,732 INFO L175 Difference]: Start difference. First operand has 71 places, 90 transitions, 698 flow. Second operand 7 states and 171 transitions. [2025-03-04 02:20:01,732 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 212 transitions, 1998 flow [2025-03-04 02:20:01,816 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 212 transitions, 1900 flow, removed 49 selfloop flow, removed 0 redundant places. [2025-03-04 02:20:01,819 INFO L231 Difference]: Finished difference. Result has 82 places, 103 transitions, 860 flow [2025-03-04 02:20:01,819 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=664, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=860, PETRI_PLACES=82, PETRI_TRANSITIONS=103} [2025-03-04 02:20:01,820 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 39 predicate places. [2025-03-04 02:20:01,820 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 103 transitions, 860 flow [2025-03-04 02:20:01,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 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-04 02:20:01,821 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:20:01,822 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-04 02:20:01,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 02:20:01,822 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-04 02:20:01,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:20:01,822 INFO L85 PathProgramCache]: Analyzing trace with hash -687261539, now seen corresponding path program 1 times [2025-03-04 02:20:01,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:20:01,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403061429] [2025-03-04 02:20:01,822 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:20:01,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:20:01,831 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-04 02:20:01,837 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 02:20:01,837 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:20:01,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:20:01,935 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-04 02:20:01,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:20:01,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403061429] [2025-03-04 02:20:01,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403061429] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:20:01,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:20:01,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 02:20:01,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376563778] [2025-03-04 02:20:01,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:20:01,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 02:20:01,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:20:01,937 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 02:20:01,937 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 02:20:01,945 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 49 [2025-03-04 02:20:01,945 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 103 transitions, 860 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-04 02:20:01,945 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:20:01,946 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 49 [2025-03-04 02:20:01,946 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:20:03,269 INFO L124 PetriNetUnfolderBase]: 14790/20500 cut-off events. [2025-03-04 02:20:03,270 INFO L125 PetriNetUnfolderBase]: For 66177/66247 co-relation queries the response was YES. [2025-03-04 02:20:03,329 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73123 conditions, 20500 events. 14790/20500 cut-off events. For 66177/66247 co-relation queries the response was YES. Maximal size of possible extension queue 977. Compared 116036 event pairs, 4711 based on Foata normal form. 5/20453 useless extension candidates. Maximal degree in co-relation 73049. Up to 8847 conditions per place. [2025-03-04 02:20:03,397 INFO L140 encePairwiseOnDemand]: 39/49 looper letters, 164 selfloop transitions, 25 changer transitions 7/200 dead transitions. [2025-03-04 02:20:03,397 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 200 transitions, 1947 flow [2025-03-04 02:20:03,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 02:20:03,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 02:20:03,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 149 transitions. [2025-03-04 02:20:03,403 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5068027210884354 [2025-03-04 02:20:03,403 INFO L175 Difference]: Start difference. First operand has 82 places, 103 transitions, 860 flow. Second operand 6 states and 149 transitions. [2025-03-04 02:20:03,403 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 200 transitions, 1947 flow [2025-03-04 02:20:03,545 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 200 transitions, 1903 flow, removed 5 selfloop flow, removed 2 redundant places. [2025-03-04 02:20:03,547 INFO L231 Difference]: Finished difference. Result has 88 places, 117 transitions, 1055 flow [2025-03-04 02:20:03,547 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=834, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1055, PETRI_PLACES=88, PETRI_TRANSITIONS=117} [2025-03-04 02:20:03,548 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 45 predicate places. [2025-03-04 02:20:03,548 INFO L471 AbstractCegarLoop]: Abstraction has has 88 places, 117 transitions, 1055 flow [2025-03-04 02:20:03,548 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-04 02:20:03,548 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:20:03,548 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-04 02:20:03,549 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 02:20:03,549 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-04 02:20:03,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:20:03,549 INFO L85 PathProgramCache]: Analyzing trace with hash -1484275194, now seen corresponding path program 1 times [2025-03-04 02:20:03,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:20:03,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654969558] [2025-03-04 02:20:03,549 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:20:03,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:20:03,558 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-04 02:20:03,567 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 02:20:03,567 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:20:03,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:20:03,661 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-04 02:20:03,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:20:03,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654969558] [2025-03-04 02:20:03,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654969558] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:20:03,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:20:03,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 02:20:03,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955976478] [2025-03-04 02:20:03,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:20:03,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 02:20:03,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:20:03,663 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 02:20:03,663 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 02:20:03,663 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 49 [2025-03-04 02:20:03,664 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 117 transitions, 1055 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-04 02:20:03,664 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:20:03,664 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 49 [2025-03-04 02:20:03,664 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:20:04,669 INFO L124 PetriNetUnfolderBase]: 13483/18987 cut-off events. [2025-03-04 02:20:04,670 INFO L125 PetriNetUnfolderBase]: For 65002/65002 co-relation queries the response was YES. [2025-03-04 02:20:04,724 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68943 conditions, 18987 events. 13483/18987 cut-off events. For 65002/65002 co-relation queries the response was YES. Maximal size of possible extension queue 934. Compared 108156 event pairs, 4069 based on Foata normal form. 1/18954 useless extension candidates. Maximal degree in co-relation 60132. Up to 8604 conditions per place. [2025-03-04 02:20:04,774 INFO L140 encePairwiseOnDemand]: 42/49 looper letters, 165 selfloop transitions, 23 changer transitions 9/201 dead transitions. [2025-03-04 02:20:04,774 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 201 transitions, 2050 flow [2025-03-04 02:20:04,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 02:20:04,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 02:20:04,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 133 transitions. [2025-03-04 02:20:04,775 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5428571428571428 [2025-03-04 02:20:04,775 INFO L175 Difference]: Start difference. First operand has 88 places, 117 transitions, 1055 flow. Second operand 5 states and 133 transitions. [2025-03-04 02:20:04,775 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 201 transitions, 2050 flow [2025-03-04 02:20:04,892 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 201 transitions, 2008 flow, removed 4 selfloop flow, removed 1 redundant places. [2025-03-04 02:20:04,894 INFO L231 Difference]: Finished difference. Result has 94 places, 129 transitions, 1278 flow [2025-03-04 02:20:04,894 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=1031, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1278, PETRI_PLACES=94, PETRI_TRANSITIONS=129} [2025-03-04 02:20:04,894 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 51 predicate places. [2025-03-04 02:20:04,894 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 129 transitions, 1278 flow [2025-03-04 02:20:04,895 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-04 02:20:04,895 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:20:04,895 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-04 02:20:04,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 02:20:04,895 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-04 02:20:04,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:20:04,895 INFO L85 PathProgramCache]: Analyzing trace with hash 1108052336, now seen corresponding path program 2 times [2025-03-04 02:20:04,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:20:04,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451540946] [2025-03-04 02:20:04,895 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:20:04,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:20:04,904 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 1 equivalence classes. [2025-03-04 02:20:04,913 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 02:20:04,913 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 02:20:04,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:20:04,987 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-04 02:20:04,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:20:04,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451540946] [2025-03-04 02:20:04,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451540946] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:20:04,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:20:04,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 02:20:04,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249824210] [2025-03-04 02:20:04,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:20:04,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 02:20:04,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:20:04,990 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 02:20:04,990 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 02:20:04,990 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 49 [2025-03-04 02:20:04,990 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 129 transitions, 1278 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-04 02:20:04,990 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:20:04,990 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 49 [2025-03-04 02:20:04,990 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:20:05,979 INFO L124 PetriNetUnfolderBase]: 13342/18711 cut-off events. [2025-03-04 02:20:05,979 INFO L125 PetriNetUnfolderBase]: For 79660/79704 co-relation queries the response was YES. [2025-03-04 02:20:06,051 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69435 conditions, 18711 events. 13342/18711 cut-off events. For 79660/79704 co-relation queries the response was YES. Maximal size of possible extension queue 904. Compared 105652 event pairs, 6881 based on Foata normal form. 1/18639 useless extension candidates. Maximal degree in co-relation 63300. Up to 12893 conditions per place. [2025-03-04 02:20:06,108 INFO L140 encePairwiseOnDemand]: 45/49 looper letters, 139 selfloop transitions, 20 changer transitions 16/179 dead transitions. [2025-03-04 02:20:06,108 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 179 transitions, 1830 flow [2025-03-04 02:20:06,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 02:20:06,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 02:20:06,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 130 transitions. [2025-03-04 02:20:06,109 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5306122448979592 [2025-03-04 02:20:06,109 INFO L175 Difference]: Start difference. First operand has 94 places, 129 transitions, 1278 flow. Second operand 5 states and 130 transitions. [2025-03-04 02:20:06,109 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 179 transitions, 1830 flow [2025-03-04 02:20:06,277 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 179 transitions, 1813 flow, removed 6 selfloop flow, removed 1 redundant places. [2025-03-04 02:20:06,278 INFO L231 Difference]: Finished difference. Result has 98 places, 126 transitions, 1261 flow [2025-03-04 02:20:06,278 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=1269, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1261, PETRI_PLACES=98, PETRI_TRANSITIONS=126} [2025-03-04 02:20:06,279 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 55 predicate places. [2025-03-04 02:20:06,279 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 126 transitions, 1261 flow [2025-03-04 02:20:06,279 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-04 02:20:06,279 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:20:06,279 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-04 02:20:06,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 02:20:06,279 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-04 02:20:06,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:20:06,280 INFO L85 PathProgramCache]: Analyzing trace with hash 1234776276, now seen corresponding path program 3 times [2025-03-04 02:20:06,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:20:06,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330280645] [2025-03-04 02:20:06,280 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:20:06,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:20:06,286 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 1 equivalence classes. [2025-03-04 02:20:06,293 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 02:20:06,294 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-04 02:20:06,294 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:20:06,370 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-04 02:20:06,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:20:06,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330280645] [2025-03-04 02:20:06,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330280645] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:20:06,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:20:06,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 02:20:06,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123287616] [2025-03-04 02:20:06,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:20:06,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 02:20:06,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:20:06,371 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 02:20:06,371 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 02:20:06,371 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 49 [2025-03-04 02:20:06,371 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 126 transitions, 1261 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-04 02:20:06,371 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:20:06,371 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 49 [2025-03-04 02:20:06,371 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:20:07,477 INFO L124 PetriNetUnfolderBase]: 13385/18758 cut-off events. [2025-03-04 02:20:07,477 INFO L125 PetriNetUnfolderBase]: For 82108/82152 co-relation queries the response was YES. [2025-03-04 02:20:07,540 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70105 conditions, 18758 events. 13385/18758 cut-off events. For 82108/82152 co-relation queries the response was YES. Maximal size of possible extension queue 903. Compared 105609 event pairs, 6696 based on Foata normal form. 1/18686 useless extension candidates. Maximal degree in co-relation 70030. Up to 12893 conditions per place. [2025-03-04 02:20:07,592 INFO L140 encePairwiseOnDemand]: 42/49 looper letters, 151 selfloop transitions, 26 changer transitions 9/190 dead transitions. [2025-03-04 02:20:07,592 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 190 transitions, 1968 flow [2025-03-04 02:20:07,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 02:20:07,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 02:20:07,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 137 transitions. [2025-03-04 02:20:07,593 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5591836734693878 [2025-03-04 02:20:07,593 INFO L175 Difference]: Start difference. First operand has 98 places, 126 transitions, 1261 flow. Second operand 5 states and 137 transitions. [2025-03-04 02:20:07,593 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 190 transitions, 1968 flow [2025-03-04 02:20:07,789 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 190 transitions, 1920 flow, removed 5 selfloop flow, removed 3 redundant places. [2025-03-04 02:20:07,790 INFO L231 Difference]: Finished difference. Result has 99 places, 130 transitions, 1295 flow [2025-03-04 02:20:07,790 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=1219, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1295, PETRI_PLACES=99, PETRI_TRANSITIONS=130} [2025-03-04 02:20:07,791 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 56 predicate places. [2025-03-04 02:20:07,791 INFO L471 AbstractCegarLoop]: Abstraction has has 99 places, 130 transitions, 1295 flow [2025-03-04 02:20:07,791 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-04 02:20:07,791 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:20:07,791 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:20:07,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 02:20:07,791 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-04 02:20:07,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:20:07,792 INFO L85 PathProgramCache]: Analyzing trace with hash 393835810, now seen corresponding path program 4 times [2025-03-04 02:20:07,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:20:07,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3690350] [2025-03-04 02:20:07,792 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 02:20:07,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:20:07,797 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 26 statements into 2 equivalence classes. [2025-03-04 02:20:07,799 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 22 of 26 statements. [2025-03-04 02:20:07,800 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-04 02:20:07,800 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:20:07,845 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-04 02:20:07,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:20:07,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3690350] [2025-03-04 02:20:07,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3690350] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:20:07,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:20:07,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 02:20:07,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312092876] [2025-03-04 02:20:07,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:20:07,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 02:20:07,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:20:07,847 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 02:20:07,847 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 02:20:07,847 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 49 [2025-03-04 02:20:07,848 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 130 transitions, 1295 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-04 02:20:07,848 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:20:07,848 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 49 [2025-03-04 02:20:07,848 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:20:08,856 INFO L124 PetriNetUnfolderBase]: 13187/18460 cut-off events. [2025-03-04 02:20:08,856 INFO L125 PetriNetUnfolderBase]: For 87226/87270 co-relation queries the response was YES. [2025-03-04 02:20:08,923 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70295 conditions, 18460 events. 13187/18460 cut-off events. For 87226/87270 co-relation queries the response was YES. Maximal size of possible extension queue 885. Compared 103664 event pairs, 7148 based on Foata normal form. 1/18406 useless extension candidates. Maximal degree in co-relation 66167. Up to 14470 conditions per place. [2025-03-04 02:20:08,975 INFO L140 encePairwiseOnDemand]: 45/49 looper letters, 148 selfloop transitions, 10 changer transitions 18/180 dead transitions. [2025-03-04 02:20:08,975 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 180 transitions, 1858 flow [2025-03-04 02:20:08,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 02:20:08,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 02:20:08,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 128 transitions. [2025-03-04 02:20:08,976 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5224489795918368 [2025-03-04 02:20:08,976 INFO L175 Difference]: Start difference. First operand has 99 places, 130 transitions, 1295 flow. Second operand 5 states and 128 transitions. [2025-03-04 02:20:08,976 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 180 transitions, 1858 flow [2025-03-04 02:20:09,190 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 180 transitions, 1816 flow, removed 13 selfloop flow, removed 2 redundant places. [2025-03-04 02:20:09,191 INFO L231 Difference]: Finished difference. Result has 100 places, 125 transitions, 1189 flow [2025-03-04 02:20:09,192 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=1257, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1189, PETRI_PLACES=100, PETRI_TRANSITIONS=125} [2025-03-04 02:20:09,192 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 57 predicate places. [2025-03-04 02:20:09,192 INFO L471 AbstractCegarLoop]: Abstraction has has 100 places, 125 transitions, 1189 flow [2025-03-04 02:20:09,192 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-04 02:20:09,192 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:20:09,192 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-04 02:20:09,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 02:20:09,192 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-04 02:20:09,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:20:09,193 INFO L85 PathProgramCache]: Analyzing trace with hash -987929018, now seen corresponding path program 5 times [2025-03-04 02:20:09,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:20:09,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785211232] [2025-03-04 02:20:09,193 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 02:20:09,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:20:09,198 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 26 statements into 1 equivalence classes. [2025-03-04 02:20:09,202 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 02:20:09,202 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 02:20:09,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:20:09,258 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-04 02:20:09,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:20:09,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785211232] [2025-03-04 02:20:09,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785211232] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:20:09,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:20:09,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 02:20:09,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219314393] [2025-03-04 02:20:09,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:20:09,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 02:20:09,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:20:09,259 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 02:20:09,259 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 02:20:09,259 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 49 [2025-03-04 02:20:09,260 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 125 transitions, 1189 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-04 02:20:09,260 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:20:09,260 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 49 [2025-03-04 02:20:09,260 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:20:10,302 INFO L124 PetriNetUnfolderBase]: 13582/19126 cut-off events. [2025-03-04 02:20:10,302 INFO L125 PetriNetUnfolderBase]: For 84878/84878 co-relation queries the response was YES. [2025-03-04 02:20:10,369 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72491 conditions, 19126 events. 13582/19126 cut-off events. For 84878/84878 co-relation queries the response was YES. Maximal size of possible extension queue 939. Compared 109017 event pairs, 4108 based on Foata normal form. 1/19094 useless extension candidates. Maximal degree in co-relation 72415. Up to 9493 conditions per place. [2025-03-04 02:20:10,541 INFO L140 encePairwiseOnDemand]: 42/49 looper letters, 174 selfloop transitions, 9 changer transitions 10/197 dead transitions. [2025-03-04 02:20:10,541 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 197 transitions, 2024 flow [2025-03-04 02:20:10,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 02:20:10,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 02:20:10,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 133 transitions. [2025-03-04 02:20:10,542 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5428571428571428 [2025-03-04 02:20:10,542 INFO L175 Difference]: Start difference. First operand has 100 places, 125 transitions, 1189 flow. Second operand 5 states and 133 transitions. [2025-03-04 02:20:10,542 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 197 transitions, 2024 flow [2025-03-04 02:20:10,676 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 197 transitions, 1990 flow, removed 7 selfloop flow, removed 3 redundant places. [2025-03-04 02:20:10,677 INFO L231 Difference]: Finished difference. Result has 102 places, 129 transitions, 1220 flow [2025-03-04 02:20:10,677 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=1165, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1220, PETRI_PLACES=102, PETRI_TRANSITIONS=129} [2025-03-04 02:20:10,678 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 59 predicate places. [2025-03-04 02:20:10,678 INFO L471 AbstractCegarLoop]: Abstraction has has 102 places, 129 transitions, 1220 flow [2025-03-04 02:20:10,678 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-04 02:20:10,678 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:20:10,678 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-04 02:20:10,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 02:20:10,678 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-04 02:20:10,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:20:10,679 INFO L85 PathProgramCache]: Analyzing trace with hash -891947968, now seen corresponding path program 6 times [2025-03-04 02:20:10,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:20:10,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091166491] [2025-03-04 02:20:10,679 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 02:20:10,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:20:10,686 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 26 statements into 1 equivalence classes. [2025-03-04 02:20:10,690 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 02:20:10,690 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-04 02:20:10,690 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:20:10,750 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-04 02:20:10,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:20:10,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091166491] [2025-03-04 02:20:10,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091166491] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:20:10,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:20:10,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 02:20:10,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242913877] [2025-03-04 02:20:10,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:20:10,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 02:20:10,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:20:10,752 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 02:20:10,752 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 02:20:10,752 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 49 [2025-03-04 02:20:10,752 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 129 transitions, 1220 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-04 02:20:10,752 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:20:10,752 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 49 [2025-03-04 02:20:10,752 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:20:12,014 INFO L124 PetriNetUnfolderBase]: 13567/19032 cut-off events. [2025-03-04 02:20:12,014 INFO L125 PetriNetUnfolderBase]: For 93451/93495 co-relation queries the response was YES. [2025-03-04 02:20:12,066 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73844 conditions, 19032 events. 13567/19032 cut-off events. For 93451/93495 co-relation queries the response was YES. Maximal size of possible extension queue 934. Compared 107911 event pairs, 7153 based on Foata normal form. 1/18978 useless extension candidates. Maximal degree in co-relation 54008. Up to 14470 conditions per place. [2025-03-04 02:20:12,115 INFO L140 encePairwiseOnDemand]: 42/49 looper letters, 162 selfloop transitions, 15 changer transitions 10/191 dead transitions. [2025-03-04 02:20:12,115 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 191 transitions, 1906 flow [2025-03-04 02:20:12,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 02:20:12,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 02:20:12,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 134 transitions. [2025-03-04 02:20:12,117 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5469387755102041 [2025-03-04 02:20:12,117 INFO L175 Difference]: Start difference. First operand has 102 places, 129 transitions, 1220 flow. Second operand 5 states and 134 transitions. [2025-03-04 02:20:12,117 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 191 transitions, 1906 flow [2025-03-04 02:20:12,281 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 191 transitions, 1885 flow, removed 9 selfloop flow, removed 1 redundant places. [2025-03-04 02:20:12,282 INFO L231 Difference]: Finished difference. Result has 107 places, 131 transitions, 1218 flow [2025-03-04 02:20:12,282 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=1203, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1218, PETRI_PLACES=107, PETRI_TRANSITIONS=131} [2025-03-04 02:20:12,283 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 64 predicate places. [2025-03-04 02:20:12,283 INFO L471 AbstractCegarLoop]: Abstraction has has 107 places, 131 transitions, 1218 flow [2025-03-04 02:20:12,283 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-04 02:20:12,283 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:20:12,283 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-04 02:20:12,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 02:20:12,283 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-04 02:20:12,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:20:12,283 INFO L85 PathProgramCache]: Analyzing trace with hash -995900130, now seen corresponding path program 1 times [2025-03-04 02:20:12,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:20:12,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852603457] [2025-03-04 02:20:12,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:20:12,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:20:12,290 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-04 02:20:12,296 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 02:20:12,296 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:20:12,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:20:12,359 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-04 02:20:12,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:20:12,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852603457] [2025-03-04 02:20:12,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [852603457] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:20:12,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:20:12,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 02:20:12,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50803085] [2025-03-04 02:20:12,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:20:12,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 02:20:12,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:20:12,360 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 02:20:12,360 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 02:20:12,360 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 49 [2025-03-04 02:20:12,360 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 131 transitions, 1218 flow. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 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-04 02:20:12,360 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:20:12,360 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 49 [2025-03-04 02:20:12,360 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:20:13,667 INFO L124 PetriNetUnfolderBase]: 14553/20576 cut-off events. [2025-03-04 02:20:13,668 INFO L125 PetriNetUnfolderBase]: For 102581/102625 co-relation queries the response was YES. [2025-03-04 02:20:13,745 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80362 conditions, 20576 events. 14553/20576 cut-off events. For 102581/102625 co-relation queries the response was YES. Maximal size of possible extension queue 1021. Compared 120000 event pairs, 7176 based on Foata normal form. 1/20526 useless extension candidates. Maximal degree in co-relation 64342. Up to 13769 conditions per place. [2025-03-04 02:20:13,948 INFO L140 encePairwiseOnDemand]: 42/49 looper letters, 173 selfloop transitions, 18 changer transitions 3/198 dead transitions. [2025-03-04 02:20:13,948 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 198 transitions, 1967 flow [2025-03-04 02:20:13,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 02:20:13,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 02:20:13,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 138 transitions. [2025-03-04 02:20:13,949 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.563265306122449 [2025-03-04 02:20:13,949 INFO L175 Difference]: Start difference. First operand has 107 places, 131 transitions, 1218 flow. Second operand 5 states and 138 transitions. [2025-03-04 02:20:13,949 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 198 transitions, 1967 flow [2025-03-04 02:20:14,093 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 198 transitions, 1919 flow, removed 21 selfloop flow, removed 1 redundant places. [2025-03-04 02:20:14,095 INFO L231 Difference]: Finished difference. Result has 111 places, 135 transitions, 1302 flow [2025-03-04 02:20:14,095 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=1182, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1302, PETRI_PLACES=111, PETRI_TRANSITIONS=135} [2025-03-04 02:20:14,096 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 68 predicate places. [2025-03-04 02:20:14,096 INFO L471 AbstractCegarLoop]: Abstraction has has 111 places, 135 transitions, 1302 flow [2025-03-04 02:20:14,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 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-04 02:20:14,096 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:20:14,096 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-04 02:20:14,096 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 02:20:14,096 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-04 02:20:14,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:20:14,097 INFO L85 PathProgramCache]: Analyzing trace with hash -497890148, now seen corresponding path program 2 times [2025-03-04 02:20:14,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:20:14,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333789663] [2025-03-04 02:20:14,097 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:20:14,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:20:14,109 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-03-04 02:20:14,114 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 26 of 27 statements. [2025-03-04 02:20:14,114 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 02:20:14,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:20:14,181 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-04 02:20:14,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:20:14,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333789663] [2025-03-04 02:20:14,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333789663] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:20:14,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:20:14,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 02:20:14,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555386925] [2025-03-04 02:20:14,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:20:14,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 02:20:14,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:20:14,182 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 02:20:14,182 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 02:20:14,182 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 49 [2025-03-04 02:20:14,183 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 135 transitions, 1302 flow. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 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-04 02:20:14,183 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:20:14,183 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 49 [2025-03-04 02:20:14,183 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:20:16,057 INFO L124 PetriNetUnfolderBase]: 14391/20634 cut-off events. [2025-03-04 02:20:16,057 INFO L125 PetriNetUnfolderBase]: For 112546/112634 co-relation queries the response was YES. [2025-03-04 02:20:16,112 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81024 conditions, 20634 events. 14391/20634 cut-off events. For 112546/112634 co-relation queries the response was YES. Maximal size of possible extension queue 1034. Compared 125484 event pairs, 4022 based on Foata normal form. 1/20627 useless extension candidates. Maximal degree in co-relation 75352. Up to 9519 conditions per place. [2025-03-04 02:20:16,162 INFO L140 encePairwiseOnDemand]: 42/49 looper letters, 188 selfloop transitions, 19 changer transitions 3/214 dead transitions. [2025-03-04 02:20:16,162 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 214 transitions, 2338 flow [2025-03-04 02:20:16,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 02:20:16,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 02:20:16,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 137 transitions. [2025-03-04 02:20:16,163 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5591836734693878 [2025-03-04 02:20:16,163 INFO L175 Difference]: Start difference. First operand has 111 places, 135 transitions, 1302 flow. Second operand 5 states and 137 transitions. [2025-03-04 02:20:16,163 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 214 transitions, 2338 flow [2025-03-04 02:20:16,284 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 214 transitions, 2316 flow, removed 3 selfloop flow, removed 1 redundant places. [2025-03-04 02:20:16,286 INFO L231 Difference]: Finished difference. Result has 117 places, 146 transitions, 1610 flow [2025-03-04 02:20:16,286 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=1292, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1610, PETRI_PLACES=117, PETRI_TRANSITIONS=146} [2025-03-04 02:20:16,287 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 74 predicate places. [2025-03-04 02:20:16,287 INFO L471 AbstractCegarLoop]: Abstraction has has 117 places, 146 transitions, 1610 flow [2025-03-04 02:20:16,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 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-04 02:20:16,287 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:20:16,287 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-04 02:20:16,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 02:20:16,287 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-04 02:20:16,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:20:16,288 INFO L85 PathProgramCache]: Analyzing trace with hash 209587556, now seen corresponding path program 3 times [2025-03-04 02:20:16,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:20:16,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439966127] [2025-03-04 02:20:16,288 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:20:16,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:20:16,294 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 27 statements into 2 equivalence classes. [2025-03-04 02:20:16,300 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 26 of 27 statements. [2025-03-04 02:20:16,300 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-04 02:20:16,300 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:20:16,370 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-04 02:20:16,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:20:16,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439966127] [2025-03-04 02:20:16,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [439966127] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:20:16,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:20:16,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 02:20:16,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40149940] [2025-03-04 02:20:16,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:20:16,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 02:20:16,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:20:16,371 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 02:20:16,371 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 02:20:16,371 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 49 [2025-03-04 02:20:16,372 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 146 transitions, 1610 flow. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 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-04 02:20:16,372 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:20:16,372 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 49 [2025-03-04 02:20:16,372 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:20:17,703 INFO L124 PetriNetUnfolderBase]: 14229/20100 cut-off events. [2025-03-04 02:20:17,703 INFO L125 PetriNetUnfolderBase]: For 122266/122310 co-relation queries the response was YES. [2025-03-04 02:20:17,780 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81568 conditions, 20100 events. 14229/20100 cut-off events. For 122266/122310 co-relation queries the response was YES. Maximal size of possible extension queue 980. Compared 116636 event pairs, 7300 based on Foata normal form. 1/20050 useless extension candidates. Maximal degree in co-relation 77467. Up to 13769 conditions per place. [2025-03-04 02:20:17,838 INFO L140 encePairwiseOnDemand]: 42/49 looper letters, 156 selfloop transitions, 30 changer transitions 8/198 dead transitions. [2025-03-04 02:20:17,838 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 198 transitions, 2230 flow [2025-03-04 02:20:17,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 02:20:17,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 02:20:17,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 133 transitions. [2025-03-04 02:20:17,839 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5428571428571428 [2025-03-04 02:20:17,839 INFO L175 Difference]: Start difference. First operand has 117 places, 146 transitions, 1610 flow. Second operand 5 states and 133 transitions. [2025-03-04 02:20:17,839 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 198 transitions, 2230 flow [2025-03-04 02:20:18,035 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 198 transitions, 2196 flow, removed 13 selfloop flow, removed 1 redundant places. [2025-03-04 02:20:18,037 INFO L231 Difference]: Finished difference. Result has 121 places, 143 transitions, 1612 flow [2025-03-04 02:20:18,037 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=1578, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1612, PETRI_PLACES=121, PETRI_TRANSITIONS=143} [2025-03-04 02:20:18,038 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 78 predicate places. [2025-03-04 02:20:18,038 INFO L471 AbstractCegarLoop]: Abstraction has has 121 places, 143 transitions, 1612 flow [2025-03-04 02:20:18,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 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-04 02:20:18,038 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:20:18,038 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-04 02:20:18,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-04 02:20:18,038 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-04 02:20:18,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:20:18,038 INFO L85 PathProgramCache]: Analyzing trace with hash -571069580, now seen corresponding path program 4 times [2025-03-04 02:20:18,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:20:18,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307735290] [2025-03-04 02:20:18,038 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 02:20:18,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:20:18,044 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 27 statements into 2 equivalence classes. [2025-03-04 02:20:18,046 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 22 of 27 statements. [2025-03-04 02:20:18,046 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-04 02:20:18,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:20:18,085 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-04 02:20:18,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:20:18,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307735290] [2025-03-04 02:20:18,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307735290] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:20:18,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:20:18,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 02:20:18,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870425608] [2025-03-04 02:20:18,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:20:18,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 02:20:18,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:20:18,086 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 02:20:18,086 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 02:20:18,086 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 49 [2025-03-04 02:20:18,087 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 143 transitions, 1612 flow. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 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-04 02:20:18,087 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:20:18,087 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 49 [2025-03-04 02:20:18,087 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:20:20,097 INFO L124 PetriNetUnfolderBase]: 18003/25940 cut-off events. [2025-03-04 02:20:20,097 INFO L125 PetriNetUnfolderBase]: For 154194/154274 co-relation queries the response was YES. [2025-03-04 02:20:20,201 INFO L83 FinitePrefix]: Finished finitePrefix Result has 103982 conditions, 25940 events. 18003/25940 cut-off events. For 154194/154274 co-relation queries the response was YES. Maximal size of possible extension queue 1283. Compared 164555 event pairs, 2747 based on Foata normal form. 1/25935 useless extension candidates. Maximal degree in co-relation 101829. Up to 8395 conditions per place. [2025-03-04 02:20:20,286 INFO L140 encePairwiseOnDemand]: 41/49 looper letters, 221 selfloop transitions, 39 changer transitions 4/268 dead transitions. [2025-03-04 02:20:20,286 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 268 transitions, 3073 flow [2025-03-04 02:20:20,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 02:20:20,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 02:20:20,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 177 transitions. [2025-03-04 02:20:20,287 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6020408163265306 [2025-03-04 02:20:20,287 INFO L175 Difference]: Start difference. First operand has 121 places, 143 transitions, 1612 flow. Second operand 6 states and 177 transitions. [2025-03-04 02:20:20,287 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 268 transitions, 3073 flow [2025-03-04 02:20:20,631 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 268 transitions, 2966 flow, removed 8 selfloop flow, removed 4 redundant places. [2025-03-04 02:20:20,633 INFO L231 Difference]: Finished difference. Result has 126 places, 162 transitions, 1937 flow [2025-03-04 02:20:20,633 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=1523, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1937, PETRI_PLACES=126, PETRI_TRANSITIONS=162} [2025-03-04 02:20:20,634 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 83 predicate places. [2025-03-04 02:20:20,634 INFO L471 AbstractCegarLoop]: Abstraction has has 126 places, 162 transitions, 1937 flow [2025-03-04 02:20:20,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 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-04 02:20:20,634 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:20:20,634 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-04 02:20:20,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-04 02:20:20,634 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-04 02:20:20,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:20:20,635 INFO L85 PathProgramCache]: Analyzing trace with hash 517431162, now seen corresponding path program 5 times [2025-03-04 02:20:20,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:20:20,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510731565] [2025-03-04 02:20:20,635 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 02:20:20,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:20:20,642 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-03-04 02:20:20,648 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 02:20:20,648 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:20:20,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:20:20,723 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-04 02:20:20,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:20:20,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510731565] [2025-03-04 02:20:20,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510731565] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:20:20,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:20:20,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 02:20:20,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963429944] [2025-03-04 02:20:20,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:20:20,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 02:20:20,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:20:20,725 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 02:20:20,725 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 02:20:20,726 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 49 [2025-03-04 02:20:20,726 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 162 transitions, 1937 flow. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 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-04 02:20:20,726 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:20:20,726 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 49 [2025-03-04 02:20:20,726 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:20:22,894 INFO L124 PetriNetUnfolderBase]: 17821/25490 cut-off events. [2025-03-04 02:20:22,894 INFO L125 PetriNetUnfolderBase]: For 186118/186118 co-relation queries the response was YES. [2025-03-04 02:20:22,998 INFO L83 FinitePrefix]: Finished finitePrefix Result has 107942 conditions, 25490 events. 17821/25490 cut-off events. For 186118/186118 co-relation queries the response was YES. Maximal size of possible extension queue 1240. Compared 156817 event pairs, 6002 based on Foata normal form. 1/25475 useless extension candidates. Maximal degree in co-relation 103963. Up to 13776 conditions per place. [2025-03-04 02:20:23,070 INFO L140 encePairwiseOnDemand]: 42/49 looper letters, 163 selfloop transitions, 50 changer transitions 8/225 dead transitions. [2025-03-04 02:20:23,071 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 225 transitions, 2767 flow [2025-03-04 02:20:23,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 02:20:23,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 02:20:23,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 133 transitions. [2025-03-04 02:20:23,071 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5428571428571428 [2025-03-04 02:20:23,072 INFO L175 Difference]: Start difference. First operand has 126 places, 162 transitions, 1937 flow. Second operand 5 states and 133 transitions. [2025-03-04 02:20:23,072 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 225 transitions, 2767 flow [2025-03-04 02:20:23,660 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 225 transitions, 2695 flow, removed 36 selfloop flow, removed 0 redundant places. [2025-03-04 02:20:23,662 INFO L231 Difference]: Finished difference. Result has 131 places, 158 transitions, 1913 flow [2025-03-04 02:20:23,662 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=1883, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1913, PETRI_PLACES=131, PETRI_TRANSITIONS=158} [2025-03-04 02:20:23,662 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 88 predicate places. [2025-03-04 02:20:23,663 INFO L471 AbstractCegarLoop]: Abstraction has has 131 places, 158 transitions, 1913 flow [2025-03-04 02:20:23,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 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-04 02:20:23,663 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:20:23,663 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-04 02:20:23,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-04 02:20:23,663 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-04 02:20:23,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:20:23,663 INFO L85 PathProgramCache]: Analyzing trace with hash -1569987560, now seen corresponding path program 6 times [2025-03-04 02:20:23,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:20:23,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904174955] [2025-03-04 02:20:23,663 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 02:20:23,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:20:23,668 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 27 statements into 2 equivalence classes. [2025-03-04 02:20:23,673 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 26 of 27 statements. [2025-03-04 02:20:23,673 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-04 02:20:23,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:20:23,866 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-04 02:20:23,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:20:23,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904174955] [2025-03-04 02:20:23,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904174955] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:20:23,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:20:23,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 02:20:23,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911880958] [2025-03-04 02:20:23,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:20:23,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 02:20:23,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:20:23,868 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 02:20:23,868 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 02:20:23,868 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 49 [2025-03-04 02:20:23,868 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 158 transitions, 1913 flow. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 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-04 02:20:23,868 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:20:23,869 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 49 [2025-03-04 02:20:23,869 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:20:26,236 INFO L124 PetriNetUnfolderBase]: 18133/26002 cut-off events. [2025-03-04 02:20:26,236 INFO L125 PetriNetUnfolderBase]: For 182050/182050 co-relation queries the response was YES. [2025-03-04 02:20:26,324 INFO L83 FinitePrefix]: Finished finitePrefix Result has 107832 conditions, 26002 events. 18133/26002 cut-off events. For 182050/182050 co-relation queries the response was YES. Maximal size of possible extension queue 1267. Compared 161814 event pairs, 3686 based on Foata normal form. 1/25975 useless extension candidates. Maximal degree in co-relation 105741. Up to 9045 conditions per place. [2025-03-04 02:20:26,391 INFO L140 encePairwiseOnDemand]: 41/49 looper letters, 203 selfloop transitions, 67 changer transitions 4/278 dead transitions. [2025-03-04 02:20:26,391 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 278 transitions, 3366 flow [2025-03-04 02:20:26,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 02:20:26,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 02:20:26,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 175 transitions. [2025-03-04 02:20:26,392 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5952380952380952 [2025-03-04 02:20:26,392 INFO L175 Difference]: Start difference. First operand has 131 places, 158 transitions, 1913 flow. Second operand 6 states and 175 transitions. [2025-03-04 02:20:26,392 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 278 transitions, 3366 flow [2025-03-04 02:20:26,728 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 278 transitions, 3251 flow, removed 6 selfloop flow, removed 3 redundant places. [2025-03-04 02:20:26,730 INFO L231 Difference]: Finished difference. Result has 136 places, 169 transitions, 2179 flow [2025-03-04 02:20:26,730 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=1820, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2179, PETRI_PLACES=136, PETRI_TRANSITIONS=169} [2025-03-04 02:20:26,731 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 93 predicate places. [2025-03-04 02:20:26,731 INFO L471 AbstractCegarLoop]: Abstraction has has 136 places, 169 transitions, 2179 flow [2025-03-04 02:20:26,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 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-04 02:20:26,731 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:20:26,731 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-04 02:20:26,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-04 02:20:26,732 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-04 02:20:26,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:20:26,732 INFO L85 PathProgramCache]: Analyzing trace with hash 1705510005, now seen corresponding path program 1 times [2025-03-04 02:20:26,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:20:26,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169364096] [2025-03-04 02:20:26,732 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:20:26,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:20:26,737 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-04 02:20:26,741 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 02:20:26,741 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:20:26,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:20:26,779 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-04 02:20:26,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:20:26,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169364096] [2025-03-04 02:20:26,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169364096] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:20:26,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:20:26,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 02:20:26,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358539288] [2025-03-04 02:20:26,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:20:26,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 02:20:26,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:20:26,781 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 02:20:26,781 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 02:20:26,789 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 49 [2025-03-04 02:20:26,789 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 169 transitions, 2179 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-04 02:20:26,789 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:20:26,790 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 49 [2025-03-04 02:20:26,790 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:20:29,007 INFO L124 PetriNetUnfolderBase]: 18939/27667 cut-off events. [2025-03-04 02:20:29,007 INFO L125 PetriNetUnfolderBase]: For 215106/215106 co-relation queries the response was YES. [2025-03-04 02:20:29,240 INFO L83 FinitePrefix]: Finished finitePrefix Result has 117755 conditions, 27667 events. 18939/27667 cut-off events. For 215106/215106 co-relation queries the response was YES. Maximal size of possible extension queue 1367. Compared 181063 event pairs, 11090 based on Foata normal form. 530/28186 useless extension candidates. Maximal degree in co-relation 114202. Up to 17556 conditions per place. [2025-03-04 02:20:29,464 INFO L140 encePairwiseOnDemand]: 40/49 looper letters, 232 selfloop transitions, 9 changer transitions 65/310 dead transitions. [2025-03-04 02:20:29,464 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 310 transitions, 4493 flow [2025-03-04 02:20:29,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 02:20:29,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 02:20:29,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 145 transitions. [2025-03-04 02:20:29,465 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4931972789115646 [2025-03-04 02:20:29,465 INFO L175 Difference]: Start difference. First operand has 136 places, 169 transitions, 2179 flow. Second operand 6 states and 145 transitions. [2025-03-04 02:20:29,465 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 310 transitions, 4493 flow [2025-03-04 02:20:30,121 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 310 transitions, 4395 flow, removed 46 selfloop flow, removed 1 redundant places. [2025-03-04 02:20:30,124 INFO L231 Difference]: Finished difference. Result has 143 places, 166 transitions, 2144 flow [2025-03-04 02:20:30,125 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=2071, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=154, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2144, PETRI_PLACES=143, PETRI_TRANSITIONS=166} [2025-03-04 02:20:30,125 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 100 predicate places. [2025-03-04 02:20:30,125 INFO L471 AbstractCegarLoop]: Abstraction has has 143 places, 166 transitions, 2144 flow [2025-03-04 02:20:30,125 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-04 02:20:30,125 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:20:30,125 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-04 02:20:30,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-04 02:20:30,125 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-04 02:20:30,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:20:30,126 INFO L85 PathProgramCache]: Analyzing trace with hash 1669589348, now seen corresponding path program 1 times [2025-03-04 02:20:30,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:20:30,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353438659] [2025-03-04 02:20:30,126 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:20:30,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:20:30,133 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-04 02:20:30,138 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 02:20:30,138 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:20:30,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:20:30,206 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-04 02:20:30,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:20:30,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353438659] [2025-03-04 02:20:30,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353438659] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:20:30,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:20:30,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 02:20:30,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988939378] [2025-03-04 02:20:30,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:20:30,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 02:20:30,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:20:30,207 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 02:20:30,207 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 02:20:30,207 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 49 [2025-03-04 02:20:30,207 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 166 transitions, 2144 flow. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 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-04 02:20:30,207 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:20:30,208 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 49 [2025-03-04 02:20:30,208 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:20:32,664 INFO L124 PetriNetUnfolderBase]: 18533/26924 cut-off events. [2025-03-04 02:20:32,664 INFO L125 PetriNetUnfolderBase]: For 197720/197720 co-relation queries the response was YES. [2025-03-04 02:20:32,962 INFO L83 FinitePrefix]: Finished finitePrefix Result has 112901 conditions, 26924 events. 18533/26924 cut-off events. For 197720/197720 co-relation queries the response was YES. Maximal size of possible extension queue 1355. Compared 174889 event pairs, 8275 based on Foata normal form. 1/26912 useless extension candidates. Maximal degree in co-relation 107446. Up to 14446 conditions per place. [2025-03-04 02:20:33,044 INFO L140 encePairwiseOnDemand]: 42/49 looper letters, 210 selfloop transitions, 20 changer transitions 3/237 dead transitions. [2025-03-04 02:20:33,044 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 237 transitions, 3086 flow [2025-03-04 02:20:33,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 02:20:33,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 02:20:33,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 139 transitions. [2025-03-04 02:20:33,045 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5673469387755102 [2025-03-04 02:20:33,045 INFO L175 Difference]: Start difference. First operand has 143 places, 166 transitions, 2144 flow. Second operand 5 states and 139 transitions. [2025-03-04 02:20:33,045 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 237 transitions, 3086 flow [2025-03-04 02:20:33,789 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 237 transitions, 3053 flow, removed 9 selfloop flow, removed 4 redundant places. [2025-03-04 02:20:33,791 INFO L231 Difference]: Finished difference. Result has 145 places, 175 transitions, 2348 flow [2025-03-04 02:20:33,791 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=2123, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2348, PETRI_PLACES=145, PETRI_TRANSITIONS=175} [2025-03-04 02:20:33,791 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 102 predicate places. [2025-03-04 02:20:33,792 INFO L471 AbstractCegarLoop]: Abstraction has has 145 places, 175 transitions, 2348 flow [2025-03-04 02:20:33,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 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-04 02:20:33,792 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:20:33,792 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-04 02:20:33,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-04 02:20:33,792 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-04 02:20:33,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:20:33,792 INFO L85 PathProgramCache]: Analyzing trace with hash -1588024236, now seen corresponding path program 2 times [2025-03-04 02:20:33,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:20:33,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540586182] [2025-03-04 02:20:33,793 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:20:33,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:20:33,797 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-03-04 02:20:33,800 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 26 of 27 statements. [2025-03-04 02:20:33,800 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 02:20:33,801 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:20:33,849 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-04 02:20:33,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:20:33,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540586182] [2025-03-04 02:20:33,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1540586182] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:20:33,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:20:33,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 02:20:33,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005315069] [2025-03-04 02:20:33,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:20:33,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 02:20:33,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:20:33,850 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 02:20:33,850 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 02:20:33,850 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 49 [2025-03-04 02:20:33,850 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 175 transitions, 2348 flow. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 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-04 02:20:33,850 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:20:33,850 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 49 [2025-03-04 02:20:33,851 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:20:36,342 INFO L124 PetriNetUnfolderBase]: 18515/26946 cut-off events. [2025-03-04 02:20:36,342 INFO L125 PetriNetUnfolderBase]: For 208835/208835 co-relation queries the response was YES. [2025-03-04 02:20:36,562 INFO L83 FinitePrefix]: Finished finitePrefix Result has 112425 conditions, 26946 events. 18515/26946 cut-off events. For 208835/208835 co-relation queries the response was YES. Maximal size of possible extension queue 1321. Compared 174688 event pairs, 9531 based on Foata normal form. 1/26930 useless extension candidates. Maximal degree in co-relation 108981. Up to 21208 conditions per place. [2025-03-04 02:20:36,640 INFO L140 encePairwiseOnDemand]: 42/49 looper letters, 210 selfloop transitions, 22 changer transitions 3/239 dead transitions. [2025-03-04 02:20:36,640 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 239 transitions, 3212 flow [2025-03-04 02:20:36,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 02:20:36,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 02:20:36,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 136 transitions. [2025-03-04 02:20:36,641 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5551020408163265 [2025-03-04 02:20:36,641 INFO L175 Difference]: Start difference. First operand has 145 places, 175 transitions, 2348 flow. Second operand 5 states and 136 transitions. [2025-03-04 02:20:36,641 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 239 transitions, 3212 flow [2025-03-04 02:20:37,203 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 239 transitions, 3186 flow, removed 7 selfloop flow, removed 1 redundant places. [2025-03-04 02:20:37,205 INFO L231 Difference]: Finished difference. Result has 150 places, 177 transitions, 2436 flow [2025-03-04 02:20:37,206 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=2327, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=175, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=153, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2436, PETRI_PLACES=150, PETRI_TRANSITIONS=177} [2025-03-04 02:20:37,206 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 107 predicate places. [2025-03-04 02:20:37,206 INFO L471 AbstractCegarLoop]: Abstraction has has 150 places, 177 transitions, 2436 flow [2025-03-04 02:20:37,206 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 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-04 02:20:37,206 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:20:37,206 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-04 02:20:37,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-04 02:20:37,206 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-04 02:20:37,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:20:37,207 INFO L85 PathProgramCache]: Analyzing trace with hash -478141022, now seen corresponding path program 3 times [2025-03-04 02:20:37,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:20:37,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750492691] [2025-03-04 02:20:37,207 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:20:37,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:20:37,213 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 27 statements into 2 equivalence classes. [2025-03-04 02:20:37,219 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 26 of 27 statements. [2025-03-04 02:20:37,220 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-04 02:20:37,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:20:37,269 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-04 02:20:37,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:20:37,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750492691] [2025-03-04 02:20:37,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750492691] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:20:37,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:20:37,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 02:20:37,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878539988] [2025-03-04 02:20:37,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:20:37,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 02:20:37,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:20:37,271 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 02:20:37,272 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 02:20:37,272 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 49 [2025-03-04 02:20:37,272 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 177 transitions, 2436 flow. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 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-04 02:20:37,272 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:20:37,272 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 49 [2025-03-04 02:20:37,272 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:20:40,123 INFO L124 PetriNetUnfolderBase]: 22195/32428 cut-off events. [2025-03-04 02:20:40,123 INFO L125 PetriNetUnfolderBase]: For 243914/243914 co-relation queries the response was YES. [2025-03-04 02:20:40,466 INFO L83 FinitePrefix]: Finished finitePrefix Result has 134346 conditions, 32428 events. 22195/32428 cut-off events. For 243914/243914 co-relation queries the response was YES. Maximal size of possible extension queue 1623. Compared 216746 event pairs, 4877 based on Foata normal form. 1/32424 useless extension candidates. Maximal degree in co-relation 131938. Up to 8478 conditions per place. [2025-03-04 02:20:40,561 INFO L140 encePairwiseOnDemand]: 41/49 looper letters, 213 selfloop transitions, 63 changer transitions 4/284 dead transitions. [2025-03-04 02:20:40,561 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 284 transitions, 3740 flow [2025-03-04 02:20:40,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 02:20:40,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 02:20:40,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 177 transitions. [2025-03-04 02:20:40,562 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6020408163265306 [2025-03-04 02:20:40,562 INFO L175 Difference]: Start difference. First operand has 150 places, 177 transitions, 2436 flow. Second operand 6 states and 177 transitions. [2025-03-04 02:20:40,562 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 284 transitions, 3740 flow [2025-03-04 02:20:41,205 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 284 transitions, 3697 flow, removed 7 selfloop flow, removed 2 redundant places. [2025-03-04 02:20:41,207 INFO L231 Difference]: Finished difference. Result has 158 places, 192 transitions, 2910 flow [2025-03-04 02:20:41,208 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=2407, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=177, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2910, PETRI_PLACES=158, PETRI_TRANSITIONS=192} [2025-03-04 02:20:41,208 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 115 predicate places. [2025-03-04 02:20:41,208 INFO L471 AbstractCegarLoop]: Abstraction has has 158 places, 192 transitions, 2910 flow [2025-03-04 02:20:41,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 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-04 02:20:41,208 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:20:41,208 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-04 02:20:41,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-04 02:20:41,208 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-04 02:20:41,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:20:41,209 INFO L85 PathProgramCache]: Analyzing trace with hash 1257761300, now seen corresponding path program 4 times [2025-03-04 02:20:41,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:20:41,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822686759] [2025-03-04 02:20:41,209 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 02:20:41,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:20:41,213 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 27 statements into 2 equivalence classes. [2025-03-04 02:20:41,215 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 22 of 27 statements. [2025-03-04 02:20:41,215 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-04 02:20:41,215 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:20:41,249 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-04 02:20:41,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:20:41,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822686759] [2025-03-04 02:20:41,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822686759] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:20:41,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:20:41,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 02:20:41,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057888207] [2025-03-04 02:20:41,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:20:41,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 02:20:41,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:20:41,251 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 02:20:41,251 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 02:20:41,251 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 49 [2025-03-04 02:20:41,251 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 192 transitions, 2910 flow. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 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-04 02:20:41,251 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:20:41,251 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 49 [2025-03-04 02:20:41,251 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:20:44,617 INFO L124 PetriNetUnfolderBase]: 22078/32203 cut-off events. [2025-03-04 02:20:44,617 INFO L125 PetriNetUnfolderBase]: For 286294/286294 co-relation queries the response was YES. [2025-03-04 02:20:44,925 INFO L83 FinitePrefix]: Finished finitePrefix Result has 141962 conditions, 32203 events. 22078/32203 cut-off events. For 286294/286294 co-relation queries the response was YES. Maximal size of possible extension queue 1614. Compared 214866 event pairs, 12111 based on Foata normal form. 1/32187 useless extension candidates. Maximal degree in co-relation 139735. Up to 26344 conditions per place. [2025-03-04 02:20:45,021 INFO L140 encePairwiseOnDemand]: 42/49 looper letters, 204 selfloop transitions, 28 changer transitions 7/243 dead transitions. [2025-03-04 02:20:45,021 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 243 transitions, 3643 flow [2025-03-04 02:20:45,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 02:20:45,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 02:20:45,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 131 transitions. [2025-03-04 02:20:45,022 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5346938775510204 [2025-03-04 02:20:45,022 INFO L175 Difference]: Start difference. First operand has 158 places, 192 transitions, 2910 flow. Second operand 5 states and 131 transitions. [2025-03-04 02:20:45,022 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 243 transitions, 3643 flow [2025-03-04 02:20:46,473 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 243 transitions, 3607 flow, removed 16 selfloop flow, removed 1 redundant places. [2025-03-04 02:20:46,476 INFO L231 Difference]: Finished difference. Result has 162 places, 188 transitions, 2877 flow [2025-03-04 02:20:46,476 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=2876, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=192, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=164, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2877, PETRI_PLACES=162, PETRI_TRANSITIONS=188} [2025-03-04 02:20:46,476 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 119 predicate places. [2025-03-04 02:20:46,476 INFO L471 AbstractCegarLoop]: Abstraction has has 162 places, 188 transitions, 2877 flow [2025-03-04 02:20:46,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 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-04 02:20:46,476 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:20:46,476 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:20:46,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-04 02:20:46,476 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-04 02:20:46,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:20:46,477 INFO L85 PathProgramCache]: Analyzing trace with hash -1262569122, now seen corresponding path program 5 times [2025-03-04 02:20:46,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:20:46,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422075671] [2025-03-04 02:20:46,477 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 02:20:46,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:20:46,481 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-03-04 02:20:46,485 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 02:20:46,485 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:20:46,485 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:20:46,533 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-04 02:20:46,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:20:46,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422075671] [2025-03-04 02:20:46,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422075671] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:20:46,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:20:46,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 02:20:46,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600201120] [2025-03-04 02:20:46,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:20:46,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 02:20:46,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:20:46,534 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 02:20:46,534 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 02:20:46,534 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 49 [2025-03-04 02:20:46,535 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 188 transitions, 2877 flow. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 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-04 02:20:46,535 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:20:46,535 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 49 [2025-03-04 02:20:46,535 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand