./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/chl-word-subst.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f8ab0bd5 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/chl-word-subst.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 1c6ecf58df9dd6f4f380af0d7ef563f293bde5430d47e04b9ba5ac44168fc198 --- Real Ultimate output --- This is Ultimate 0.3.0-?-f8ab0bd-m [2025-03-13 21:43:43,146 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-13 21:43:43,192 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-13 21:43:43,198 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-13 21:43:43,198 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-13 21:43:43,219 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-13 21:43:43,220 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-13 21:43:43,220 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-13 21:43:43,220 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-13 21:43:43,221 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-13 21:43:43,221 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-13 21:43:43,222 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-13 21:43:43,222 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-13 21:43:43,222 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-13 21:43:43,222 INFO L153 SettingsManager]: * Use SBE=true [2025-03-13 21:43:43,223 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-13 21:43:43,223 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-13 21:43:43,223 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-13 21:43:43,223 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-13 21:43:43,223 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-13 21:43:43,223 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-13 21:43:43,223 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-13 21:43:43,223 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-13 21:43:43,223 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-13 21:43:43,223 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-13 21:43:43,223 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-13 21:43:43,223 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-13 21:43:43,223 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-13 21:43:43,224 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-13 21:43:43,224 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-13 21:43:43,224 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-13 21:43:43,224 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-13 21:43:43,224 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 21:43:43,224 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-13 21:43:43,224 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-13 21:43:43,224 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-13 21:43:43,224 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-13 21:43:43,225 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-13 21:43:43,225 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-13 21:43:43,225 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-13 21:43:43,225 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-13 21:43:43,225 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-13 21:43:43,225 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-13 21:43:43,225 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 -> 1c6ecf58df9dd6f4f380af0d7ef563f293bde5430d47e04b9ba5ac44168fc198 [2025-03-13 21:43:43,463 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-13 21:43:43,470 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-13 21:43:43,472 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-13 21:43:43,473 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-13 21:43:43,473 INFO L274 PluginConnector]: CDTParser initialized [2025-03-13 21:43:43,474 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-word-subst.wvr.c [2025-03-13 21:43:44,638 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/32d90342a/c59c37c4f1104b5eb815858e55828f1c/FLAG04c5d4799 [2025-03-13 21:43:44,845 INFO L384 CDTParser]: Found 1 translation units. [2025-03-13 21:43:44,846 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-word-subst.wvr.c [2025-03-13 21:43:44,854 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/32d90342a/c59c37c4f1104b5eb815858e55828f1c/FLAG04c5d4799 [2025-03-13 21:43:44,865 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/32d90342a/c59c37c4f1104b5eb815858e55828f1c [2025-03-13 21:43:44,866 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-13 21:43:44,867 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-13 21:43:44,868 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-13 21:43:44,869 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-13 21:43:44,872 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-13 21:43:44,872 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 09:43:44" (1/1) ... [2025-03-13 21:43:44,874 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@65e61abc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:43:44, skipping insertion in model container [2025-03-13 21:43:44,874 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 09:43:44" (1/1) ... [2025-03-13 21:43:44,884 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-13 21:43:44,992 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-subst.wvr.c[3384,3397] [2025-03-13 21:43:45,003 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 21:43:45,010 INFO L200 MainTranslator]: Completed pre-run [2025-03-13 21:43:45,025 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-subst.wvr.c[3384,3397] [2025-03-13 21:43:45,027 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 21:43:45,037 INFO L204 MainTranslator]: Completed translation [2025-03-13 21:43:45,038 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:43:45 WrapperNode [2025-03-13 21:43:45,038 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-13 21:43:45,039 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-13 21:43:45,040 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-13 21:43:45,040 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-13 21:43:45,044 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:43:45" (1/1) ... [2025-03-13 21:43:45,051 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:43:45" (1/1) ... [2025-03-13 21:43:45,066 INFO L138 Inliner]: procedures = 24, calls = 30, calls flagged for inlining = 9, calls inlined = 13, statements flattened = 160 [2025-03-13 21:43:45,068 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-13 21:43:45,068 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-13 21:43:45,069 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-13 21:43:45,069 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-13 21:43:45,074 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:43:45" (1/1) ... [2025-03-13 21:43:45,074 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:43:45" (1/1) ... [2025-03-13 21:43:45,076 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:43:45" (1/1) ... [2025-03-13 21:43:45,086 INFO L175 MemorySlicer]: Split 17 memory accesses to 2 slices as follows [2, 15]. 88 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 3 writes are split as follows [0, 3]. [2025-03-13 21:43:45,086 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:43:45" (1/1) ... [2025-03-13 21:43:45,087 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:43:45" (1/1) ... [2025-03-13 21:43:45,099 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:43:45" (1/1) ... [2025-03-13 21:43:45,099 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:43:45" (1/1) ... [2025-03-13 21:43:45,100 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:43:45" (1/1) ... [2025-03-13 21:43:45,105 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:43:45" (1/1) ... [2025-03-13 21:43:45,107 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-13 21:43:45,107 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-13 21:43:45,107 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-13 21:43:45,108 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-13 21:43:45,109 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:43:45" (1/1) ... [2025-03-13 21:43:45,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 21:43:45,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:43:45,130 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-13 21:43:45,132 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-13 21:43:45,148 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-13 21:43:45,149 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-13 21:43:45,149 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-13 21:43:45,149 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-13 21:43:45,149 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-13 21:43:45,149 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-13 21:43:45,149 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-13 21:43:45,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-13 21:43:45,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-13 21:43:45,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-13 21:43:45,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-13 21:43:45,150 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-13 21:43:45,150 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-13 21:43:45,150 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-13 21:43:45,150 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-13 21:43:45,150 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-13 21:43:45,151 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-13 21:43:45,233 INFO L256 CfgBuilder]: Building ICFG [2025-03-13 21:43:45,234 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-13 21:43:45,505 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-13 21:43:45,506 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-13 21:43:45,506 INFO L318 CfgBuilder]: Performing block encoding [2025-03-13 21:43:45,767 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-13 21:43:45,768 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 09:43:45 BoogieIcfgContainer [2025-03-13 21:43:45,768 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-13 21:43:45,769 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-13 21:43:45,769 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-13 21:43:45,773 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-13 21:43:45,773 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.03 09:43:44" (1/3) ... [2025-03-13 21:43:45,773 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e2b41ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 09:43:45, skipping insertion in model container [2025-03-13 21:43:45,773 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:43:45" (2/3) ... [2025-03-13 21:43:45,773 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e2b41ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 09:43:45, skipping insertion in model container [2025-03-13 21:43:45,774 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 09:43:45" (3/3) ... [2025-03-13 21:43:45,774 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-word-subst.wvr.c [2025-03-13 21:43:45,786 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-13 21:43:45,787 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-word-subst.wvr.c that has 4 procedures, 38 locations, 1 initial locations, 6 loop locations, and 1 error locations. [2025-03-13 21:43:45,787 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-13 21:43:45,839 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-13 21:43:45,871 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 49 transitions, 119 flow [2025-03-13 21:43:45,898 INFO L124 PetriNetUnfolderBase]: 12/46 cut-off events. [2025-03-13 21:43:45,900 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-13 21:43:45,904 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-13 21:43:45,904 INFO L82 GeneralOperation]: Start removeDead. Operand has 47 places, 49 transitions, 119 flow [2025-03-13 21:43:45,907 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 43 places, 45 transitions, 108 flow [2025-03-13 21:43:45,913 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 21:43:45,922 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;@560e1cc2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 21:43:45,923 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-03-13 21:43:45,938 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 21:43:45,938 INFO L124 PetriNetUnfolderBase]: 12/44 cut-off events. [2025-03-13 21:43:45,938 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-13 21:43:45,938 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:43:45,939 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:43:45,939 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-13 21:43:45,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:43:45,943 INFO L85 PathProgramCache]: Analyzing trace with hash -1587187905, now seen corresponding path program 1 times [2025-03-13 21:43:45,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:43:45,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770998805] [2025-03-13 21:43:45,948 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:43:45,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:43:46,006 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-13 21:43:46,051 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-13 21:43:46,052 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:43:46,052 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:43:46,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:43:46,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:43:46,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770998805] [2025-03-13 21:43:46,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770998805] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:43:46,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:43:46,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-13 21:43:46,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557783674] [2025-03-13 21:43:46,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:43:46,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:43:46,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:43:46,363 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:43:46,364 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:43:46,366 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 49 [2025-03-13 21:43:46,367 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 45 transitions, 108 flow. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:43:46,369 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:43:46,369 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 49 [2025-03-13 21:43:46,369 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:43:46,784 INFO L124 PetriNetUnfolderBase]: 3108/4257 cut-off events. [2025-03-13 21:43:46,785 INFO L125 PetriNetUnfolderBase]: For 243/243 co-relation queries the response was YES. [2025-03-13 21:43:46,792 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8664 conditions, 4257 events. 3108/4257 cut-off events. For 243/243 co-relation queries the response was YES. Maximal size of possible extension queue 194. Compared 18152 event pairs, 1260 based on Foata normal form. 1/3476 useless extension candidates. Maximal degree in co-relation 7777. Up to 2653 conditions per place. [2025-03-13 21:43:46,810 INFO L140 encePairwiseOnDemand]: 45/49 looper letters, 60 selfloop transitions, 2 changer transitions 5/71 dead transitions. [2025-03-13 21:43:46,812 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 71 transitions, 309 flow [2025-03-13 21:43:46,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:43:46,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:43:46,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 89 transitions. [2025-03-13 21:43:46,823 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6054421768707483 [2025-03-13 21:43:46,824 INFO L175 Difference]: Start difference. First operand has 43 places, 45 transitions, 108 flow. Second operand 3 states and 89 transitions. [2025-03-13 21:43:46,825 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 71 transitions, 309 flow [2025-03-13 21:43:46,831 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 71 transitions, 287 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-13 21:43:46,833 INFO L231 Difference]: Finished difference. Result has 40 places, 45 transitions, 106 flow [2025-03-13 21:43:46,836 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=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=106, PETRI_PLACES=40, PETRI_TRANSITIONS=45} [2025-03-13 21:43:46,840 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, -3 predicate places. [2025-03-13 21:43:46,840 INFO L471 AbstractCegarLoop]: Abstraction has has 40 places, 45 transitions, 106 flow [2025-03-13 21:43:46,841 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:43:46,841 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:43:46,841 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:43:46,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-13 21:43:46,842 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-13 21:43:46,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:43:46,843 INFO L85 PathProgramCache]: Analyzing trace with hash -23630285, now seen corresponding path program 1 times [2025-03-13 21:43:46,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:43:46,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168919588] [2025-03-13 21:43:46,843 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:43:46,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:43:46,858 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-13 21:43:46,908 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-13 21:43:46,911 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:43:46,911 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:43:47,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:43:47,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:43:47,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168919588] [2025-03-13 21:43:47,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1168919588] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:43:47,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:43:47,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 21:43:47,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519124333] [2025-03-13 21:43:47,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:43:47,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-13 21:43:47,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:43:47,478 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-13 21:43:47,478 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-13 21:43:47,478 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 49 [2025-03-13 21:43:47,479 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 45 transitions, 106 flow. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:43:47,479 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:43:47,479 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 49 [2025-03-13 21:43:47,479 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:43:47,948 INFO L124 PetriNetUnfolderBase]: 3001/4191 cut-off events. [2025-03-13 21:43:47,948 INFO L125 PetriNetUnfolderBase]: For 503/503 co-relation queries the response was YES. [2025-03-13 21:43:47,952 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8937 conditions, 4191 events. 3001/4191 cut-off events. For 503/503 co-relation queries the response was YES. Maximal size of possible extension queue 193. Compared 18958 event pairs, 391 based on Foata normal form. 1/3699 useless extension candidates. Maximal degree in co-relation 7011. Up to 2563 conditions per place. [2025-03-13 21:43:47,964 INFO L140 encePairwiseOnDemand]: 45/49 looper letters, 81 selfloop transitions, 2 changer transitions 13/100 dead transitions. [2025-03-13 21:43:47,965 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 100 transitions, 435 flow [2025-03-13 21:43:47,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-13 21:43:47,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-13 21:43:47,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 129 transitions. [2025-03-13 21:43:47,966 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5265306122448979 [2025-03-13 21:43:47,969 INFO L175 Difference]: Start difference. First operand has 40 places, 45 transitions, 106 flow. Second operand 5 states and 129 transitions. [2025-03-13 21:43:47,969 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 100 transitions, 435 flow [2025-03-13 21:43:47,987 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 100 transitions, 425 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-03-13 21:43:47,988 INFO L231 Difference]: Finished difference. Result has 46 places, 46 transitions, 117 flow [2025-03-13 21:43:47,989 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=117, PETRI_PLACES=46, PETRI_TRANSITIONS=46} [2025-03-13 21:43:47,989 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 3 predicate places. [2025-03-13 21:43:47,989 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 46 transitions, 117 flow [2025-03-13 21:43:47,989 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:43:47,989 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:43:47,990 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:43:47,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-13 21:43:47,992 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-13 21:43:47,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:43:47,993 INFO L85 PathProgramCache]: Analyzing trace with hash 1956981085, now seen corresponding path program 2 times [2025-03-13 21:43:47,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:43:47,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347642062] [2025-03-13 21:43:47,993 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:43:47,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:43:48,005 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 1 equivalence classes. [2025-03-13 21:43:48,022 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-13 21:43:48,023 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-13 21:43:48,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:43:48,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:43:48,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:43:48,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347642062] [2025-03-13 21:43:48,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347642062] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:43:48,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:43:48,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 21:43:48,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995827112] [2025-03-13 21:43:48,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:43:48,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-13 21:43:48,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:43:48,543 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-13 21:43:48,543 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-13 21:43:48,543 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 49 [2025-03-13 21:43:48,544 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 46 transitions, 117 flow. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:43:48,544 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:43:48,544 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 49 [2025-03-13 21:43:48,544 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:43:48,980 INFO L124 PetriNetUnfolderBase]: 3423/4867 cut-off events. [2025-03-13 21:43:48,980 INFO L125 PetriNetUnfolderBase]: For 1203/1203 co-relation queries the response was YES. [2025-03-13 21:43:48,984 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10685 conditions, 4867 events. 3423/4867 cut-off events. For 1203/1203 co-relation queries the response was YES. Maximal size of possible extension queue 247. Compared 23166 event pairs, 1590 based on Foata normal form. 1/4577 useless extension candidates. Maximal degree in co-relation 10662. Up to 2966 conditions per place. [2025-03-13 21:43:48,998 INFO L140 encePairwiseOnDemand]: 45/49 looper letters, 76 selfloop transitions, 3 changer transitions 14/97 dead transitions. [2025-03-13 21:43:48,998 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 97 transitions, 445 flow [2025-03-13 21:43:48,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-13 21:43:48,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-13 21:43:48,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 124 transitions. [2025-03-13 21:43:49,000 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5061224489795918 [2025-03-13 21:43:49,000 INFO L175 Difference]: Start difference. First operand has 46 places, 46 transitions, 117 flow. Second operand 5 states and 124 transitions. [2025-03-13 21:43:49,001 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 97 transitions, 445 flow [2025-03-13 21:43:49,005 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 97 transitions, 436 flow, removed 3 selfloop flow, removed 2 redundant places. [2025-03-13 21:43:49,006 INFO L231 Difference]: Finished difference. Result has 50 places, 47 transitions, 134 flow [2025-03-13 21:43:49,006 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=134, PETRI_PLACES=50, PETRI_TRANSITIONS=47} [2025-03-13 21:43:49,007 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 7 predicate places. [2025-03-13 21:43:49,007 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 47 transitions, 134 flow [2025-03-13 21:43:49,007 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:43:49,007 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:43:49,008 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:43:49,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-13 21:43:49,008 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-13 21:43:49,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:43:49,009 INFO L85 PathProgramCache]: Analyzing trace with hash -239834439, now seen corresponding path program 3 times [2025-03-13 21:43:49,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:43:49,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830444924] [2025-03-13 21:43:49,009 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-13 21:43:49,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:43:49,019 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 1 equivalence classes. [2025-03-13 21:43:49,046 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-13 21:43:49,046 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-13 21:43:49,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:43:49,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:43:49,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:43:49,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830444924] [2025-03-13 21:43:49,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830444924] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:43:49,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:43:49,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 21:43:49,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528019394] [2025-03-13 21:43:49,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:43:49,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-13 21:43:49,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:43:49,270 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-13 21:43:49,270 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-13 21:43:49,270 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 49 [2025-03-13 21:43:49,270 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 47 transitions, 134 flow. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:43:49,270 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:43:49,270 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 49 [2025-03-13 21:43:49,270 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:43:49,703 INFO L124 PetriNetUnfolderBase]: 3981/5671 cut-off events. [2025-03-13 21:43:49,704 INFO L125 PetriNetUnfolderBase]: For 2356/2356 co-relation queries the response was YES. [2025-03-13 21:43:49,711 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12870 conditions, 5671 events. 3981/5671 cut-off events. For 2356/2356 co-relation queries the response was YES. Maximal size of possible extension queue 294. Compared 28555 event pairs, 691 based on Foata normal form. 1/5370 useless extension candidates. Maximal degree in co-relation 12841. Up to 3752 conditions per place. [2025-03-13 21:43:49,730 INFO L140 encePairwiseOnDemand]: 45/49 looper letters, 79 selfloop transitions, 3 changer transitions 14/100 dead transitions. [2025-03-13 21:43:49,730 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 100 transitions, 471 flow [2025-03-13 21:43:49,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-13 21:43:49,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-13 21:43:49,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 127 transitions. [2025-03-13 21:43:49,733 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5183673469387755 [2025-03-13 21:43:49,733 INFO L175 Difference]: Start difference. First operand has 50 places, 47 transitions, 134 flow. Second operand 5 states and 127 transitions. [2025-03-13 21:43:49,733 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 100 transitions, 471 flow [2025-03-13 21:43:49,745 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 100 transitions, 460 flow, removed 4 selfloop flow, removed 2 redundant places. [2025-03-13 21:43:49,747 INFO L231 Difference]: Finished difference. Result has 54 places, 48 transitions, 149 flow [2025-03-13 21:43:49,747 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=149, PETRI_PLACES=54, PETRI_TRANSITIONS=48} [2025-03-13 21:43:49,747 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 11 predicate places. [2025-03-13 21:43:49,748 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 48 transitions, 149 flow [2025-03-13 21:43:49,748 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:43:49,748 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:43:49,748 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:43:49,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-13 21:43:49,748 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-13 21:43:49,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:43:49,749 INFO L85 PathProgramCache]: Analyzing trace with hash -1238259779, now seen corresponding path program 4 times [2025-03-13 21:43:49,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:43:49,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65753778] [2025-03-13 21:43:49,749 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-13 21:43:49,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:43:49,758 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 26 statements into 2 equivalence classes. [2025-03-13 21:43:49,765 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 22 of 26 statements. [2025-03-13 21:43:49,768 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-13 21:43:49,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:43:50,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:43:50,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:43:50,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65753778] [2025-03-13 21:43:50,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [65753778] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:43:50,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:43:50,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 21:43:50,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376732273] [2025-03-13 21:43:50,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:43:50,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-13 21:43:50,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:43:50,037 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-13 21:43:50,037 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-13 21:43:50,037 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 49 [2025-03-13 21:43:50,037 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 48 transitions, 149 flow. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:43:50,038 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:43:50,038 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 49 [2025-03-13 21:43:50,038 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:43:50,585 INFO L124 PetriNetUnfolderBase]: 4636/6589 cut-off events. [2025-03-13 21:43:50,586 INFO L125 PetriNetUnfolderBase]: For 4345/4345 co-relation queries the response was YES. [2025-03-13 21:43:50,597 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15386 conditions, 6589 events. 4636/6589 cut-off events. For 4345/4345 co-relation queries the response was YES. Maximal size of possible extension queue 337. Compared 33126 event pairs, 873 based on Foata normal form. 1/6247 useless extension candidates. Maximal degree in co-relation 15347. Up to 3623 conditions per place. [2025-03-13 21:43:50,621 INFO L140 encePairwiseOnDemand]: 40/49 looper letters, 94 selfloop transitions, 13 changer transitions 15/126 dead transitions. [2025-03-13 21:43:50,622 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 126 transitions, 643 flow [2025-03-13 21:43:50,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 21:43:50,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 21:43:50,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 154 transitions. [2025-03-13 21:43:50,623 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5238095238095238 [2025-03-13 21:43:50,623 INFO L175 Difference]: Start difference. First operand has 54 places, 48 transitions, 149 flow. Second operand 6 states and 154 transitions. [2025-03-13 21:43:50,623 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 126 transitions, 643 flow [2025-03-13 21:43:50,636 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 126 transitions, 624 flow, removed 7 selfloop flow, removed 3 redundant places. [2025-03-13 21:43:50,638 INFO L231 Difference]: Finished difference. Result has 59 places, 57 transitions, 251 flow [2025-03-13 21:43:50,638 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=143, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=251, PETRI_PLACES=59, PETRI_TRANSITIONS=57} [2025-03-13 21:43:50,640 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 16 predicate places. [2025-03-13 21:43:50,641 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 57 transitions, 251 flow [2025-03-13 21:43:50,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:43:50,641 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:43:50,641 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:43:50,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-13 21:43:50,642 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-13 21:43:50,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:43:50,643 INFO L85 PathProgramCache]: Analyzing trace with hash -1457334377, now seen corresponding path program 5 times [2025-03-13 21:43:50,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:43:50,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279698053] [2025-03-13 21:43:50,643 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-13 21:43:50,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:43:50,652 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 26 statements into 1 equivalence classes. [2025-03-13 21:43:50,672 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-13 21:43:50,673 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-13 21:43:50,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:43:50,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:43:50,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:43:50,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279698053] [2025-03-13 21:43:50,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279698053] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:43:50,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:43:50,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 21:43:50,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129296909] [2025-03-13 21:43:50,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:43:50,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-13 21:43:50,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:43:50,951 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-13 21:43:50,952 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-13 21:43:50,952 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 49 [2025-03-13 21:43:50,952 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 57 transitions, 251 flow. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:43:50,952 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:43:50,952 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 49 [2025-03-13 21:43:50,952 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:43:51,415 INFO L124 PetriNetUnfolderBase]: 4455/6333 cut-off events. [2025-03-13 21:43:51,415 INFO L125 PetriNetUnfolderBase]: For 5631/5659 co-relation queries the response was YES. [2025-03-13 21:43:51,425 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16428 conditions, 6333 events. 4455/6333 cut-off events. For 5631/5659 co-relation queries the response was YES. Maximal size of possible extension queue 328. Compared 31827 event pairs, 2206 based on Foata normal form. 29/6336 useless extension candidates. Maximal degree in co-relation 16391. Up to 4432 conditions per place. [2025-03-13 21:43:51,442 INFO L140 encePairwiseOnDemand]: 45/49 looper letters, 90 selfloop transitions, 6 changer transitions 13/113 dead transitions. [2025-03-13 21:43:51,443 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 113 transitions, 628 flow [2025-03-13 21:43:51,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-13 21:43:51,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-13 21:43:51,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 130 transitions. [2025-03-13 21:43:51,444 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5306122448979592 [2025-03-13 21:43:51,444 INFO L175 Difference]: Start difference. First operand has 59 places, 57 transitions, 251 flow. Second operand 5 states and 130 transitions. [2025-03-13 21:43:51,445 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 113 transitions, 628 flow [2025-03-13 21:43:51,461 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 113 transitions, 609 flow, removed 9 selfloop flow, removed 2 redundant places. [2025-03-13 21:43:51,463 INFO L231 Difference]: Finished difference. Result has 62 places, 57 transitions, 252 flow [2025-03-13 21:43:51,463 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=238, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=252, PETRI_PLACES=62, PETRI_TRANSITIONS=57} [2025-03-13 21:43:51,465 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 19 predicate places. [2025-03-13 21:43:51,465 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 57 transitions, 252 flow [2025-03-13 21:43:51,465 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:43:51,465 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:43:51,466 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:43:51,466 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-13 21:43:51,466 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-13 21:43:51,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:43:51,466 INFO L85 PathProgramCache]: Analyzing trace with hash 1080040095, now seen corresponding path program 6 times [2025-03-13 21:43:51,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:43:51,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375759361] [2025-03-13 21:43:51,466 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-13 21:43:51,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:43:51,474 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 26 statements into 1 equivalence classes. [2025-03-13 21:43:51,492 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-13 21:43:51,492 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-13 21:43:51,492 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:43:51,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:43:51,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:43:51,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375759361] [2025-03-13 21:43:51,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [375759361] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:43:51,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:43:51,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 21:43:51,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136618231] [2025-03-13 21:43:51,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:43:51,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-13 21:43:51,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:43:51,685 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-13 21:43:51,685 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-13 21:43:51,686 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 49 [2025-03-13 21:43:51,686 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 57 transitions, 252 flow. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:43:51,686 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:43:51,686 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 49 [2025-03-13 21:43:51,686 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:43:52,128 INFO L124 PetriNetUnfolderBase]: 4227/6050 cut-off events. [2025-03-13 21:43:52,128 INFO L125 PetriNetUnfolderBase]: For 5671/5671 co-relation queries the response was YES. [2025-03-13 21:43:52,136 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15557 conditions, 6050 events. 4227/6050 cut-off events. For 5671/5671 co-relation queries the response was YES. Maximal size of possible extension queue 297. Compared 30005 event pairs, 2192 based on Foata normal form. 1/6039 useless extension candidates. Maximal degree in co-relation 15523. Up to 4403 conditions per place. [2025-03-13 21:43:52,149 INFO L140 encePairwiseOnDemand]: 45/49 looper letters, 87 selfloop transitions, 5 changer transitions 13/109 dead transitions. [2025-03-13 21:43:52,150 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 109 transitions, 611 flow [2025-03-13 21:43:52,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-13 21:43:52,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-13 21:43:52,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 126 transitions. [2025-03-13 21:43:52,150 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5142857142857142 [2025-03-13 21:43:52,150 INFO L175 Difference]: Start difference. First operand has 62 places, 57 transitions, 252 flow. Second operand 5 states and 126 transitions. [2025-03-13 21:43:52,150 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 109 transitions, 611 flow [2025-03-13 21:43:52,158 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 109 transitions, 597 flow, removed 3 selfloop flow, removed 3 redundant places. [2025-03-13 21:43:52,159 INFO L231 Difference]: Finished difference. Result has 63 places, 57 transitions, 255 flow [2025-03-13 21:43:52,160 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=242, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=255, PETRI_PLACES=63, PETRI_TRANSITIONS=57} [2025-03-13 21:43:52,160 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 20 predicate places. [2025-03-13 21:43:52,160 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 57 transitions, 255 flow [2025-03-13 21:43:52,160 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:43:52,161 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:43:52,161 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:43:52,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-13 21:43:52,162 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-13 21:43:52,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:43:52,163 INFO L85 PathProgramCache]: Analyzing trace with hash 760665717, now seen corresponding path program 1 times [2025-03-13 21:43:52,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:43:52,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90768161] [2025-03-13 21:43:52,163 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:43:52,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:43:52,171 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-13 21:43:52,177 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-13 21:43:52,177 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:43:52,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:43:52,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:43:52,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:43:52,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90768161] [2025-03-13 21:43:52,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90768161] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:43:52,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:43:52,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-13 21:43:52,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656450103] [2025-03-13 21:43:52,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:43:52,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-13 21:43:52,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:43:52,224 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-13 21:43:52,224 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-13 21:43:52,224 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 49 [2025-03-13 21:43:52,224 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 57 transitions, 255 flow. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:43:52,224 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:43:52,224 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 49 [2025-03-13 21:43:52,224 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:43:52,630 INFO L124 PetriNetUnfolderBase]: 4981/7220 cut-off events. [2025-03-13 21:43:52,632 INFO L125 PetriNetUnfolderBase]: For 7191/7191 co-relation queries the response was YES. [2025-03-13 21:43:52,643 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18312 conditions, 7220 events. 4981/7220 cut-off events. For 7191/7191 co-relation queries the response was YES. Maximal size of possible extension queue 362. Compared 38531 event pairs, 421 based on Foata normal form. 56/7271 useless extension candidates. Maximal degree in co-relation 18270. Up to 4169 conditions per place. [2025-03-13 21:43:52,660 INFO L140 encePairwiseOnDemand]: 45/49 looper letters, 94 selfloop transitions, 6 changer transitions 0/104 dead transitions. [2025-03-13 21:43:52,660 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 104 transitions, 617 flow [2025-03-13 21:43:52,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-13 21:43:52,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-13 21:43:52,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 111 transitions. [2025-03-13 21:43:52,661 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5663265306122449 [2025-03-13 21:43:52,661 INFO L175 Difference]: Start difference. First operand has 63 places, 57 transitions, 255 flow. Second operand 4 states and 111 transitions. [2025-03-13 21:43:52,661 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 104 transitions, 617 flow [2025-03-13 21:43:52,672 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 104 transitions, 605 flow, removed 3 selfloop flow, removed 3 redundant places. [2025-03-13 21:43:52,673 INFO L231 Difference]: Finished difference. Result has 64 places, 62 transitions, 306 flow [2025-03-13 21:43:52,675 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=245, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=306, PETRI_PLACES=64, PETRI_TRANSITIONS=62} [2025-03-13 21:43:52,675 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 21 predicate places. [2025-03-13 21:43:52,675 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 62 transitions, 306 flow [2025-03-13 21:43:52,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:43:52,676 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:43:52,676 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:43:52,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-13 21:43:52,676 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-13 21:43:52,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:43:52,677 INFO L85 PathProgramCache]: Analyzing trace with hash -615779583, now seen corresponding path program 2 times [2025-03-13 21:43:52,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:43:52,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300840939] [2025-03-13 21:43:52,677 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:43:52,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:43:52,684 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 1 equivalence classes. [2025-03-13 21:43:52,693 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-13 21:43:52,693 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-13 21:43:52,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:43:52,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:43:52,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:43:52,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300840939] [2025-03-13 21:43:52,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300840939] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:43:52,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:43:52,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-13 21:43:52,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62041401] [2025-03-13 21:43:52,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:43:52,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-13 21:43:52,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:43:52,747 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-13 21:43:52,747 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-13 21:43:52,748 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 49 [2025-03-13 21:43:52,748 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 62 transitions, 306 flow. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:43:52,748 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:43:52,748 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 49 [2025-03-13 21:43:52,748 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:43:53,153 INFO L124 PetriNetUnfolderBase]: 4651/6768 cut-off events. [2025-03-13 21:43:53,153 INFO L125 PetriNetUnfolderBase]: For 6887/6887 co-relation queries the response was YES. [2025-03-13 21:43:53,161 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17830 conditions, 6768 events. 4651/6768 cut-off events. For 6887/6887 co-relation queries the response was YES. Maximal size of possible extension queue 336. Compared 35815 event pairs, 572 based on Foata normal form. 56/6819 useless extension candidates. Maximal degree in co-relation 13883. Up to 3906 conditions per place. [2025-03-13 21:43:53,172 INFO L140 encePairwiseOnDemand]: 45/49 looper letters, 96 selfloop transitions, 8 changer transitions 0/108 dead transitions. [2025-03-13 21:43:53,172 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 108 transitions, 683 flow [2025-03-13 21:43:53,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-13 21:43:53,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-13 21:43:53,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 111 transitions. [2025-03-13 21:43:53,173 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5663265306122449 [2025-03-13 21:43:53,173 INFO L175 Difference]: Start difference. First operand has 64 places, 62 transitions, 306 flow. Second operand 4 states and 111 transitions. [2025-03-13 21:43:53,173 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 108 transitions, 683 flow [2025-03-13 21:43:53,184 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 108 transitions, 683 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 21:43:53,185 INFO L231 Difference]: Finished difference. Result has 70 places, 66 transitions, 377 flow [2025-03-13 21:43:53,185 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=292, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=377, PETRI_PLACES=70, PETRI_TRANSITIONS=66} [2025-03-13 21:43:53,186 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 27 predicate places. [2025-03-13 21:43:53,186 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 66 transitions, 377 flow [2025-03-13 21:43:53,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:43:53,187 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:43:53,187 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:43:53,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-13 21:43:53,188 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-13 21:43:53,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:43:53,189 INFO L85 PathProgramCache]: Analyzing trace with hash -893140235, now seen corresponding path program 1 times [2025-03-13 21:43:53,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:43:53,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940227162] [2025-03-13 21:43:53,189 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:43:53,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:43:53,198 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-13 21:43:53,203 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-13 21:43:53,203 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:43:53,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:43:53,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:43:53,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:43:53,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940227162] [2025-03-13 21:43:53,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940227162] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:43:53,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:43:53,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-13 21:43:53,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337808350] [2025-03-13 21:43:53,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:43:53,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-13 21:43:53,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:43:53,252 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-13 21:43:53,252 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-13 21:43:53,252 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 49 [2025-03-13 21:43:53,253 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 66 transitions, 377 flow. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:43:53,253 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:43:53,253 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 49 [2025-03-13 21:43:53,253 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:43:53,620 INFO L124 PetriNetUnfolderBase]: 4698/6812 cut-off events. [2025-03-13 21:43:53,620 INFO L125 PetriNetUnfolderBase]: For 8709/8729 co-relation queries the response was YES. [2025-03-13 21:43:53,634 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18734 conditions, 6812 events. 4698/6812 cut-off events. For 8709/8729 co-relation queries the response was YES. Maximal size of possible extension queue 342. Compared 35797 event pairs, 1238 based on Foata normal form. 43/6852 useless extension candidates. Maximal degree in co-relation 14528. Up to 4047 conditions per place. [2025-03-13 21:43:53,652 INFO L140 encePairwiseOnDemand]: 44/49 looper letters, 96 selfloop transitions, 14 changer transitions 3/117 dead transitions. [2025-03-13 21:43:53,653 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 117 transitions, 771 flow [2025-03-13 21:43:53,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-13 21:43:53,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-13 21:43:53,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 128 transitions. [2025-03-13 21:43:53,654 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5224489795918368 [2025-03-13 21:43:53,654 INFO L175 Difference]: Start difference. First operand has 70 places, 66 transitions, 377 flow. Second operand 5 states and 128 transitions. [2025-03-13 21:43:53,654 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 117 transitions, 771 flow [2025-03-13 21:43:53,671 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 117 transitions, 769 flow, removed 1 selfloop flow, removed 0 redundant places. [2025-03-13 21:43:53,672 INFO L231 Difference]: Finished difference. Result has 76 places, 70 transitions, 459 flow [2025-03-13 21:43:53,673 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=375, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=459, PETRI_PLACES=76, PETRI_TRANSITIONS=70} [2025-03-13 21:43:53,674 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 33 predicate places. [2025-03-13 21:43:53,674 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 70 transitions, 459 flow [2025-03-13 21:43:53,674 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:43:53,674 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:43:53,674 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:43:53,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-13 21:43:53,674 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-13 21:43:53,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:43:53,675 INFO L85 PathProgramCache]: Analyzing trace with hash 884673441, now seen corresponding path program 3 times [2025-03-13 21:43:53,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:43:53,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543108331] [2025-03-13 21:43:53,676 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-13 21:43:53,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:43:53,684 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 28 statements into 1 equivalence classes. [2025-03-13 21:43:53,689 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-13 21:43:53,689 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-13 21:43:53,689 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:43:53,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:43:53,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:43:53,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543108331] [2025-03-13 21:43:53,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [543108331] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:43:53,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:43:53,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-13 21:43:53,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670579922] [2025-03-13 21:43:53,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:43:53,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-13 21:43:53,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:43:53,732 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-13 21:43:53,733 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-13 21:43:53,733 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 49 [2025-03-13 21:43:53,733 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 70 transitions, 459 flow. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:43:53,733 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:43:53,733 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 49 [2025-03-13 21:43:53,733 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:43:54,128 INFO L124 PetriNetUnfolderBase]: 4465/6468 cut-off events. [2025-03-13 21:43:54,128 INFO L125 PetriNetUnfolderBase]: For 10680/10700 co-relation queries the response was YES. [2025-03-13 21:43:54,142 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18350 conditions, 6468 events. 4465/6468 cut-off events. For 10680/10700 co-relation queries the response was YES. Maximal size of possible extension queue 318. Compared 33743 event pairs, 949 based on Foata normal form. 42/6505 useless extension candidates. Maximal degree in co-relation 14921. Up to 4295 conditions per place. [2025-03-13 21:43:54,157 INFO L140 encePairwiseOnDemand]: 44/49 looper letters, 98 selfloop transitions, 13 changer transitions 2/117 dead transitions. [2025-03-13 21:43:54,158 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 117 transitions, 833 flow [2025-03-13 21:43:54,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-13 21:43:54,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-13 21:43:54,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 126 transitions. [2025-03-13 21:43:54,159 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5142857142857142 [2025-03-13 21:43:54,159 INFO L175 Difference]: Start difference. First operand has 76 places, 70 transitions, 459 flow. Second operand 5 states and 126 transitions. [2025-03-13 21:43:54,159 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 117 transitions, 833 flow [2025-03-13 21:43:54,176 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 117 transitions, 810 flow, removed 8 selfloop flow, removed 1 redundant places. [2025-03-13 21:43:54,177 INFO L231 Difference]: Finished difference. Result has 80 places, 71 transitions, 473 flow [2025-03-13 21:43:54,177 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=436, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=473, PETRI_PLACES=80, PETRI_TRANSITIONS=71} [2025-03-13 21:43:54,177 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 37 predicate places. [2025-03-13 21:43:54,178 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 71 transitions, 473 flow [2025-03-13 21:43:54,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:43:54,178 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:43:54,178 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:43:54,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-13 21:43:54,178 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-13 21:43:54,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:43:54,179 INFO L85 PathProgramCache]: Analyzing trace with hash -822114757, now seen corresponding path program 2 times [2025-03-13 21:43:54,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:43:54,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153446817] [2025-03-13 21:43:54,179 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:43:54,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:43:54,184 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 1 equivalence classes. [2025-03-13 21:43:54,189 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-13 21:43:54,189 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-13 21:43:54,190 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:43:54,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:43:54,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:43:54,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153446817] [2025-03-13 21:43:54,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153446817] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:43:54,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:43:54,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-13 21:43:54,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240880842] [2025-03-13 21:43:54,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:43:54,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-13 21:43:54,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:43:54,230 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-13 21:43:54,230 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-13 21:43:54,230 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 49 [2025-03-13 21:43:54,231 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 71 transitions, 473 flow. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:43:54,231 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:43:54,231 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 49 [2025-03-13 21:43:54,231 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:43:54,590 INFO L124 PetriNetUnfolderBase]: 4940/7165 cut-off events. [2025-03-13 21:43:54,591 INFO L125 PetriNetUnfolderBase]: For 13762/13762 co-relation queries the response was YES. [2025-03-13 21:43:54,606 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20016 conditions, 7165 events. 4940/7165 cut-off events. For 13762/13762 co-relation queries the response was YES. Maximal size of possible extension queue 374. Compared 38226 event pairs, 835 based on Foata normal form. 55/7217 useless extension candidates. Maximal degree in co-relation 17050. Up to 4517 conditions per place. [2025-03-13 21:43:54,623 INFO L140 encePairwiseOnDemand]: 45/49 looper letters, 96 selfloop transitions, 11 changer transitions 0/111 dead transitions. [2025-03-13 21:43:54,623 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 111 transitions, 805 flow [2025-03-13 21:43:54,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-13 21:43:54,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-13 21:43:54,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 110 transitions. [2025-03-13 21:43:54,624 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5612244897959183 [2025-03-13 21:43:54,624 INFO L175 Difference]: Start difference. First operand has 80 places, 71 transitions, 473 flow. Second operand 4 states and 110 transitions. [2025-03-13 21:43:54,624 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 111 transitions, 805 flow [2025-03-13 21:43:54,650 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 111 transitions, 770 flow, removed 4 selfloop flow, removed 4 redundant places. [2025-03-13 21:43:54,651 INFO L231 Difference]: Finished difference. Result has 80 places, 72 transitions, 488 flow [2025-03-13 21:43:54,651 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=438, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=488, PETRI_PLACES=80, PETRI_TRANSITIONS=72} [2025-03-13 21:43:54,652 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 37 predicate places. [2025-03-13 21:43:54,652 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 72 transitions, 488 flow [2025-03-13 21:43:54,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:43:54,652 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:43:54,652 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:43:54,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-13 21:43:54,652 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-13 21:43:54,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:43:54,653 INFO L85 PathProgramCache]: Analyzing trace with hash 926290713, now seen corresponding path program 4 times [2025-03-13 21:43:54,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:43:54,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069660779] [2025-03-13 21:43:54,653 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-13 21:43:54,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:43:54,658 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 28 statements into 2 equivalence classes. [2025-03-13 21:43:54,660 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 23 of 28 statements. [2025-03-13 21:43:54,660 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-13 21:43:54,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:43:54,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:43:54,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:43:54,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069660779] [2025-03-13 21:43:54,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069660779] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:43:54,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:43:54,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-13 21:43:54,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970477667] [2025-03-13 21:43:54,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:43:54,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-13 21:43:54,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:43:54,675 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-13 21:43:54,675 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-13 21:43:54,675 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 49 [2025-03-13 21:43:54,675 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 72 transitions, 488 flow. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:43:54,675 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:43:54,675 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 49 [2025-03-13 21:43:54,676 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:43:55,073 INFO L124 PetriNetUnfolderBase]: 4994/7238 cut-off events. [2025-03-13 21:43:55,074 INFO L125 PetriNetUnfolderBase]: For 11987/11987 co-relation queries the response was YES. [2025-03-13 21:43:55,088 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20600 conditions, 7238 events. 4994/7238 cut-off events. For 11987/11987 co-relation queries the response was YES. Maximal size of possible extension queue 380. Compared 38647 event pairs, 1926 based on Foata normal form. 20/7253 useless extension candidates. Maximal degree in co-relation 17441. Up to 3752 conditions per place. [2025-03-13 21:43:55,106 INFO L140 encePairwiseOnDemand]: 46/49 looper letters, 83 selfloop transitions, 6 changer transitions 10/103 dead transitions. [2025-03-13 21:43:55,106 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 103 transitions, 772 flow [2025-03-13 21:43:55,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-13 21:43:55,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-13 21:43:55,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 100 transitions. [2025-03-13 21:43:55,108 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5102040816326531 [2025-03-13 21:43:55,109 INFO L175 Difference]: Start difference. First operand has 80 places, 72 transitions, 488 flow. Second operand 4 states and 100 transitions. [2025-03-13 21:43:55,109 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 103 transitions, 772 flow [2025-03-13 21:43:55,128 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 103 transitions, 762 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-03-13 21:43:55,129 INFO L231 Difference]: Finished difference. Result has 83 places, 70 transitions, 465 flow [2025-03-13 21:43:55,129 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=478, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=465, PETRI_PLACES=83, PETRI_TRANSITIONS=70} [2025-03-13 21:43:55,129 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 40 predicate places. [2025-03-13 21:43:55,130 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 70 transitions, 465 flow [2025-03-13 21:43:55,130 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:43:55,130 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:43:55,130 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:43:55,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-13 21:43:55,130 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-13 21:43:55,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:43:55,130 INFO L85 PathProgramCache]: Analyzing trace with hash 277220671, now seen corresponding path program 3 times [2025-03-13 21:43:55,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:43:55,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424942282] [2025-03-13 21:43:55,130 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-13 21:43:55,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:43:55,137 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 28 statements into 1 equivalence classes. [2025-03-13 21:43:55,141 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-13 21:43:55,141 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-13 21:43:55,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:43:55,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:43:55,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:43:55,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424942282] [2025-03-13 21:43:55,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424942282] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:43:55,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:43:55,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-13 21:43:55,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825627720] [2025-03-13 21:43:55,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:43:55,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-13 21:43:55,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:43:55,174 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-13 21:43:55,174 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-13 21:43:55,174 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 49 [2025-03-13 21:43:55,174 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 70 transitions, 465 flow. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:43:55,174 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:43:55,175 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 49 [2025-03-13 21:43:55,175 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:43:55,638 INFO L124 PetriNetUnfolderBase]: 4436/6383 cut-off events. [2025-03-13 21:43:55,638 INFO L125 PetriNetUnfolderBase]: For 11290/11290 co-relation queries the response was YES. [2025-03-13 21:43:55,651 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18503 conditions, 6383 events. 4436/6383 cut-off events. For 11290/11290 co-relation queries the response was YES. Maximal size of possible extension queue 323. Compared 32764 event pairs, 1978 based on Foata normal form. 45/6421 useless extension candidates. Maximal degree in co-relation 17424. Up to 4110 conditions per place. [2025-03-13 21:43:55,667 INFO L140 encePairwiseOnDemand]: 44/49 looper letters, 107 selfloop transitions, 8 changer transitions 6/125 dead transitions. [2025-03-13 21:43:55,667 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 125 transitions, 853 flow [2025-03-13 21:43:55,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-13 21:43:55,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-13 21:43:55,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 134 transitions. [2025-03-13 21:43:55,668 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5469387755102041 [2025-03-13 21:43:55,668 INFO L175 Difference]: Start difference. First operand has 83 places, 70 transitions, 465 flow. Second operand 5 states and 134 transitions. [2025-03-13 21:43:55,668 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 125 transitions, 853 flow [2025-03-13 21:43:55,684 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 125 transitions, 832 flow, removed 1 selfloop flow, removed 4 redundant places. [2025-03-13 21:43:55,685 INFO L231 Difference]: Finished difference. Result has 83 places, 68 transitions, 430 flow [2025-03-13 21:43:55,685 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=444, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=430, PETRI_PLACES=83, PETRI_TRANSITIONS=68} [2025-03-13 21:43:55,686 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 40 predicate places. [2025-03-13 21:43:55,686 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 68 transitions, 430 flow [2025-03-13 21:43:55,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:43:55,686 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:43:55,686 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:43:55,686 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-13 21:43:55,687 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-13 21:43:55,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:43:55,687 INFO L85 PathProgramCache]: Analyzing trace with hash -470472933, now seen corresponding path program 4 times [2025-03-13 21:43:55,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:43:55,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294196636] [2025-03-13 21:43:55,687 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-13 21:43:55,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:43:55,693 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 28 statements into 2 equivalence classes. [2025-03-13 21:43:55,696 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 23 of 28 statements. [2025-03-13 21:43:55,696 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-13 21:43:55,696 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:43:55,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:43:55,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:43:55,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294196636] [2025-03-13 21:43:55,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1294196636] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:43:55,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:43:55,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-13 21:43:55,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455861204] [2025-03-13 21:43:55,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:43:55,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-13 21:43:55,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:43:55,720 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-13 21:43:55,721 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-13 21:43:55,721 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 49 [2025-03-13 21:43:55,721 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 68 transitions, 430 flow. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:43:55,722 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:43:55,722 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 49 [2025-03-13 21:43:55,722 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:43:56,178 INFO L124 PetriNetUnfolderBase]: 4309/6178 cut-off events. [2025-03-13 21:43:56,178 INFO L125 PetriNetUnfolderBase]: For 9565/9565 co-relation queries the response was YES. [2025-03-13 21:43:56,191 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18094 conditions, 6178 events. 4309/6178 cut-off events. For 9565/9565 co-relation queries the response was YES. Maximal size of possible extension queue 317. Compared 31524 event pairs, 2243 based on Foata normal form. 16/6187 useless extension candidates. Maximal degree in co-relation 16336. Up to 4634 conditions per place. [2025-03-13 21:43:56,207 INFO L140 encePairwiseOnDemand]: 46/49 looper letters, 76 selfloop transitions, 4 changer transitions 13/97 dead transitions. [2025-03-13 21:43:56,207 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 97 transitions, 692 flow [2025-03-13 21:43:56,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-13 21:43:56,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-13 21:43:56,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 99 transitions. [2025-03-13 21:43:56,209 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5051020408163265 [2025-03-13 21:43:56,209 INFO L175 Difference]: Start difference. First operand has 83 places, 68 transitions, 430 flow. Second operand 4 states and 99 transitions. [2025-03-13 21:43:56,209 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 97 transitions, 692 flow [2025-03-13 21:43:56,226 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 97 transitions, 675 flow, removed 3 selfloop flow, removed 4 redundant places. [2025-03-13 21:43:56,227 INFO L231 Difference]: Finished difference. Result has 83 places, 66 transitions, 403 flow [2025-03-13 21:43:56,228 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=413, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=403, PETRI_PLACES=83, PETRI_TRANSITIONS=66} [2025-03-13 21:43:56,228 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 40 predicate places. [2025-03-13 21:43:56,228 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 66 transitions, 403 flow [2025-03-13 21:43:56,228 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:43:56,228 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:43:56,228 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:43:56,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-13 21:43:56,229 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-13 21:43:56,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:43:56,229 INFO L85 PathProgramCache]: Analyzing trace with hash 1951938269, now seen corresponding path program 5 times [2025-03-13 21:43:56,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:43:56,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841350686] [2025-03-13 21:43:56,229 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-13 21:43:56,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:43:56,236 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 28 statements into 1 equivalence classes. [2025-03-13 21:43:56,242 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-13 21:43:56,242 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-13 21:43:56,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:43:56,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:43:56,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:43:56,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841350686] [2025-03-13 21:43:56,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841350686] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:43:56,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:43:56,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-13 21:43:56,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278018076] [2025-03-13 21:43:56,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:43:56,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-13 21:43:56,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:43:56,299 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-13 21:43:56,299 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-13 21:43:56,299 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 49 [2025-03-13 21:43:56,299 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 66 transitions, 403 flow. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:43:56,299 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:43:56,299 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 49 [2025-03-13 21:43:56,299 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:43:56,679 INFO L124 PetriNetUnfolderBase]: 3888/5581 cut-off events. [2025-03-13 21:43:56,680 INFO L125 PetriNetUnfolderBase]: For 9214/9214 co-relation queries the response was YES. [2025-03-13 21:43:56,688 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16064 conditions, 5581 events. 3888/5581 cut-off events. For 9214/9214 co-relation queries the response was YES. Maximal size of possible extension queue 284. Compared 27787 event pairs, 785 based on Foata normal form. 55/5631 useless extension candidates. Maximal degree in co-relation 14908. Up to 4214 conditions per place. [2025-03-13 21:43:56,698 INFO L140 encePairwiseOnDemand]: 45/49 looper letters, 83 selfloop transitions, 9 changer transitions 3/99 dead transitions. [2025-03-13 21:43:56,698 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 99 transitions, 667 flow [2025-03-13 21:43:56,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-13 21:43:56,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-13 21:43:56,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 105 transitions. [2025-03-13 21:43:56,699 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5357142857142857 [2025-03-13 21:43:56,699 INFO L175 Difference]: Start difference. First operand has 83 places, 66 transitions, 403 flow. Second operand 4 states and 105 transitions. [2025-03-13 21:43:56,699 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 99 transitions, 667 flow [2025-03-13 21:43:56,709 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 99 transitions, 651 flow, removed 2 selfloop flow, removed 3 redundant places. [2025-03-13 21:43:56,710 INFO L231 Difference]: Finished difference. Result has 81 places, 64 transitions, 368 flow [2025-03-13 21:43:56,710 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=369, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=368, PETRI_PLACES=81, PETRI_TRANSITIONS=64} [2025-03-13 21:43:56,710 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 38 predicate places. [2025-03-13 21:43:56,711 INFO L471 AbstractCegarLoop]: Abstraction has has 81 places, 64 transitions, 368 flow [2025-03-13 21:43:56,711 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:43:56,711 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:43:56,711 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:43:56,711 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-13 21:43:56,711 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-13 21:43:56,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:43:56,712 INFO L85 PathProgramCache]: Analyzing trace with hash 928055385, now seen corresponding path program 5 times [2025-03-13 21:43:56,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:43:56,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932972540] [2025-03-13 21:43:56,712 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-13 21:43:56,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:43:56,718 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 28 statements into 1 equivalence classes. [2025-03-13 21:43:56,723 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-13 21:43:56,723 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-13 21:43:56,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:43:56,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:43:56,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:43:56,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932972540] [2025-03-13 21:43:56,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932972540] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:43:56,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:43:56,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-13 21:43:56,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959430423] [2025-03-13 21:43:56,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:43:56,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-13 21:43:56,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:43:56,754 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-13 21:43:56,754 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-13 21:43:56,754 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 49 [2025-03-13 21:43:56,755 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 64 transitions, 368 flow. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:43:56,755 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:43:56,755 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 49 [2025-03-13 21:43:56,755 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:43:56,998 INFO L124 PetriNetUnfolderBase]: 3478/4964 cut-off events. [2025-03-13 21:43:56,999 INFO L125 PetriNetUnfolderBase]: For 5944/5944 co-relation queries the response was YES. [2025-03-13 21:43:57,008 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13999 conditions, 4964 events. 3478/4964 cut-off events. For 5944/5944 co-relation queries the response was YES. Maximal size of possible extension queue 259. Compared 24020 event pairs, 2093 based on Foata normal form. 16/4973 useless extension candidates. Maximal degree in co-relation 12179. Up to 4638 conditions per place. [2025-03-13 21:43:57,019 INFO L140 encePairwiseOnDemand]: 46/49 looper letters, 57 selfloop transitions, 0 changer transitions 14/75 dead transitions. [2025-03-13 21:43:57,019 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 75 transitions, 522 flow [2025-03-13 21:43:57,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-13 21:43:57,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-13 21:43:57,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 82 transitions. [2025-03-13 21:43:57,020 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.41836734693877553 [2025-03-13 21:43:57,020 INFO L175 Difference]: Start difference. First operand has 81 places, 64 transitions, 368 flow. Second operand 4 states and 82 transitions. [2025-03-13 21:43:57,021 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 75 transitions, 522 flow [2025-03-13 21:43:57,029 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 75 transitions, 487 flow, removed 7 selfloop flow, removed 5 redundant places. [2025-03-13 21:43:57,030 INFO L231 Difference]: Finished difference. Result has 77 places, 61 transitions, 297 flow [2025-03-13 21:43:57,030 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=317, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=297, PETRI_PLACES=77, PETRI_TRANSITIONS=61} [2025-03-13 21:43:57,030 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 34 predicate places. [2025-03-13 21:43:57,030 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 61 transitions, 297 flow [2025-03-13 21:43:57,031 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:43:57,031 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:43:57,031 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:43:57,031 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-13 21:43:57,031 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-13 21:43:57,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:43:57,031 INFO L85 PathProgramCache]: Analyzing trace with hash 419057631, now seen corresponding path program 6 times [2025-03-13 21:43:57,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:43:57,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984931451] [2025-03-13 21:43:57,032 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-13 21:43:57,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:43:57,037 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 28 statements into 1 equivalence classes. [2025-03-13 21:43:57,042 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-13 21:43:57,042 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-13 21:43:57,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:43:57,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:43:57,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:43:57,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984931451] [2025-03-13 21:43:57,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984931451] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:43:57,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:43:57,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-13 21:43:57,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357370783] [2025-03-13 21:43:57,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:43:57,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-13 21:43:57,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:43:57,077 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-13 21:43:57,078 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-13 21:43:57,078 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 49 [2025-03-13 21:43:57,078 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 61 transitions, 297 flow. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:43:57,078 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:43:57,078 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 49 [2025-03-13 21:43:57,078 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:43:57,333 INFO L124 PetriNetUnfolderBase]: 3104/4414 cut-off events. [2025-03-13 21:43:57,334 INFO L125 PetriNetUnfolderBase]: For 3312/3312 co-relation queries the response was YES. [2025-03-13 21:43:57,341 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12106 conditions, 4414 events. 3104/4414 cut-off events. For 3312/3312 co-relation queries the response was YES. Maximal size of possible extension queue 235. Compared 20634 event pairs, 558 based on Foata normal form. 20/4429 useless extension candidates. Maximal degree in co-relation 12094. Up to 3835 conditions per place. [2025-03-13 21:43:57,350 INFO L140 encePairwiseOnDemand]: 45/49 looper letters, 63 selfloop transitions, 4 changer transitions 10/81 dead transitions. [2025-03-13 21:43:57,350 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 81 transitions, 490 flow [2025-03-13 21:43:57,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-13 21:43:57,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-13 21:43:57,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 91 transitions. [2025-03-13 21:43:57,353 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4642857142857143 [2025-03-13 21:43:57,353 INFO L175 Difference]: Start difference. First operand has 77 places, 61 transitions, 297 flow. Second operand 4 states and 91 transitions. [2025-03-13 21:43:57,353 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 81 transitions, 490 flow [2025-03-13 21:43:57,358 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 81 transitions, 488 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-03-13 21:43:57,358 INFO L231 Difference]: Finished difference. Result has 71 places, 58 transitions, 264 flow [2025-03-13 21:43:57,359 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=280, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=264, PETRI_PLACES=71, PETRI_TRANSITIONS=58} [2025-03-13 21:43:57,359 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 28 predicate places. [2025-03-13 21:43:57,359 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 58 transitions, 264 flow [2025-03-13 21:43:57,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:43:57,359 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:43:57,359 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:43:57,359 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-13 21:43:57,359 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-13 21:43:57,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:43:57,360 INFO L85 PathProgramCache]: Analyzing trace with hash -1848300677, now seen corresponding path program 1 times [2025-03-13 21:43:57,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:43:57,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209723383] [2025-03-13 21:43:57,360 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:43:57,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:43:57,366 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-13 21:43:57,381 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-13 21:43:57,384 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:43:57,384 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:43:57,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:43:57,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:43:57,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209723383] [2025-03-13 21:43:57,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209723383] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:43:57,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:43:57,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-13 21:43:57,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061363549] [2025-03-13 21:43:57,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:43:57,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-13 21:43:57,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:43:57,903 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-13 21:43:57,903 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-03-13 21:43:57,962 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 49 [2025-03-13 21:43:57,963 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 58 transitions, 264 flow. Second operand has 10 states, 10 states have (on average 9.6) internal successors, (96), 10 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:43:57,963 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:43:57,963 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 49 [2025-03-13 21:43:57,963 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:43:58,913 INFO L124 PetriNetUnfolderBase]: 8774/12370 cut-off events. [2025-03-13 21:43:58,913 INFO L125 PetriNetUnfolderBase]: For 8804/8862 co-relation queries the response was YES. [2025-03-13 21:43:58,945 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34015 conditions, 12370 events. 8774/12370 cut-off events. For 8804/8862 co-relation queries the response was YES. Maximal size of possible extension queue 611. Compared 67260 event pairs, 1012 based on Foata normal form. 59/12420 useless extension candidates. Maximal degree in co-relation 34003. Up to 2790 conditions per place. [2025-03-13 21:43:58,975 INFO L140 encePairwiseOnDemand]: 35/49 looper letters, 261 selfloop transitions, 30 changer transitions 15/310 dead transitions. [2025-03-13 21:43:58,976 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 310 transitions, 2054 flow [2025-03-13 21:43:58,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-13 21:43:58,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-13 21:43:58,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 335 transitions. [2025-03-13 21:43:58,977 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.48833819241982507 [2025-03-13 21:43:58,977 INFO L175 Difference]: Start difference. First operand has 71 places, 58 transitions, 264 flow. Second operand 14 states and 335 transitions. [2025-03-13 21:43:58,977 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 310 transitions, 2054 flow [2025-03-13 21:43:58,993 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 310 transitions, 1995 flow, removed 8 selfloop flow, removed 3 redundant places. [2025-03-13 21:43:58,995 INFO L231 Difference]: Finished difference. Result has 86 places, 83 transitions, 469 flow [2025-03-13 21:43:58,995 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=254, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=469, PETRI_PLACES=86, PETRI_TRANSITIONS=83} [2025-03-13 21:43:58,996 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 43 predicate places. [2025-03-13 21:43:58,996 INFO L471 AbstractCegarLoop]: Abstraction has has 86 places, 83 transitions, 469 flow [2025-03-13 21:43:58,996 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.6) internal successors, (96), 10 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:43:58,996 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:43:58,996 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:43:58,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-13 21:43:58,996 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-13 21:43:58,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:43:58,997 INFO L85 PathProgramCache]: Analyzing trace with hash 1174906831, now seen corresponding path program 2 times [2025-03-13 21:43:58,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:43:58,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585438412] [2025-03-13 21:43:58,997 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:43:58,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:43:59,002 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 1 equivalence classes. [2025-03-13 21:43:59,019 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-13 21:43:59,020 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-13 21:43:59,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:43:59,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:43:59,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:43:59,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585438412] [2025-03-13 21:43:59,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585438412] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:43:59,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:43:59,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-13 21:43:59,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136207422] [2025-03-13 21:43:59,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:43:59,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-13 21:43:59,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:43:59,267 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-13 21:43:59,267 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-13 21:43:59,296 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 49 [2025-03-13 21:43:59,296 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 83 transitions, 469 flow. Second operand has 8 states, 8 states have (on average 10.25) internal successors, (82), 8 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:43:59,296 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:43:59,296 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 49 [2025-03-13 21:43:59,296 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:44:00,038 INFO L124 PetriNetUnfolderBase]: 9149/12971 cut-off events. [2025-03-13 21:44:00,038 INFO L125 PetriNetUnfolderBase]: For 14326/14382 co-relation queries the response was YES. [2025-03-13 21:44:00,068 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39966 conditions, 12971 events. 9149/12971 cut-off events. For 14326/14382 co-relation queries the response was YES. Maximal size of possible extension queue 652. Compared 71934 event pairs, 3127 based on Foata normal form. 59/13021 useless extension candidates. Maximal degree in co-relation 39946. Up to 5912 conditions per place. [2025-03-13 21:44:00,092 INFO L140 encePairwiseOnDemand]: 37/49 looper letters, 122 selfloop transitions, 21 changer transitions 4/151 dead transitions. [2025-03-13 21:44:00,092 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 151 transitions, 1120 flow [2025-03-13 21:44:00,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-13 21:44:00,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-13 21:44:00,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 147 transitions. [2025-03-13 21:44:00,093 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.42857142857142855 [2025-03-13 21:44:00,093 INFO L175 Difference]: Start difference. First operand has 86 places, 83 transitions, 469 flow. Second operand 7 states and 147 transitions. [2025-03-13 21:44:00,093 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 151 transitions, 1120 flow [2025-03-13 21:44:00,138 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 151 transitions, 1095 flow, removed 5 selfloop flow, removed 2 redundant places. [2025-03-13 21:44:00,139 INFO L231 Difference]: Finished difference. Result has 90 places, 84 transitions, 511 flow [2025-03-13 21:44:00,140 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=444, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=511, PETRI_PLACES=90, PETRI_TRANSITIONS=84} [2025-03-13 21:44:00,140 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 47 predicate places. [2025-03-13 21:44:00,140 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 84 transitions, 511 flow [2025-03-13 21:44:00,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.25) internal successors, (82), 8 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:44:00,140 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:44:00,140 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:44:00,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-13 21:44:00,140 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-13 21:44:00,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:44:00,141 INFO L85 PathProgramCache]: Analyzing trace with hash -722346230, now seen corresponding path program 1 times [2025-03-13 21:44:00,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:44:00,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223872958] [2025-03-13 21:44:00,141 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:44:00,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:44:00,147 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-13 21:44:00,151 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-13 21:44:00,151 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:44:00,152 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:44:00,249 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:44:00,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:44:00,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223872958] [2025-03-13 21:44:00,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223872958] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:44:00,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [277776205] [2025-03-13 21:44:00,250 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:44:00,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:44:00,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:44:00,252 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 21:44:00,254 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-13 21:44:00,310 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-13 21:44:00,333 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-13 21:44:00,333 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:44:00,333 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:44:00,335 INFO L256 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-13 21:44:00,338 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:44:00,790 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:44:00,790 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:44:02,115 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 21:44:02,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [277776205] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-13 21:44:02,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-13 21:44:02,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [6, 11] total 23 [2025-03-13 21:44:02,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726343753] [2025-03-13 21:44:02,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:44:02,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-13 21:44:02,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:44:02,116 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-13 21:44:02,117 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=401, Unknown=0, NotChecked=0, Total=506 [2025-03-13 21:44:02,180 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 49 [2025-03-13 21:44:02,181 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 84 transitions, 511 flow. Second operand has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:44:02,181 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:44:02,181 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 49 [2025-03-13 21:44:02,181 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:44:04,745 INFO L124 PetriNetUnfolderBase]: 15865/22972 cut-off events. [2025-03-13 21:44:04,746 INFO L125 PetriNetUnfolderBase]: For 26394/26410 co-relation queries the response was YES. [2025-03-13 21:44:04,805 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72644 conditions, 22972 events. 15865/22972 cut-off events. For 26394/26410 co-relation queries the response was YES. Maximal size of possible extension queue 1051. Compared 143738 event pairs, 1427 based on Foata normal form. 18/22983 useless extension candidates. Maximal degree in co-relation 72623. Up to 4823 conditions per place. [2025-03-13 21:44:04,851 INFO L140 encePairwiseOnDemand]: 38/49 looper letters, 365 selfloop transitions, 104 changer transitions 13/486 dead transitions. [2025-03-13 21:44:04,851 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 486 transitions, 3838 flow [2025-03-13 21:44:04,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-13 21:44:04,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-13 21:44:04,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 381 transitions. [2025-03-13 21:44:04,853 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5183673469387755 [2025-03-13 21:44:04,853 INFO L175 Difference]: Start difference. First operand has 90 places, 84 transitions, 511 flow. Second operand 15 states and 381 transitions. [2025-03-13 21:44:04,853 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 486 transitions, 3838 flow [2025-03-13 21:44:04,979 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 486 transitions, 3685 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-13 21:44:04,982 INFO L231 Difference]: Finished difference. Result has 111 places, 197 transitions, 1808 flow [2025-03-13 21:44:04,982 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=480, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=1808, PETRI_PLACES=111, PETRI_TRANSITIONS=197} [2025-03-13 21:44:04,982 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 68 predicate places. [2025-03-13 21:44:04,982 INFO L471 AbstractCegarLoop]: Abstraction has has 111 places, 197 transitions, 1808 flow [2025-03-13 21:44:04,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:44:04,982 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:44:04,983 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:44:04,988 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-13 21:44:05,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2025-03-13 21:44:05,183 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-13 21:44:05,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:44:05,184 INFO L85 PathProgramCache]: Analyzing trace with hash 5269148, now seen corresponding path program 1 times [2025-03-13 21:44:05,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:44:05,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556160128] [2025-03-13 21:44:05,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:44:05,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:44:05,190 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-13 21:44:05,193 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-13 21:44:05,193 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:44:05,193 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:44:05,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:44:05,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:44:05,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556160128] [2025-03-13 21:44:05,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556160128] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:44:05,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:44:05,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 21:44:05,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091832973] [2025-03-13 21:44:05,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:44:05,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-13 21:44:05,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:44:05,243 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-13 21:44:05,244 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-13 21:44:05,251 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 49 [2025-03-13 21:44:05,251 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 197 transitions, 1808 flow. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:44:05,251 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:44:05,252 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 49 [2025-03-13 21:44:05,252 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:44:06,849 INFO L124 PetriNetUnfolderBase]: 15734/24105 cut-off events. [2025-03-13 21:44:06,849 INFO L125 PetriNetUnfolderBase]: For 64453/64453 co-relation queries the response was YES. [2025-03-13 21:44:07,170 INFO L83 FinitePrefix]: Finished finitePrefix Result has 87825 conditions, 24105 events. 15734/24105 cut-off events. For 64453/64453 co-relation queries the response was YES. Maximal size of possible extension queue 1128. Compared 167466 event pairs, 8510 based on Foata normal form. 834/24929 useless extension candidates. Maximal degree in co-relation 87792. Up to 11559 conditions per place. [2025-03-13 21:44:07,326 INFO L140 encePairwiseOnDemand]: 41/49 looper letters, 260 selfloop transitions, 28 changer transitions 27/319 dead transitions. [2025-03-13 21:44:07,326 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 319 transitions, 3251 flow [2025-03-13 21:44:07,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 21:44:07,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 21:44:07,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 132 transitions. [2025-03-13 21:44:07,327 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4489795918367347 [2025-03-13 21:44:07,327 INFO L175 Difference]: Start difference. First operand has 111 places, 197 transitions, 1808 flow. Second operand 6 states and 132 transitions. [2025-03-13 21:44:07,327 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 319 transitions, 3251 flow [2025-03-13 21:44:07,598 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 319 transitions, 3149 flow, removed 26 selfloop flow, removed 3 redundant places. [2025-03-13 21:44:07,600 INFO L231 Difference]: Finished difference. Result has 116 places, 167 transitions, 1467 flow [2025-03-13 21:44:07,600 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=1359, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=167, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=139, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1467, PETRI_PLACES=116, PETRI_TRANSITIONS=167} [2025-03-13 21:44:07,600 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 73 predicate places. [2025-03-13 21:44:07,601 INFO L471 AbstractCegarLoop]: Abstraction has has 116 places, 167 transitions, 1467 flow [2025-03-13 21:44:07,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:44:07,601 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:44:07,601 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:44:07,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-13 21:44:07,601 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-13 21:44:07,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:44:07,601 INFO L85 PathProgramCache]: Analyzing trace with hash -1919906693, now seen corresponding path program 1 times [2025-03-13 21:44:07,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:44:07,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600426690] [2025-03-13 21:44:07,601 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:44:07,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:44:07,606 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-13 21:44:07,609 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-13 21:44:07,610 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:44:07,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:44:07,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:44:07,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:44:07,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600426690] [2025-03-13 21:44:07,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600426690] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:44:07,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:44:07,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-13 21:44:07,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961954070] [2025-03-13 21:44:07,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:44:07,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-13 21:44:07,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:44:07,651 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-13 21:44:07,651 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-13 21:44:07,657 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 49 [2025-03-13 21:44:07,657 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 167 transitions, 1467 flow. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:44:07,657 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:44:07,657 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 49 [2025-03-13 21:44:07,658 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:44:09,722 INFO L124 PetriNetUnfolderBase]: 18075/28109 cut-off events. [2025-03-13 21:44:09,722 INFO L125 PetriNetUnfolderBase]: For 87991/87991 co-relation queries the response was YES. [2025-03-13 21:44:09,842 INFO L83 FinitePrefix]: Finished finitePrefix Result has 108092 conditions, 28109 events. 18075/28109 cut-off events. For 87991/87991 co-relation queries the response was YES. Maximal size of possible extension queue 1318. Compared 203952 event pairs, 10205 based on Foata normal form. 958/29057 useless extension candidates. Maximal degree in co-relation 108056. Up to 14164 conditions per place. [2025-03-13 21:44:09,905 INFO L140 encePairwiseOnDemand]: 43/49 looper letters, 240 selfloop transitions, 16 changer transitions 28/288 dead transitions. [2025-03-13 21:44:09,906 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 288 transitions, 2946 flow [2025-03-13 21:44:09,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-13 21:44:09,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-13 21:44:09,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 126 transitions. [2025-03-13 21:44:09,906 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5142857142857142 [2025-03-13 21:44:09,906 INFO L175 Difference]: Start difference. First operand has 116 places, 167 transitions, 1467 flow. Second operand 5 states and 126 transitions. [2025-03-13 21:44:09,907 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 288 transitions, 2946 flow [2025-03-13 21:44:10,558 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 288 transitions, 2881 flow, removed 26 selfloop flow, removed 3 redundant places. [2025-03-13 21:44:10,561 INFO L231 Difference]: Finished difference. Result has 118 places, 139 transitions, 1172 flow [2025-03-13 21:44:10,561 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=1176, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1172, PETRI_PLACES=118, PETRI_TRANSITIONS=139} [2025-03-13 21:44:10,561 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 75 predicate places. [2025-03-13 21:44:10,561 INFO L471 AbstractCegarLoop]: Abstraction has has 118 places, 139 transitions, 1172 flow [2025-03-13 21:44:10,561 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:44:10,561 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:44:10,561 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:44:10,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-13 21:44:10,562 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-13 21:44:10,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:44:10,562 INFO L85 PathProgramCache]: Analyzing trace with hash 1049548376, now seen corresponding path program 1 times [2025-03-13 21:44:10,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:44:10,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276631247] [2025-03-13 21:44:10,562 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:44:10,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:44:10,569 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-13 21:44:10,580 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-13 21:44:10,580 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:44:10,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:44:10,939 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:44:10,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:44:10,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276631247] [2025-03-13 21:44:10,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276631247] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:44:10,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1766767058] [2025-03-13 21:44:10,940 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:44:10,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:44:10,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:44:10,942 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 21:44:10,944 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-13 21:44:10,988 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-13 21:44:11,009 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-13 21:44:11,009 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:44:11,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:44:11,011 INFO L256 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-13 21:44:11,012 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:44:11,415 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:44:11,416 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:44:12,454 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 21:44:12,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1766767058] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-13 21:44:12,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-13 21:44:12,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [10, 11] total 27 [2025-03-13 21:44:12,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750108742] [2025-03-13 21:44:12,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:44:12,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-13 21:44:12,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:44:12,455 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-13 21:44:12,455 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=613, Unknown=0, NotChecked=0, Total=702 [2025-03-13 21:44:12,494 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 49 [2025-03-13 21:44:12,495 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 139 transitions, 1172 flow. Second operand has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:44:12,495 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:44:12,495 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 49 [2025-03-13 21:44:12,495 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:44:16,233 INFO L124 PetriNetUnfolderBase]: 23922/35919 cut-off events. [2025-03-13 21:44:16,233 INFO L125 PetriNetUnfolderBase]: For 127960/128280 co-relation queries the response was YES. [2025-03-13 21:44:16,431 INFO L83 FinitePrefix]: Finished finitePrefix Result has 143258 conditions, 35919 events. 23922/35919 cut-off events. For 127960/128280 co-relation queries the response was YES. Maximal size of possible extension queue 1724. Compared 256832 event pairs, 3248 based on Foata normal form. 296/36201 useless extension candidates. Maximal degree in co-relation 143222. Up to 10226 conditions per place. [2025-03-13 21:44:16,549 INFO L140 encePairwiseOnDemand]: 36/49 looper letters, 426 selfloop transitions, 75 changer transitions 11/516 dead transitions. [2025-03-13 21:44:16,549 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 516 transitions, 5466 flow [2025-03-13 21:44:16,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-13 21:44:16,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-13 21:44:16,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 355 transitions. [2025-03-13 21:44:16,551 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5174927113702624 [2025-03-13 21:44:16,551 INFO L175 Difference]: Start difference. First operand has 118 places, 139 transitions, 1172 flow. Second operand 14 states and 355 transitions. [2025-03-13 21:44:16,551 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 516 transitions, 5466 flow [2025-03-13 21:44:17,983 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 516 transitions, 5220 flow, removed 82 selfloop flow, removed 8 redundant places. [2025-03-13 21:44:17,986 INFO L231 Difference]: Finished difference. Result has 126 places, 191 transitions, 1811 flow [2025-03-13 21:44:17,987 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=1068, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=1811, PETRI_PLACES=126, PETRI_TRANSITIONS=191} [2025-03-13 21:44:17,987 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 83 predicate places. [2025-03-13 21:44:17,987 INFO L471 AbstractCegarLoop]: Abstraction has has 126 places, 191 transitions, 1811 flow [2025-03-13 21:44:17,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:44:17,987 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:44:17,987 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:44:17,993 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-13 21:44:18,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-03-13 21:44:18,188 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-13 21:44:18,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:44:18,189 INFO L85 PathProgramCache]: Analyzing trace with hash -82496464, now seen corresponding path program 2 times [2025-03-13 21:44:18,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:44:18,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248663949] [2025-03-13 21:44:18,189 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:44:18,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:44:18,197 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-03-13 21:44:18,208 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 30 of 31 statements. [2025-03-13 21:44:18,208 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-13 21:44:18,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:44:18,506 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 21:44:18,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:44:18,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248663949] [2025-03-13 21:44:18,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248663949] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:44:18,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:44:18,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-13 21:44:18,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812139268] [2025-03-13 21:44:18,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:44:18,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-13 21:44:18,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:44:18,509 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-13 21:44:18,509 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-13 21:44:18,545 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 49 [2025-03-13 21:44:18,546 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 191 transitions, 1811 flow. Second operand has 10 states, 10 states have (on average 9.7) internal successors, (97), 10 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:44:18,546 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:44:18,546 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 49 [2025-03-13 21:44:18,546 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:44:21,686 INFO L124 PetriNetUnfolderBase]: 24847/37545 cut-off events. [2025-03-13 21:44:21,686 INFO L125 PetriNetUnfolderBase]: For 188601/188681 co-relation queries the response was YES. [2025-03-13 21:44:21,964 INFO L83 FinitePrefix]: Finished finitePrefix Result has 159598 conditions, 37545 events. 24847/37545 cut-off events. For 188601/188681 co-relation queries the response was YES. Maximal size of possible extension queue 1837. Compared 271323 event pairs, 4992 based on Foata normal form. 51/37589 useless extension candidates. Maximal degree in co-relation 159559. Up to 23932 conditions per place. [2025-03-13 21:44:22,070 INFO L140 encePairwiseOnDemand]: 35/49 looper letters, 241 selfloop transitions, 93 changer transitions 38/376 dead transitions. [2025-03-13 21:44:22,070 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 376 transitions, 4236 flow [2025-03-13 21:44:22,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-13 21:44:22,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-13 21:44:22,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 210 transitions. [2025-03-13 21:44:22,072 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.38961038961038963 [2025-03-13 21:44:22,072 INFO L175 Difference]: Start difference. First operand has 126 places, 191 transitions, 1811 flow. Second operand 11 states and 210 transitions. [2025-03-13 21:44:22,072 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 376 transitions, 4236 flow [2025-03-13 21:44:23,281 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 376 transitions, 4059 flow, removed 69 selfloop flow, removed 2 redundant places. [2025-03-13 21:44:23,284 INFO L231 Difference]: Finished difference. Result has 138 places, 223 transitions, 2363 flow [2025-03-13 21:44:23,284 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=1708, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=191, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2363, PETRI_PLACES=138, PETRI_TRANSITIONS=223} [2025-03-13 21:44:23,285 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 95 predicate places. [2025-03-13 21:44:23,285 INFO L471 AbstractCegarLoop]: Abstraction has has 138 places, 223 transitions, 2363 flow [2025-03-13 21:44:23,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.7) internal successors, (97), 10 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:44:23,285 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:44:23,285 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:44:23,285 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-13 21:44:23,285 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-13 21:44:23,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:44:23,286 INFO L85 PathProgramCache]: Analyzing trace with hash -1089101638, now seen corresponding path program 3 times [2025-03-13 21:44:23,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:44:23,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753253158] [2025-03-13 21:44:23,286 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-13 21:44:23,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:44:23,292 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 31 statements into 2 equivalence classes. [2025-03-13 21:44:23,300 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 30 of 31 statements. [2025-03-13 21:44:23,300 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-13 21:44:23,300 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:44:23,705 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 21:44:23,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:44:23,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753253158] [2025-03-13 21:44:23,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753253158] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:44:23,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:44:23,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-13 21:44:23,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755111367] [2025-03-13 21:44:23,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:44:23,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-13 21:44:23,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:44:23,706 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-13 21:44:23,706 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-13 21:44:23,736 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 49 [2025-03-13 21:44:23,736 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 223 transitions, 2363 flow. Second operand has 10 states, 10 states have (on average 9.7) internal successors, (97), 10 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:44:23,736 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:44:23,736 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 49 [2025-03-13 21:44:23,736 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:44:27,341 INFO L124 PetriNetUnfolderBase]: 24684/37412 cut-off events. [2025-03-13 21:44:27,341 INFO L125 PetriNetUnfolderBase]: For 201990/202038 co-relation queries the response was YES. [2025-03-13 21:44:27,642 INFO L83 FinitePrefix]: Finished finitePrefix Result has 165641 conditions, 37412 events. 24684/37412 cut-off events. For 201990/202038 co-relation queries the response was YES. Maximal size of possible extension queue 1806. Compared 271383 event pairs, 5291 based on Foata normal form. 37/37423 useless extension candidates. Maximal degree in co-relation 165597. Up to 23709 conditions per place. [2025-03-13 21:44:27,748 INFO L140 encePairwiseOnDemand]: 35/49 looper letters, 245 selfloop transitions, 93 changer transitions 36/378 dead transitions. [2025-03-13 21:44:27,748 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 378 transitions, 4435 flow [2025-03-13 21:44:27,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-13 21:44:27,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-13 21:44:27,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 207 transitions. [2025-03-13 21:44:27,749 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.38404452690166974 [2025-03-13 21:44:27,749 INFO L175 Difference]: Start difference. First operand has 138 places, 223 transitions, 2363 flow. Second operand 11 states and 207 transitions. [2025-03-13 21:44:27,749 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 378 transitions, 4435 flow [2025-03-13 21:44:29,256 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 378 transitions, 4184 flow, removed 10 selfloop flow, removed 7 redundant places. [2025-03-13 21:44:29,259 INFO L231 Difference]: Finished difference. Result has 144 places, 229 transitions, 2489 flow [2025-03-13 21:44:29,260 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=2132, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=223, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=87, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2489, PETRI_PLACES=144, PETRI_TRANSITIONS=229} [2025-03-13 21:44:29,260 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 101 predicate places. [2025-03-13 21:44:29,260 INFO L471 AbstractCegarLoop]: Abstraction has has 144 places, 229 transitions, 2489 flow [2025-03-13 21:44:29,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.7) internal successors, (97), 10 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:44:29,260 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:44:29,260 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:44:29,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-13 21:44:29,260 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-13 21:44:29,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:44:29,261 INFO L85 PathProgramCache]: Analyzing trace with hash -945055974, now seen corresponding path program 2 times [2025-03-13 21:44:29,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:44:29,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572219035] [2025-03-13 21:44:29,261 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:44:29,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:44:29,266 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-03-13 21:44:29,271 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 30 of 31 statements. [2025-03-13 21:44:29,271 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-13 21:44:29,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:44:29,518 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 21:44:29,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:44:29,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572219035] [2025-03-13 21:44:29,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572219035] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:44:29,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:44:29,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-13 21:44:29,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964246818] [2025-03-13 21:44:29,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:44:29,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-13 21:44:29,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:44:29,520 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-13 21:44:29,520 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-03-13 21:44:29,572 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 49 [2025-03-13 21:44:29,572 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 229 transitions, 2489 flow. Second operand has 11 states, 11 states have (on average 9.454545454545455) internal successors, (104), 11 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:44:29,572 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:44:29,572 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 49 [2025-03-13 21:44:29,572 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:44:33,966 INFO L124 PetriNetUnfolderBase]: 30078/45450 cut-off events. [2025-03-13 21:44:33,966 INFO L125 PetriNetUnfolderBase]: For 253074/253290 co-relation queries the response was YES. [2025-03-13 21:44:34,368 INFO L83 FinitePrefix]: Finished finitePrefix Result has 203889 conditions, 45450 events. 30078/45450 cut-off events. For 253074/253290 co-relation queries the response was YES. Maximal size of possible extension queue 2177. Compared 336462 event pairs, 6556 based on Foata normal form. 216/45662 useless extension candidates. Maximal degree in co-relation 203843. Up to 24998 conditions per place. [2025-03-13 21:44:34,513 INFO L140 encePairwiseOnDemand]: 34/49 looper letters, 462 selfloop transitions, 102 changer transitions 14/582 dead transitions. [2025-03-13 21:44:34,513 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 582 transitions, 6750 flow [2025-03-13 21:44:34,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-13 21:44:34,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-13 21:44:34,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 328 transitions. [2025-03-13 21:44:34,514 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.478134110787172 [2025-03-13 21:44:34,514 INFO L175 Difference]: Start difference. First operand has 144 places, 229 transitions, 2489 flow. Second operand 14 states and 328 transitions. [2025-03-13 21:44:34,514 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 582 transitions, 6750 flow [2025-03-13 21:44:36,463 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 582 transitions, 6383 flow, removed 7 selfloop flow, removed 8 redundant places. [2025-03-13 21:44:36,467 INFO L231 Difference]: Finished difference. Result has 158 places, 291 transitions, 3354 flow [2025-03-13 21:44:36,467 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=2281, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=229, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=155, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=3354, PETRI_PLACES=158, PETRI_TRANSITIONS=291} [2025-03-13 21:44:36,468 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 115 predicate places. [2025-03-13 21:44:36,468 INFO L471 AbstractCegarLoop]: Abstraction has has 158 places, 291 transitions, 3354 flow [2025-03-13 21:44:36,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.454545454545455) internal successors, (104), 11 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:44:36,468 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:44:36,468 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:44:36,468 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-13 21:44:36,468 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-13 21:44:36,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:44:36,469 INFO L85 PathProgramCache]: Analyzing trace with hash -1801914276, now seen corresponding path program 3 times [2025-03-13 21:44:36,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:44:36,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321168956] [2025-03-13 21:44:36,469 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-13 21:44:36,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:44:36,474 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 31 statements into 2 equivalence classes. [2025-03-13 21:44:36,478 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 30 of 31 statements. [2025-03-13 21:44:36,479 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-13 21:44:36,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:44:36,722 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 21:44:36,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:44:36,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321168956] [2025-03-13 21:44:36,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321168956] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:44:36,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:44:36,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-13 21:44:36,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492446448] [2025-03-13 21:44:36,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:44:36,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-13 21:44:36,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:44:36,724 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-13 21:44:36,724 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-03-13 21:44:36,768 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 49 [2025-03-13 21:44:36,768 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 291 transitions, 3354 flow. Second operand has 11 states, 11 states have (on average 9.454545454545455) internal successors, (104), 11 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:44:36,768 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:44:36,768 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 49 [2025-03-13 21:44:36,768 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand