/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.automaton.type.used.in.concurrency.analysis PETRI_NET -i ../../../trunk/examples/svcomp/pthread-wmm/thin002_pso.oepc_pso.opt_tso.oepc_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 19:37:50,944 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 19:37:50,995 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:37:51,001 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 19:37:51,002 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 19:37:51,022 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 19:37:51,023 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 19:37:51,023 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 19:37:51,023 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 19:37:51,023 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 19:37:51,023 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 19:37:51,023 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 19:37:51,023 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 19:37:51,023 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 19:37:51,024 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 19:37:51,024 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 19:37:51,024 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 19:37:51,024 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 19:37:51,024 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 19:37:51,024 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 19:37:51,024 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 19:37:51,024 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 19:37:51,024 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 19:37:51,024 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 19:37:51,024 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 19:37:51,024 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 19:37:51,024 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 19:37:51,024 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 19:37:51,024 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 19:37:51,025 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 19:37:51,025 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 19:37:51,025 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 19:37:51,025 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 19:37:51,025 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 19:37:51,025 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 19:37:51,025 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 19:37:51,025 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 19:37:51,025 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 19:37:51,025 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 19:37:51,025 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 19:37:51,025 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 19:37:51,025 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 19:37:51,025 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 19:37:51,025 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 19:37:51,025 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 19:37:51,026 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 19:37:51,026 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 19:37:51,026 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:37:51,249 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 19:37:51,257 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 19:37:51,258 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 19:37:51,259 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 19:37:51,261 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 19:37:51,263 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/thin002_pso.oepc_pso.opt_tso.oepc_tso.opt.i [2025-04-13 19:37:52,514 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2aa4ebb6f/a258cfa79f394691ad8cd6db0e36c196/FLAG7e8d6dd66 [2025-04-13 19:37:52,726 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 19:37:52,727 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/thin002_pso.oepc_pso.opt_tso.oepc_tso.opt.i [2025-04-13 19:37:52,743 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2aa4ebb6f/a258cfa79f394691ad8cd6db0e36c196/FLAG7e8d6dd66 [2025-04-13 19:37:53,715 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2aa4ebb6f/a258cfa79f394691ad8cd6db0e36c196 [2025-04-13 19:37:53,717 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 19:37:53,718 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 19:37:53,719 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 19:37:53,720 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 19:37:53,723 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 19:37:53,723 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 07:37:53" (1/1) ... [2025-04-13 19:37:53,724 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18c6dab6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:37:53, skipping insertion in model container [2025-04-13 19:37:53,724 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 07:37:53" (1/1) ... [2025-04-13 19:37:53,751 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 19:37:53,905 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/thin002_pso.oepc_pso.opt_tso.oepc_tso.opt.i[975,988] [2025-04-13 19:37:54,019 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 19:37:54,026 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 19:37:54,040 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/thin002_pso.oepc_pso.opt_tso.oepc_tso.opt.i[975,988] [2025-04-13 19:37:54,079 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 19:37:54,099 INFO L204 MainTranslator]: Completed translation [2025-04-13 19:37:54,100 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:37:54 WrapperNode [2025-04-13 19:37:54,100 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 19:37:54,102 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 19:37:54,103 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 19:37:54,103 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 19:37:54,107 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:37:54" (1/1) ... [2025-04-13 19:37:54,122 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:37:54" (1/1) ... [2025-04-13 19:37:54,135 INFO L138 Inliner]: procedures = 176, calls = 50, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 68 [2025-04-13 19:37:54,135 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 19:37:54,135 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 19:37:54,135 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 19:37:54,136 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 19:37:54,140 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:37:54" (1/1) ... [2025-04-13 19:37:54,140 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:37:54" (1/1) ... [2025-04-13 19:37:54,142 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:37:54" (1/1) ... [2025-04-13 19:37:54,150 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-04-13 19:37:54,151 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:37:54" (1/1) ... [2025-04-13 19:37:54,151 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:37:54" (1/1) ... [2025-04-13 19:37:54,154 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:37:54" (1/1) ... [2025-04-13 19:37:54,154 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:37:54" (1/1) ... [2025-04-13 19:37:54,159 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:37:54" (1/1) ... [2025-04-13 19:37:54,162 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:37:54" (1/1) ... [2025-04-13 19:37:54,163 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:37:54" (1/1) ... [2025-04-13 19:37:54,165 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 19:37:54,167 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-13 19:37:54,167 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-13 19:37:54,167 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-13 19:37:54,168 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:37:54" (1/1) ... [2025-04-13 19:37:54,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 19:37:54,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:37:54,191 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:37:54,193 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:37:54,207 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-04-13 19:37:54,207 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 19:37:54,207 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2025-04-13 19:37:54,207 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2025-04-13 19:37:54,207 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2025-04-13 19:37:54,208 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2025-04-13 19:37:54,208 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2025-04-13 19:37:54,208 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2025-04-13 19:37:54,208 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2025-04-13 19:37:54,208 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2025-04-13 19:37:54,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 19:37:54,208 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-04-13 19:37:54,208 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 19:37:54,208 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 19:37:54,209 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:37:54,305 INFO L234 CfgBuilder]: Building ICFG [2025-04-13 19:37:54,307 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 19:37:54,419 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 19:37:54,420 INFO L289 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 19:37:54,420 INFO L294 CfgBuilder]: Performing block encoding [2025-04-13 19:37:54,506 INFO L313 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 19:37:54,506 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 07:37:54 BoogieIcfgContainer [2025-04-13 19:37:54,506 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-13 19:37:54,508 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 19:37:54,508 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 19:37:54,510 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 19:37:54,511 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 07:37:53" (1/3) ... [2025-04-13 19:37:54,511 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f419110 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 07:37:54, skipping insertion in model container [2025-04-13 19:37:54,511 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:37:54" (2/3) ... [2025-04-13 19:37:54,511 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f419110 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 07:37:54, skipping insertion in model container [2025-04-13 19:37:54,511 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 07:37:54" (3/3) ... [2025-04-13 19:37:54,512 INFO L128 eAbstractionObserver]: Analyzing ICFG thin002_pso.oepc_pso.opt_tso.oepc_tso.opt.i [2025-04-13 19:37:54,521 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 19:37:54,522 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG thin002_pso.oepc_pso.opt_tso.oepc_tso.opt.i that has 5 procedures, 44 locations, 39 edges, 1 initial locations, 0 loop locations, and 1 error locations. [2025-04-13 19:37:54,522 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 19:37:54,572 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-13 19:37:54,602 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 56 places, 43 transitions, 102 flow [2025-04-13 19:37:54,634 INFO L116 PetriNetUnfolderBase]: 0/39 cut-off events. [2025-04-13 19:37:54,636 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-13 19:37:54,637 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52 conditions, 39 events. 0/39 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 82 event pairs, 0 based on Foata normal form. 0/38 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2025-04-13 19:37:54,639 INFO L82 GeneralOperation]: Start removeDead. Operand has 56 places, 43 transitions, 102 flow [2025-04-13 19:37:54,641 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 51 places, 38 transitions, 88 flow [2025-04-13 19:37:54,653 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 19:37:54,668 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;@28378ceb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 19:37:54,668 INFO L341 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-04-13 19:37:54,682 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 19:37:54,682 INFO L116 PetriNetUnfolderBase]: 0/36 cut-off events. [2025-04-13 19:37:54,682 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-13 19:37:54,682 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:37:54,683 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:37:54,683 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 19:37:54,691 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:37:54,691 INFO L85 PathProgramCache]: Analyzing trace with hash 921787202, now seen corresponding path program 1 times [2025-04-13 19:37:54,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:37:54,697 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002282005] [2025-04-13 19:37:54,697 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:37:54,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:37:54,763 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-13 19:37:54,791 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 19:37:54,791 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:37:54,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:37:55,105 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:37:55,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:37:55,106 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002282005] [2025-04-13 19:37:55,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002282005] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:37:55,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:37:55,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 19:37:55,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973944289] [2025-04-13 19:37:55,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:37:55,111 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 19:37:55,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:37:55,130 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 19:37:55,130 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 19:37:55,153 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 43 [2025-04-13 19:37:55,155 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 38 transitions, 88 flow. Second operand has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 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:37:55,155 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:37:55,155 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 43 [2025-04-13 19:37:55,156 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:37:55,438 INFO L116 PetriNetUnfolderBase]: 1264/2421 cut-off events. [2025-04-13 19:37:55,438 INFO L117 PetriNetUnfolderBase]: For 36/36 co-relation queries the response was YES. [2025-04-13 19:37:55,449 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4334 conditions, 2421 events. 1264/2421 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 179. Compared 16917 event pairs, 792 based on Foata normal form. 81/2377 useless extension candidates. Maximal degree in co-relation 4322. Up to 1601 conditions per place. [2025-04-13 19:37:55,482 INFO L140 encePairwiseOnDemand]: 36/43 looper letters, 27 selfloop transitions, 5 changer transitions 13/63 dead transitions. [2025-04-13 19:37:55,483 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 63 transitions, 237 flow [2025-04-13 19:37:55,484 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 19:37:55,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 19:37:55,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 157 transitions. [2025-04-13 19:37:55,491 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7302325581395349 [2025-04-13 19:37:55,492 INFO L175 Difference]: Start difference. First operand has 51 places, 38 transitions, 88 flow. Second operand 5 states and 157 transitions. [2025-04-13 19:37:55,492 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 63 transitions, 237 flow [2025-04-13 19:37:55,497 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 63 transitions, 230 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-04-13 19:37:55,500 INFO L231 Difference]: Finished difference. Result has 54 places, 42 transitions, 129 flow [2025-04-13 19:37:55,502 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=129, PETRI_PLACES=54, PETRI_TRANSITIONS=42} [2025-04-13 19:37:55,504 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 3 predicate places. [2025-04-13 19:37:55,504 INFO L485 AbstractCegarLoop]: Abstraction has has 54 places, 42 transitions, 129 flow [2025-04-13 19:37:55,505 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 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:37:55,505 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:37:55,505 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:37:55,505 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 19:37:55,506 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 19:37:55,507 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:37:55,507 INFO L85 PathProgramCache]: Analyzing trace with hash -1744008765, now seen corresponding path program 1 times [2025-04-13 19:37:55,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:37:55,507 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040742251] [2025-04-13 19:37:55,507 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:37:55,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:37:55,518 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-13 19:37:55,528 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 19:37:55,528 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:37:55,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:37:55,669 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:37:55,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:37:55,669 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040742251] [2025-04-13 19:37:55,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040742251] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:37:55,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:37:55,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 19:37:55,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211966095] [2025-04-13 19:37:55,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:37:55,670 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 19:37:55,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:37:55,670 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 19:37:55,670 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 19:37:55,689 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 43 [2025-04-13 19:37:55,689 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 42 transitions, 129 flow. Second operand has 5 states, 5 states have (on average 24.6) internal successors, (123), 5 states have internal predecessors, (123), 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:37:55,689 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:37:55,689 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 43 [2025-04-13 19:37:55,689 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:37:55,906 INFO L116 PetriNetUnfolderBase]: 1127/2089 cut-off events. [2025-04-13 19:37:55,906 INFO L117 PetriNetUnfolderBase]: For 1343/1343 co-relation queries the response was YES. [2025-04-13 19:37:55,910 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5195 conditions, 2089 events. 1127/2089 cut-off events. For 1343/1343 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 14195 event pairs, 272 based on Foata normal form. 78/2100 useless extension candidates. Maximal degree in co-relation 5182. Up to 973 conditions per place. [2025-04-13 19:37:55,919 INFO L140 encePairwiseOnDemand]: 39/43 looper letters, 29 selfloop transitions, 3 changer transitions 15/65 dead transitions. [2025-04-13 19:37:55,919 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 65 transitions, 311 flow [2025-04-13 19:37:55,919 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 19:37:55,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 19:37:55,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 155 transitions. [2025-04-13 19:37:55,921 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7209302325581395 [2025-04-13 19:37:55,921 INFO L175 Difference]: Start difference. First operand has 54 places, 42 transitions, 129 flow. Second operand 5 states and 155 transitions. [2025-04-13 19:37:55,921 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 65 transitions, 311 flow [2025-04-13 19:37:55,928 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 65 transitions, 304 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-04-13 19:37:55,928 INFO L231 Difference]: Finished difference. Result has 57 places, 42 transitions, 137 flow [2025-04-13 19:37:55,929 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=137, PETRI_PLACES=57, PETRI_TRANSITIONS=42} [2025-04-13 19:37:55,929 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 6 predicate places. [2025-04-13 19:37:55,929 INFO L485 AbstractCegarLoop]: Abstraction has has 57 places, 42 transitions, 137 flow [2025-04-13 19:37:55,929 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.6) internal successors, (123), 5 states have internal predecessors, (123), 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:37:55,929 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:37:55,929 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:37:55,929 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 19:37:55,930 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 19:37:55,930 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:37:55,930 INFO L85 PathProgramCache]: Analyzing trace with hash 1107746721, now seen corresponding path program 1 times [2025-04-13 19:37:55,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:37:55,930 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769465239] [2025-04-13 19:37:55,930 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:37:55,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:37:55,938 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-13 19:37:55,947 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 19:37:55,947 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:37:55,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:37:56,073 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:37:56,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:37:56,073 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769465239] [2025-04-13 19:37:56,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769465239] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:37:56,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:37:56,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 19:37:56,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066936025] [2025-04-13 19:37:56,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:37:56,073 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 19:37:56,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:37:56,074 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 19:37:56,074 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 19:37:56,097 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 43 [2025-04-13 19:37:56,098 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 42 transitions, 137 flow. Second operand has 5 states, 5 states have (on average 23.6) internal successors, (118), 5 states have internal predecessors, (118), 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:37:56,098 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:37:56,098 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 43 [2025-04-13 19:37:56,098 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:37:56,419 INFO L116 PetriNetUnfolderBase]: 2082/3673 cut-off events. [2025-04-13 19:37:56,419 INFO L117 PetriNetUnfolderBase]: For 3065/3065 co-relation queries the response was YES. [2025-04-13 19:37:56,426 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9284 conditions, 3673 events. 2082/3673 cut-off events. For 3065/3065 co-relation queries the response was YES. Maximal size of possible extension queue 287. Compared 26048 event pairs, 414 based on Foata normal form. 142/3676 useless extension candidates. Maximal degree in co-relation 9268. Up to 1063 conditions per place. [2025-04-13 19:37:56,437 INFO L140 encePairwiseOnDemand]: 35/43 looper letters, 48 selfloop transitions, 12 changer transitions 28/105 dead transitions. [2025-04-13 19:37:56,438 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 105 transitions, 540 flow [2025-04-13 19:37:56,438 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 19:37:56,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-13 19:37:56,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 278 transitions. [2025-04-13 19:37:56,441 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7183462532299741 [2025-04-13 19:37:56,441 INFO L175 Difference]: Start difference. First operand has 57 places, 42 transitions, 137 flow. Second operand 9 states and 278 transitions. [2025-04-13 19:37:56,441 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 105 transitions, 540 flow [2025-04-13 19:37:56,452 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 105 transitions, 524 flow, removed 4 selfloop flow, removed 4 redundant places. [2025-04-13 19:37:56,453 INFO L231 Difference]: Finished difference. Result has 66 places, 49 transitions, 244 flow [2025-04-13 19:37:56,453 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=127, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=244, PETRI_PLACES=66, PETRI_TRANSITIONS=49} [2025-04-13 19:37:56,454 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 15 predicate places. [2025-04-13 19:37:56,454 INFO L485 AbstractCegarLoop]: Abstraction has has 66 places, 49 transitions, 244 flow [2025-04-13 19:37:56,454 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.6) internal successors, (118), 5 states have internal predecessors, (118), 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:37:56,454 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:37:56,454 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:37:56,454 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 19:37:56,455 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 19:37:56,455 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:37:56,455 INFO L85 PathProgramCache]: Analyzing trace with hash -989879326, now seen corresponding path program 1 times [2025-04-13 19:37:56,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:37:56,456 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715116047] [2025-04-13 19:37:56,456 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:37:56,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:37:56,463 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-13 19:37:56,469 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 19:37:56,469 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:37:56,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:37:56,594 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:37:56,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:37:56,594 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715116047] [2025-04-13 19:37:56,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715116047] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:37:56,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:37:56,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 19:37:56,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458710186] [2025-04-13 19:37:56,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:37:56,595 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 19:37:56,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:37:56,595 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 19:37:56,595 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 19:37:56,605 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 43 [2025-04-13 19:37:56,606 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 49 transitions, 244 flow. Second operand has 5 states, 5 states have (on average 23.8) internal successors, (119), 5 states have internal predecessors, (119), 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:37:56,606 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:37:56,606 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 43 [2025-04-13 19:37:56,606 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:37:57,174 INFO L116 PetriNetUnfolderBase]: 3283/6012 cut-off events. [2025-04-13 19:37:57,174 INFO L117 PetriNetUnfolderBase]: For 19662/19689 co-relation queries the response was YES. [2025-04-13 19:37:57,196 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19222 conditions, 6012 events. 3283/6012 cut-off events. For 19662/19689 co-relation queries the response was YES. Maximal size of possible extension queue 456. Compared 48841 event pairs, 380 based on Foata normal form. 147/6074 useless extension candidates. Maximal degree in co-relation 19201. Up to 2005 conditions per place. [2025-04-13 19:37:57,231 INFO L140 encePairwiseOnDemand]: 35/43 looper letters, 60 selfloop transitions, 20 changer transitions 16/114 dead transitions. [2025-04-13 19:37:57,231 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 114 transitions, 830 flow [2025-04-13 19:37:57,231 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 19:37:57,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-13 19:37:57,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 274 transitions. [2025-04-13 19:37:57,232 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7080103359173127 [2025-04-13 19:37:57,232 INFO L175 Difference]: Start difference. First operand has 66 places, 49 transitions, 244 flow. Second operand 9 states and 274 transitions. [2025-04-13 19:37:57,232 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 114 transitions, 830 flow [2025-04-13 19:37:57,295 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 114 transitions, 708 flow, removed 58 selfloop flow, removed 5 redundant places. [2025-04-13 19:37:57,296 INFO L231 Difference]: Finished difference. Result has 72 places, 65 transitions, 450 flow [2025-04-13 19:37:57,296 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=208, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=450, PETRI_PLACES=72, PETRI_TRANSITIONS=65} [2025-04-13 19:37:57,296 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 21 predicate places. [2025-04-13 19:37:57,296 INFO L485 AbstractCegarLoop]: Abstraction has has 72 places, 65 transitions, 450 flow [2025-04-13 19:37:57,297 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.8) internal successors, (119), 5 states have internal predecessors, (119), 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:37:57,297 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:37:57,297 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:37:57,297 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 19:37:57,297 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 19:37:57,297 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:37:57,297 INFO L85 PathProgramCache]: Analyzing trace with hash -585221696, now seen corresponding path program 1 times [2025-04-13 19:37:57,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:37:57,297 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838370159] [2025-04-13 19:37:57,297 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:37:57,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:37:57,302 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-13 19:37:57,305 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 19:37:57,305 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:37:57,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:37:57,402 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:37:57,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:37:57,402 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838370159] [2025-04-13 19:37:57,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838370159] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:37:57,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:37:57,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 19:37:57,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464244734] [2025-04-13 19:37:57,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:37:57,402 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 19:37:57,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:37:57,403 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 19:37:57,403 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 19:37:57,414 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 43 [2025-04-13 19:37:57,414 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 65 transitions, 450 flow. Second operand has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 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:37:57,415 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:37:57,415 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 43 [2025-04-13 19:37:57,415 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:37:57,818 INFO L116 PetriNetUnfolderBase]: 2637/5111 cut-off events. [2025-04-13 19:37:57,818 INFO L117 PetriNetUnfolderBase]: For 17416/17477 co-relation queries the response was YES. [2025-04-13 19:37:57,829 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16943 conditions, 5111 events. 2637/5111 cut-off events. For 17416/17477 co-relation queries the response was YES. Maximal size of possible extension queue 384. Compared 42055 event pairs, 905 based on Foata normal form. 189/5108 useless extension candidates. Maximal degree in co-relation 16918. Up to 2929 conditions per place. [2025-04-13 19:37:57,847 INFO L140 encePairwiseOnDemand]: 39/43 looper letters, 69 selfloop transitions, 11 changer transitions 2/103 dead transitions. [2025-04-13 19:37:57,847 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 103 transitions, 898 flow [2025-04-13 19:37:57,848 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 19:37:57,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 19:37:57,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 159 transitions. [2025-04-13 19:37:57,849 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7395348837209302 [2025-04-13 19:37:57,849 INFO L175 Difference]: Start difference. First operand has 72 places, 65 transitions, 450 flow. Second operand 5 states and 159 transitions. [2025-04-13 19:37:57,849 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 103 transitions, 898 flow [2025-04-13 19:37:57,867 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 103 transitions, 828 flow, removed 35 selfloop flow, removed 0 redundant places. [2025-04-13 19:37:57,868 INFO L231 Difference]: Finished difference. Result has 79 places, 68 transitions, 482 flow [2025-04-13 19:37:57,868 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=400, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=482, PETRI_PLACES=79, PETRI_TRANSITIONS=68} [2025-04-13 19:37:57,868 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 28 predicate places. [2025-04-13 19:37:57,869 INFO L485 AbstractCegarLoop]: Abstraction has has 79 places, 68 transitions, 482 flow [2025-04-13 19:37:57,869 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 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:37:57,869 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:37:57,869 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:37:57,869 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-13 19:37:57,869 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 19:37:57,869 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:37:57,869 INFO L85 PathProgramCache]: Analyzing trace with hash -1627773442, now seen corresponding path program 1 times [2025-04-13 19:37:57,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:37:57,869 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390611821] [2025-04-13 19:37:57,869 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:37:57,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:37:57,877 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-13 19:37:57,881 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 19:37:57,881 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:37:57,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:37:57,991 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:37:57,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:37:57,991 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390611821] [2025-04-13 19:37:57,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390611821] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:37:57,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:37:57,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 19:37:57,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764449840] [2025-04-13 19:37:57,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:37:57,992 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 19:37:57,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:37:57,992 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 19:37:57,992 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 19:37:57,999 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 43 [2025-04-13 19:37:58,000 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 68 transitions, 482 flow. Second operand has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 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:37:58,000 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:37:58,000 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 43 [2025-04-13 19:37:58,000 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:37:58,377 INFO L116 PetriNetUnfolderBase]: 2682/5376 cut-off events. [2025-04-13 19:37:58,377 INFO L117 PetriNetUnfolderBase]: For 16400/16450 co-relation queries the response was YES. [2025-04-13 19:37:58,393 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17160 conditions, 5376 events. 2682/5376 cut-off events. For 16400/16450 co-relation queries the response was YES. Maximal size of possible extension queue 395. Compared 46008 event pairs, 741 based on Foata normal form. 98/5328 useless extension candidates. Maximal degree in co-relation 17130. Up to 2817 conditions per place. [2025-04-13 19:37:58,408 INFO L140 encePairwiseOnDemand]: 39/43 looper letters, 58 selfloop transitions, 6 changer transitions 22/107 dead transitions. [2025-04-13 19:37:58,408 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 107 transitions, 992 flow [2025-04-13 19:37:58,408 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 19:37:58,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 19:37:58,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 155 transitions. [2025-04-13 19:37:58,409 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7209302325581395 [2025-04-13 19:37:58,409 INFO L175 Difference]: Start difference. First operand has 79 places, 68 transitions, 482 flow. Second operand 5 states and 155 transitions. [2025-04-13 19:37:58,409 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 107 transitions, 992 flow [2025-04-13 19:37:58,422 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 107 transitions, 980 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-13 19:37:58,424 INFO L231 Difference]: Finished difference. Result has 85 places, 68 transitions, 504 flow [2025-04-13 19:37:58,424 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=474, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=504, PETRI_PLACES=85, PETRI_TRANSITIONS=68} [2025-04-13 19:37:58,424 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 34 predicate places. [2025-04-13 19:37:58,424 INFO L485 AbstractCegarLoop]: Abstraction has has 85 places, 68 transitions, 504 flow [2025-04-13 19:37:58,424 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 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:37:58,425 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:37:58,425 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:37:58,425 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-13 19:37:58,425 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 19:37:58,425 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:37:58,425 INFO L85 PathProgramCache]: Analyzing trace with hash -1356914567, now seen corresponding path program 1 times [2025-04-13 19:37:58,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:37:58,425 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344317065] [2025-04-13 19:37:58,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:37:58,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:37:58,429 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-13 19:37:58,433 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 19:37:58,433 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:37:58,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:37:58,522 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:37:58,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:37:58,522 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344317065] [2025-04-13 19:37:58,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344317065] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:37:58,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:37:58,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 19:37:58,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018027071] [2025-04-13 19:37:58,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:37:58,523 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 19:37:58,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:37:58,523 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 19:37:58,523 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-13 19:37:58,536 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 43 [2025-04-13 19:37:58,536 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 68 transitions, 504 flow. Second operand has 6 states, 6 states have (on average 23.5) internal successors, (141), 6 states have internal predecessors, (141), 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:37:58,536 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:37:58,536 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 43 [2025-04-13 19:37:58,536 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:37:58,971 INFO L116 PetriNetUnfolderBase]: 3612/6635 cut-off events. [2025-04-13 19:37:58,971 INFO L117 PetriNetUnfolderBase]: For 25350/25407 co-relation queries the response was YES. [2025-04-13 19:37:58,991 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21430 conditions, 6635 events. 3612/6635 cut-off events. For 25350/25407 co-relation queries the response was YES. Maximal size of possible extension queue 484. Compared 54619 event pairs, 858 based on Foata normal form. 111/6601 useless extension candidates. Maximal degree in co-relation 21396. Up to 1710 conditions per place. [2025-04-13 19:37:59,003 INFO L140 encePairwiseOnDemand]: 38/43 looper letters, 43 selfloop transitions, 4 changer transitions 60/125 dead transitions. [2025-04-13 19:37:59,003 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 125 transitions, 1190 flow [2025-04-13 19:37:59,003 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 19:37:59,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-13 19:37:59,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 181 transitions. [2025-04-13 19:37:59,004 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7015503875968992 [2025-04-13 19:37:59,004 INFO L175 Difference]: Start difference. First operand has 85 places, 68 transitions, 504 flow. Second operand 6 states and 181 transitions. [2025-04-13 19:37:59,004 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 125 transitions, 1190 flow [2025-04-13 19:37:59,086 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 125 transitions, 1170 flow, removed 4 selfloop flow, removed 4 redundant places. [2025-04-13 19:37:59,089 INFO L231 Difference]: Finished difference. Result has 88 places, 48 transitions, 299 flow [2025-04-13 19:37:59,089 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=484, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=299, PETRI_PLACES=88, PETRI_TRANSITIONS=48} [2025-04-13 19:37:59,089 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 37 predicate places. [2025-04-13 19:37:59,090 INFO L485 AbstractCegarLoop]: Abstraction has has 88 places, 48 transitions, 299 flow [2025-04-13 19:37:59,090 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.5) internal successors, (141), 6 states have internal predecessors, (141), 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:37:59,090 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:37:59,090 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:37:59,090 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-13 19:37:59,090 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 19:37:59,090 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:37:59,090 INFO L85 PathProgramCache]: Analyzing trace with hash -737894997, now seen corresponding path program 1 times [2025-04-13 19:37:59,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:37:59,091 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153311852] [2025-04-13 19:37:59,091 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:37:59,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:37:59,098 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-13 19:37:59,104 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 19:37:59,104 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:37:59,104 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:37:59,236 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:37:59,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:37:59,236 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153311852] [2025-04-13 19:37:59,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153311852] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:37:59,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:37:59,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 19:37:59,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416479914] [2025-04-13 19:37:59,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:37:59,237 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 19:37:59,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:37:59,237 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 19:37:59,237 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-13 19:37:59,257 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 43 [2025-04-13 19:37:59,257 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 48 transitions, 299 flow. Second operand has 6 states, 6 states have (on average 23.5) internal successors, (141), 6 states have internal predecessors, (141), 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:37:59,257 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:37:59,257 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 43 [2025-04-13 19:37:59,257 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:37:59,506 INFO L116 PetriNetUnfolderBase]: 1381/2584 cut-off events. [2025-04-13 19:37:59,506 INFO L117 PetriNetUnfolderBase]: For 11891/11891 co-relation queries the response was YES. [2025-04-13 19:37:59,514 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8459 conditions, 2584 events. 1381/2584 cut-off events. For 11891/11891 co-relation queries the response was YES. Maximal size of possible extension queue 195. Compared 19079 event pairs, 553 based on Foata normal form. 36/2538 useless extension candidates. Maximal degree in co-relation 8423. Up to 961 conditions per place. [2025-04-13 19:37:59,520 INFO L140 encePairwiseOnDemand]: 38/43 looper letters, 31 selfloop transitions, 3 changer transitions 21/72 dead transitions. [2025-04-13 19:37:59,520 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 72 transitions, 530 flow [2025-04-13 19:37:59,521 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 19:37:59,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-13 19:37:59,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 175 transitions. [2025-04-13 19:37:59,522 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6782945736434108 [2025-04-13 19:37:59,522 INFO L175 Difference]: Start difference. First operand has 88 places, 48 transitions, 299 flow. Second operand 6 states and 175 transitions. [2025-04-13 19:37:59,522 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 72 transitions, 530 flow [2025-04-13 19:37:59,531 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 72 transitions, 410 flow, removed 43 selfloop flow, removed 19 redundant places. [2025-04-13 19:37:59,532 INFO L231 Difference]: Finished difference. Result has 69 places, 41 transitions, 176 flow [2025-04-13 19:37:59,532 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=211, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=176, PETRI_PLACES=69, PETRI_TRANSITIONS=41} [2025-04-13 19:37:59,532 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 18 predicate places. [2025-04-13 19:37:59,532 INFO L485 AbstractCegarLoop]: Abstraction has has 69 places, 41 transitions, 176 flow [2025-04-13 19:37:59,534 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.5) internal successors, (141), 6 states have internal predecessors, (141), 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:37:59,534 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:37:59,534 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:37:59,534 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-13 19:37:59,535 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 19:37:59,535 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:37:59,535 INFO L85 PathProgramCache]: Analyzing trace with hash -628559359, now seen corresponding path program 1 times [2025-04-13 19:37:59,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:37:59,535 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314847496] [2025-04-13 19:37:59,535 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:37:59,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:37:59,544 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-13 19:37:59,549 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 19:37:59,549 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:37:59,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:37:59,660 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:37:59,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:37:59,660 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314847496] [2025-04-13 19:37:59,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314847496] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:37:59,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:37:59,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 19:37:59,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883610443] [2025-04-13 19:37:59,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:37:59,660 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 19:37:59,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:37:59,661 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 19:37:59,661 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 19:37:59,671 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 43 [2025-04-13 19:37:59,671 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 41 transitions, 176 flow. Second operand has 5 states, 5 states have (on average 25.0) internal successors, (125), 5 states have internal predecessors, (125), 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:37:59,671 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:37:59,671 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 43 [2025-04-13 19:37:59,671 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:37:59,780 INFO L116 PetriNetUnfolderBase]: 396/858 cut-off events. [2025-04-13 19:37:59,780 INFO L117 PetriNetUnfolderBase]: For 1542/1542 co-relation queries the response was YES. [2025-04-13 19:37:59,782 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2335 conditions, 858 events. 396/858 cut-off events. For 1542/1542 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 5191 event pairs, 232 based on Foata normal form. 24/826 useless extension candidates. Maximal degree in co-relation 2311. Up to 437 conditions per place. [2025-04-13 19:37:59,784 INFO L140 encePairwiseOnDemand]: 39/43 looper letters, 30 selfloop transitions, 4 changer transitions 9/61 dead transitions. [2025-04-13 19:37:59,784 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 61 transitions, 344 flow [2025-04-13 19:37:59,785 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 19:37:59,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 19:37:59,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 153 transitions. [2025-04-13 19:37:59,786 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7116279069767442 [2025-04-13 19:37:59,786 INFO L175 Difference]: Start difference. First operand has 69 places, 41 transitions, 176 flow. Second operand 5 states and 153 transitions. [2025-04-13 19:37:59,786 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 61 transitions, 344 flow [2025-04-13 19:37:59,788 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 61 transitions, 286 flow, removed 18 selfloop flow, removed 11 redundant places. [2025-04-13 19:37:59,789 INFO L231 Difference]: Finished difference. Result has 62 places, 41 transitions, 153 flow [2025-04-13 19:37:59,789 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=135, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=153, PETRI_PLACES=62, PETRI_TRANSITIONS=41} [2025-04-13 19:37:59,790 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 11 predicate places. [2025-04-13 19:37:59,790 INFO L485 AbstractCegarLoop]: Abstraction has has 62 places, 41 transitions, 153 flow [2025-04-13 19:37:59,790 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.0) internal successors, (125), 5 states have internal predecessors, (125), 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:37:59,791 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:37:59,791 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:37:59,791 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-13 19:37:59,791 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 19:37:59,791 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:37:59,791 INFO L85 PathProgramCache]: Analyzing trace with hash -824595686, now seen corresponding path program 1 times [2025-04-13 19:37:59,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:37:59,791 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015032711] [2025-04-13 19:37:59,791 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:37:59,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:37:59,802 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-13 19:37:59,805 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 19:37:59,805 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:37:59,805 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:37:59,903 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:37:59,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:37:59,903 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015032711] [2025-04-13 19:37:59,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015032711] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:37:59,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:37:59,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 19:37:59,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447448377] [2025-04-13 19:37:59,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:37:59,903 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 19:37:59,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:37:59,904 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 19:37:59,904 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 19:37:59,910 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 43 [2025-04-13 19:37:59,911 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 41 transitions, 153 flow. Second operand has 5 states, 5 states have (on average 26.6) internal successors, (133), 5 states have internal predecessors, (133), 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:37:59,911 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:37:59,911 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 43 [2025-04-13 19:37:59,911 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:38:00,044 INFO L116 PetriNetUnfolderBase]: 538/1088 cut-off events. [2025-04-13 19:38:00,044 INFO L117 PetriNetUnfolderBase]: For 1029/1063 co-relation queries the response was YES. [2025-04-13 19:38:00,046 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2550 conditions, 1088 events. 538/1088 cut-off events. For 1029/1063 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 6849 event pairs, 110 based on Foata normal form. 24/1041 useless extension candidates. Maximal degree in co-relation 2532. Up to 249 conditions per place. [2025-04-13 19:38:00,048 INFO L140 encePairwiseOnDemand]: 38/43 looper letters, 24 selfloop transitions, 3 changer transitions 16/63 dead transitions. [2025-04-13 19:38:00,048 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 63 transitions, 302 flow [2025-04-13 19:38:00,049 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 19:38:00,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-13 19:38:00,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 186 transitions. [2025-04-13 19:38:00,049 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7209302325581395 [2025-04-13 19:38:00,050 INFO L175 Difference]: Start difference. First operand has 62 places, 41 transitions, 153 flow. Second operand 6 states and 186 transitions. [2025-04-13 19:38:00,050 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 63 transitions, 302 flow [2025-04-13 19:38:00,051 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 63 transitions, 286 flow, removed 3 selfloop flow, removed 4 redundant places. [2025-04-13 19:38:00,051 INFO L231 Difference]: Finished difference. Result has 65 places, 38 transitions, 138 flow [2025-04-13 19:38:00,052 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=139, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=138, PETRI_PLACES=65, PETRI_TRANSITIONS=38} [2025-04-13 19:38:00,052 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 14 predicate places. [2025-04-13 19:38:00,052 INFO L485 AbstractCegarLoop]: Abstraction has has 65 places, 38 transitions, 138 flow [2025-04-13 19:38:00,052 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.6) internal successors, (133), 5 states have internal predecessors, (133), 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:38:00,052 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:38:00,052 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:38:00,052 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-13 19:38:00,052 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 19:38:00,053 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:38:00,053 INFO L85 PathProgramCache]: Analyzing trace with hash 931866968, now seen corresponding path program 1 times [2025-04-13 19:38:00,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:38:00,053 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371287143] [2025-04-13 19:38:00,053 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:38:00,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:38:00,059 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-13 19:38:00,062 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 19:38:00,062 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:38:00,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:38:00,154 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:38:00,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:38:00,154 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371287143] [2025-04-13 19:38:00,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [371287143] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:38:00,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:38:00,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 19:38:00,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319100166] [2025-04-13 19:38:00,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:38:00,154 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 19:38:00,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:38:00,155 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 19:38:00,155 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-13 19:38:00,166 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 43 [2025-04-13 19:38:00,166 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 38 transitions, 138 flow. Second operand has 6 states, 6 states have (on average 23.666666666666668) internal successors, (142), 6 states have internal predecessors, (142), 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:38:00,166 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:38:00,166 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 43 [2025-04-13 19:38:00,166 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:38:00,253 INFO L116 PetriNetUnfolderBase]: 270/535 cut-off events. [2025-04-13 19:38:00,253 INFO L117 PetriNetUnfolderBase]: For 673/673 co-relation queries the response was YES. [2025-04-13 19:38:00,254 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1326 conditions, 535 events. 270/535 cut-off events. For 673/673 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2811 event pairs, 114 based on Foata normal form. 24/534 useless extension candidates. Maximal degree in co-relation 1314. Up to 194 conditions per place. [2025-04-13 19:38:00,254 INFO L140 encePairwiseOnDemand]: 39/43 looper letters, 0 selfloop transitions, 0 changer transitions 51/51 dead transitions. [2025-04-13 19:38:00,255 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 51 transitions, 238 flow [2025-04-13 19:38:00,255 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 19:38:00,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-13 19:38:00,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 162 transitions. [2025-04-13 19:38:00,256 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.627906976744186 [2025-04-13 19:38:00,256 INFO L175 Difference]: Start difference. First operand has 65 places, 38 transitions, 138 flow. Second operand 6 states and 162 transitions. [2025-04-13 19:38:00,256 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 51 transitions, 238 flow [2025-04-13 19:38:00,257 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 51 transitions, 190 flow, removed 15 selfloop flow, removed 10 redundant places. [2025-04-13 19:38:00,257 INFO L231 Difference]: Finished difference. Result has 57 places, 0 transitions, 0 flow [2025-04-13 19:38:00,257 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=0, PETRI_PLACES=57, PETRI_TRANSITIONS=0} [2025-04-13 19:38:00,258 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, 6 predicate places. [2025-04-13 19:38:00,258 INFO L485 AbstractCegarLoop]: Abstraction has has 57 places, 0 transitions, 0 flow [2025-04-13 19:38:00,258 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.666666666666668) internal successors, (142), 6 states have internal predecessors, (142), 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:38:00,260 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2025-04-13 19:38:00,260 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 5 remaining) [2025-04-13 19:38:00,260 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2025-04-13 19:38:00,260 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2025-04-13 19:38:00,260 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining) [2025-04-13 19:38:00,260 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-13 19:38:00,261 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:38:00,263 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-13 19:38:00,263 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-13 19:38:00,267 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 07:38:00 BasicIcfg [2025-04-13 19:38:00,267 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-13 19:38:00,267 INFO L158 Benchmark]: Toolchain (without parser) took 6549.11ms. Allocated memory was 167.8MB in the beginning and 746.6MB in the end (delta: 578.8MB). Free memory was 115.1MB in the beginning and 239.1MB in the end (delta: -124.0MB). Peak memory consumption was 456.9MB. Max. memory is 8.0GB. [2025-04-13 19:38:00,268 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 163.6MB. Free memory was 89.1MB in the beginning and 88.8MB in the end (delta: 279.6kB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 19:38:00,268 INFO L158 Benchmark]: CACSL2BoogieTranslator took 380.82ms. Allocated memory is still 167.8MB. Free memory was 115.1MB in the beginning and 92.0MB in the end (delta: 23.0MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2025-04-13 19:38:00,268 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.62ms. Allocated memory is still 167.8MB. Free memory was 92.0MB in the beginning and 90.0MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 19:38:00,268 INFO L158 Benchmark]: Boogie Preprocessor took 31.00ms. Allocated memory is still 167.8MB. Free memory was 90.0MB in the beginning and 87.8MB in the end (delta: 2.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 19:38:00,268 INFO L158 Benchmark]: RCFGBuilder took 339.22ms. Allocated memory is still 167.8MB. Free memory was 87.8MB in the beginning and 62.7MB in the end (delta: 25.1MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2025-04-13 19:38:00,268 INFO L158 Benchmark]: TraceAbstraction took 5759.42ms. Allocated memory was 167.8MB in the beginning and 746.6MB in the end (delta: 578.8MB). Free memory was 61.7MB in the beginning and 239.1MB in the end (delta: -177.4MB). Peak memory consumption was 402.3MB. Max. memory is 8.0GB. [2025-04-13 19:38:00,269 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24ms. Allocated memory is still 163.6MB. Free memory was 89.1MB in the beginning and 88.8MB in the end (delta: 279.6kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 380.82ms. Allocated memory is still 167.8MB. Free memory was 115.1MB in the beginning and 92.0MB in the end (delta: 23.0MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 32.62ms. Allocated memory is still 167.8MB. Free memory was 92.0MB in the beginning and 90.0MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 31.00ms. Allocated memory is still 167.8MB. Free memory was 90.0MB in the beginning and 87.8MB in the end (delta: 2.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 339.22ms. Allocated memory is still 167.8MB. Free memory was 87.8MB in the beginning and 62.7MB in the end (delta: 25.1MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * TraceAbstraction took 5759.42ms. Allocated memory was 167.8MB in the beginning and 746.6MB in the end (delta: 578.8MB). Free memory was 61.7MB in the beginning and 239.1MB in the end (delta: -177.4MB). Peak memory consumption was 402.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 18]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 76 locations, 71 edges, 5 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 5.7s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 422 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 355 mSDsluCounter, 248 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 161 mSDsCounter, 7 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 885 IncrementalHoareTripleChecker+Invalid, 892 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7 mSolverCounterUnsat, 87 mSDtfsCounter, 885 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 60 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=504occurred in iteration=6, InterpolantAutomatonStates: 67, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 213 NumberOfCodeBlocks, 213 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 202 ConstructedInterpolants, 0 QuantifiedInterpolants, 1105 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-04-13 19:38:00,286 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...