/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/goblint-regression/28-race_reach_72-funloop_hard_racing.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 19:43:03,513 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 19:43:03,569 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:43:03,573 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 19:43:03,573 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 19:43:03,592 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 19:43:03,594 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 19:43:03,594 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 19:43:03,594 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 19:43:03,594 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 19:43:03,594 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 19:43:03,594 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 19:43:03,595 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 19:43:03,595 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 19:43:03,595 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 19:43:03,595 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 19:43:03,595 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 19:43:03,595 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 19:43:03,595 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 19:43:03,595 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 19:43:03,595 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 19:43:03,595 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 19:43:03,595 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 19:43:03,595 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 19:43:03,595 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 19:43:03,595 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 19:43:03,595 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 19:43:03,595 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 19:43:03,595 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 19:43:03,595 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 19:43:03,596 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 19:43:03,596 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 19:43:03,596 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 19:43:03,596 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 19:43:03,596 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 19:43:03,596 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 19:43:03,596 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 19:43:03,596 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 19:43:03,596 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 19:43:03,596 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 19:43:03,596 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 19:43:03,596 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 19:43:03,596 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 19:43:03,596 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 19:43:03,596 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 19:43:03,596 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 19:43:03,596 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 19:43:03,596 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:43:03,809 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 19:43:03,816 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 19:43:03,818 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 19:43:03,820 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 19:43:03,822 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 19:43:03,823 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/28-race_reach_72-funloop_hard_racing.i [2025-04-13 19:43:05,087 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d19aa559e/146d1b8e856247588b18373864ce1a21/FLAGb3a85ae4b [2025-04-13 19:43:05,332 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 19:43:05,335 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_72-funloop_hard_racing.i [2025-04-13 19:43:05,347 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d19aa559e/146d1b8e856247588b18373864ce1a21/FLAGb3a85ae4b [2025-04-13 19:43:06,288 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d19aa559e/146d1b8e856247588b18373864ce1a21 [2025-04-13 19:43:06,290 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 19:43:06,291 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 19:43:06,292 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 19:43:06,292 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 19:43:06,295 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 19:43:06,296 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 07:43:06" (1/1) ... [2025-04-13 19:43:06,296 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a03ddd5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:43:06, skipping insertion in model container [2025-04-13 19:43:06,296 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 07:43:06" (1/1) ... [2025-04-13 19:43:06,321 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 19:43:06,660 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_72-funloop_hard_racing.i[41323,41336] [2025-04-13 19:43:06,688 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 19:43:06,732 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 19:43:06,783 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_72-funloop_hard_racing.i[41323,41336] [2025-04-13 19:43:06,790 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 19:43:06,830 INFO L204 MainTranslator]: Completed translation [2025-04-13 19:43:06,831 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:43:06 WrapperNode [2025-04-13 19:43:06,831 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 19:43:06,832 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 19:43:06,832 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 19:43:06,832 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 19:43:06,835 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:43:06" (1/1) ... [2025-04-13 19:43:06,848 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:43:06" (1/1) ... [2025-04-13 19:43:06,872 INFO L138 Inliner]: procedures = 272, calls = 109, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 314 [2025-04-13 19:43:06,872 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 19:43:06,872 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 19:43:06,873 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 19:43:06,873 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 19:43:06,879 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:43:06" (1/1) ... [2025-04-13 19:43:06,879 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:43:06" (1/1) ... [2025-04-13 19:43:06,883 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:43:06" (1/1) ... [2025-04-13 19:43:06,894 INFO L175 MemorySlicer]: Split 84 memory accesses to 4 slices as follows [2, 5, 2, 75]. 89 percent of accesses are in the largest equivalence class. The 67 initializations are split as follows [2, 5, 0, 60]. The 7 writes are split as follows [0, 0, 1, 6]. [2025-04-13 19:43:06,894 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:43:06" (1/1) ... [2025-04-13 19:43:06,894 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:43:06" (1/1) ... [2025-04-13 19:43:06,904 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:43:06" (1/1) ... [2025-04-13 19:43:06,905 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:43:06" (1/1) ... [2025-04-13 19:43:06,907 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:43:06" (1/1) ... [2025-04-13 19:43:06,909 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:43:06" (1/1) ... [2025-04-13 19:43:06,910 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:43:06" (1/1) ... [2025-04-13 19:43:06,913 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 19:43:06,914 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-13 19:43:06,914 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-13 19:43:06,914 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-13 19:43:06,915 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:43:06" (1/1) ... [2025-04-13 19:43:06,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 19:43:06,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:43:06,942 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:43:06,947 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:43:06,963 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-04-13 19:43:06,964 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-04-13 19:43:06,964 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-04-13 19:43:06,964 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-13 19:43:06,964 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-13 19:43:06,964 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-04-13 19:43:06,964 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-04-13 19:43:06,964 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-13 19:43:06,964 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-13 19:43:06,964 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-04-13 19:43:06,964 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-04-13 19:43:06,964 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-04-13 19:43:06,964 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 19:43:06,964 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-04-13 19:43:06,964 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-04-13 19:43:06,964 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 19:43:06,964 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-13 19:43:06,964 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-04-13 19:43:06,964 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-04-13 19:43:06,964 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 19:43:06,964 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 19:43:06,965 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:43:07,075 INFO L234 CfgBuilder]: Building ICFG [2025-04-13 19:43:07,076 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 19:43:07,383 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 19:43:07,384 INFO L289 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 19:43:07,384 INFO L294 CfgBuilder]: Performing block encoding [2025-04-13 19:43:07,747 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:43:07,748 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:43:07,751 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:43:07,755 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:43:07,758 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:43:07,758 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:43:07,761 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:43:07,763 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:43:07,763 WARN L179 LargeBlockEncoding]: Complex 2:3 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 19:43:07,766 WARN L179 LargeBlockEncoding]: Complex 3:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 19:43:07,769 WARN L179 LargeBlockEncoding]: Complex 4:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 19:43:07,771 WARN L179 LargeBlockEncoding]: Complex 2:4 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 19:43:07,774 WARN L179 LargeBlockEncoding]: Complex 2:4 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 19:43:07,778 INFO L313 CfgBuilder]: Removed 15 assume(true) statements. [2025-04-13 19:43:07,778 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 07:43:07 BoogieIcfgContainer [2025-04-13 19:43:07,778 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-13 19:43:07,779 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 19:43:07,780 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 19:43:07,784 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 19:43:07,784 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 07:43:06" (1/3) ... [2025-04-13 19:43:07,785 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2df389ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 07:43:07, skipping insertion in model container [2025-04-13 19:43:07,785 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:43:06" (2/3) ... [2025-04-13 19:43:07,785 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2df389ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 07:43:07, skipping insertion in model container [2025-04-13 19:43:07,786 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 07:43:07" (3/3) ... [2025-04-13 19:43:07,787 INFO L128 eAbstractionObserver]: Analyzing ICFG 28-race_reach_72-funloop_hard_racing.i [2025-04-13 19:43:07,798 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 19:43:07,800 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 28-race_reach_72-funloop_hard_racing.i that has 2 procedures, 63 locations, 114 edges, 1 initial locations, 20 loop locations, and 3 error locations. [2025-04-13 19:43:07,800 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 19:43:07,843 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-04-13 19:43:07,872 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 66 places, 115 transitions, 237 flow [2025-04-13 19:43:07,927 INFO L116 PetriNetUnfolderBase]: 80/181 cut-off events. [2025-04-13 19:43:07,928 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-13 19:43:07,932 INFO L83 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 181 events. 80/181 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 734 event pairs, 0 based on Foata normal form. 0/93 useless extension candidates. Maximal degree in co-relation 105. Up to 12 conditions per place. [2025-04-13 19:43:07,932 INFO L82 GeneralOperation]: Start removeDead. Operand has 66 places, 115 transitions, 237 flow [2025-04-13 19:43:07,940 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 65 places, 112 transitions, 228 flow [2025-04-13 19:43:07,948 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 19:43:07,963 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;@28f01018, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 19:43:07,963 INFO L341 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-04-13 19:43:07,971 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 19:43:07,971 INFO L116 PetriNetUnfolderBase]: 11/31 cut-off events. [2025-04-13 19:43:07,971 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-13 19:43:07,972 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:43:07,972 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-04-13 19:43:07,973 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 19:43:07,977 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:43:07,977 INFO L85 PathProgramCache]: Analyzing trace with hash 927709397, now seen corresponding path program 1 times [2025-04-13 19:43:07,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:43:07,984 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326650556] [2025-04-13 19:43:07,984 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:43:07,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:43:08,056 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-13 19:43:08,085 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-13 19:43:08,086 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:43:08,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:43:08,202 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:43:08,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:43:08,202 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326650556] [2025-04-13 19:43:08,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326650556] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:43:08,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:43:08,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 19:43:08,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115463534] [2025-04-13 19:43:08,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:43:08,210 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 19:43:08,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:43:08,229 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 19:43:08,229 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 19:43:08,230 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 115 [2025-04-13 19:43:08,232 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 112 transitions, 228 flow. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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:43:08,232 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:43:08,232 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 115 [2025-04-13 19:43:08,232 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:43:08,562 INFO L116 PetriNetUnfolderBase]: 861/1646 cut-off events. [2025-04-13 19:43:08,562 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-13 19:43:08,566 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3295 conditions, 1646 events. 861/1646 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 7983 event pairs, 722 based on Foata normal form. 0/1408 useless extension candidates. Maximal degree in co-relation 3278. Up to 1644 conditions per place. [2025-04-13 19:43:08,577 INFO L140 encePairwiseOnDemand]: 67/115 looper letters, 65 selfloop transitions, 2 changer transitions 0/68 dead transitions. [2025-04-13 19:43:08,578 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 68 transitions, 274 flow [2025-04-13 19:43:08,579 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 19:43:08,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 19:43:08,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 118 transitions. [2025-04-13 19:43:08,588 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.34202898550724636 [2025-04-13 19:43:08,590 INFO L175 Difference]: Start difference. First operand has 65 places, 112 transitions, 228 flow. Second operand 3 states and 118 transitions. [2025-04-13 19:43:08,590 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 68 transitions, 274 flow [2025-04-13 19:43:08,594 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 68 transitions, 274 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-13 19:43:08,597 INFO L231 Difference]: Finished difference. Result has 67 places, 68 transitions, 150 flow [2025-04-13 19:43:08,599 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=150, PETRI_PLACES=67, PETRI_TRANSITIONS=68} [2025-04-13 19:43:08,603 INFO L279 CegarLoopForPetriNet]: 65 programPoint places, 2 predicate places. [2025-04-13 19:43:08,603 INFO L485 AbstractCegarLoop]: Abstraction has has 67 places, 68 transitions, 150 flow [2025-04-13 19:43:08,603 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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:43:08,603 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:43:08,603 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-04-13 19:43:08,603 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 19:43:08,603 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 19:43:08,604 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:43:08,604 INFO L85 PathProgramCache]: Analyzing trace with hash -1308603382, now seen corresponding path program 1 times [2025-04-13 19:43:08,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:43:08,604 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018248918] [2025-04-13 19:43:08,604 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:43:08,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:43:08,624 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-13 19:43:08,642 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-13 19:43:08,642 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:43:08,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:43:08,731 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:43:08,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:43:08,731 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018248918] [2025-04-13 19:43:08,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1018248918] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 19:43:08,731 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1058146388] [2025-04-13 19:43:08,731 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:43:08,731 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:43:08,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:43:08,734 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 19:43:08,736 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-04-13 19:43:08,793 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-13 19:43:08,822 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-13 19:43:08,822 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:43:08,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:43:08,824 INFO L256 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-13 19:43:08,827 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 19:43:08,867 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:43:08,867 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 19:43:08,884 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:43:08,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1058146388] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 19:43:08,885 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 19:43:08,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-04-13 19:43:08,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668660466] [2025-04-13 19:43:08,885 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 19:43:08,886 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 19:43:08,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:43:08,886 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 19:43:08,887 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-04-13 19:43:08,887 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 115 [2025-04-13 19:43:08,887 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 68 transitions, 150 flow. Second operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 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:43:08,887 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:43:08,887 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 115 [2025-04-13 19:43:08,887 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:43:09,250 INFO L116 PetriNetUnfolderBase]: 861/1649 cut-off events. [2025-04-13 19:43:09,251 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-13 19:43:09,253 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3311 conditions, 1649 events. 861/1649 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 7974 event pairs, 722 based on Foata normal form. 0/1411 useless extension candidates. Maximal degree in co-relation 3299. Up to 1644 conditions per place. [2025-04-13 19:43:09,260 INFO L140 encePairwiseOnDemand]: 112/115 looper letters, 65 selfloop transitions, 5 changer transitions 0/71 dead transitions. [2025-04-13 19:43:09,260 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 71 transitions, 302 flow [2025-04-13 19:43:09,261 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 19:43:09,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-13 19:43:09,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 79 transitions. [2025-04-13 19:43:09,262 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.1144927536231884 [2025-04-13 19:43:09,262 INFO L175 Difference]: Start difference. First operand has 67 places, 68 transitions, 150 flow. Second operand 6 states and 79 transitions. [2025-04-13 19:43:09,262 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 71 transitions, 302 flow [2025-04-13 19:43:09,264 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 71 transitions, 298 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-04-13 19:43:09,266 INFO L231 Difference]: Finished difference. Result has 74 places, 71 transitions, 182 flow [2025-04-13 19:43:09,267 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=182, PETRI_PLACES=74, PETRI_TRANSITIONS=71} [2025-04-13 19:43:09,267 INFO L279 CegarLoopForPetriNet]: 65 programPoint places, 9 predicate places. [2025-04-13 19:43:09,268 INFO L485 AbstractCegarLoop]: Abstraction has has 74 places, 71 transitions, 182 flow [2025-04-13 19:43:09,268 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 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:43:09,268 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:43:09,268 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1] [2025-04-13 19:43:09,275 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-04-13 19:43:09,468 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:43:09,469 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 19:43:09,469 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:43:09,469 INFO L85 PathProgramCache]: Analyzing trace with hash -1989059051, now seen corresponding path program 2 times [2025-04-13 19:43:09,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:43:09,469 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527724023] [2025-04-13 19:43:09,470 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 19:43:09,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:43:09,480 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 9 statements into 2 equivalence classes. [2025-04-13 19:43:09,513 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 9 of 9 statements. [2025-04-13 19:43:09,513 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 19:43:09,513 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:43:09,652 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:43:09,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:43:09,652 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527724023] [2025-04-13 19:43:09,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [527724023] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 19:43:09,652 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1855946254] [2025-04-13 19:43:09,652 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 19:43:09,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:43:09,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:43:09,656 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 19:43:09,657 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-04-13 19:43:09,712 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 9 statements into 2 equivalence classes. [2025-04-13 19:43:09,743 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 9 of 9 statements. [2025-04-13 19:43:09,743 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 19:43:09,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:43:09,744 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-13 19:43:09,745 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 19:43:09,759 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:43:09,760 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 19:43:09,820 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:43:09,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1855946254] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 19:43:09,820 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 19:43:09,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2025-04-13 19:43:09,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120123330] [2025-04-13 19:43:09,821 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 19:43:09,821 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-13 19:43:09,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:43:09,821 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-13 19:43:09,821 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-04-13 19:43:09,822 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 115 [2025-04-13 19:43:09,822 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 71 transitions, 182 flow. Second operand has 13 states, 13 states have (on average 2.230769230769231) internal successors, (29), 13 states have internal predecessors, (29), 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:43:09,822 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:43:09,822 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 115 [2025-04-13 19:43:09,822 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:43:10,132 INFO L116 PetriNetUnfolderBase]: 861/1655 cut-off events. [2025-04-13 19:43:10,132 INFO L117 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2025-04-13 19:43:10,134 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3348 conditions, 1655 events. 861/1655 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 7977 event pairs, 722 based on Foata normal form. 6/1424 useless extension candidates. Maximal degree in co-relation 3290. Up to 1644 conditions per place. [2025-04-13 19:43:10,139 INFO L140 encePairwiseOnDemand]: 112/115 looper letters, 65 selfloop transitions, 11 changer transitions 0/77 dead transitions. [2025-04-13 19:43:10,140 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 77 transitions, 370 flow [2025-04-13 19:43:10,140 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 19:43:10,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-04-13 19:43:10,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 94 transitions. [2025-04-13 19:43:10,143 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.06811594202898551 [2025-04-13 19:43:10,143 INFO L175 Difference]: Start difference. First operand has 74 places, 71 transitions, 182 flow. Second operand 12 states and 94 transitions. [2025-04-13 19:43:10,143 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 77 transitions, 370 flow [2025-04-13 19:43:10,145 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 77 transitions, 356 flow, removed 6 selfloop flow, removed 1 redundant places. [2025-04-13 19:43:10,146 INFO L231 Difference]: Finished difference. Result has 90 places, 77 transitions, 252 flow [2025-04-13 19:43:10,146 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=252, PETRI_PLACES=90, PETRI_TRANSITIONS=77} [2025-04-13 19:43:10,148 INFO L279 CegarLoopForPetriNet]: 65 programPoint places, 25 predicate places. [2025-04-13 19:43:10,148 INFO L485 AbstractCegarLoop]: Abstraction has has 90 places, 77 transitions, 252 flow [2025-04-13 19:43:10,148 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.230769230769231) internal successors, (29), 13 states have internal predecessors, (29), 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:43:10,149 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:43:10,149 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1] [2025-04-13 19:43:10,155 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-04-13 19:43:10,352 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2025-04-13 19:43:10,352 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 19:43:10,352 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:43:10,352 INFO L85 PathProgramCache]: Analyzing trace with hash -313251339, now seen corresponding path program 3 times [2025-04-13 19:43:10,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:43:10,353 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696383503] [2025-04-13 19:43:10,353 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 19:43:10,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:43:10,365 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 15 statements into 6 equivalence classes. [2025-04-13 19:43:10,409 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 19:43:10,409 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-04-13 19:43:10,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 19:43:10,410 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-13 19:43:10,414 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-13 19:43:10,435 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 19:43:10,435 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:43:10,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 19:43:10,452 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-13 19:43:10,453 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-13 19:43:10,453 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2025-04-13 19:43:10,456 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2025-04-13 19:43:10,456 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 5 remaining) [2025-04-13 19:43:10,457 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2025-04-13 19:43:10,457 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2025-04-13 19:43:10,457 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 19:43:10,457 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1] [2025-04-13 19:43:10,459 WARN L247 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-13 19:43:10,459 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-04-13 19:43:10,490 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-13 19:43:10,493 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 88 places, 153 transitions, 322 flow [2025-04-13 19:43:10,512 INFO L116 PetriNetUnfolderBase]: 130/294 cut-off events. [2025-04-13 19:43:10,513 INFO L117 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-04-13 19:43:10,516 INFO L83 FinitePrefix]: Finished finitePrefix Result has 306 conditions, 294 events. 130/294 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1333 event pairs, 0 based on Foata normal form. 0/152 useless extension candidates. Maximal degree in co-relation 183. Up to 18 conditions per place. [2025-04-13 19:43:10,516 INFO L82 GeneralOperation]: Start removeDead. Operand has 88 places, 153 transitions, 322 flow [2025-04-13 19:43:10,518 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 88 places, 153 transitions, 322 flow [2025-04-13 19:43:10,519 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 19:43:10,519 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;@28f01018, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 19:43:10,519 INFO L341 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-04-13 19:43:10,527 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 19:43:10,527 INFO L116 PetriNetUnfolderBase]: 32/83 cut-off events. [2025-04-13 19:43:10,527 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-13 19:43:10,527 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:43:10,527 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-04-13 19:43:10,527 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 19:43:10,527 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:43:10,527 INFO L85 PathProgramCache]: Analyzing trace with hash -1077746724, now seen corresponding path program 1 times [2025-04-13 19:43:10,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:43:10,527 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777528082] [2025-04-13 19:43:10,528 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:43:10,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:43:10,533 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-13 19:43:10,535 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-13 19:43:10,535 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:43:10,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:43:10,547 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:43:10,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:43:10,547 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777528082] [2025-04-13 19:43:10,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777528082] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:43:10,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:43:10,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 19:43:10,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768730600] [2025-04-13 19:43:10,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:43:10,548 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-13 19:43:10,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:43:10,548 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-13 19:43:10,548 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-13 19:43:10,548 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 153 [2025-04-13 19:43:10,549 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 153 transitions, 322 flow. Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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:43:10,549 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:43:10,549 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 153 [2025-04-13 19:43:10,549 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:43:13,286 INFO L116 PetriNetUnfolderBase]: 34567/51054 cut-off events. [2025-04-13 19:43:13,286 INFO L117 PetriNetUnfolderBase]: For 102/102 co-relation queries the response was YES. [2025-04-13 19:43:13,342 INFO L83 FinitePrefix]: Finished finitePrefix Result has 102214 conditions, 51054 events. 34567/51054 cut-off events. For 102/102 co-relation queries the response was YES. Maximal size of possible extension queue 870. Compared 322064 event pairs, 30077 based on Foata normal form. 0/43680 useless extension candidates. Maximal degree in co-relation 93748. Up to 51053 conditions per place. [2025-04-13 19:43:13,509 INFO L140 encePairwiseOnDemand]: 93/153 looper letters, 92 selfloop transitions, 0 changer transitions 0/93 dead transitions. [2025-04-13 19:43:13,510 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 93 transitions, 386 flow [2025-04-13 19:43:13,510 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-13 19:43:13,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-04-13 19:43:13,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 154 transitions. [2025-04-13 19:43:13,512 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5032679738562091 [2025-04-13 19:43:13,512 INFO L175 Difference]: Start difference. First operand has 88 places, 153 transitions, 322 flow. Second operand 2 states and 154 transitions. [2025-04-13 19:43:13,512 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 93 transitions, 386 flow [2025-04-13 19:43:13,514 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 93 transitions, 386 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-13 19:43:13,518 INFO L231 Difference]: Finished difference. Result has 89 places, 93 transitions, 202 flow [2025-04-13 19:43:13,519 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=202, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=202, PETRI_PLACES=89, PETRI_TRANSITIONS=93} [2025-04-13 19:43:13,519 INFO L279 CegarLoopForPetriNet]: 88 programPoint places, 1 predicate places. [2025-04-13 19:43:13,519 INFO L485 AbstractCegarLoop]: Abstraction has has 89 places, 93 transitions, 202 flow [2025-04-13 19:43:13,519 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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:43:13,519 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:43:13,519 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1] [2025-04-13 19:43:13,520 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-13 19:43:13,520 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 19:43:13,520 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:43:13,520 INFO L85 PathProgramCache]: Analyzing trace with hash 1084223937, now seen corresponding path program 1 times [2025-04-13 19:43:13,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:43:13,520 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038834473] [2025-04-13 19:43:13,520 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:43:13,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:43:13,529 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-13 19:43:13,532 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-13 19:43:13,532 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:43:13,533 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:43:13,562 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:43:13,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:43:13,562 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038834473] [2025-04-13 19:43:13,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038834473] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:43:13,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:43:13,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 19:43:13,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510945857] [2025-04-13 19:43:13,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:43:13,563 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 19:43:13,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:43:13,564 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 19:43:13,564 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 19:43:13,565 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 153 [2025-04-13 19:43:13,565 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 93 transitions, 202 flow. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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:43:13,565 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:43:13,565 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 153 [2025-04-13 19:43:13,565 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:43:15,794 INFO L116 PetriNetUnfolderBase]: 34567/51055 cut-off events. [2025-04-13 19:43:15,794 INFO L117 PetriNetUnfolderBase]: For 102/102 co-relation queries the response was YES. [2025-04-13 19:43:15,859 INFO L83 FinitePrefix]: Finished finitePrefix Result has 102217 conditions, 51055 events. 34567/51055 cut-off events. For 102/102 co-relation queries the response was YES. Maximal size of possible extension queue 870. Compared 321971 event pairs, 30077 based on Foata normal form. 0/43681 useless extension candidates. Maximal degree in co-relation 102212. Up to 51053 conditions per place. [2025-04-13 19:43:16,216 INFO L140 encePairwiseOnDemand]: 150/153 looper letters, 91 selfloop transitions, 2 changer transitions 0/94 dead transitions. [2025-04-13 19:43:16,216 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 94 transitions, 390 flow [2025-04-13 19:43:16,217 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 19:43:16,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 19:43:16,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 97 transitions. [2025-04-13 19:43:16,218 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.2113289760348584 [2025-04-13 19:43:16,218 INFO L175 Difference]: Start difference. First operand has 89 places, 93 transitions, 202 flow. Second operand 3 states and 97 transitions. [2025-04-13 19:43:16,218 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 94 transitions, 390 flow [2025-04-13 19:43:16,219 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 94 transitions, 390 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-13 19:43:16,220 INFO L231 Difference]: Finished difference. Result has 92 places, 94 transitions, 214 flow [2025-04-13 19:43:16,220 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=202, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=214, PETRI_PLACES=92, PETRI_TRANSITIONS=94} [2025-04-13 19:43:16,220 INFO L279 CegarLoopForPetriNet]: 88 programPoint places, 4 predicate places. [2025-04-13 19:43:16,221 INFO L485 AbstractCegarLoop]: Abstraction has has 92 places, 94 transitions, 214 flow [2025-04-13 19:43:16,221 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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:43:16,221 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:43:16,221 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-04-13 19:43:16,221 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-13 19:43:16,221 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 19:43:16,221 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:43:16,221 INFO L85 PathProgramCache]: Analyzing trace with hash -166699779, now seen corresponding path program 1 times [2025-04-13 19:43:16,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:43:16,221 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787267994] [2025-04-13 19:43:16,221 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:43:16,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:43:16,228 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-13 19:43:16,233 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-13 19:43:16,233 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:43:16,233 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:43:16,277 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:43:16,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:43:16,277 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787267994] [2025-04-13 19:43:16,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [787267994] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 19:43:16,277 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1564337464] [2025-04-13 19:43:16,277 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:43:16,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:43:16,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:43:16,281 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 19:43:16,287 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-04-13 19:43:16,347 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-13 19:43:16,371 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-13 19:43:16,371 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:43:16,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:43:16,372 INFO L256 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-13 19:43:16,373 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 19:43:16,379 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:43:16,379 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 19:43:16,390 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:43:16,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1564337464] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 19:43:16,390 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 19:43:16,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-04-13 19:43:16,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947204113] [2025-04-13 19:43:16,391 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 19:43:16,391 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 19:43:16,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:43:16,391 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 19:43:16,391 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-04-13 19:43:16,391 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 153 [2025-04-13 19:43:16,391 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 94 transitions, 214 flow. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 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:43:16,392 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:43:16,392 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 153 [2025-04-13 19:43:16,392 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:43:18,652 INFO L116 PetriNetUnfolderBase]: 34567/51058 cut-off events. [2025-04-13 19:43:18,653 INFO L117 PetriNetUnfolderBase]: For 102/102 co-relation queries the response was YES. [2025-04-13 19:43:18,740 INFO L83 FinitePrefix]: Finished finitePrefix Result has 102233 conditions, 51058 events. 34567/51058 cut-off events. For 102/102 co-relation queries the response was YES. Maximal size of possible extension queue 870. Compared 322042 event pairs, 30077 based on Foata normal form. 0/43684 useless extension candidates. Maximal degree in co-relation 102226. Up to 51053 conditions per place. [2025-04-13 19:43:18,908 INFO L140 encePairwiseOnDemand]: 150/153 looper letters, 91 selfloop transitions, 5 changer transitions 0/97 dead transitions. [2025-04-13 19:43:18,908 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 97 transitions, 418 flow [2025-04-13 19:43:18,908 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 19:43:18,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-13 19:43:18,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 105 transitions. [2025-04-13 19:43:18,910 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.11437908496732026 [2025-04-13 19:43:18,910 INFO L175 Difference]: Start difference. First operand has 92 places, 94 transitions, 214 flow. Second operand 6 states and 105 transitions. [2025-04-13 19:43:18,910 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 97 transitions, 418 flow [2025-04-13 19:43:18,911 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 97 transitions, 414 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-04-13 19:43:18,912 INFO L231 Difference]: Finished difference. Result has 99 places, 97 transitions, 246 flow [2025-04-13 19:43:18,914 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=210, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=246, PETRI_PLACES=99, PETRI_TRANSITIONS=97} [2025-04-13 19:43:18,916 INFO L279 CegarLoopForPetriNet]: 88 programPoint places, 11 predicate places. [2025-04-13 19:43:18,916 INFO L485 AbstractCegarLoop]: Abstraction has has 99 places, 97 transitions, 246 flow [2025-04-13 19:43:18,916 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 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:43:18,916 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:43:18,916 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 2, 1, 1, 1, 1, 1] [2025-04-13 19:43:18,923 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-04-13 19:43:19,117 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:43:19,117 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 19:43:19,117 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:43:19,117 INFO L85 PathProgramCache]: Analyzing trace with hash 1325326529, now seen corresponding path program 2 times [2025-04-13 19:43:19,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:43:19,118 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469396648] [2025-04-13 19:43:19,118 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 19:43:19,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:43:19,315 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 2 equivalence classes. [2025-04-13 19:43:19,326 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 11 of 11 statements. [2025-04-13 19:43:19,327 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 19:43:19,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:43:19,401 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:43:19,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:43:19,402 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469396648] [2025-04-13 19:43:19,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469396648] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 19:43:19,402 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [921517404] [2025-04-13 19:43:19,402 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 19:43:19,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:43:19,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:43:19,424 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 19:43:19,427 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-04-13 19:43:19,483 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 2 equivalence classes. [2025-04-13 19:43:19,507 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 11 of 11 statements. [2025-04-13 19:43:19,507 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 19:43:19,507 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:43:19,508 INFO L256 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-13 19:43:19,509 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 19:43:19,523 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:43:19,524 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 19:43:19,570 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:43:19,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [921517404] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 19:43:19,570 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 19:43:19,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2025-04-13 19:43:19,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274575105] [2025-04-13 19:43:19,570 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 19:43:19,570 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-13 19:43:19,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:43:19,571 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-13 19:43:19,571 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-04-13 19:43:19,571 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 153 [2025-04-13 19:43:19,571 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 97 transitions, 246 flow. Second operand has 13 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 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:43:19,571 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:43:19,571 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 153 [2025-04-13 19:43:19,571 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:43:21,797 INFO L116 PetriNetUnfolderBase]: 34567/51064 cut-off events. [2025-04-13 19:43:21,797 INFO L117 PetriNetUnfolderBase]: For 122/122 co-relation queries the response was YES. [2025-04-13 19:43:21,909 INFO L83 FinitePrefix]: Finished finitePrefix Result has 102270 conditions, 51064 events. 34567/51064 cut-off events. For 122/122 co-relation queries the response was YES. Maximal size of possible extension queue 848. Compared 321236 event pairs, 30077 based on Foata normal form. 6/43697 useless extension candidates. Maximal degree in co-relation 102260. Up to 51053 conditions per place. [2025-04-13 19:43:22,024 INFO L140 encePairwiseOnDemand]: 150/153 looper letters, 91 selfloop transitions, 11 changer transitions 0/103 dead transitions. [2025-04-13 19:43:22,024 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 103 transitions, 486 flow [2025-04-13 19:43:22,025 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 19:43:22,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-04-13 19:43:22,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 120 transitions. [2025-04-13 19:43:22,025 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.06535947712418301 [2025-04-13 19:43:22,026 INFO L175 Difference]: Start difference. First operand has 99 places, 97 transitions, 246 flow. Second operand 12 states and 120 transitions. [2025-04-13 19:43:22,026 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 103 transitions, 486 flow [2025-04-13 19:43:22,027 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 103 transitions, 472 flow, removed 6 selfloop flow, removed 1 redundant places. [2025-04-13 19:43:22,028 INFO L231 Difference]: Finished difference. Result has 115 places, 103 transitions, 316 flow [2025-04-13 19:43:22,028 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=232, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=316, PETRI_PLACES=115, PETRI_TRANSITIONS=103} [2025-04-13 19:43:22,029 INFO L279 CegarLoopForPetriNet]: 88 programPoint places, 27 predicate places. [2025-04-13 19:43:22,029 INFO L485 AbstractCegarLoop]: Abstraction has has 115 places, 103 transitions, 316 flow [2025-04-13 19:43:22,029 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 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:43:22,029 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:43:22,029 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1] [2025-04-13 19:43:22,037 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-04-13 19:43:22,229 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:43:22,230 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 19:43:22,230 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:43:22,230 INFO L85 PathProgramCache]: Analyzing trace with hash 574371649, now seen corresponding path program 3 times [2025-04-13 19:43:22,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:43:22,230 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386023122] [2025-04-13 19:43:22,230 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 19:43:22,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:43:22,238 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 17 statements into 6 equivalence classes. [2025-04-13 19:43:22,265 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 17 of 17 statements. [2025-04-13 19:43:22,265 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-04-13 19:43:22,265 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 19:43:22,265 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-13 19:43:22,269 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-13 19:43:22,279 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-13 19:43:22,279 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:43:22,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 19:43:22,286 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-13 19:43:22,286 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-13 19:43:22,286 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2025-04-13 19:43:22,286 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2025-04-13 19:43:22,287 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 6 remaining) [2025-04-13 19:43:22,287 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2025-04-13 19:43:22,287 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2025-04-13 19:43:22,287 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2025-04-13 19:43:22,287 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-13 19:43:22,287 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1, 1] [2025-04-13 19:43:22,287 WARN L247 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-13 19:43:22,287 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-04-13 19:43:22,324 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-13 19:43:22,326 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 110 places, 191 transitions, 409 flow [2025-04-13 19:43:22,487 INFO L116 PetriNetUnfolderBase]: 183/416 cut-off events. [2025-04-13 19:43:22,487 INFO L117 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2025-04-13 19:43:22,489 INFO L83 FinitePrefix]: Finished finitePrefix Result has 441 conditions, 416 events. 183/416 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1927 event pairs, 1 based on Foata normal form. 0/218 useless extension candidates. Maximal degree in co-relation 303. Up to 24 conditions per place. [2025-04-13 19:43:22,489 INFO L82 GeneralOperation]: Start removeDead. Operand has 110 places, 191 transitions, 409 flow [2025-04-13 19:43:22,492 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 110 places, 191 transitions, 409 flow [2025-04-13 19:43:22,493 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 19:43:22,493 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;@28f01018, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 19:43:22,493 INFO L341 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-04-13 19:43:22,498 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 19:43:22,498 INFO L116 PetriNetUnfolderBase]: 32/83 cut-off events. [2025-04-13 19:43:22,498 INFO L117 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-04-13 19:43:22,498 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:43:22,498 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-04-13 19:43:22,498 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 19:43:22,498 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:43:22,498 INFO L85 PathProgramCache]: Analyzing trace with hash 277726076, now seen corresponding path program 1 times [2025-04-13 19:43:22,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:43:22,498 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46405836] [2025-04-13 19:43:22,499 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:43:22,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:43:22,504 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-13 19:43:22,506 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-13 19:43:22,506 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:43:22,506 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:43:22,512 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:43:22,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:43:22,512 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46405836] [2025-04-13 19:43:22,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46405836] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:43:22,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:43:22,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 19:43:22,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721680221] [2025-04-13 19:43:22,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:43:22,512 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-13 19:43:22,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:43:22,513 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-13 19:43:22,513 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-13 19:43:22,513 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 191 [2025-04-13 19:43:22,513 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 191 transitions, 409 flow. Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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:43:22,513 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:43:22,513 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 191 [2025-04-13 19:43:22,513 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand