/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/safe011_tso.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 19:36:22,990 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 19:36:23,041 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:36:23,044 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 19:36:23,044 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 19:36:23,062 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 19:36:23,062 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 19:36:23,063 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 19:36:23,063 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 19:36:23,063 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 19:36:23,063 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 19:36:23,063 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 19:36:23,063 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 19:36:23,063 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 19:36:23,063 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 19:36:23,063 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 19:36:23,063 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 19:36:23,064 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 19:36:23,064 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 19:36:23,064 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 19:36:23,064 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 19:36:23,064 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 19:36:23,064 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 19:36:23,064 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 19:36:23,064 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 19:36:23,064 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 19:36:23,064 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 19:36:23,064 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 19:36:23,064 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 19:36:23,064 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 19:36:23,064 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 19:36:23,064 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 19:36:23,066 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 19:36:23,066 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 19:36:23,066 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 19:36:23,066 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 19:36:23,066 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 19:36:23,066 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 19:36:23,066 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 19:36:23,066 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 19:36:23,066 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 19:36:23,066 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 19:36:23,067 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 19:36:23,067 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 19:36:23,067 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 19:36:23,067 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 19:36:23,067 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 19:36:23,067 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:36:23,281 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 19:36:23,289 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 19:36:23,291 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 19:36:23,292 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 19:36:23,292 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 19:36:23,293 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe011_tso.i [2025-04-13 19:36:24,630 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/77e6c17ff/1745f0f1653c4ea7b4fa078ff70bd24f/FLAGd70b5ca56 [2025-04-13 19:36:24,899 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 19:36:24,900 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe011_tso.i [2025-04-13 19:36:24,916 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/77e6c17ff/1745f0f1653c4ea7b4fa078ff70bd24f/FLAGd70b5ca56 [2025-04-13 19:36:25,681 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/77e6c17ff/1745f0f1653c4ea7b4fa078ff70bd24f [2025-04-13 19:36:25,684 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 19:36:25,685 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 19:36:25,686 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 19:36:25,686 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 19:36:25,691 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 19:36:25,692 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 07:36:25" (1/1) ... [2025-04-13 19:36:25,692 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e41ffc3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:36:25, skipping insertion in model container [2025-04-13 19:36:25,692 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 07:36:25" (1/1) ... [2025-04-13 19:36:25,715 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 19:36:25,860 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/safe011_tso.i[945,958] [2025-04-13 19:36:26,010 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 19:36:26,016 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 19:36:26,030 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/safe011_tso.i[945,958] [2025-04-13 19:36:26,054 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 19:36:26,076 INFO L204 MainTranslator]: Completed translation [2025-04-13 19:36:26,077 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:36:26 WrapperNode [2025-04-13 19:36:26,077 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 19:36:26,077 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 19:36:26,078 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 19:36:26,078 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 19:36:26,081 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:36:26" (1/1) ... [2025-04-13 19:36:26,094 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:36:26" (1/1) ... [2025-04-13 19:36:26,107 INFO L138 Inliner]: procedures = 175, calls = 41, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 57 [2025-04-13 19:36:26,107 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 19:36:26,108 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 19:36:26,108 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 19:36:26,108 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 19:36:26,117 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:36:26" (1/1) ... [2025-04-13 19:36:26,117 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:36:26" (1/1) ... [2025-04-13 19:36:26,118 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:36:26" (1/1) ... [2025-04-13 19:36:26,126 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:36:26,126 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:36:26" (1/1) ... [2025-04-13 19:36:26,127 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:36:26" (1/1) ... [2025-04-13 19:36:26,133 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:36:26" (1/1) ... [2025-04-13 19:36:26,134 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:36:26" (1/1) ... [2025-04-13 19:36:26,135 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:36:26" (1/1) ... [2025-04-13 19:36:26,140 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:36:26" (1/1) ... [2025-04-13 19:36:26,140 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:36:26" (1/1) ... [2025-04-13 19:36:26,143 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 19:36:26,147 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-13 19:36:26,147 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-13 19:36:26,147 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-13 19:36:26,148 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:36:26" (1/1) ... [2025-04-13 19:36:26,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 19:36:26,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:36:26,172 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:36:26,174 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:36:26,192 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-04-13 19:36:26,192 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 19:36:26,192 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2025-04-13 19:36:26,192 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2025-04-13 19:36:26,192 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2025-04-13 19:36:26,192 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2025-04-13 19:36:26,192 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2025-04-13 19:36:26,193 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2025-04-13 19:36:26,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 19:36:26,193 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-04-13 19:36:26,193 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 19:36:26,193 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 19:36:26,193 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:36:26,287 INFO L234 CfgBuilder]: Building ICFG [2025-04-13 19:36:26,288 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 19:36:26,376 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 19:36:26,376 INFO L289 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 19:36:26,377 INFO L294 CfgBuilder]: Performing block encoding [2025-04-13 19:36:26,465 INFO L313 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 19:36:26,466 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 07:36:26 BoogieIcfgContainer [2025-04-13 19:36:26,466 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-13 19:36:26,467 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 19:36:26,467 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 19:36:26,471 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 19:36:26,471 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 07:36:25" (1/3) ... [2025-04-13 19:36:26,471 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19ee89cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 07:36:26, skipping insertion in model container [2025-04-13 19:36:26,472 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:36:26" (2/3) ... [2025-04-13 19:36:26,472 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19ee89cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 07:36:26, skipping insertion in model container [2025-04-13 19:36:26,472 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 07:36:26" (3/3) ... [2025-04-13 19:36:26,473 INFO L128 eAbstractionObserver]: Analyzing ICFG safe011_tso.i [2025-04-13 19:36:26,485 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 19:36:26,486 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG safe011_tso.i that has 4 procedures, 35 locations, 31 edges, 1 initial locations, 0 loop locations, and 1 error locations. [2025-04-13 19:36:26,487 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 19:36:26,527 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-13 19:36:26,552 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 44 places, 34 transitions, 80 flow [2025-04-13 19:36:26,574 INFO L116 PetriNetUnfolderBase]: 0/31 cut-off events. [2025-04-13 19:36:26,576 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-13 19:36:26,577 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41 conditions, 31 events. 0/31 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 54 event pairs, 0 based on Foata normal form. 0/30 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2025-04-13 19:36:26,577 INFO L82 GeneralOperation]: Start removeDead. Operand has 44 places, 34 transitions, 80 flow [2025-04-13 19:36:26,579 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 40 places, 30 transitions, 69 flow [2025-04-13 19:36:26,585 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 19:36:26,592 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;@77d98351, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 19:36:26,592 INFO L341 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-04-13 19:36:26,600 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 19:36:26,600 INFO L116 PetriNetUnfolderBase]: 0/28 cut-off events. [2025-04-13 19:36:26,600 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-13 19:36:26,600 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:36:26,601 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:36:26,601 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 1 more)] === [2025-04-13 19:36:26,604 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:36:26,604 INFO L85 PathProgramCache]: Analyzing trace with hash -908518439, now seen corresponding path program 1 times [2025-04-13 19:36:26,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:36:26,611 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964155479] [2025-04-13 19:36:26,611 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:36:26,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:36:26,692 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-13 19:36:26,721 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-13 19:36:26,721 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:36:26,722 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:36:27,003 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:36:27,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:36:27,004 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964155479] [2025-04-13 19:36:27,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964155479] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:36:27,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:36:27,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 19:36:27,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703984029] [2025-04-13 19:36:27,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:36:27,010 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 19:36:27,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:36:27,028 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 19:36:27,028 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 19:36:27,044 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 34 [2025-04-13 19:36:27,046 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 30 transitions, 69 flow. Second operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 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:36:27,046 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:36:27,046 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 34 [2025-04-13 19:36:27,046 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:36:27,326 INFO L116 PetriNetUnfolderBase]: 840/1702 cut-off events. [2025-04-13 19:36:27,326 INFO L117 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2025-04-13 19:36:27,331 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3084 conditions, 1702 events. 840/1702 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 12078 event pairs, 277 based on Foata normal form. 76/1722 useless extension candidates. Maximal degree in co-relation 3073. Up to 629 conditions per place. [2025-04-13 19:36:27,336 INFO L140 encePairwiseOnDemand]: 26/34 looper letters, 27 selfloop transitions, 6 changer transitions 17/62 dead transitions. [2025-04-13 19:36:27,337 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 62 transitions, 239 flow [2025-04-13 19:36:27,338 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 19:36:27,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 19:36:27,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 127 transitions. [2025-04-13 19:36:27,345 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7470588235294118 [2025-04-13 19:36:27,346 INFO L175 Difference]: Start difference. First operand has 40 places, 30 transitions, 69 flow. Second operand 5 states and 127 transitions. [2025-04-13 19:36:27,347 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 62 transitions, 239 flow [2025-04-13 19:36:27,349 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 62 transitions, 234 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-04-13 19:36:27,351 INFO L231 Difference]: Finished difference. Result has 45 places, 35 transitions, 126 flow [2025-04-13 19:36:27,353 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=126, PETRI_PLACES=45, PETRI_TRANSITIONS=35} [2025-04-13 19:36:27,355 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 5 predicate places. [2025-04-13 19:36:27,355 INFO L485 AbstractCegarLoop]: Abstraction has has 45 places, 35 transitions, 126 flow [2025-04-13 19:36:27,355 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 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:36:27,356 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:36:27,356 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:36:27,356 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 19:36:27,356 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 1 more)] === [2025-04-13 19:36:27,357 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:36:27,357 INFO L85 PathProgramCache]: Analyzing trace with hash -1207588134, now seen corresponding path program 1 times [2025-04-13 19:36:27,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:36:27,357 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226853171] [2025-04-13 19:36:27,357 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:36:27,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:36:27,367 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-13 19:36:27,377 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 19:36:27,377 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:36:27,377 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:36:27,541 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:36:27,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:36:27,542 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226853171] [2025-04-13 19:36:27,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226853171] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:36:27,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:36:27,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 19:36:27,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122977449] [2025-04-13 19:36:27,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:36:27,544 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 19:36:27,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:36:27,545 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 19:36:27,545 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 19:36:27,557 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 34 [2025-04-13 19:36:27,557 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 35 transitions, 126 flow. Second operand has 5 states, 5 states have (on average 17.2) internal successors, (86), 5 states have internal predecessors, (86), 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:36:27,557 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:36:27,557 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 34 [2025-04-13 19:36:27,557 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:36:27,770 INFO L116 PetriNetUnfolderBase]: 743/1567 cut-off events. [2025-04-13 19:36:27,770 INFO L117 PetriNetUnfolderBase]: For 1141/1148 co-relation queries the response was YES. [2025-04-13 19:36:27,774 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3951 conditions, 1567 events. 743/1567 cut-off events. For 1141/1148 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 11043 event pairs, 143 based on Foata normal form. 77/1617 useless extension candidates. Maximal degree in co-relation 3937. Up to 540 conditions per place. [2025-04-13 19:36:27,779 INFO L140 encePairwiseOnDemand]: 26/34 looper letters, 37 selfloop transitions, 10 changer transitions 26/85 dead transitions. [2025-04-13 19:36:27,779 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 85 transitions, 492 flow [2025-04-13 19:36:27,780 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 19:36:27,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-13 19:36:27,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 174 transitions. [2025-04-13 19:36:27,782 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7310924369747899 [2025-04-13 19:36:27,782 INFO L175 Difference]: Start difference. First operand has 45 places, 35 transitions, 126 flow. Second operand 7 states and 174 transitions. [2025-04-13 19:36:27,782 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 85 transitions, 492 flow [2025-04-13 19:36:27,789 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 85 transitions, 452 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-13 19:36:27,792 INFO L231 Difference]: Finished difference. Result has 53 places, 42 transitions, 214 flow [2025-04-13 19:36:27,792 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=214, PETRI_PLACES=53, PETRI_TRANSITIONS=42} [2025-04-13 19:36:27,793 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 13 predicate places. [2025-04-13 19:36:27,793 INFO L485 AbstractCegarLoop]: Abstraction has has 53 places, 42 transitions, 214 flow [2025-04-13 19:36:27,793 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 5 states have internal predecessors, (86), 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:36:27,793 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:36:27,793 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:36:27,793 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 19:36:27,793 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 1 more)] === [2025-04-13 19:36:27,794 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:36:27,794 INFO L85 PathProgramCache]: Analyzing trace with hash -1187078472, now seen corresponding path program 1 times [2025-04-13 19:36:27,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:36:27,795 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432695800] [2025-04-13 19:36:27,795 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:36:27,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:36:27,803 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-13 19:36:27,808 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 19:36:27,808 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:36:27,808 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:36:27,941 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:36:27,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:36:27,941 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432695800] [2025-04-13 19:36:27,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432695800] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:36:27,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:36:27,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 19:36:27,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142053439] [2025-04-13 19:36:27,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:36:27,942 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 19:36:27,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:36:27,942 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 19:36:27,942 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 19:36:27,952 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 34 [2025-04-13 19:36:27,952 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 42 transitions, 214 flow. Second operand has 5 states, 5 states have (on average 17.2) internal successors, (86), 5 states have internal predecessors, (86), 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:36:27,952 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:36:27,952 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 34 [2025-04-13 19:36:27,952 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:36:28,126 INFO L116 PetriNetUnfolderBase]: 673/1369 cut-off events. [2025-04-13 19:36:28,126 INFO L117 PetriNetUnfolderBase]: For 2677/2677 co-relation queries the response was YES. [2025-04-13 19:36:28,130 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4042 conditions, 1369 events. 673/1369 cut-off events. For 2677/2677 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 9089 event pairs, 136 based on Foata normal form. 40/1374 useless extension candidates. Maximal degree in co-relation 4022. Up to 508 conditions per place. [2025-04-13 19:36:28,135 INFO L140 encePairwiseOnDemand]: 26/34 looper letters, 40 selfloop transitions, 14 changer transitions 18/84 dead transitions. [2025-04-13 19:36:28,136 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 84 transitions, 558 flow [2025-04-13 19:36:28,136 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 19:36:28,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-13 19:36:28,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 170 transitions. [2025-04-13 19:36:28,139 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7142857142857143 [2025-04-13 19:36:28,139 INFO L175 Difference]: Start difference. First operand has 53 places, 42 transitions, 214 flow. Second operand 7 states and 170 transitions. [2025-04-13 19:36:28,139 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 84 transitions, 558 flow [2025-04-13 19:36:28,149 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 84 transitions, 548 flow, removed 5 selfloop flow, removed 0 redundant places. [2025-04-13 19:36:28,150 INFO L231 Difference]: Finished difference. Result has 61 places, 47 transitions, 304 flow [2025-04-13 19:36:28,150 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=208, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=304, PETRI_PLACES=61, PETRI_TRANSITIONS=47} [2025-04-13 19:36:28,151 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 21 predicate places. [2025-04-13 19:36:28,152 INFO L485 AbstractCegarLoop]: Abstraction has has 61 places, 47 transitions, 304 flow [2025-04-13 19:36:28,152 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 5 states have internal predecessors, (86), 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:36:28,152 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:36:28,152 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:36:28,152 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 19:36:28,153 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 1 more)] === [2025-04-13 19:36:28,153 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:36:28,153 INFO L85 PathProgramCache]: Analyzing trace with hash 497839767, now seen corresponding path program 1 times [2025-04-13 19:36:28,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:36:28,153 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068042205] [2025-04-13 19:36:28,154 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:36:28,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:36:28,161 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-13 19:36:28,166 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 19:36:28,166 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:36:28,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:36:28,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:36:28,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:36:28,269 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068042205] [2025-04-13 19:36:28,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068042205] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:36:28,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:36:28,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 19:36:28,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188771416] [2025-04-13 19:36:28,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:36:28,270 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 19:36:28,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:36:28,270 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 19:36:28,270 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 19:36:28,286 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 34 [2025-04-13 19:36:28,286 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 47 transitions, 304 flow. Second operand has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 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:36:28,286 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:36:28,286 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 34 [2025-04-13 19:36:28,286 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:36:28,435 INFO L116 PetriNetUnfolderBase]: 627/1293 cut-off events. [2025-04-13 19:36:28,435 INFO L117 PetriNetUnfolderBase]: For 4016/4018 co-relation queries the response was YES. [2025-04-13 19:36:28,438 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4215 conditions, 1293 events. 627/1293 cut-off events. For 4016/4018 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 8717 event pairs, 134 based on Foata normal form. 32/1296 useless extension candidates. Maximal degree in co-relation 4188. Up to 400 conditions per place. [2025-04-13 19:36:28,443 INFO L140 encePairwiseOnDemand]: 26/34 looper letters, 36 selfloop transitions, 14 changer transitions 15/77 dead transitions. [2025-04-13 19:36:28,443 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 77 transitions, 606 flow [2025-04-13 19:36:28,444 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 19:36:28,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-13 19:36:28,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 157 transitions. [2025-04-13 19:36:28,444 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6596638655462185 [2025-04-13 19:36:28,444 INFO L175 Difference]: Start difference. First operand has 61 places, 47 transitions, 304 flow. Second operand 7 states and 157 transitions. [2025-04-13 19:36:28,444 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 77 transitions, 606 flow [2025-04-13 19:36:28,451 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 77 transitions, 582 flow, removed 12 selfloop flow, removed 5 redundant places. [2025-04-13 19:36:28,452 INFO L231 Difference]: Finished difference. Result has 65 places, 50 transitions, 391 flow [2025-04-13 19:36:28,452 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=286, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=391, PETRI_PLACES=65, PETRI_TRANSITIONS=50} [2025-04-13 19:36:28,452 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 25 predicate places. [2025-04-13 19:36:28,452 INFO L485 AbstractCegarLoop]: Abstraction has has 65 places, 50 transitions, 391 flow [2025-04-13 19:36:28,452 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 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:36:28,452 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:36:28,453 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:36:28,453 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 19:36:28,453 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 1 more)] === [2025-04-13 19:36:28,453 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:36:28,453 INFO L85 PathProgramCache]: Analyzing trace with hash -202426751, now seen corresponding path program 1 times [2025-04-13 19:36:28,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:36:28,453 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543425312] [2025-04-13 19:36:28,453 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:36:28,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:36:28,462 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-13 19:36:28,466 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-13 19:36:28,466 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:36:28,466 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:36:28,535 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:36:28,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:36:28,536 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543425312] [2025-04-13 19:36:28,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543425312] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:36:28,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:36:28,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 19:36:28,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781652809] [2025-04-13 19:36:28,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:36:28,536 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 19:36:28,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:36:28,537 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 19:36:28,537 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 19:36:28,541 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 34 [2025-04-13 19:36:28,541 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 50 transitions, 391 flow. Second operand has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:36:28,541 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:36:28,541 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 34 [2025-04-13 19:36:28,541 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:36:28,701 INFO L116 PetriNetUnfolderBase]: 502/1209 cut-off events. [2025-04-13 19:36:28,701 INFO L117 PetriNetUnfolderBase]: For 4507/4565 co-relation queries the response was YES. [2025-04-13 19:36:28,707 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3779 conditions, 1209 events. 502/1209 cut-off events. For 4507/4565 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 9163 event pairs, 192 based on Foata normal form. 59/1186 useless extension candidates. Maximal degree in co-relation 3749. Up to 463 conditions per place. [2025-04-13 19:36:28,712 INFO L140 encePairwiseOnDemand]: 30/34 looper letters, 26 selfloop transitions, 8 changer transitions 10/69 dead transitions. [2025-04-13 19:36:28,712 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 69 transitions, 562 flow [2025-04-13 19:36:28,713 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 19:36:28,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 19:36:28,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 126 transitions. [2025-04-13 19:36:28,713 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7411764705882353 [2025-04-13 19:36:28,715 INFO L175 Difference]: Start difference. First operand has 65 places, 50 transitions, 391 flow. Second operand 5 states and 126 transitions. [2025-04-13 19:36:28,715 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 69 transitions, 562 flow [2025-04-13 19:36:28,723 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 69 transitions, 527 flow, removed 8 selfloop flow, removed 4 redundant places. [2025-04-13 19:36:28,724 INFO L231 Difference]: Finished difference. Result has 65 places, 49 transitions, 381 flow [2025-04-13 19:36:28,725 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=365, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=381, PETRI_PLACES=65, PETRI_TRANSITIONS=49} [2025-04-13 19:36:28,726 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 25 predicate places. [2025-04-13 19:36:28,726 INFO L485 AbstractCegarLoop]: Abstraction has has 65 places, 49 transitions, 381 flow [2025-04-13 19:36:28,726 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:36:28,726 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:36:28,727 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:36:28,727 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-13 19:36:28,727 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 1 more)] === [2025-04-13 19:36:28,728 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:36:28,728 INFO L85 PathProgramCache]: Analyzing trace with hash -191054277, now seen corresponding path program 1 times [2025-04-13 19:36:28,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:36:28,728 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457130949] [2025-04-13 19:36:28,728 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:36:28,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:36:28,736 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-13 19:36:28,743 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-13 19:36:28,744 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:36:28,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:36:28,870 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:36:28,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:36:28,871 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457130949] [2025-04-13 19:36:28,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457130949] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:36:28,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:36:28,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 19:36:28,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234368239] [2025-04-13 19:36:28,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:36:28,872 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 19:36:28,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:36:28,872 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 19:36:28,872 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-13 19:36:28,882 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 34 [2025-04-13 19:36:28,882 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 49 transitions, 381 flow. Second operand has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:36:28,882 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:36:28,882 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 34 [2025-04-13 19:36:28,882 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:36:29,115 INFO L116 PetriNetUnfolderBase]: 1006/2111 cut-off events. [2025-04-13 19:36:29,115 INFO L117 PetriNetUnfolderBase]: For 8321/8321 co-relation queries the response was YES. [2025-04-13 19:36:29,121 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6635 conditions, 2111 events. 1006/2111 cut-off events. For 8321/8321 co-relation queries the response was YES. Maximal size of possible extension queue 179. Compared 15896 event pairs, 197 based on Foata normal form. 69/2135 useless extension candidates. Maximal degree in co-relation 6615. Up to 556 conditions per place. [2025-04-13 19:36:29,125 INFO L140 encePairwiseOnDemand]: 26/34 looper letters, 37 selfloop transitions, 7 changer transitions 45/100 dead transitions. [2025-04-13 19:36:29,125 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 100 transitions, 950 flow [2025-04-13 19:36:29,126 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 19:36:29,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-13 19:36:29,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 160 transitions. [2025-04-13 19:36:29,126 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6722689075630253 [2025-04-13 19:36:29,126 INFO L175 Difference]: Start difference. First operand has 65 places, 49 transitions, 381 flow. Second operand 7 states and 160 transitions. [2025-04-13 19:36:29,126 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 100 transitions, 950 flow [2025-04-13 19:36:29,134 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 100 transitions, 910 flow, removed 12 selfloop flow, removed 4 redundant places. [2025-04-13 19:36:29,135 INFO L231 Difference]: Finished difference. Result has 69 places, 38 transitions, 258 flow [2025-04-13 19:36:29,135 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=363, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=258, PETRI_PLACES=69, PETRI_TRANSITIONS=38} [2025-04-13 19:36:29,135 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 29 predicate places. [2025-04-13 19:36:29,135 INFO L485 AbstractCegarLoop]: Abstraction has has 69 places, 38 transitions, 258 flow [2025-04-13 19:36:29,136 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:36:29,136 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:36:29,136 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:36:29,136 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-13 19:36:29,136 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 1 more)] === [2025-04-13 19:36:29,136 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:36:29,136 INFO L85 PathProgramCache]: Analyzing trace with hash 537524402, now seen corresponding path program 1 times [2025-04-13 19:36:29,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:36:29,136 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235210271] [2025-04-13 19:36:29,136 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:36:29,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:36:29,141 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-13 19:36:29,145 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 19:36:29,145 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:36:29,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:36:29,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:36:29,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:36:29,202 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235210271] [2025-04-13 19:36:29,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235210271] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:36:29,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:36:29,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 19:36:29,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366777054] [2025-04-13 19:36:29,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:36:29,202 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 19:36:29,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:36:29,203 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 19:36:29,203 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 19:36:29,206 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 34 [2025-04-13 19:36:29,206 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 38 transitions, 258 flow. Second operand has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 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:36:29,206 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:36:29,206 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 34 [2025-04-13 19:36:29,206 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:36:29,304 INFO L116 PetriNetUnfolderBase]: 716/1343 cut-off events. [2025-04-13 19:36:29,304 INFO L117 PetriNetUnfolderBase]: For 1822/1861 co-relation queries the response was YES. [2025-04-13 19:36:29,308 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3233 conditions, 1343 events. 716/1343 cut-off events. For 1822/1861 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 8393 event pairs, 188 based on Foata normal form. 81/1342 useless extension candidates. Maximal degree in co-relation 3212. Up to 639 conditions per place. [2025-04-13 19:36:29,311 INFO L140 encePairwiseOnDemand]: 28/34 looper letters, 26 selfloop transitions, 5 changer transitions 0/53 dead transitions. [2025-04-13 19:36:29,311 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 53 transitions, 354 flow [2025-04-13 19:36:29,312 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 19:36:29,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-13 19:36:29,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 101 transitions. [2025-04-13 19:36:29,312 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7426470588235294 [2025-04-13 19:36:29,313 INFO L175 Difference]: Start difference. First operand has 69 places, 38 transitions, 258 flow. Second operand 4 states and 101 transitions. [2025-04-13 19:36:29,313 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 53 transitions, 354 flow [2025-04-13 19:36:29,315 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 53 transitions, 272 flow, removed 11 selfloop flow, removed 14 redundant places. [2025-04-13 19:36:29,316 INFO L231 Difference]: Finished difference. Result has 58 places, 42 transitions, 214 flow [2025-04-13 19:36:29,316 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=53, 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=4, PETRI_FLOW=214, PETRI_PLACES=58, PETRI_TRANSITIONS=42} [2025-04-13 19:36:29,317 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 18 predicate places. [2025-04-13 19:36:29,317 INFO L485 AbstractCegarLoop]: Abstraction has has 58 places, 42 transitions, 214 flow [2025-04-13 19:36:29,317 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 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:36:29,317 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:36:29,317 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:36:29,317 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-13 19:36:29,317 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 1 more)] === [2025-04-13 19:36:29,317 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:36:29,317 INFO L85 PathProgramCache]: Analyzing trace with hash 1470045749, now seen corresponding path program 1 times [2025-04-13 19:36:29,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:36:29,317 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956275971] [2025-04-13 19:36:29,317 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:36:29,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:36:29,325 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-13 19:36:29,329 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 19:36:29,329 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:36:29,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:36:29,420 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:36:29,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:36:29,420 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956275971] [2025-04-13 19:36:29,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956275971] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:36:29,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:36:29,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 19:36:29,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272337572] [2025-04-13 19:36:29,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:36:29,421 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 19:36:29,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:36:29,421 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 19:36:29,421 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 19:36:29,431 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 34 [2025-04-13 19:36:29,431 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 42 transitions, 214 flow. Second operand has 5 states, 5 states have (on average 19.2) internal successors, (96), 5 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:36:29,431 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:36:29,431 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 34 [2025-04-13 19:36:29,431 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:36:29,536 INFO L116 PetriNetUnfolderBase]: 587/1124 cut-off events. [2025-04-13 19:36:29,536 INFO L117 PetriNetUnfolderBase]: For 612/1005 co-relation queries the response was YES. [2025-04-13 19:36:29,539 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2929 conditions, 1124 events. 587/1124 cut-off events. For 612/1005 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 6553 event pairs, 57 based on Foata normal form. 87/1144 useless extension candidates. Maximal degree in co-relation 2914. Up to 520 conditions per place. [2025-04-13 19:36:29,541 INFO L140 encePairwiseOnDemand]: 28/34 looper letters, 27 selfloop transitions, 8 changer transitions 9/63 dead transitions. [2025-04-13 19:36:29,541 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 63 transitions, 359 flow [2025-04-13 19:36:29,541 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 19:36:29,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 19:36:29,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 128 transitions. [2025-04-13 19:36:29,542 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7529411764705882 [2025-04-13 19:36:29,542 INFO L175 Difference]: Start difference. First operand has 58 places, 42 transitions, 214 flow. Second operand 5 states and 128 transitions. [2025-04-13 19:36:29,542 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 63 transitions, 359 flow [2025-04-13 19:36:29,543 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 63 transitions, 340 flow, removed 4 selfloop flow, removed 4 redundant places. [2025-04-13 19:36:29,544 INFO L231 Difference]: Finished difference. Result has 60 places, 40 transitions, 213 flow [2025-04-13 19:36:29,544 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=213, PETRI_PLACES=60, PETRI_TRANSITIONS=40} [2025-04-13 19:36:29,545 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 20 predicate places. [2025-04-13 19:36:29,545 INFO L485 AbstractCegarLoop]: Abstraction has has 60 places, 40 transitions, 213 flow [2025-04-13 19:36:29,545 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 5 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:36:29,545 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:36:29,545 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:36:29,545 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-13 19:36:29,545 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 1 more)] === [2025-04-13 19:36:29,545 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:36:29,545 INFO L85 PathProgramCache]: Analyzing trace with hash 965389236, now seen corresponding path program 1 times [2025-04-13 19:36:29,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:36:29,546 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366475609] [2025-04-13 19:36:29,546 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:36:29,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:36:29,550 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-13 19:36:29,553 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 19:36:29,553 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:36:29,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:36:29,622 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:36:29,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:36:29,623 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366475609] [2025-04-13 19:36:29,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366475609] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:36:29,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:36:29,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 19:36:29,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563563640] [2025-04-13 19:36:29,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:36:29,623 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 19:36:29,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:36:29,623 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 19:36:29,623 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-04-13 19:36:29,627 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 34 [2025-04-13 19:36:29,627 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 40 transitions, 213 flow. Second operand has 6 states, 6 states have (on average 19.0) internal successors, (114), 6 states have internal predecessors, (114), 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:36:29,627 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:36:29,627 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 34 [2025-04-13 19:36:29,627 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:36:29,722 INFO L116 PetriNetUnfolderBase]: 313/595 cut-off events. [2025-04-13 19:36:29,723 INFO L117 PetriNetUnfolderBase]: For 954/1237 co-relation queries the response was YES. [2025-04-13 19:36:29,724 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1826 conditions, 595 events. 313/595 cut-off events. For 954/1237 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 2834 event pairs, 17 based on Foata normal form. 72/628 useless extension candidates. Maximal degree in co-relation 1812. Up to 248 conditions per place. [2025-04-13 19:36:29,724 INFO L140 encePairwiseOnDemand]: 28/34 looper letters, 0 selfloop transitions, 0 changer transitions 57/57 dead transitions. [2025-04-13 19:36:29,724 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 57 transitions, 330 flow [2025-04-13 19:36:29,725 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 19:36:29,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-13 19:36:29,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 143 transitions. [2025-04-13 19:36:29,725 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7009803921568627 [2025-04-13 19:36:29,726 INFO L175 Difference]: Start difference. First operand has 60 places, 40 transitions, 213 flow. Second operand 6 states and 143 transitions. [2025-04-13 19:36:29,726 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 57 transitions, 330 flow [2025-04-13 19:36:29,727 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 57 transitions, 293 flow, removed 5 selfloop flow, removed 7 redundant places. [2025-04-13 19:36:29,728 INFO L231 Difference]: Finished difference. Result has 56 places, 0 transitions, 0 flow [2025-04-13 19:36:29,728 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=170, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=0, PETRI_PLACES=56, PETRI_TRANSITIONS=0} [2025-04-13 19:36:29,729 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 16 predicate places. [2025-04-13 19:36:29,729 INFO L485 AbstractCegarLoop]: Abstraction has has 56 places, 0 transitions, 0 flow [2025-04-13 19:36:29,729 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.0) internal successors, (114), 6 states have internal predecessors, (114), 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:36:29,731 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2025-04-13 19:36:29,731 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2025-04-13 19:36:29,731 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2025-04-13 19:36:29,731 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2025-04-13 19:36:29,731 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-13 19:36:29,731 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:36:29,734 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-13 19:36:29,734 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-13 19:36:29,739 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 07:36:29 BasicIcfg [2025-04-13 19:36:29,739 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-13 19:36:29,739 INFO L158 Benchmark]: Toolchain (without parser) took 4054.39ms. Allocated memory was 125.8MB in the beginning and 209.7MB in the end (delta: 83.9MB). Free memory was 84.7MB in the beginning and 85.9MB in the end (delta: -1.2MB). Peak memory consumption was 81.6MB. Max. memory is 8.0GB. [2025-04-13 19:36:29,739 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 155.2MB. Free memory is still 84.7MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 19:36:29,739 INFO L158 Benchmark]: CACSL2BoogieTranslator took 391.09ms. Allocated memory is still 125.8MB. Free memory was 84.7MB in the beginning and 61.1MB in the end (delta: 23.6MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2025-04-13 19:36:29,739 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.91ms. Allocated memory is still 125.8MB. Free memory was 61.1MB in the beginning and 59.6MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 19:36:29,740 INFO L158 Benchmark]: Boogie Preprocessor took 35.08ms. Allocated memory is still 125.8MB. Free memory was 59.6MB in the beginning and 57.7MB in the end (delta: 1.9MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 19:36:29,740 INFO L158 Benchmark]: RCFGBuilder took 318.36ms. Allocated memory is still 125.8MB. Free memory was 57.7MB in the beginning and 36.7MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2025-04-13 19:36:29,740 INFO L158 Benchmark]: TraceAbstraction took 3271.75ms. Allocated memory was 125.8MB in the beginning and 209.7MB in the end (delta: 83.9MB). Free memory was 36.0MB in the beginning and 85.9MB in the end (delta: -49.9MB). Peak memory consumption was 31.3MB. Max. memory is 8.0GB. [2025-04-13 19:36:29,743 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.15ms. Allocated memory is still 155.2MB. Free memory is still 84.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 391.09ms. Allocated memory is still 125.8MB. Free memory was 84.7MB in the beginning and 61.1MB in the end (delta: 23.6MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 29.91ms. Allocated memory is still 125.8MB. Free memory was 61.1MB in the beginning and 59.6MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 35.08ms. Allocated memory is still 125.8MB. Free memory was 59.6MB in the beginning and 57.7MB in the end (delta: 1.9MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 318.36ms. Allocated memory is still 125.8MB. Free memory was 57.7MB in the beginning and 36.7MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * TraceAbstraction took 3271.75ms. Allocated memory was 125.8MB in the beginning and 209.7MB in the end (delta: 83.9MB). Free memory was 36.0MB in the beginning and 85.9MB in the end (delta: -49.9MB). Peak memory consumption was 31.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 7 procedures, 59 locations, 55 edges, 4 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: 3.2s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 298 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 274 mSDsluCounter, 124 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 82 mSDsCounter, 28 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 559 IncrementalHoareTripleChecker+Invalid, 587 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 28 mSolverCounterUnsat, 42 mSDtfsCounter, 559 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 47 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=391occurred in iteration=4, InterpolantAutomatonStates: 53, 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.1s InterpolantComputationTime, 154 NumberOfCodeBlocks, 154 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 145 ConstructedInterpolants, 0 QuantifiedInterpolants, 657 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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:36:29,757 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...