/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/safe013_tso.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 19:36:29,098 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 19:36:29,154 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:29,158 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 19:36:29,158 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 19:36:29,181 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 19:36:29,182 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 19:36:29,182 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 19:36:29,182 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 19:36:29,183 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 19:36:29,183 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 19:36:29,183 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 19:36:29,183 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 19:36:29,184 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 19:36:29,184 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 19:36:29,184 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 19:36:29,184 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 19:36:29,184 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 19:36:29,184 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 19:36:29,184 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 19:36:29,184 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 19:36:29,184 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 19:36:29,184 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 19:36:29,184 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 19:36:29,184 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 19:36:29,185 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 19:36:29,185 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 19:36:29,185 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 19:36:29,185 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 19:36:29,185 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 19:36:29,185 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 19:36:29,185 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 19:36:29,185 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 19:36:29,185 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 19:36:29,185 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 19:36:29,185 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 19:36:29,185 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 19:36:29,185 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 19:36:29,185 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 19:36:29,186 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 19:36:29,186 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 19:36:29,186 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 19:36:29,186 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 19:36:29,186 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 19:36:29,186 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 19:36:29,186 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 19:36:29,186 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 19:36:29,186 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:29,409 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 19:36:29,415 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 19:36:29,416 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 19:36:29,417 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 19:36:29,418 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 19:36:29,419 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe013_tso.i [2025-04-13 19:36:30,773 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e33ddbfc/d3a9a6d199c34d2ca4516153a378c154/FLAG8533a1cec [2025-04-13 19:36:31,043 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 19:36:31,044 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe013_tso.i [2025-04-13 19:36:31,052 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e33ddbfc/d3a9a6d199c34d2ca4516153a378c154/FLAG8533a1cec [2025-04-13 19:36:31,824 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e33ddbfc/d3a9a6d199c34d2ca4516153a378c154 [2025-04-13 19:36:31,826 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 19:36:31,827 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 19:36:31,830 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 19:36:31,830 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 19:36:31,833 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 19:36:31,834 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 07:36:31" (1/1) ... [2025-04-13 19:36:31,834 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4493c9d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:36:31, skipping insertion in model container [2025-04-13 19:36:31,834 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 07:36:31" (1/1) ... [2025-04-13 19:36:31,856 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 19:36:32,018 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/safe013_tso.i[945,958] [2025-04-13 19:36:32,173 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 19:36:32,186 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 19:36:32,205 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/safe013_tso.i[945,958] [2025-04-13 19:36:32,246 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 19:36:32,275 INFO L204 MainTranslator]: Completed translation [2025-04-13 19:36:32,275 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:36:32 WrapperNode [2025-04-13 19:36:32,275 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 19:36:32,276 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 19:36:32,276 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 19:36:32,276 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 19:36:32,282 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:32" (1/1) ... [2025-04-13 19:36:32,293 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:32" (1/1) ... [2025-04-13 19:36:32,310 INFO L138 Inliner]: procedures = 175, calls = 43, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 58 [2025-04-13 19:36:32,310 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 19:36:32,311 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 19:36:32,311 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 19:36:32,311 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 19:36:32,318 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:32" (1/1) ... [2025-04-13 19:36:32,318 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:32" (1/1) ... [2025-04-13 19:36:32,321 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:32" (1/1) ... [2025-04-13 19:36:32,331 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:32,331 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:32" (1/1) ... [2025-04-13 19:36:32,331 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:32" (1/1) ... [2025-04-13 19:36:32,334 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:32" (1/1) ... [2025-04-13 19:36:32,335 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:32" (1/1) ... [2025-04-13 19:36:32,336 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:32" (1/1) ... [2025-04-13 19:36:32,337 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:32" (1/1) ... [2025-04-13 19:36:32,337 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:32" (1/1) ... [2025-04-13 19:36:32,340 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 19:36:32,340 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-13 19:36:32,340 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-13 19:36:32,340 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-13 19:36:32,341 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:36:32" (1/1) ... [2025-04-13 19:36:32,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 19:36:32,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:36:32,374 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:32,376 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:32,401 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-04-13 19:36:32,401 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 19:36:32,402 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2025-04-13 19:36:32,402 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2025-04-13 19:36:32,402 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2025-04-13 19:36:32,402 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2025-04-13 19:36:32,402 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2025-04-13 19:36:32,402 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2025-04-13 19:36:32,402 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 19:36:32,402 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-04-13 19:36:32,402 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 19:36:32,402 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 19:36:32,404 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:32,512 INFO L234 CfgBuilder]: Building ICFG [2025-04-13 19:36:32,514 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 19:36:32,651 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 19:36:32,651 INFO L289 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 19:36:32,651 INFO L294 CfgBuilder]: Performing block encoding [2025-04-13 19:36:32,774 INFO L313 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 19:36:32,776 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 07:36:32 BoogieIcfgContainer [2025-04-13 19:36:32,777 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-13 19:36:32,779 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 19:36:32,779 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 19:36:32,784 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 19:36:32,784 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 07:36:31" (1/3) ... [2025-04-13 19:36:32,785 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33afb985 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 07:36:32, skipping insertion in model container [2025-04-13 19:36:32,785 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:36:32" (2/3) ... [2025-04-13 19:36:32,785 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33afb985 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 07:36:32, skipping insertion in model container [2025-04-13 19:36:32,785 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 07:36:32" (3/3) ... [2025-04-13 19:36:32,786 INFO L128 eAbstractionObserver]: Analyzing ICFG safe013_tso.i [2025-04-13 19:36:32,798 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 19:36:32,799 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG safe013_tso.i that has 4 procedures, 36 locations, 32 edges, 1 initial locations, 0 loop locations, and 1 error locations. [2025-04-13 19:36:32,799 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 19:36:32,842 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-13 19:36:32,868 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 35 transitions, 82 flow [2025-04-13 19:36:32,892 INFO L116 PetriNetUnfolderBase]: 0/32 cut-off events. [2025-04-13 19:36:32,893 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-13 19:36:32,895 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42 conditions, 32 events. 0/32 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 65 event pairs, 0 based on Foata normal form. 0/31 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2025-04-13 19:36:32,895 INFO L82 GeneralOperation]: Start removeDead. Operand has 45 places, 35 transitions, 82 flow [2025-04-13 19:36:32,897 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 41 places, 31 transitions, 71 flow [2025-04-13 19:36:32,902 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 19:36:32,910 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;@34ff04da, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 19:36:32,910 INFO L341 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-04-13 19:36:32,917 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 19:36:32,918 INFO L116 PetriNetUnfolderBase]: 0/29 cut-off events. [2025-04-13 19:36:32,918 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-13 19:36:32,918 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:36:32,918 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:36:32,919 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:32,924 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:36:32,925 INFO L85 PathProgramCache]: Analyzing trace with hash -1021190667, now seen corresponding path program 1 times [2025-04-13 19:36:32,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:36:32,933 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404034734] [2025-04-13 19:36:32,933 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:36:32,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:36:32,992 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-13 19:36:33,017 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-13 19:36:33,019 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:36:33,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:36:33,322 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:33,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:36:33,322 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404034734] [2025-04-13 19:36:33,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404034734] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:36:33,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:36:33,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 19:36:33,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316879881] [2025-04-13 19:36:33,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:36:33,329 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 19:36:33,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:36:33,349 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 19:36:33,350 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 19:36:33,375 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 35 [2025-04-13 19:36:33,378 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 31 transitions, 71 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:33,378 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:36:33,378 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 35 [2025-04-13 19:36:33,379 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:36:33,574 INFO L116 PetriNetUnfolderBase]: 435/908 cut-off events. [2025-04-13 19:36:33,574 INFO L117 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2025-04-13 19:36:33,578 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1659 conditions, 908 events. 435/908 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 6416 event pairs, 140 based on Foata normal form. 44/933 useless extension candidates. Maximal degree in co-relation 1648. Up to 414 conditions per place. [2025-04-13 19:36:33,582 INFO L140 encePairwiseOnDemand]: 28/35 looper letters, 25 selfloop transitions, 5 changer transitions 14/58 dead transitions. [2025-04-13 19:36:33,583 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 58 transitions, 219 flow [2025-04-13 19:36:33,584 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 19:36:33,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 19:36:33,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 131 transitions. [2025-04-13 19:36:33,592 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7485714285714286 [2025-04-13 19:36:33,593 INFO L175 Difference]: Start difference. First operand has 41 places, 31 transitions, 71 flow. Second operand 5 states and 131 transitions. [2025-04-13 19:36:33,594 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 58 transitions, 219 flow [2025-04-13 19:36:33,599 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 58 transitions, 214 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-04-13 19:36:33,601 INFO L231 Difference]: Finished difference. Result has 45 places, 34 transitions, 107 flow [2025-04-13 19:36:33,603 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=107, PETRI_PLACES=45, PETRI_TRANSITIONS=34} [2025-04-13 19:36:33,606 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 4 predicate places. [2025-04-13 19:36:33,606 INFO L485 AbstractCegarLoop]: Abstraction has has 45 places, 34 transitions, 107 flow [2025-04-13 19:36:33,606 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:33,607 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:36:33,607 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:36:33,607 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 19:36:33,607 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:33,608 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:36:33,608 INFO L85 PathProgramCache]: Analyzing trace with hash -2111558794, now seen corresponding path program 1 times [2025-04-13 19:36:33,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:36:33,608 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769354644] [2025-04-13 19:36:33,608 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:36:33,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:36:33,619 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-13 19:36:33,627 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 19:36:33,627 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:36:33,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:36:33,784 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:33,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:36:33,785 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769354644] [2025-04-13 19:36:33,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1769354644] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:36:33,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:36:33,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 19:36:33,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106118323] [2025-04-13 19:36:33,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:36:33,786 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 19:36:33,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:36:33,786 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 19:36:33,786 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 19:36:33,799 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 35 [2025-04-13 19:36:33,799 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 34 transitions, 107 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:33,799 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:36:33,800 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 35 [2025-04-13 19:36:33,800 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:36:33,969 INFO L116 PetriNetUnfolderBase]: 383/822 cut-off events. [2025-04-13 19:36:33,969 INFO L117 PetriNetUnfolderBase]: For 437/437 co-relation queries the response was YES. [2025-04-13 19:36:33,973 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1927 conditions, 822 events. 383/822 cut-off events. For 437/437 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 5619 event pairs, 111 based on Foata normal form. 32/831 useless extension candidates. Maximal degree in co-relation 1914. Up to 295 conditions per place. [2025-04-13 19:36:33,976 INFO L140 encePairwiseOnDemand]: 28/35 looper letters, 26 selfloop transitions, 6 changer transitions 14/60 dead transitions. [2025-04-13 19:36:33,976 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 60 transitions, 282 flow [2025-04-13 19:36:33,977 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 19:36:33,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-13 19:36:33,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 167 transitions. [2025-04-13 19:36:33,978 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6816326530612244 [2025-04-13 19:36:33,978 INFO L175 Difference]: Start difference. First operand has 45 places, 34 transitions, 107 flow. Second operand 7 states and 167 transitions. [2025-04-13 19:36:33,978 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 60 transitions, 282 flow [2025-04-13 19:36:33,980 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 60 transitions, 270 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-04-13 19:36:33,982 INFO L231 Difference]: Finished difference. Result has 52 places, 35 transitions, 132 flow [2025-04-13 19:36:33,982 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=132, PETRI_PLACES=52, PETRI_TRANSITIONS=35} [2025-04-13 19:36:33,982 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 11 predicate places. [2025-04-13 19:36:33,982 INFO L485 AbstractCegarLoop]: Abstraction has has 52 places, 35 transitions, 132 flow [2025-04-13 19:36:33,982 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:33,982 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:36:33,983 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:36:33,983 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 19:36:33,983 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:33,983 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:36:33,983 INFO L85 PathProgramCache]: Analyzing trace with hash -2111159018, now seen corresponding path program 1 times [2025-04-13 19:36:33,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:36:33,983 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216244817] [2025-04-13 19:36:33,983 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:36:33,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:36:33,992 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-13 19:36:33,999 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 19:36:33,999 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:36:34,000 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:36:34,111 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:34,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:36:34,111 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216244817] [2025-04-13 19:36:34,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216244817] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:36:34,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:36:34,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 19:36:34,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278744435] [2025-04-13 19:36:34,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:36:34,112 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 19:36:34,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:36:34,112 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 19:36:34,112 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 19:36:34,122 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 35 [2025-04-13 19:36:34,123 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 35 transitions, 132 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:34,123 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:36:34,123 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 35 [2025-04-13 19:36:34,123 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:36:34,253 INFO L116 PetriNetUnfolderBase]: 361/802 cut-off events. [2025-04-13 19:36:34,253 INFO L117 PetriNetUnfolderBase]: For 990/992 co-relation queries the response was YES. [2025-04-13 19:36:34,254 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2048 conditions, 802 events. 361/802 cut-off events. For 990/992 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 5602 event pairs, 49 based on Foata normal form. 38/829 useless extension candidates. Maximal degree in co-relation 2030. Up to 345 conditions per place. [2025-04-13 19:36:34,257 INFO L140 encePairwiseOnDemand]: 29/35 looper letters, 28 selfloop transitions, 7 changer transitions 14/63 dead transitions. [2025-04-13 19:36:34,257 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 63 transitions, 335 flow [2025-04-13 19:36:34,257 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 19:36:34,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-13 19:36:34,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 170 transitions. [2025-04-13 19:36:34,258 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6938775510204082 [2025-04-13 19:36:34,258 INFO L175 Difference]: Start difference. First operand has 52 places, 35 transitions, 132 flow. Second operand 7 states and 170 transitions. [2025-04-13 19:36:34,258 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 63 transitions, 335 flow [2025-04-13 19:36:34,260 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 63 transitions, 305 flow, removed 8 selfloop flow, removed 5 redundant places. [2025-04-13 19:36:34,261 INFO L231 Difference]: Finished difference. Result has 54 places, 36 transitions, 147 flow [2025-04-13 19:36:34,261 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=115, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=147, PETRI_PLACES=54, PETRI_TRANSITIONS=36} [2025-04-13 19:36:34,262 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 13 predicate places. [2025-04-13 19:36:34,262 INFO L485 AbstractCegarLoop]: Abstraction has has 54 places, 36 transitions, 147 flow [2025-04-13 19:36:34,262 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:34,262 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:36:34,262 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:34,262 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 19:36:34,262 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:34,263 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:36:34,263 INFO L85 PathProgramCache]: Analyzing trace with hash -929547345, now seen corresponding path program 1 times [2025-04-13 19:36:34,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:36:34,263 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120688082] [2025-04-13 19:36:34,263 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:36:34,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:36:34,267 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-13 19:36:34,270 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 19:36:34,271 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:36:34,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:36:34,359 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:34,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:36:34,359 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120688082] [2025-04-13 19:36:34,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120688082] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:36:34,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:36:34,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 19:36:34,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292201157] [2025-04-13 19:36:34,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:36:34,360 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 19:36:34,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:36:34,360 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 19:36:34,360 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 19:36:34,377 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 35 [2025-04-13 19:36:34,377 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 36 transitions, 147 flow. Second operand has 5 states, 5 states have (on average 18.4) internal successors, (92), 5 states have internal predecessors, (92), 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:34,377 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:36:34,377 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 35 [2025-04-13 19:36:34,377 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:36:34,591 INFO L116 PetriNetUnfolderBase]: 660/1347 cut-off events. [2025-04-13 19:36:34,591 INFO L117 PetriNetUnfolderBase]: For 1885/1887 co-relation queries the response was YES. [2025-04-13 19:36:34,595 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3584 conditions, 1347 events. 660/1347 cut-off events. For 1885/1887 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 8916 event pairs, 62 based on Foata normal form. 46/1382 useless extension candidates. Maximal degree in co-relation 3565. Up to 418 conditions per place. [2025-04-13 19:36:34,600 INFO L140 encePairwiseOnDemand]: 27/35 looper letters, 46 selfloop transitions, 18 changer transitions 22/99 dead transitions. [2025-04-13 19:36:34,600 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 99 transitions, 620 flow [2025-04-13 19:36:34,600 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 19:36:34,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-13 19:36:34,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 223 transitions. [2025-04-13 19:36:34,601 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.707936507936508 [2025-04-13 19:36:34,601 INFO L175 Difference]: Start difference. First operand has 54 places, 36 transitions, 147 flow. Second operand 9 states and 223 transitions. [2025-04-13 19:36:34,601 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 99 transitions, 620 flow [2025-04-13 19:36:34,605 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 99 transitions, 558 flow, removed 14 selfloop flow, removed 5 redundant places. [2025-04-13 19:36:34,606 INFO L231 Difference]: Finished difference. Result has 62 places, 49 transitions, 317 flow [2025-04-13 19:36:34,606 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=131, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=317, PETRI_PLACES=62, PETRI_TRANSITIONS=49} [2025-04-13 19:36:34,607 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 21 predicate places. [2025-04-13 19:36:34,607 INFO L485 AbstractCegarLoop]: Abstraction has has 62 places, 49 transitions, 317 flow [2025-04-13 19:36:34,607 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.4) internal successors, (92), 5 states have internal predecessors, (92), 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:34,607 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:36:34,607 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:34,607 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 19:36:34,608 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:34,608 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:36:34,608 INFO L85 PathProgramCache]: Analyzing trace with hash -1030830505, now seen corresponding path program 2 times [2025-04-13 19:36:34,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:36:34,608 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204824953] [2025-04-13 19:36:34,608 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 19:36:34,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:36:34,616 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 1 equivalence classes. [2025-04-13 19:36:34,620 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 19:36:34,621 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 19:36:34,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:36:34,725 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:34,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:36:34,726 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204824953] [2025-04-13 19:36:34,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204824953] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:36:34,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:36:34,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 19:36:34,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776457214] [2025-04-13 19:36:34,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:36:34,726 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 19:36:34,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:36:34,726 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 19:36:34,726 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-13 19:36:34,740 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 35 [2025-04-13 19:36:34,741 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 49 transitions, 317 flow. Second operand has 6 states, 6 states have (on average 18.0) internal successors, (108), 6 states have internal predecessors, (108), 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:34,741 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:36:34,741 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 35 [2025-04-13 19:36:34,741 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:36:34,932 INFO L116 PetriNetUnfolderBase]: 765/1611 cut-off events. [2025-04-13 19:36:34,933 INFO L117 PetriNetUnfolderBase]: For 4672/4672 co-relation queries the response was YES. [2025-04-13 19:36:34,937 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5097 conditions, 1611 events. 765/1611 cut-off events. For 4672/4672 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 11530 event pairs, 121 based on Foata normal form. 45/1621 useless extension candidates. Maximal degree in co-relation 5072. Up to 486 conditions per place. [2025-04-13 19:36:34,941 INFO L140 encePairwiseOnDemand]: 27/35 looper letters, 33 selfloop transitions, 9 changer transitions 33/88 dead transitions. [2025-04-13 19:36:34,941 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 88 transitions, 708 flow [2025-04-13 19:36:34,942 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 19:36:34,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-13 19:36:34,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 170 transitions. [2025-04-13 19:36:34,943 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6938775510204082 [2025-04-13 19:36:34,944 INFO L175 Difference]: Start difference. First operand has 62 places, 49 transitions, 317 flow. Second operand 7 states and 170 transitions. [2025-04-13 19:36:34,944 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 88 transitions, 708 flow [2025-04-13 19:36:34,952 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 88 transitions, 666 flow, removed 21 selfloop flow, removed 3 redundant places. [2025-04-13 19:36:34,953 INFO L231 Difference]: Finished difference. Result has 65 places, 38 transitions, 225 flow [2025-04-13 19:36:34,954 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=301, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=225, PETRI_PLACES=65, PETRI_TRANSITIONS=38} [2025-04-13 19:36:34,955 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 24 predicate places. [2025-04-13 19:36:34,955 INFO L485 AbstractCegarLoop]: Abstraction has has 65 places, 38 transitions, 225 flow [2025-04-13 19:36:34,955 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.0) internal successors, (108), 6 states have internal predecessors, (108), 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:34,955 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:36:34,955 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:34,955 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-13 19:36:34,955 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:34,956 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:36:34,957 INFO L85 PathProgramCache]: Analyzing trace with hash -1620836499, now seen corresponding path program 1 times [2025-04-13 19:36:34,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:36:34,957 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781677369] [2025-04-13 19:36:34,957 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:36:34,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:36:34,965 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-13 19:36:34,972 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 19:36:34,973 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:36:34,973 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:36:35,023 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:35,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:36:35,023 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781677369] [2025-04-13 19:36:35,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781677369] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:36:35,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:36:35,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 19:36:35,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234760125] [2025-04-13 19:36:35,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:36:35,024 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 19:36:35,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:36:35,024 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 19:36:35,024 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 19:36:35,032 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 35 [2025-04-13 19:36:35,032 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 38 transitions, 225 flow. Second operand has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:36:35,032 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:36:35,032 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 35 [2025-04-13 19:36:35,032 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:36:35,141 INFO L116 PetriNetUnfolderBase]: 699/1295 cut-off events. [2025-04-13 19:36:35,141 INFO L117 PetriNetUnfolderBase]: For 1491/1538 co-relation queries the response was YES. [2025-04-13 19:36:35,144 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3168 conditions, 1295 events. 699/1295 cut-off events. For 1491/1538 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 7989 event pairs, 151 based on Foata normal form. 70/1291 useless extension candidates. Maximal degree in co-relation 3151. Up to 598 conditions per place. [2025-04-13 19:36:35,148 INFO L140 encePairwiseOnDemand]: 29/35 looper letters, 26 selfloop transitions, 5 changer transitions 0/53 dead transitions. [2025-04-13 19:36:35,148 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 53 transitions, 321 flow [2025-04-13 19:36:35,148 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 19:36:35,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-13 19:36:35,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 105 transitions. [2025-04-13 19:36:35,149 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.75 [2025-04-13 19:36:35,149 INFO L175 Difference]: Start difference. First operand has 65 places, 38 transitions, 225 flow. Second operand 4 states and 105 transitions. [2025-04-13 19:36:35,149 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 53 transitions, 321 flow [2025-04-13 19:36:35,153 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 53 transitions, 254 flow, removed 9 selfloop flow, removed 12 redundant places. [2025-04-13 19:36:35,153 INFO L231 Difference]: Finished difference. Result has 56 places, 42 transitions, 196 flow [2025-04-13 19:36:35,154 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=51, 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=196, PETRI_PLACES=56, PETRI_TRANSITIONS=42} [2025-04-13 19:36:35,155 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 15 predicate places. [2025-04-13 19:36:35,155 INFO L485 AbstractCegarLoop]: Abstraction has has 56 places, 42 transitions, 196 flow [2025-04-13 19:36:35,155 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:36:35,155 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:36:35,155 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:35,155 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-13 19:36:35,155 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:35,156 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:36:35,156 INFO L85 PathProgramCache]: Analyzing trace with hash 1320046982, now seen corresponding path program 1 times [2025-04-13 19:36:35,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:36:35,156 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130947188] [2025-04-13 19:36:35,156 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:36:35,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:36:35,163 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-13 19:36:35,168 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 19:36:35,169 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:36:35,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:36:35,234 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:35,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:36:35,234 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130947188] [2025-04-13 19:36:35,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130947188] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:36:35,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:36:35,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 19:36:35,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991211291] [2025-04-13 19:36:35,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:36:35,235 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 19:36:35,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:36:35,235 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 19:36:35,235 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 19:36:35,239 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 35 [2025-04-13 19:36:35,239 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 42 transitions, 196 flow. Second operand has 5 states, 5 states have (on average 20.2) internal successors, (101), 5 states have internal predecessors, (101), 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:35,239 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:36:35,239 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 35 [2025-04-13 19:36:35,239 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:36:35,368 INFO L116 PetriNetUnfolderBase]: 600/1138 cut-off events. [2025-04-13 19:36:35,368 INFO L117 PetriNetUnfolderBase]: For 603/831 co-relation queries the response was YES. [2025-04-13 19:36:35,370 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2976 conditions, 1138 events. 600/1138 cut-off events. For 603/831 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 6575 event pairs, 49 based on Foata normal form. 77/1156 useless extension candidates. Maximal degree in co-relation 2964. Up to 520 conditions per place. [2025-04-13 19:36:35,372 INFO L140 encePairwiseOnDemand]: 29/35 looper letters, 33 selfloop transitions, 8 changer transitions 0/63 dead transitions. [2025-04-13 19:36:35,372 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 63 transitions, 341 flow [2025-04-13 19:36:35,373 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 19:36:35,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 19:36:35,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 133 transitions. [2025-04-13 19:36:35,373 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.76 [2025-04-13 19:36:35,373 INFO L175 Difference]: Start difference. First operand has 56 places, 42 transitions, 196 flow. Second operand 5 states and 133 transitions. [2025-04-13 19:36:35,373 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 63 transitions, 341 flow [2025-04-13 19:36:35,375 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 63 transitions, 331 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-04-13 19:36:35,376 INFO L231 Difference]: Finished difference. Result has 60 places, 46 transitions, 241 flow [2025-04-13 19:36:35,376 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=187, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=241, PETRI_PLACES=60, PETRI_TRANSITIONS=46} [2025-04-13 19:36:35,377 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 19 predicate places. [2025-04-13 19:36:35,377 INFO L485 AbstractCegarLoop]: Abstraction has has 60 places, 46 transitions, 241 flow [2025-04-13 19:36:35,377 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 5 states have internal predecessors, (101), 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:35,377 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:36:35,377 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:35,378 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-13 19:36:35,378 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:35,378 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:36:35,378 INFO L85 PathProgramCache]: Analyzing trace with hash 1662480814, now seen corresponding path program 1 times [2025-04-13 19:36:35,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:36:35,378 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965753435] [2025-04-13 19:36:35,378 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:36:35,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:36:35,384 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-13 19:36:35,389 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 19:36:35,390 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:36:35,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:36:35,471 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:35,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:36:35,471 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965753435] [2025-04-13 19:36:35,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965753435] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:36:35,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:36:35,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 19:36:35,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438713791] [2025-04-13 19:36:35,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:36:35,472 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 19:36:35,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:36:35,472 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 19:36:35,472 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-04-13 19:36:35,482 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 35 [2025-04-13 19:36:35,482 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 46 transitions, 241 flow. Second operand has 6 states, 6 states have (on average 20.0) internal successors, (120), 6 states have internal predecessors, (120), 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:35,482 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:36:35,482 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 35 [2025-04-13 19:36:35,483 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:36:35,623 INFO L116 PetriNetUnfolderBase]: 488/914 cut-off events. [2025-04-13 19:36:35,623 INFO L117 PetriNetUnfolderBase]: For 1479/2034 co-relation queries the response was YES. [2025-04-13 19:36:35,625 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2870 conditions, 914 events. 488/914 cut-off events. For 1479/2034 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 4886 event pairs, 25 based on Foata normal form. 73/932 useless extension candidates. Maximal degree in co-relation 2857. Up to 376 conditions per place. [2025-04-13 19:36:35,627 INFO L140 encePairwiseOnDemand]: 29/35 looper letters, 32 selfloop transitions, 11 changer transitions 0/65 dead transitions. [2025-04-13 19:36:35,627 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 65 transitions, 376 flow [2025-04-13 19:36:35,628 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 19:36:35,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-13 19:36:35,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 153 transitions. [2025-04-13 19:36:35,628 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7285714285714285 [2025-04-13 19:36:35,628 INFO L175 Difference]: Start difference. First operand has 60 places, 46 transitions, 241 flow. Second operand 6 states and 153 transitions. [2025-04-13 19:36:35,628 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 65 transitions, 376 flow [2025-04-13 19:36:35,630 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 65 transitions, 356 flow, removed 5 selfloop flow, removed 3 redundant places. [2025-04-13 19:36:35,630 INFO L231 Difference]: Finished difference. Result has 64 places, 47 transitions, 266 flow [2025-04-13 19:36:35,630 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=222, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=266, PETRI_PLACES=64, PETRI_TRANSITIONS=47} [2025-04-13 19:36:35,631 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 23 predicate places. [2025-04-13 19:36:35,631 INFO L485 AbstractCegarLoop]: Abstraction has has 64 places, 47 transitions, 266 flow [2025-04-13 19:36:35,631 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.0) internal successors, (120), 6 states have internal predecessors, (120), 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:35,631 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:36:35,631 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:36:35,631 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-13 19:36:35,631 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:35,631 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:36:35,631 INFO L85 PathProgramCache]: Analyzing trace with hash -1282538124, now seen corresponding path program 1 times [2025-04-13 19:36:35,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:36:35,632 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352082608] [2025-04-13 19:36:35,632 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:36:35,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:36:35,635 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-13 19:36:35,638 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 19:36:35,638 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:36:35,638 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:36:35,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:36:35,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:36:35,719 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352082608] [2025-04-13 19:36:35,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352082608] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:36:35,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:36:35,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 19:36:35,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922090304] [2025-04-13 19:36:35,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:36:35,719 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 19:36:35,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:36:35,720 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 19:36:35,720 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 19:36:35,722 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 35 [2025-04-13 19:36:35,722 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 47 transitions, 266 flow. Second operand has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 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:35,722 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:36:35,722 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 35 [2025-04-13 19:36:35,722 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:36:35,806 INFO L116 PetriNetUnfolderBase]: 461/1045 cut-off events. [2025-04-13 19:36:35,806 INFO L117 PetriNetUnfolderBase]: For 1910/1990 co-relation queries the response was YES. [2025-04-13 19:36:35,809 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3155 conditions, 1045 events. 461/1045 cut-off events. For 1910/1990 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 7107 event pairs, 176 based on Foata normal form. 14/899 useless extension candidates. Maximal degree in co-relation 3141. Up to 315 conditions per place. [2025-04-13 19:36:35,811 INFO L140 encePairwiseOnDemand]: 31/35 looper letters, 16 selfloop transitions, 2 changer transitions 13/56 dead transitions. [2025-04-13 19:36:35,811 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 56 transitions, 354 flow [2025-04-13 19:36:35,812 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 19:36:35,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-13 19:36:35,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 102 transitions. [2025-04-13 19:36:35,812 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7285714285714285 [2025-04-13 19:36:35,812 INFO L175 Difference]: Start difference. First operand has 64 places, 47 transitions, 266 flow. Second operand 4 states and 102 transitions. [2025-04-13 19:36:35,812 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 56 transitions, 354 flow [2025-04-13 19:36:35,815 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 56 transitions, 326 flow, removed 8 selfloop flow, removed 4 redundant places. [2025-04-13 19:36:35,816 INFO L231 Difference]: Finished difference. Result has 65 places, 40 transitions, 202 flow [2025-04-13 19:36:35,816 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=238, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=202, PETRI_PLACES=65, PETRI_TRANSITIONS=40} [2025-04-13 19:36:35,816 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 24 predicate places. [2025-04-13 19:36:35,816 INFO L485 AbstractCegarLoop]: Abstraction has has 65 places, 40 transitions, 202 flow [2025-04-13 19:36:35,816 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 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:35,817 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:36:35,817 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:36:35,817 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-13 19:36:35,817 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 19:36:35,817 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:36:35,817 INFO L85 PathProgramCache]: Analyzing trace with hash 511620310, now seen corresponding path program 2 times [2025-04-13 19:36:35,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:36:35,817 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046832081] [2025-04-13 19:36:35,817 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 19:36:35,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:36:35,821 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 1 equivalence classes. [2025-04-13 19:36:35,824 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 19:36:35,824 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 19:36:35,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:36:35,917 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:35,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:36:35,917 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046832081] [2025-04-13 19:36:35,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046832081] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:36:35,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:36:35,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 19:36:35,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427367657] [2025-04-13 19:36:35,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:36:35,917 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 19:36:35,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:36:35,918 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 19:36:35,918 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 19:36:35,926 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 35 [2025-04-13 19:36:35,926 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 40 transitions, 202 flow. Second operand has 5 states, 5 states have (on average 19.0) internal successors, (95), 5 states have internal predecessors, (95), 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:35,926 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:36:35,926 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 35 [2025-04-13 19:36:35,927 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:36:36,027 INFO L116 PetriNetUnfolderBase]: 161/390 cut-off events. [2025-04-13 19:36:36,027 INFO L117 PetriNetUnfolderBase]: For 471/514 co-relation queries the response was YES. [2025-04-13 19:36:36,028 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1110 conditions, 390 events. 161/390 cut-off events. For 471/514 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 1960 event pairs, 40 based on Foata normal form. 12/363 useless extension candidates. Maximal degree in co-relation 1095. Up to 178 conditions per place. [2025-04-13 19:36:36,029 INFO L140 encePairwiseOnDemand]: 27/35 looper letters, 0 selfloop transitions, 0 changer transitions 48/48 dead transitions. [2025-04-13 19:36:36,029 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 48 transitions, 270 flow [2025-04-13 19:36:36,029 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 19:36:36,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-13 19:36:36,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 123 transitions. [2025-04-13 19:36:36,029 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5857142857142857 [2025-04-13 19:36:36,030 INFO L175 Difference]: Start difference. First operand has 65 places, 40 transitions, 202 flow. Second operand 6 states and 123 transitions. [2025-04-13 19:36:36,030 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 48 transitions, 270 flow [2025-04-13 19:36:36,031 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 48 transitions, 240 flow, removed 3 selfloop flow, removed 9 redundant places. [2025-04-13 19:36:36,031 INFO L231 Difference]: Finished difference. Result has 58 places, 0 transitions, 0 flow [2025-04-13 19:36:36,031 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=0, PETRI_PLACES=58, PETRI_TRANSITIONS=0} [2025-04-13 19:36:36,031 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 17 predicate places. [2025-04-13 19:36:36,031 INFO L485 AbstractCegarLoop]: Abstraction has has 58 places, 0 transitions, 0 flow [2025-04-13 19:36:36,032 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 5 states have internal predecessors, (95), 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:36,034 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2025-04-13 19:36:36,034 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2025-04-13 19:36:36,034 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2025-04-13 19:36:36,034 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2025-04-13 19:36:36,034 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-13 19:36:36,034 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1] [2025-04-13 19:36:36,036 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-13 19:36:36,036 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-13 19:36:36,040 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 07:36:36 BasicIcfg [2025-04-13 19:36:36,040 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-13 19:36:36,042 INFO L158 Benchmark]: Toolchain (without parser) took 4213.71ms. Allocated memory is still 155.2MB. Free memory was 108.7MB in the beginning and 103.9MB in the end (delta: 4.8MB). Peak memory consumption was 3.2MB. Max. memory is 8.0GB. [2025-04-13 19:36:36,042 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 155.2MB. Free memory is still 83.1MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 19:36:36,042 INFO L158 Benchmark]: CACSL2BoogieTranslator took 445.96ms. Allocated memory is still 155.2MB. Free memory was 108.7MB in the beginning and 85.5MB in the end (delta: 23.2MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2025-04-13 19:36:36,042 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.87ms. Allocated memory is still 155.2MB. Free memory was 85.4MB in the beginning and 83.3MB in the end (delta: 2.1MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 19:36:36,042 INFO L158 Benchmark]: Boogie Preprocessor took 29.13ms. Allocated memory is still 155.2MB. Free memory was 83.3MB in the beginning and 81.2MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 19:36:36,042 INFO L158 Benchmark]: RCFGBuilder took 436.51ms. Allocated memory is still 155.2MB. Free memory was 81.2MB in the beginning and 59.5MB in the end (delta: 21.7MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2025-04-13 19:36:36,042 INFO L158 Benchmark]: TraceAbstraction took 3261.65ms. Allocated memory is still 155.2MB. Free memory was 58.8MB in the beginning and 103.9MB in the end (delta: -45.0MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 19:36:36,043 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.20ms. Allocated memory is still 155.2MB. Free memory is still 83.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 445.96ms. Allocated memory is still 155.2MB. Free memory was 108.7MB in the beginning and 85.5MB in the end (delta: 23.2MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 33.87ms. Allocated memory is still 155.2MB. Free memory was 85.4MB in the beginning and 83.3MB in the end (delta: 2.1MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 29.13ms. Allocated memory is still 155.2MB. Free memory was 83.3MB in the beginning and 81.2MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 436.51ms. Allocated memory is still 155.2MB. Free memory was 81.2MB in the beginning and 59.5MB in the end (delta: 21.7MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * TraceAbstraction took 3261.65ms. Allocated memory is still 155.2MB. Free memory was 58.8MB in the beginning and 103.9MB in the end (delta: -45.0MB). There was no memory consumed. 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, 61 locations, 57 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: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 324 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 282 mSDsluCounter, 148 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 85 mSDsCounter, 26 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 634 IncrementalHoareTripleChecker+Invalid, 660 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 26 mSolverCounterUnsat, 63 mSDtfsCounter, 634 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 56 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=317occurred in iteration=4, InterpolantAutomatonStates: 60, 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, 192 NumberOfCodeBlocks, 192 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 182 ConstructedInterpolants, 0 QuantifiedInterpolants, 799 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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:36,056 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...