/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.automaton.type.used.in.concurrency.analysis PETRI_NET -i ../../../trunk/examples/svcomp/pthread-ext/09_fmaxsym-zero.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 19:16:20,755 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 19:16:20,807 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2025-04-13 19:16:20,811 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 19:16:20,812 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 19:16:20,831 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 19:16:20,832 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 19:16:20,832 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 19:16:20,833 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 19:16:20,833 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 19:16:20,833 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 19:16:20,833 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 19:16:20,834 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 19:16:20,834 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 19:16:20,834 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 19:16:20,834 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 19:16:20,835 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 19:16:20,835 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 19:16:20,835 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 19:16:20,835 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 19:16:20,835 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 19:16:20,835 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 19:16:20,835 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 19:16:20,835 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 19:16:20,835 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 19:16:20,835 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 19:16:20,835 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 19:16:20,835 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 19:16:20,835 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 19:16:20,835 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 19:16:20,835 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 19:16:20,836 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 19:16:20,836 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 19:16:20,836 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 19:16:20,836 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 19:16:20,836 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 19:16:20,836 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 19:16:20,836 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 19:16:20,836 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 19:16:20,836 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 19:16:20,836 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 19:16:20,836 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 19:16:20,836 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 19:16:20,836 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 19:16:20,836 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 19:16:20,836 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 19:16:20,836 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 19:16:20,836 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Automaton type used in concurrency analysis -> PETRI_NET [2025-04-13 19:16:21,073 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 19:16:21,083 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 19:16:21,084 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 19:16:21,085 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 19:16:21,086 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 19:16:21,087 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-ext/09_fmaxsym-zero.i [2025-04-13 19:16:22,410 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cca21f413/1c9ca39e5b6c48cbb571fbf29eadc874/FLAGd38d96de9 [2025-04-13 19:16:22,654 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 19:16:22,655 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/09_fmaxsym-zero.i [2025-04-13 19:16:22,672 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cca21f413/1c9ca39e5b6c48cbb571fbf29eadc874/FLAGd38d96de9 [2025-04-13 19:16:23,462 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cca21f413/1c9ca39e5b6c48cbb571fbf29eadc874 [2025-04-13 19:16:23,464 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 19:16:23,465 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 19:16:23,466 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 19:16:23,466 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 19:16:23,468 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 19:16:23,469 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 07:16:23" (1/1) ... [2025-04-13 19:16:23,469 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7406eb76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:16:23, skipping insertion in model container [2025-04-13 19:16:23,469 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 07:16:23" (1/1) ... [2025-04-13 19:16:23,490 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 19:16:23,707 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/09_fmaxsym-zero.i[30725,30738] [2025-04-13 19:16:23,719 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 19:16:23,732 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 19:16:23,796 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/09_fmaxsym-zero.i[30725,30738] [2025-04-13 19:16:23,802 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 19:16:23,829 INFO L204 MainTranslator]: Completed translation [2025-04-13 19:16:23,831 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:16:23 WrapperNode [2025-04-13 19:16:23,831 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 19:16:23,832 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 19:16:23,832 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 19:16:23,832 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 19:16:23,836 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:16:23" (1/1) ... [2025-04-13 19:16:23,850 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:16:23" (1/1) ... [2025-04-13 19:16:23,869 INFO L138 Inliner]: procedures = 164, calls = 25, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 67 [2025-04-13 19:16:23,870 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 19:16:23,870 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 19:16:23,870 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 19:16:23,870 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 19:16:23,875 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:16:23" (1/1) ... [2025-04-13 19:16:23,875 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:16:23" (1/1) ... [2025-04-13 19:16:23,877 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:16:23" (1/1) ... [2025-04-13 19:16:23,885 INFO L175 MemorySlicer]: Split 14 memory accesses to 3 slices as follows [2, 5, 7]. 50 percent of accesses are in the largest equivalence class. The 13 initializations are split as follows [2, 5, 6]. The 0 writes are split as follows [0, 0, 0]. [2025-04-13 19:16:23,885 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:16:23" (1/1) ... [2025-04-13 19:16:23,885 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:16:23" (1/1) ... [2025-04-13 19:16:23,888 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:16:23" (1/1) ... [2025-04-13 19:16:23,889 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:16:23" (1/1) ... [2025-04-13 19:16:23,890 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:16:23" (1/1) ... [2025-04-13 19:16:23,891 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:16:23" (1/1) ... [2025-04-13 19:16:23,892 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:16:23" (1/1) ... [2025-04-13 19:16:23,894 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 19:16:23,895 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-13 19:16:23,895 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-13 19:16:23,895 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-13 19:16:23,896 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:16:23" (1/1) ... [2025-04-13 19:16:23,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 19:16:23,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:16:23,918 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-04-13 19:16:23,920 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-04-13 19:16:23,934 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-13 19:16:23,934 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-13 19:16:23,935 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-04-13 19:16:23,935 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2025-04-13 19:16:23,935 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2025-04-13 19:16:23,935 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-04-13 19:16:23,935 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 19:16:23,935 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 19:16:23,935 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-13 19:16:23,935 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-04-13 19:16:23,935 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-04-13 19:16:23,935 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 19:16:23,935 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 19:16:23,936 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-13 19:16:24,019 INFO L234 CfgBuilder]: Building ICFG [2025-04-13 19:16:24,020 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 19:16:24,131 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 19:16:24,132 INFO L289 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 19:16:24,132 INFO L294 CfgBuilder]: Performing block encoding [2025-04-13 19:16:24,249 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 19:16:24,254 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 19:16:24,270 INFO L313 CfgBuilder]: Removed 1 assume(true) statements. [2025-04-13 19:16:24,270 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 07:16:24 BoogieIcfgContainer [2025-04-13 19:16:24,270 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-13 19:16:24,271 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 19:16:24,271 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 19:16:24,275 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 19:16:24,276 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 07:16:23" (1/3) ... [2025-04-13 19:16:24,276 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@664aa6fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 07:16:24, skipping insertion in model container [2025-04-13 19:16:24,276 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:16:23" (2/3) ... [2025-04-13 19:16:24,276 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@664aa6fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 07:16:24, skipping insertion in model container [2025-04-13 19:16:24,276 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 07:16:24" (3/3) ... [2025-04-13 19:16:24,277 INFO L128 eAbstractionObserver]: Analyzing ICFG 09_fmaxsym-zero.i [2025-04-13 19:16:24,287 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 19:16:24,288 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 09_fmaxsym-zero.i that has 2 procedures, 11 locations, 13 edges, 1 initial locations, 2 loop locations, and 1 error locations. [2025-04-13 19:16:24,289 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 19:16:24,321 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-13 19:16:24,346 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 14 places, 14 transitions, 32 flow [2025-04-13 19:16:24,367 INFO L116 PetriNetUnfolderBase]: 2/14 cut-off events. [2025-04-13 19:16:24,370 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-13 19:16:24,372 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18 conditions, 14 events. 2/14 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 16 event pairs, 0 based on Foata normal form. 0/9 useless extension candidates. Maximal degree in co-relation 10. Up to 2 conditions per place. [2025-04-13 19:16:24,372 INFO L82 GeneralOperation]: Start removeDead. Operand has 14 places, 14 transitions, 32 flow [2025-04-13 19:16:24,374 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 14 places, 13 transitions, 30 flow [2025-04-13 19:16:24,382 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 19:16:24,390 INFO L340 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;@10326dd1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 19:16:24,391 INFO L341 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-04-13 19:16:24,395 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 19:16:24,395 INFO L116 PetriNetUnfolderBase]: 0/6 cut-off events. [2025-04-13 19:16:24,395 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-13 19:16:24,396 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:16:24,396 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-04-13 19:16:24,396 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-13 19:16:24,400 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:16:24,400 INFO L85 PathProgramCache]: Analyzing trace with hash 6848602, now seen corresponding path program 1 times [2025-04-13 19:16:24,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:16:24,405 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787285582] [2025-04-13 19:16:24,406 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:16:24,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:16:24,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-13 19:16:24,469 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-13 19:16:24,469 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:16:24,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 19:16:24,470 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-13 19:16:24,474 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-13 19:16:24,490 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-13 19:16:24,491 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:16:24,491 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 19:16:24,504 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-13 19:16:24,505 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-13 19:16:24,505 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2025-04-13 19:16:24,507 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2025-04-13 19:16:24,507 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 3 remaining) [2025-04-13 19:16:24,507 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 19:16:24,508 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2025-04-13 19:16:24,511 WARN L247 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-13 19:16:24,511 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-04-13 19:16:24,561 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-13 19:16:24,562 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 23 places, 23 transitions, 56 flow [2025-04-13 19:16:24,573 INFO L116 PetriNetUnfolderBase]: 4/25 cut-off events. [2025-04-13 19:16:24,573 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-13 19:16:24,573 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33 conditions, 25 events. 4/25 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 49 event pairs, 0 based on Foata normal form. 0/16 useless extension candidates. Maximal degree in co-relation 18. Up to 3 conditions per place. [2025-04-13 19:16:24,573 INFO L82 GeneralOperation]: Start removeDead. Operand has 23 places, 23 transitions, 56 flow [2025-04-13 19:16:24,574 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 23 places, 22 transitions, 54 flow [2025-04-13 19:16:24,576 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 19:16:24,577 INFO L340 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;@10326dd1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 19:16:24,577 INFO L341 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-04-13 19:16:24,583 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 19:16:24,583 INFO L116 PetriNetUnfolderBase]: 0/13 cut-off events. [2025-04-13 19:16:24,583 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-13 19:16:24,583 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:16:24,583 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2025-04-13 19:16:24,583 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-04-13 19:16:24,583 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:16:24,584 INFO L85 PathProgramCache]: Analyzing trace with hash -1320604514, now seen corresponding path program 1 times [2025-04-13 19:16:24,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:16:24,584 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933704491] [2025-04-13 19:16:24,584 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:16:24,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:16:24,602 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-13 19:16:24,608 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-13 19:16:24,608 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:16:24,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 19:16:24,609 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-13 19:16:24,613 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-13 19:16:24,623 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-13 19:16:24,624 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:16:24,624 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 19:16:24,630 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-13 19:16:24,630 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-13 19:16:24,630 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 4 remaining) [2025-04-13 19:16:24,631 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2025-04-13 19:16:24,631 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2025-04-13 19:16:24,631 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2025-04-13 19:16:24,631 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 19:16:24,631 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2025-04-13 19:16:24,631 WARN L247 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-13 19:16:24,631 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-04-13 19:16:24,660 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-13 19:16:24,663 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 32 transitions, 82 flow [2025-04-13 19:16:24,673 INFO L116 PetriNetUnfolderBase]: 6/36 cut-off events. [2025-04-13 19:16:24,674 INFO L117 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-04-13 19:16:24,674 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49 conditions, 36 events. 6/36 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 80 event pairs, 0 based on Foata normal form. 0/23 useless extension candidates. Maximal degree in co-relation 32. Up to 4 conditions per place. [2025-04-13 19:16:24,674 INFO L82 GeneralOperation]: Start removeDead. Operand has 32 places, 32 transitions, 82 flow [2025-04-13 19:16:24,675 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 32 places, 31 transitions, 80 flow [2025-04-13 19:16:24,676 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 19:16:24,677 INFO L340 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;@10326dd1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 19:16:24,677 INFO L341 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-04-13 19:16:24,684 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 19:16:24,685 INFO L116 PetriNetUnfolderBase]: 2/23 cut-off events. [2025-04-13 19:16:24,685 INFO L117 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-04-13 19:16:24,685 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:16:24,685 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:16:24,685 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-04-13 19:16:24,685 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:16:24,685 INFO L85 PathProgramCache]: Analyzing trace with hash 1530993031, now seen corresponding path program 1 times [2025-04-13 19:16:24,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:16:24,686 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816851560] [2025-04-13 19:16:24,686 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:16:24,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:16:24,701 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-13 19:16:24,723 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-13 19:16:24,724 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:16:24,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:16:24,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:16:24,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:16:24,880 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816851560] [2025-04-13 19:16:24,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1816851560] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:16:24,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:16:24,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 19:16:24,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135965245] [2025-04-13 19:16:24,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:16:24,886 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 19:16:24,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:16:24,905 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 19:16:24,905 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 19:16:24,906 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 32 [2025-04-13 19:16:24,908 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 31 transitions, 80 flow. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:16:24,908 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:16:24,908 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 32 [2025-04-13 19:16:24,908 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:16:25,266 INFO L116 PetriNetUnfolderBase]: 1651/2344 cut-off events. [2025-04-13 19:16:25,267 INFO L117 PetriNetUnfolderBase]: For 281/281 co-relation queries the response was YES. [2025-04-13 19:16:25,272 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4873 conditions, 2344 events. 1651/2344 cut-off events. For 281/281 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 9277 event pairs, 867 based on Foata normal form. 0/1870 useless extension candidates. Maximal degree in co-relation 1932. Up to 1559 conditions per place. [2025-04-13 19:16:25,288 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 39 selfloop transitions, 3 changer transitions 0/43 dead transitions. [2025-04-13 19:16:25,289 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 43 transitions, 200 flow [2025-04-13 19:16:25,291 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 19:16:25,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 19:16:25,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 53 transitions. [2025-04-13 19:16:25,302 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5520833333333334 [2025-04-13 19:16:25,303 INFO L175 Difference]: Start difference. First operand has 32 places, 31 transitions, 80 flow. Second operand 3 states and 53 transitions. [2025-04-13 19:16:25,304 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 43 transitions, 200 flow [2025-04-13 19:16:25,309 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 43 transitions, 196 flow, removed 2 selfloop flow, removed 0 redundant places. [2025-04-13 19:16:25,312 INFO L231 Difference]: Finished difference. Result has 32 places, 26 transitions, 74 flow [2025-04-13 19:16:25,314 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=74, PETRI_PLACES=32, PETRI_TRANSITIONS=26} [2025-04-13 19:16:25,316 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 0 predicate places. [2025-04-13 19:16:25,317 INFO L485 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 74 flow [2025-04-13 19:16:25,317 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:16:25,317 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:16:25,317 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1] [2025-04-13 19:16:25,317 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 19:16:25,317 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-04-13 19:16:25,318 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:16:25,318 INFO L85 PathProgramCache]: Analyzing trace with hash -55744525, now seen corresponding path program 1 times [2025-04-13 19:16:25,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:16:25,318 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109060888] [2025-04-13 19:16:25,318 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:16:25,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:16:25,327 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-13 19:16:25,332 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-13 19:16:25,332 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:16:25,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 19:16:25,332 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-13 19:16:25,334 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-13 19:16:25,338 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-13 19:16:25,338 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:16:25,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 19:16:25,343 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-13 19:16:25,344 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-13 19:16:25,344 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2025-04-13 19:16:25,344 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2025-04-13 19:16:25,344 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 5 remaining) [2025-04-13 19:16:25,344 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2025-04-13 19:16:25,344 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2025-04-13 19:16:25,344 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 19:16:25,344 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-04-13 19:16:25,345 WARN L247 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-13 19:16:25,345 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-04-13 19:16:25,377 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-13 19:16:25,379 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 41 transitions, 110 flow [2025-04-13 19:16:25,384 INFO L116 PetriNetUnfolderBase]: 8/47 cut-off events. [2025-04-13 19:16:25,384 INFO L117 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-04-13 19:16:25,385 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66 conditions, 47 events. 8/47 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 108 event pairs, 0 based on Foata normal form. 0/30 useless extension candidates. Maximal degree in co-relation 48. Up to 5 conditions per place. [2025-04-13 19:16:25,385 INFO L82 GeneralOperation]: Start removeDead. Operand has 41 places, 41 transitions, 110 flow [2025-04-13 19:16:25,385 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 41 places, 40 transitions, 108 flow [2025-04-13 19:16:25,386 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 19:16:25,387 INFO L340 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;@10326dd1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 19:16:25,387 INFO L341 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-04-13 19:16:25,390 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 19:16:25,390 INFO L116 PetriNetUnfolderBase]: 2/23 cut-off events. [2025-04-13 19:16:25,390 INFO L117 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2025-04-13 19:16:25,390 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:16:25,390 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:16:25,390 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 19:16:25,391 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:16:25,391 INFO L85 PathProgramCache]: Analyzing trace with hash 713527632, now seen corresponding path program 1 times [2025-04-13 19:16:25,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:16:25,391 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062438185] [2025-04-13 19:16:25,391 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:16:25,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:16:25,400 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-13 19:16:25,408 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-13 19:16:25,408 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:16:25,408 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:16:25,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:16:25,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:16:25,451 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062438185] [2025-04-13 19:16:25,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062438185] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:16:25,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:16:25,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 19:16:25,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440344148] [2025-04-13 19:16:25,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:16:25,452 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 19:16:25,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:16:25,452 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 19:16:25,452 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 19:16:25,452 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 41 [2025-04-13 19:16:25,452 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 40 transitions, 108 flow. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:16:25,452 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:16:25,453 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 41 [2025-04-13 19:16:25,453 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:16:26,824 INFO L116 PetriNetUnfolderBase]: 16351/21184 cut-off events. [2025-04-13 19:16:26,824 INFO L117 PetriNetUnfolderBase]: For 3362/3362 co-relation queries the response was YES. [2025-04-13 19:16:26,852 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44000 conditions, 21184 events. 16351/21184 cut-off events. For 3362/3362 co-relation queries the response was YES. Maximal size of possible extension queue 492. Compared 94666 event pairs, 8805 based on Foata normal form. 0/16496 useless extension candidates. Maximal degree in co-relation 9744. Up to 14103 conditions per place. [2025-04-13 19:16:26,946 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 55 selfloop transitions, 3 changer transitions 0/59 dead transitions. [2025-04-13 19:16:26,946 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 59 transitions, 283 flow [2025-04-13 19:16:26,947 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 19:16:26,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 19:16:26,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 71 transitions. [2025-04-13 19:16:26,948 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5772357723577236 [2025-04-13 19:16:26,948 INFO L175 Difference]: Start difference. First operand has 41 places, 40 transitions, 108 flow. Second operand 3 states and 71 transitions. [2025-04-13 19:16:26,948 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 59 transitions, 283 flow [2025-04-13 19:16:26,951 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 59 transitions, 271 flow, removed 6 selfloop flow, removed 0 redundant places. [2025-04-13 19:16:26,952 INFO L231 Difference]: Finished difference. Result has 41 places, 34 transitions, 96 flow [2025-04-13 19:16:26,952 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=96, PETRI_PLACES=41, PETRI_TRANSITIONS=34} [2025-04-13 19:16:26,954 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 0 predicate places. [2025-04-13 19:16:26,954 INFO L485 AbstractCegarLoop]: Abstraction has has 41 places, 34 transitions, 96 flow [2025-04-13 19:16:26,954 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:16:26,954 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:16:26,954 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:16:26,954 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-13 19:16:26,954 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 19:16:26,955 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:16:26,955 INFO L85 PathProgramCache]: Analyzing trace with hash 172968756, now seen corresponding path program 1 times [2025-04-13 19:16:26,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:16:26,955 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878997757] [2025-04-13 19:16:26,955 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:16:26,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:16:26,964 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-13 19:16:26,970 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-13 19:16:26,970 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:16:26,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:16:27,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:16:27,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:16:27,017 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878997757] [2025-04-13 19:16:27,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878997757] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:16:27,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:16:27,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 19:16:27,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056710893] [2025-04-13 19:16:27,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:16:27,018 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 19:16:27,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:16:27,018 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 19:16:27,018 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 19:16:27,018 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 41 [2025-04-13 19:16:27,018 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 34 transitions, 96 flow. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:16:27,018 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:16:27,018 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 41 [2025-04-13 19:16:27,018 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:16:27,942 INFO L116 PetriNetUnfolderBase]: 14017/18182 cut-off events. [2025-04-13 19:16:27,942 INFO L117 PetriNetUnfolderBase]: For 2502/2502 co-relation queries the response was YES. [2025-04-13 19:16:27,970 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39265 conditions, 18182 events. 14017/18182 cut-off events. For 2502/2502 co-relation queries the response was YES. Maximal size of possible extension queue 431. Compared 79890 event pairs, 7487 based on Foata normal form. 0/14652 useless extension candidates. Maximal degree in co-relation 32952. Up to 12099 conditions per place. [2025-04-13 19:16:28,032 INFO L140 encePairwiseOnDemand]: 37/41 looper letters, 52 selfloop transitions, 3 changer transitions 0/56 dead transitions. [2025-04-13 19:16:28,032 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 56 transitions, 266 flow [2025-04-13 19:16:28,032 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 19:16:28,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 19:16:28,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 59 transitions. [2025-04-13 19:16:28,034 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4796747967479675 [2025-04-13 19:16:28,035 INFO L175 Difference]: Start difference. First operand has 41 places, 34 transitions, 96 flow. Second operand 3 states and 59 transitions. [2025-04-13 19:16:28,035 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 56 transitions, 266 flow [2025-04-13 19:16:28,041 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 56 transitions, 254 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-13 19:16:28,042 INFO L231 Difference]: Finished difference. Result has 40 places, 33 transitions, 94 flow [2025-04-13 19:16:28,042 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=94, PETRI_PLACES=40, PETRI_TRANSITIONS=33} [2025-04-13 19:16:28,044 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, -1 predicate places. [2025-04-13 19:16:28,044 INFO L485 AbstractCegarLoop]: Abstraction has has 40 places, 33 transitions, 94 flow [2025-04-13 19:16:28,044 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:16:28,044 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:16:28,044 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1] [2025-04-13 19:16:28,044 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-13 19:16:28,045 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 19:16:28,045 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:16:28,045 INFO L85 PathProgramCache]: Analyzing trace with hash 330161017, now seen corresponding path program 1 times [2025-04-13 19:16:28,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:16:28,045 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475852118] [2025-04-13 19:16:28,045 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:16:28,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:16:28,050 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-13 19:16:28,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-13 19:16:28,054 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:16:28,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 19:16:28,054 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-13 19:16:28,060 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-13 19:16:28,067 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-13 19:16:28,067 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:16:28,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 19:16:28,075 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-13 19:16:28,075 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-13 19:16:28,075 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2025-04-13 19:16:28,078 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2025-04-13 19:16:28,078 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 6 remaining) [2025-04-13 19:16:28,079 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2025-04-13 19:16:28,079 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2025-04-13 19:16:28,079 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2025-04-13 19:16:28,079 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-13 19:16:28,079 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-04-13 19:16:28,079 WARN L247 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-13 19:16:28,079 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2025-04-13 19:16:28,111 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-13 19:16:28,112 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 50 transitions, 140 flow [2025-04-13 19:16:28,119 INFO L116 PetriNetUnfolderBase]: 10/58 cut-off events. [2025-04-13 19:16:28,119 INFO L117 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2025-04-13 19:16:28,120 INFO L83 FinitePrefix]: Finished finitePrefix Result has 84 conditions, 58 events. 10/58 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 139 event pairs, 0 based on Foata normal form. 0/37 useless extension candidates. Maximal degree in co-relation 65. Up to 6 conditions per place. [2025-04-13 19:16:28,120 INFO L82 GeneralOperation]: Start removeDead. Operand has 50 places, 50 transitions, 140 flow [2025-04-13 19:16:28,121 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 50 places, 49 transitions, 138 flow [2025-04-13 19:16:28,122 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 19:16:28,122 INFO L340 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;@10326dd1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 19:16:28,122 INFO L341 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-04-13 19:16:28,125 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 19:16:28,125 INFO L116 PetriNetUnfolderBase]: 2/23 cut-off events. [2025-04-13 19:16:28,125 INFO L117 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2025-04-13 19:16:28,125 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:16:28,125 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:16:28,125 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 19:16:28,125 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:16:28,125 INFO L85 PathProgramCache]: Analyzing trace with hash -455357006, now seen corresponding path program 1 times [2025-04-13 19:16:28,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:16:28,126 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570916898] [2025-04-13 19:16:28,126 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:16:28,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:16:28,131 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-13 19:16:28,135 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-13 19:16:28,135 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:16:28,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:16:28,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:16:28,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:16:28,184 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570916898] [2025-04-13 19:16:28,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [570916898] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:16:28,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:16:28,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 19:16:28,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107231910] [2025-04-13 19:16:28,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:16:28,184 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 19:16:28,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:16:28,185 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 19:16:28,185 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 19:16:28,185 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 50 [2025-04-13 19:16:28,185 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 49 transitions, 138 flow. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:16:28,185 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:16:28,185 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 50 [2025-04-13 19:16:28,185 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:16:36,570 INFO L116 PetriNetUnfolderBase]: 148063/181900 cut-off events. [2025-04-13 19:16:36,570 INFO L117 PetriNetUnfolderBase]: For 36115/36115 co-relation queries the response was YES. [2025-04-13 19:16:36,864 INFO L83 FinitePrefix]: Finished finitePrefix Result has 377589 conditions, 181900 events. 148063/181900 cut-off events. For 36115/36115 co-relation queries the response was YES. Maximal size of possible extension queue 3105. Compared 877332 event pairs, 80835 based on Foata normal form. 0/139482 useless extension candidates. Maximal degree in co-relation 51744. Up to 121119 conditions per place. [2025-04-13 19:16:37,475 INFO L140 encePairwiseOnDemand]: 40/50 looper letters, 71 selfloop transitions, 3 changer transitions 0/75 dead transitions. [2025-04-13 19:16:37,476 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 75 transitions, 370 flow [2025-04-13 19:16:37,477 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 19:16:37,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 19:16:37,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 89 transitions. [2025-04-13 19:16:37,477 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5933333333333334 [2025-04-13 19:16:37,477 INFO L175 Difference]: Start difference. First operand has 50 places, 49 transitions, 138 flow. Second operand 3 states and 89 transitions. [2025-04-13 19:16:37,477 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 75 transitions, 370 flow [2025-04-13 19:16:37,493 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 75 transitions, 346 flow, removed 12 selfloop flow, removed 0 redundant places. [2025-04-13 19:16:37,494 INFO L231 Difference]: Finished difference. Result has 50 places, 42 transitions, 118 flow [2025-04-13 19:16:37,494 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=118, PETRI_PLACES=50, PETRI_TRANSITIONS=42} [2025-04-13 19:16:37,495 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 0 predicate places. [2025-04-13 19:16:37,495 INFO L485 AbstractCegarLoop]: Abstraction has has 50 places, 42 transitions, 118 flow [2025-04-13 19:16:37,495 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:16:37,495 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:16:37,495 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:16:37,495 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-13 19:16:37,495 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 19:16:37,495 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:16:37,496 INFO L85 PathProgramCache]: Analyzing trace with hash 1109156926, now seen corresponding path program 1 times [2025-04-13 19:16:37,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:16:37,496 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214542880] [2025-04-13 19:16:37,496 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:16:37,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:16:37,502 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-13 19:16:37,506 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-13 19:16:37,507 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:16:37,507 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:16:37,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-04-13 19:16:37,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:16:37,542 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214542880] [2025-04-13 19:16:37,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1214542880] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:16:37,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:16:37,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 19:16:37,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371521645] [2025-04-13 19:16:37,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:16:37,542 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 19:16:37,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:16:37,543 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 19:16:37,543 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 19:16:37,543 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 50 [2025-04-13 19:16:37,543 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 42 transitions, 118 flow. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:16:37,543 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:16:37,543 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 50 [2025-04-13 19:16:37,543 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:16:44,663 INFO L116 PetriNetUnfolderBase]: 126913/155918 cut-off events. [2025-04-13 19:16:44,663 INFO L117 PetriNetUnfolderBase]: For 17564/17564 co-relation queries the response was YES. [2025-04-13 19:16:45,213 INFO L83 FinitePrefix]: Finished finitePrefix Result has 332234 conditions, 155918 events. 126913/155918 cut-off events. For 17564/17564 co-relation queries the response was YES. Maximal size of possible extension queue 2703. Compared 738570 event pairs, 68835 based on Foata normal form. 0/122988 useless extension candidates. Maximal degree in co-relation 226104. Up to 103827 conditions per place. [2025-04-13 19:16:45,689 INFO L140 encePairwiseOnDemand]: 46/50 looper letters, 68 selfloop transitions, 3 changer transitions 0/72 dead transitions. [2025-04-13 19:16:45,689 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 72 transitions, 341 flow [2025-04-13 19:16:45,689 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 19:16:45,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 19:16:45,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 75 transitions. [2025-04-13 19:16:45,690 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5 [2025-04-13 19:16:45,690 INFO L175 Difference]: Start difference. First operand has 50 places, 42 transitions, 118 flow. Second operand 3 states and 75 transitions. [2025-04-13 19:16:45,690 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 72 transitions, 341 flow [2025-04-13 19:16:45,715 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 72 transitions, 329 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-13 19:16:45,716 INFO L231 Difference]: Finished difference. Result has 49 places, 41 transitions, 116 flow [2025-04-13 19:16:45,716 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=116, PETRI_PLACES=49, PETRI_TRANSITIONS=41} [2025-04-13 19:16:45,716 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, -1 predicate places. [2025-04-13 19:16:45,716 INFO L485 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 116 flow [2025-04-13 19:16:45,716 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:16:45,716 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:16:45,716 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:16:45,716 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-13 19:16:45,717 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 19:16:45,717 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:16:45,717 INFO L85 PathProgramCache]: Analyzing trace with hash 159152257, now seen corresponding path program 1 times [2025-04-13 19:16:45,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:16:45,717 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532482811] [2025-04-13 19:16:45,717 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:16:45,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:16:45,723 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-13 19:16:45,727 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-13 19:16:45,727 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:16:45,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:16:45,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:16:45,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:16:45,769 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532482811] [2025-04-13 19:16:45,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532482811] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:16:45,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:16:45,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 19:16:45,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552456529] [2025-04-13 19:16:45,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:16:45,770 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 19:16:45,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:16:45,770 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 19:16:45,770 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 19:16:45,770 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 50 [2025-04-13 19:16:45,771 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 116 flow. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:16:45,771 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:16:45,771 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 50 [2025-04-13 19:16:45,771 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:16:51,771 INFO L116 PetriNetUnfolderBase]: 108805/133802 cut-off events. [2025-04-13 19:16:51,772 INFO L117 PetriNetUnfolderBase]: For 16192/16192 co-relation queries the response was YES. [2025-04-13 19:16:52,085 INFO L83 FinitePrefix]: Finished finitePrefix Result has 284984 conditions, 133802 events. 108805/133802 cut-off events. For 16192/16192 co-relation queries the response was YES. Maximal size of possible extension queue 2351. Compared 624941 event pairs, 58667 based on Foata normal form. 0/108504 useless extension candidates. Maximal degree in co-relation 189744. Up to 89091 conditions per place. [2025-04-13 19:16:52,660 INFO L140 encePairwiseOnDemand]: 46/50 looper letters, 65 selfloop transitions, 3 changer transitions 0/69 dead transitions. [2025-04-13 19:16:52,660 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 69 transitions, 324 flow [2025-04-13 19:16:52,661 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 19:16:52,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 19:16:52,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 72 transitions. [2025-04-13 19:16:52,661 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.48 [2025-04-13 19:16:52,661 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 116 flow. Second operand 3 states and 72 transitions. [2025-04-13 19:16:52,662 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 69 transitions, 324 flow [2025-04-13 19:16:52,703 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 69 transitions, 312 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-13 19:16:52,704 INFO L231 Difference]: Finished difference. Result has 48 places, 40 transitions, 114 flow [2025-04-13 19:16:52,704 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=114, PETRI_PLACES=48, PETRI_TRANSITIONS=40} [2025-04-13 19:16:52,705 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, -2 predicate places. [2025-04-13 19:16:52,705 INFO L485 AbstractCegarLoop]: Abstraction has has 48 places, 40 transitions, 114 flow [2025-04-13 19:16:52,705 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:16:52,705 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:16:52,705 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:16:52,705 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-13 19:16:52,705 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 19:16:52,705 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:16:52,706 INFO L85 PathProgramCache]: Analyzing trace with hash 146837584, now seen corresponding path program 1 times [2025-04-13 19:16:52,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:16:52,706 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434566816] [2025-04-13 19:16:52,706 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:16:52,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:16:52,710 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-13 19:16:52,713 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-13 19:16:52,713 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:16:52,713 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 19:16:52,713 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-13 19:16:52,715 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-13 19:16:52,717 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-13 19:16:52,717 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:16:52,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 19:16:52,724 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-13 19:16:52,724 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-13 19:16:52,724 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining) [2025-04-13 19:16:52,724 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2025-04-13 19:16:52,724 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 7 remaining) [2025-04-13 19:16:52,724 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 7 remaining) [2025-04-13 19:16:52,725 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 7 remaining) [2025-04-13 19:16:52,725 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 7 remaining) [2025-04-13 19:16:52,725 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2025-04-13 19:16:52,725 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-13 19:16:52,725 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-04-13 19:16:52,725 WARN L247 ceAbstractionStarter]: 5 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-13 19:16:52,725 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 6 thread instances. [2025-04-13 19:16:52,755 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-13 19:16:52,758 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 59 places, 59 transitions, 172 flow [2025-04-13 19:16:52,761 INFO L116 PetriNetUnfolderBase]: 12/69 cut-off events. [2025-04-13 19:16:52,762 INFO L117 PetriNetUnfolderBase]: For 50/50 co-relation queries the response was YES. [2025-04-13 19:16:52,762 INFO L83 FinitePrefix]: Finished finitePrefix Result has 103 conditions, 69 events. 12/69 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 166 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 83. Up to 7 conditions per place. [2025-04-13 19:16:52,762 INFO L82 GeneralOperation]: Start removeDead. Operand has 59 places, 59 transitions, 172 flow [2025-04-13 19:16:52,762 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 59 places, 58 transitions, 170 flow [2025-04-13 19:16:52,763 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 19:16:52,763 INFO L340 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;@10326dd1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 19:16:52,763 INFO L341 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-04-13 19:16:52,766 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 19:16:52,767 INFO L116 PetriNetUnfolderBase]: 2/23 cut-off events. [2025-04-13 19:16:52,767 INFO L117 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2025-04-13 19:16:52,767 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:16:52,767 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:16:52,767 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-04-13 19:16:52,767 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:16:52,767 INFO L85 PathProgramCache]: Analyzing trace with hash -1952757563, now seen corresponding path program 1 times [2025-04-13 19:16:52,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:16:52,767 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706338262] [2025-04-13 19:16:52,767 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:16:52,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:16:52,773 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-13 19:16:52,776 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-13 19:16:52,776 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:16:52,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:16:52,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:16:52,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:16:52,806 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706338262] [2025-04-13 19:16:52,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706338262] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:16:52,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:16:52,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 19:16:52,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182816163] [2025-04-13 19:16:52,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:16:52,807 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 19:16:52,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:16:52,807 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 19:16:52,807 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 19:16:52,808 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 59 [2025-04-13 19:16:52,808 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 58 transitions, 170 flow. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:16:52,808 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:16:52,808 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 59 [2025-04-13 19:16:52,808 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand