/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_IcfgBuilder.xml -s ../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.automaton.type.used.in.concurrency.analysis PETRI_NET --preprocessor.replace.while.statements.and.if-then-else.statements false -i ../../../trunk/examples/svcomp/weaver/parallel-bakery-2.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-14 00:51:05,592 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-14 00:51:05,643 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-14 00:51:05,647 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-14 00:51:05,647 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-14 00:51:05,664 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-14 00:51:05,664 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-14 00:51:05,664 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-14 00:51:05,664 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-14 00:51:05,664 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-14 00:51:05,665 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-14 00:51:05,665 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-14 00:51:05,665 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-14 00:51:05,665 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-14 00:51:05,665 INFO L153 SettingsManager]: * Use SBE=true [2025-04-14 00:51:05,666 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-14 00:51:05,666 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-14 00:51:05,666 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-14 00:51:05,667 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-14 00:51:05,667 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-14 00:51:05,667 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-14 00:51:05,667 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-14 00:51:05,667 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-14 00:51:05,667 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-14 00:51:05,667 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-14 00:51:05,667 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-14 00:51:05,667 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-14 00:51:05,667 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-14 00:51:05,667 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-14 00:51:05,667 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 00:51:05,668 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 00:51:05,668 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 00:51:05,668 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 00:51:05,668 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-14 00:51:05,668 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 00:51:05,668 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 00:51:05,668 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 00:51:05,668 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 00:51:05,668 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-14 00:51:05,668 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-14 00:51:05,668 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-14 00:51:05,668 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-14 00:51:05,668 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-14 00:51:05,668 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-14 00:51:05,669 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-14 00:51:05,669 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-14 00:51:05,669 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-14 00:51:05,669 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Replace while statements and if-then-else statements -> false [2025-04-14 00:51:05,873 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-14 00:51:05,880 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-14 00:51:05,881 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-14 00:51:05,882 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-14 00:51:05,884 INFO L274 PluginConnector]: CDTParser initialized [2025-04-14 00:51:05,884 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/parallel-bakery-2.wvr.c [2025-04-14 00:51:07,136 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18df66de0/d1979262f57d4551be6b929aa0660d34/FLAG5138c1b84 [2025-04-14 00:51:07,353 INFO L389 CDTParser]: Found 1 translation units. [2025-04-14 00:51:07,354 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-bakery-2.wvr.c [2025-04-14 00:51:07,370 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18df66de0/d1979262f57d4551be6b929aa0660d34/FLAG5138c1b84 [2025-04-14 00:51:08,187 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18df66de0/d1979262f57d4551be6b929aa0660d34 [2025-04-14 00:51:08,189 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-14 00:51:08,190 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-14 00:51:08,191 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-14 00:51:08,191 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-14 00:51:08,194 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-14 00:51:08,194 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 12:51:08" (1/1) ... [2025-04-14 00:51:08,195 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1eb3efa2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:51:08, skipping insertion in model container [2025-04-14 00:51:08,195 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 12:51:08" (1/1) ... [2025-04-14 00:51:08,204 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-14 00:51:08,354 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-bakery-2.wvr.c[2556,2569] [2025-04-14 00:51:08,357 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 00:51:08,366 INFO L200 MainTranslator]: Completed pre-run [2025-04-14 00:51:08,395 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-bakery-2.wvr.c[2556,2569] [2025-04-14 00:51:08,396 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 00:51:08,408 INFO L204 MainTranslator]: Completed translation [2025-04-14 00:51:08,409 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:51:08 WrapperNode [2025-04-14 00:51:08,409 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-14 00:51:08,409 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-14 00:51:08,410 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-14 00:51:08,410 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-14 00:51:08,415 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:51:08" (1/1) ... [2025-04-14 00:51:08,420 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:51:08" (1/1) ... [2025-04-14 00:51:08,441 INFO L138 Inliner]: procedures = 18, calls = 14, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 139 [2025-04-14 00:51:08,441 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-14 00:51:08,441 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-14 00:51:08,442 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-14 00:51:08,442 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-14 00:51:08,446 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:51:08" (1/1) ... [2025-04-14 00:51:08,446 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:51:08" (1/1) ... [2025-04-14 00:51:08,448 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:51:08" (1/1) ... [2025-04-14 00:51:08,465 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-14 00:51:08,465 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:51:08" (1/1) ... [2025-04-14 00:51:08,466 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:51:08" (1/1) ... [2025-04-14 00:51:08,468 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:51:08" (1/1) ... [2025-04-14 00:51:08,469 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:51:08" (1/1) ... [2025-04-14 00:51:08,469 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:51:08" (1/1) ... [2025-04-14 00:51:08,470 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:51:08" (1/1) ... [2025-04-14 00:51:08,472 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-14 00:51:08,473 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-04-14 00:51:08,473 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-04-14 00:51:08,473 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-04-14 00:51:08,473 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:51:08" (1/1) ... [2025-04-14 00:51:08,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 00:51:08,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:51:08,495 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-14 00:51:08,497 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-14 00:51:08,511 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-14 00:51:08,511 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-14 00:51:08,511 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-14 00:51:08,512 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-14 00:51:08,512 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-14 00:51:08,512 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-14 00:51:08,512 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-14 00:51:08,512 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-14 00:51:08,513 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-14 00:51:08,578 INFO L256 CfgBuilder]: Building ICFG [2025-04-14 00:51:08,580 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-14 00:51:08,737 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-14 00:51:08,737 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-14 00:51:08,737 INFO L318 CfgBuilder]: Performing block encoding [2025-04-14 00:51:08,852 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-14 00:51:08,852 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 12:51:08 BoogieIcfgContainer [2025-04-14 00:51:08,853 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-04-14 00:51:08,854 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-14 00:51:08,854 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-14 00:51:08,857 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-14 00:51:08,857 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.04 12:51:08" (1/3) ... [2025-04-14 00:51:08,858 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e4bd768 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 12:51:08, skipping insertion in model container [2025-04-14 00:51:08,858 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:51:08" (2/3) ... [2025-04-14 00:51:08,858 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e4bd768 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 12:51:08, skipping insertion in model container [2025-04-14 00:51:08,858 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 12:51:08" (3/3) ... [2025-04-14 00:51:08,859 INFO L128 eAbstractionObserver]: Analyzing ICFG parallel-bakery-2.wvr.c [2025-04-14 00:51:08,867 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-14 00:51:08,869 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG parallel-bakery-2.wvr.c that has 3 procedures, 50 locations, 49 edges, 1 initial locations, 0 loop locations, and 1 error locations. [2025-04-14 00:51:08,869 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-14 00:51:08,901 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-14 00:51:08,926 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 56 places, 51 transitions, 116 flow [2025-04-14 00:51:08,947 INFO L116 PetriNetUnfolderBase]: 2/49 cut-off events. [2025-04-14 00:51:08,949 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-14 00:51:08,950 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58 conditions, 49 events. 2/49 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 38 event pairs, 0 based on Foata normal form. 0/46 useless extension candidates. Maximal degree in co-relation 32. Up to 2 conditions per place. [2025-04-14 00:51:08,950 INFO L82 GeneralOperation]: Start removeDead. Operand has 56 places, 51 transitions, 116 flow [2025-04-14 00:51:08,952 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 53 places, 48 transitions, 108 flow [2025-04-14 00:51:08,956 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-14 00:51:08,963 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@71f78f31, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 00:51:08,963 INFO L341 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-04-14 00:51:08,973 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-14 00:51:08,973 INFO L116 PetriNetUnfolderBase]: 2/47 cut-off events. [2025-04-14 00:51:08,973 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-14 00:51:08,974 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:51:08,974 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:51:08,974 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:51:08,978 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:51:08,978 INFO L85 PathProgramCache]: Analyzing trace with hash 499056364, now seen corresponding path program 1 times [2025-04-14 00:51:08,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:51:08,983 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192336987] [2025-04-14 00:51:08,983 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:51:08,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:51:09,035 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-04-14 00:51:09,060 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-04-14 00:51:09,060 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:51:09,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:51:09,470 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-14 00:51:09,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:51:09,470 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192336987] [2025-04-14 00:51:09,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192336987] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:51:09,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:51:09,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-14 00:51:09,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471990850] [2025-04-14 00:51:09,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:51:09,479 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-14 00:51:09,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:51:09,497 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-14 00:51:09,498 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-04-14 00:51:09,499 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 51 [2025-04-14 00:51:09,501 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 48 transitions, 108 flow. Second operand has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:51:09,501 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:51:09,501 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 51 [2025-04-14 00:51:09,502 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:51:09,927 INFO L116 PetriNetUnfolderBase]: 535/979 cut-off events. [2025-04-14 00:51:09,927 INFO L117 PetriNetUnfolderBase]: For 51/51 co-relation queries the response was YES. [2025-04-14 00:51:09,929 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1992 conditions, 979 events. 535/979 cut-off events. For 51/51 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 3922 event pairs, 215 based on Foata normal form. 1/925 useless extension candidates. Maximal degree in co-relation 1832. Up to 394 conditions per place. [2025-04-14 00:51:09,933 INFO L140 encePairwiseOnDemand]: 42/51 looper letters, 78 selfloop transitions, 10 changer transitions 23/113 dead transitions. [2025-04-14 00:51:09,933 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 113 transitions, 487 flow [2025-04-14 00:51:09,934 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-14 00:51:09,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-14 00:51:09,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 144 transitions. [2025-04-14 00:51:09,942 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.35294117647058826 [2025-04-14 00:51:09,943 INFO L175 Difference]: Start difference. First operand has 53 places, 48 transitions, 108 flow. Second operand 8 states and 144 transitions. [2025-04-14 00:51:09,943 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 113 transitions, 487 flow [2025-04-14 00:51:09,947 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 113 transitions, 461 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-04-14 00:51:09,950 INFO L231 Difference]: Finished difference. Result has 59 places, 53 transitions, 144 flow [2025-04-14 00:51:09,952 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=144, PETRI_PLACES=59, PETRI_TRANSITIONS=53} [2025-04-14 00:51:09,954 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 6 predicate places. [2025-04-14 00:51:09,954 INFO L485 AbstractCegarLoop]: Abstraction has has 59 places, 53 transitions, 144 flow [2025-04-14 00:51:09,955 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:51:09,955 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:51:09,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, 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-14 00:51:09,955 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-14 00:51:09,955 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:51:09,955 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:51:09,956 INFO L85 PathProgramCache]: Analyzing trace with hash -453525912, now seen corresponding path program 2 times [2025-04-14 00:51:09,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:51:09,956 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645913742] [2025-04-14 00:51:09,956 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:51:09,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:51:09,971 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 44 statements into 1 equivalence classes. [2025-04-14 00:51:09,982 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-04-14 00:51:09,983 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 00:51:09,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:51:10,098 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-14 00:51:10,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:51:10,099 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645913742] [2025-04-14 00:51:10,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645913742] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:51:10,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:51:10,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 00:51:10,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472109984] [2025-04-14 00:51:10,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:51:10,100 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 00:51:10,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:51:10,100 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 00:51:10,100 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-14 00:51:10,100 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 51 [2025-04-14 00:51:10,100 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 53 transitions, 144 flow. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 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-14 00:51:10,101 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:51:10,101 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 51 [2025-04-14 00:51:10,101 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:51:10,289 INFO L116 PetriNetUnfolderBase]: 702/1304 cut-off events. [2025-04-14 00:51:10,289 INFO L117 PetriNetUnfolderBase]: For 111/111 co-relation queries the response was YES. [2025-04-14 00:51:10,294 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2859 conditions, 1304 events. 702/1304 cut-off events. For 111/111 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 6173 event pairs, 155 based on Foata normal form. 0/1275 useless extension candidates. Maximal degree in co-relation 2844. Up to 708 conditions per place. [2025-04-14 00:51:10,298 INFO L140 encePairwiseOnDemand]: 39/51 looper letters, 87 selfloop transitions, 13 changer transitions 9/111 dead transitions. [2025-04-14 00:51:10,299 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 111 transitions, 527 flow [2025-04-14 00:51:10,299 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 00:51:10,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-14 00:51:10,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 113 transitions. [2025-04-14 00:51:10,300 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.553921568627451 [2025-04-14 00:51:10,300 INFO L175 Difference]: Start difference. First operand has 59 places, 53 transitions, 144 flow. Second operand 4 states and 113 transitions. [2025-04-14 00:51:10,300 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 111 transitions, 527 flow [2025-04-14 00:51:10,301 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 111 transitions, 525 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-04-14 00:51:10,302 INFO L231 Difference]: Finished difference. Result has 62 places, 62 transitions, 232 flow [2025-04-14 00:51:10,303 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=232, PETRI_PLACES=62, PETRI_TRANSITIONS=62} [2025-04-14 00:51:10,303 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 9 predicate places. [2025-04-14 00:51:10,303 INFO L485 AbstractCegarLoop]: Abstraction has has 62 places, 62 transitions, 232 flow [2025-04-14 00:51:10,303 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 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-14 00:51:10,303 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:51:10,303 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:51:10,303 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-14 00:51:10,304 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:51:10,304 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:51:10,304 INFO L85 PathProgramCache]: Analyzing trace with hash -288974368, now seen corresponding path program 3 times [2025-04-14 00:51:10,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:51:10,304 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210658916] [2025-04-14 00:51:10,304 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 00:51:10,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:51:10,311 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 44 statements into 1 equivalence classes. [2025-04-14 00:51:10,316 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-04-14 00:51:10,316 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-14 00:51:10,316 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:51:10,398 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-14 00:51:10,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:51:10,398 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210658916] [2025-04-14 00:51:10,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210658916] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:51:10,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:51:10,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 00:51:10,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881708954] [2025-04-14 00:51:10,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:51:10,399 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 00:51:10,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:51:10,399 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 00:51:10,399 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 00:51:10,399 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 51 [2025-04-14 00:51:10,399 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 62 transitions, 232 flow. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 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-14 00:51:10,399 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:51:10,399 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 51 [2025-04-14 00:51:10,399 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:51:10,558 INFO L116 PetriNetUnfolderBase]: 646/1214 cut-off events. [2025-04-14 00:51:10,558 INFO L117 PetriNetUnfolderBase]: For 409/409 co-relation queries the response was YES. [2025-04-14 00:51:10,560 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3166 conditions, 1214 events. 646/1214 cut-off events. For 409/409 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 5586 event pairs, 376 based on Foata normal form. 14/1228 useless extension candidates. Maximal degree in co-relation 1247. Up to 910 conditions per place. [2025-04-14 00:51:10,563 INFO L140 encePairwiseOnDemand]: 48/51 looper letters, 69 selfloop transitions, 2 changer transitions 5/78 dead transitions. [2025-04-14 00:51:10,563 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 78 transitions, 445 flow [2025-04-14 00:51:10,563 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 00:51:10,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-14 00:51:10,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 72 transitions. [2025-04-14 00:51:10,564 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.47058823529411764 [2025-04-14 00:51:10,564 INFO L175 Difference]: Start difference. First operand has 62 places, 62 transitions, 232 flow. Second operand 3 states and 72 transitions. [2025-04-14 00:51:10,564 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 78 transitions, 445 flow [2025-04-14 00:51:10,565 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 78 transitions, 445 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-14 00:51:10,566 INFO L231 Difference]: Finished difference. Result has 65 places, 62 transitions, 240 flow [2025-04-14 00:51:10,566 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=232, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=240, PETRI_PLACES=65, PETRI_TRANSITIONS=62} [2025-04-14 00:51:10,567 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 12 predicate places. [2025-04-14 00:51:10,567 INFO L485 AbstractCegarLoop]: Abstraction has has 65 places, 62 transitions, 240 flow [2025-04-14 00:51:10,567 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 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-14 00:51:10,567 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:51:10,567 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:51:10,567 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-14 00:51:10,567 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:51:10,568 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:51:10,568 INFO L85 PathProgramCache]: Analyzing trace with hash 114192300, now seen corresponding path program 4 times [2025-04-14 00:51:10,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:51:10,568 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341857073] [2025-04-14 00:51:10,568 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 00:51:10,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:51:10,575 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 44 statements into 2 equivalence classes. [2025-04-14 00:51:10,590 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 44 of 44 statements. [2025-04-14 00:51:10,590 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 00:51:10,591 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:51:10,727 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-14 00:51:10,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:51:10,727 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341857073] [2025-04-14 00:51:10,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341857073] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:51:10,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:51:10,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-14 00:51:10,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416840184] [2025-04-14 00:51:10,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:51:10,728 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 00:51:10,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:51:10,728 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 00:51:10,728 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-14 00:51:10,728 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 51 [2025-04-14 00:51:10,729 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 62 transitions, 240 flow. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 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-14 00:51:10,729 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:51:10,729 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 51 [2025-04-14 00:51:10,729 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:51:10,917 INFO L116 PetriNetUnfolderBase]: 614/1206 cut-off events. [2025-04-14 00:51:10,917 INFO L117 PetriNetUnfolderBase]: For 475/475 co-relation queries the response was YES. [2025-04-14 00:51:10,922 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3180 conditions, 1206 events. 614/1206 cut-off events. For 475/475 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 5833 event pairs, 184 based on Foata normal form. 28/1234 useless extension candidates. Maximal degree in co-relation 1160. Up to 823 conditions per place. [2025-04-14 00:51:10,925 INFO L140 encePairwiseOnDemand]: 40/51 looper letters, 84 selfloop transitions, 10 changer transitions 2/98 dead transitions. [2025-04-14 00:51:10,925 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 98 transitions, 558 flow [2025-04-14 00:51:10,927 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 00:51:10,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 00:51:10,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 103 transitions. [2025-04-14 00:51:10,929 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.403921568627451 [2025-04-14 00:51:10,929 INFO L175 Difference]: Start difference. First operand has 65 places, 62 transitions, 240 flow. Second operand 5 states and 103 transitions. [2025-04-14 00:51:10,929 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 98 transitions, 558 flow [2025-04-14 00:51:10,931 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 98 transitions, 548 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-14 00:51:10,934 INFO L231 Difference]: Finished difference. Result has 70 places, 66 transitions, 295 flow [2025-04-14 00:51:10,934 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=224, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=295, PETRI_PLACES=70, PETRI_TRANSITIONS=66} [2025-04-14 00:51:10,935 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 17 predicate places. [2025-04-14 00:51:10,935 INFO L485 AbstractCegarLoop]: Abstraction has has 70 places, 66 transitions, 295 flow [2025-04-14 00:51:10,935 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 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-14 00:51:10,935 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:51:10,935 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:51:10,935 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-14 00:51:10,935 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:51:10,937 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:51:10,937 INFO L85 PathProgramCache]: Analyzing trace with hash 900105150, now seen corresponding path program 5 times [2025-04-14 00:51:10,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:51:10,937 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652343044] [2025-04-14 00:51:10,937 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 00:51:10,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:51:10,946 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 44 statements into 1 equivalence classes. [2025-04-14 00:51:10,958 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-04-14 00:51:10,958 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 00:51:10,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:51:11,071 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-14 00:51:11,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:51:11,072 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652343044] [2025-04-14 00:51:11,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652343044] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:51:11,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:51:11,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-14 00:51:11,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111468122] [2025-04-14 00:51:11,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:51:11,072 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 00:51:11,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:51:11,072 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 00:51:11,073 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-14 00:51:11,073 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 51 [2025-04-14 00:51:11,073 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 66 transitions, 295 flow. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 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-14 00:51:11,073 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:51:11,073 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 51 [2025-04-14 00:51:11,073 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:51:11,269 INFO L116 PetriNetUnfolderBase]: 552/1104 cut-off events. [2025-04-14 00:51:11,269 INFO L117 PetriNetUnfolderBase]: For 629/629 co-relation queries the response was YES. [2025-04-14 00:51:11,272 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3128 conditions, 1104 events. 552/1104 cut-off events. For 629/629 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 5191 event pairs, 173 based on Foata normal form. 10/1114 useless extension candidates. Maximal degree in co-relation 1509. Up to 838 conditions per place. [2025-04-14 00:51:11,274 INFO L140 encePairwiseOnDemand]: 43/51 looper letters, 66 selfloop transitions, 6 changer transitions 15/89 dead transitions. [2025-04-14 00:51:11,274 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 89 transitions, 538 flow [2025-04-14 00:51:11,275 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 00:51:11,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 00:51:11,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 96 transitions. [2025-04-14 00:51:11,277 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3764705882352941 [2025-04-14 00:51:11,277 INFO L175 Difference]: Start difference. First operand has 70 places, 66 transitions, 295 flow. Second operand 5 states and 96 transitions. [2025-04-14 00:51:11,277 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 89 transitions, 538 flow [2025-04-14 00:51:11,279 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 89 transitions, 532 flow, removed 3 selfloop flow, removed 0 redundant places. [2025-04-14 00:51:11,282 INFO L231 Difference]: Finished difference. Result has 76 places, 63 transitions, 289 flow [2025-04-14 00:51:11,282 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=283, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=289, PETRI_PLACES=76, PETRI_TRANSITIONS=63} [2025-04-14 00:51:11,283 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 23 predicate places. [2025-04-14 00:51:11,283 INFO L485 AbstractCegarLoop]: Abstraction has has 76 places, 63 transitions, 289 flow [2025-04-14 00:51:11,283 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 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-14 00:51:11,283 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:51:11,283 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:51:11,283 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-14 00:51:11,283 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:51:11,284 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:51:11,284 INFO L85 PathProgramCache]: Analyzing trace with hash -1084492202, now seen corresponding path program 6 times [2025-04-14 00:51:11,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:51:11,284 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457420282] [2025-04-14 00:51:11,284 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-14 00:51:11,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:51:11,294 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 44 statements into 1 equivalence classes. [2025-04-14 00:51:11,301 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-04-14 00:51:11,301 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-14 00:51:11,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:51:11,349 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-14 00:51:11,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:51:11,349 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457420282] [2025-04-14 00:51:11,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457420282] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:51:11,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:51:11,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 00:51:11,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588986010] [2025-04-14 00:51:11,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:51:11,349 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 00:51:11,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:51:11,350 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 00:51:11,350 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 00:51:11,350 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 51 [2025-04-14 00:51:11,350 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 63 transitions, 289 flow. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 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-14 00:51:11,350 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:51:11,350 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 51 [2025-04-14 00:51:11,350 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:51:11,475 INFO L116 PetriNetUnfolderBase]: 421/864 cut-off events. [2025-04-14 00:51:11,475 INFO L117 PetriNetUnfolderBase]: For 610/610 co-relation queries the response was YES. [2025-04-14 00:51:11,477 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2443 conditions, 864 events. 421/864 cut-off events. For 610/610 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 3837 event pairs, 265 based on Foata normal form. 10/874 useless extension candidates. Maximal degree in co-relation 1511. Up to 599 conditions per place. [2025-04-14 00:51:11,479 INFO L140 encePairwiseOnDemand]: 48/51 looper letters, 72 selfloop transitions, 2 changer transitions 2/78 dead transitions. [2025-04-14 00:51:11,479 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 78 transitions, 508 flow [2025-04-14 00:51:11,479 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 00:51:11,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-14 00:51:11,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 73 transitions. [2025-04-14 00:51:11,480 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.477124183006536 [2025-04-14 00:51:11,480 INFO L175 Difference]: Start difference. First operand has 76 places, 63 transitions, 289 flow. Second operand 3 states and 73 transitions. [2025-04-14 00:51:11,480 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 78 transitions, 508 flow [2025-04-14 00:51:11,482 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 78 transitions, 490 flow, removed 1 selfloop flow, removed 4 redundant places. [2025-04-14 00:51:11,483 INFO L231 Difference]: Finished difference. Result has 74 places, 60 transitions, 264 flow [2025-04-14 00:51:11,483 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=270, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=264, PETRI_PLACES=74, PETRI_TRANSITIONS=60} [2025-04-14 00:51:11,484 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 21 predicate places. [2025-04-14 00:51:11,484 INFO L485 AbstractCegarLoop]: Abstraction has has 74 places, 60 transitions, 264 flow [2025-04-14 00:51:11,484 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 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-14 00:51:11,484 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:51:11,484 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:51:11,484 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-14 00:51:11,484 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:51:11,485 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:51:11,485 INFO L85 PathProgramCache]: Analyzing trace with hash 1187542430, now seen corresponding path program 7 times [2025-04-14 00:51:11,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:51:11,485 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075126625] [2025-04-14 00:51:11,485 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-14 00:51:11,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:51:11,491 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-04-14 00:51:11,495 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-04-14 00:51:11,495 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:51:11,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:51:11,586 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-14 00:51:11,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:51:11,586 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075126625] [2025-04-14 00:51:11,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075126625] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:51:11,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:51:11,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-14 00:51:11,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887462815] [2025-04-14 00:51:11,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:51:11,587 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-14 00:51:11,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:51:11,587 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-14 00:51:11,588 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-04-14 00:51:11,588 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 51 [2025-04-14 00:51:11,588 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 60 transitions, 264 flow. Second operand has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:51:11,588 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:51:11,588 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 51 [2025-04-14 00:51:11,588 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:51:11,855 INFO L116 PetriNetUnfolderBase]: 403/815 cut-off events. [2025-04-14 00:51:11,855 INFO L117 PetriNetUnfolderBase]: For 588/588 co-relation queries the response was YES. [2025-04-14 00:51:11,857 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2370 conditions, 815 events. 403/815 cut-off events. For 588/588 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 3451 event pairs, 156 based on Foata normal form. 1/816 useless extension candidates. Maximal degree in co-relation 1534. Up to 305 conditions per place. [2025-04-14 00:51:11,859 INFO L140 encePairwiseOnDemand]: 42/51 looper letters, 59 selfloop transitions, 9 changer transitions 39/109 dead transitions. [2025-04-14 00:51:11,859 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 109 transitions, 667 flow [2025-04-14 00:51:11,859 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-14 00:51:11,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-14 00:51:11,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 133 transitions. [2025-04-14 00:51:11,860 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.32598039215686275 [2025-04-14 00:51:11,860 INFO L175 Difference]: Start difference. First operand has 74 places, 60 transitions, 264 flow. Second operand 8 states and 133 transitions. [2025-04-14 00:51:11,860 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 109 transitions, 667 flow [2025-04-14 00:51:11,863 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 109 transitions, 655 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-14 00:51:11,864 INFO L231 Difference]: Finished difference. Result has 79 places, 52 transitions, 234 flow [2025-04-14 00:51:11,864 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=260, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=234, PETRI_PLACES=79, PETRI_TRANSITIONS=52} [2025-04-14 00:51:11,864 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 26 predicate places. [2025-04-14 00:51:11,864 INFO L485 AbstractCegarLoop]: Abstraction has has 79 places, 52 transitions, 234 flow [2025-04-14 00:51:11,864 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:51:11,864 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:51:11,864 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:51:11,865 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-14 00:51:11,865 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:51:11,865 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:51:11,865 INFO L85 PathProgramCache]: Analyzing trace with hash 295016531, now seen corresponding path program 1 times [2025-04-14 00:51:11,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:51:11,865 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190031866] [2025-04-14 00:51:11,865 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:51:11,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:51:11,871 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-04-14 00:51:11,875 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-04-14 00:51:11,875 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:51:11,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:51:11,977 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-14 00:51:11,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:51:11,978 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190031866] [2025-04-14 00:51:11,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190031866] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:51:11,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:51:11,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-14 00:51:11,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33147176] [2025-04-14 00:51:11,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:51:11,978 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-14 00:51:11,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:51:11,979 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-14 00:51:11,979 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2025-04-14 00:51:11,979 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 51 [2025-04-14 00:51:11,979 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 52 transitions, 234 flow. Second operand has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 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-14 00:51:11,979 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:51:11,979 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 51 [2025-04-14 00:51:11,979 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:51:12,154 INFO L116 PetriNetUnfolderBase]: 238/526 cut-off events. [2025-04-14 00:51:12,154 INFO L117 PetriNetUnfolderBase]: For 387/387 co-relation queries the response was YES. [2025-04-14 00:51:12,155 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1515 conditions, 526 events. 238/526 cut-off events. For 387/387 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 2034 event pairs, 95 based on Foata normal form. 6/532 useless extension candidates. Maximal degree in co-relation 1492. Up to 235 conditions per place. [2025-04-14 00:51:12,157 INFO L140 encePairwiseOnDemand]: 41/51 looper letters, 47 selfloop transitions, 5 changer transitions 24/78 dead transitions. [2025-04-14 00:51:12,157 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 78 transitions, 479 flow [2025-04-14 00:51:12,157 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-14 00:51:12,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-14 00:51:12,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 103 transitions. [2025-04-14 00:51:12,158 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.28851540616246496 [2025-04-14 00:51:12,158 INFO L175 Difference]: Start difference. First operand has 79 places, 52 transitions, 234 flow. Second operand 7 states and 103 transitions. [2025-04-14 00:51:12,158 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 78 transitions, 479 flow [2025-04-14 00:51:12,160 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 78 transitions, 405 flow, removed 8 selfloop flow, removed 16 redundant places. [2025-04-14 00:51:12,163 INFO L231 Difference]: Finished difference. Result has 68 places, 47 transitions, 166 flow [2025-04-14 00:51:12,164 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=166, PETRI_PLACES=68, PETRI_TRANSITIONS=47} [2025-04-14 00:51:12,165 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 15 predicate places. [2025-04-14 00:51:12,165 INFO L485 AbstractCegarLoop]: Abstraction has has 68 places, 47 transitions, 166 flow [2025-04-14 00:51:12,165 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 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-14 00:51:12,165 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:51:12,165 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:51:12,165 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-14 00:51:12,165 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:51:12,166 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:51:12,166 INFO L85 PathProgramCache]: Analyzing trace with hash 1553906146, now seen corresponding path program 1 times [2025-04-14 00:51:12,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:51:12,166 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493198828] [2025-04-14 00:51:12,166 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:51:12,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:51:12,174 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-04-14 00:51:12,182 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-04-14 00:51:12,183 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:51:12,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:51:12,297 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-14 00:51:12,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:51:12,297 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493198828] [2025-04-14 00:51:12,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493198828] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:51:12,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:51:12,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-14 00:51:12,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321137897] [2025-04-14 00:51:12,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:51:12,297 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-14 00:51:12,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:51:12,298 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-14 00:51:12,298 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2025-04-14 00:51:12,298 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 51 [2025-04-14 00:51:12,298 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 47 transitions, 166 flow. Second operand has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 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-14 00:51:12,298 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:51:12,298 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 51 [2025-04-14 00:51:12,298 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:51:12,375 INFO L116 PetriNetUnfolderBase]: 87/202 cut-off events. [2025-04-14 00:51:12,375 INFO L117 PetriNetUnfolderBase]: For 65/65 co-relation queries the response was YES. [2025-04-14 00:51:12,375 INFO L83 FinitePrefix]: Finished finitePrefix Result has 529 conditions, 202 events. 87/202 cut-off events. For 65/65 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 566 event pairs, 29 based on Foata normal form. 6/208 useless extension candidates. Maximal degree in co-relation 345. Up to 65 conditions per place. [2025-04-14 00:51:12,376 INFO L140 encePairwiseOnDemand]: 43/51 looper letters, 0 selfloop transitions, 0 changer transitions 47/47 dead transitions. [2025-04-14 00:51:12,376 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 47 transitions, 246 flow [2025-04-14 00:51:12,376 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-14 00:51:12,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-14 00:51:12,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 74 transitions. [2025-04-14 00:51:12,376 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.20728291316526612 [2025-04-14 00:51:12,376 INFO L175 Difference]: Start difference. First operand has 68 places, 47 transitions, 166 flow. Second operand 7 states and 74 transitions. [2025-04-14 00:51:12,376 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 47 transitions, 246 flow [2025-04-14 00:51:12,377 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 47 transitions, 199 flow, removed 6 selfloop flow, removed 11 redundant places. [2025-04-14 00:51:12,378 INFO L231 Difference]: Finished difference. Result has 45 places, 0 transitions, 0 flow [2025-04-14 00:51:12,378 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=0, PETRI_PLACES=45, PETRI_TRANSITIONS=0} [2025-04-14 00:51:12,378 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, -8 predicate places. [2025-04-14 00:51:12,379 INFO L485 AbstractCegarLoop]: Abstraction has has 45 places, 0 transitions, 0 flow [2025-04-14 00:51:12,379 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 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-14 00:51:12,380 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2025-04-14 00:51:12,381 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2025-04-14 00:51:12,381 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2025-04-14 00:51:12,381 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-14 00:51:12,381 INFO L422 BasicCegarLoop]: Path program histogram: [7, 1, 1] [2025-04-14 00:51:12,383 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-14 00:51:12,383 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-14 00:51:12,389 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.04 12:51:12 BasicIcfg [2025-04-14 00:51:12,389 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-14 00:51:12,390 INFO L158 Benchmark]: Toolchain (without parser) took 4199.99ms. Allocated memory was 155.2MB in the beginning and 356.5MB in the end (delta: 201.3MB). Free memory was 107.8MB in the beginning and 294.5MB in the end (delta: -186.7MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2025-04-14 00:51:12,390 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 167.8MB. Free memory is still 94.9MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 00:51:12,390 INFO L158 Benchmark]: CACSL2BoogieTranslator took 218.09ms. Allocated memory is still 155.2MB. Free memory was 107.8MB in the beginning and 93.1MB in the end (delta: 14.7MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-14 00:51:12,390 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.67ms. Allocated memory is still 155.2MB. Free memory was 93.1MB in the beginning and 91.3MB in the end (delta: 1.8MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-14 00:51:12,390 INFO L158 Benchmark]: Boogie Preprocessor took 30.60ms. Allocated memory is still 155.2MB. Free memory was 91.3MB in the beginning and 89.7MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 00:51:12,390 INFO L158 Benchmark]: IcfgBuilder took 380.05ms. Allocated memory is still 155.2MB. Free memory was 89.7MB in the beginning and 58.7MB in the end (delta: 31.0MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. [2025-04-14 00:51:12,391 INFO L158 Benchmark]: TraceAbstraction took 3535.50ms. Allocated memory was 155.2MB in the beginning and 356.5MB in the end (delta: 201.3MB). Free memory was 57.7MB in the beginning and 294.5MB in the end (delta: -236.8MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 00:51:12,391 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.21ms. Allocated memory is still 167.8MB. Free memory is still 94.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 218.09ms. Allocated memory is still 155.2MB. Free memory was 107.8MB in the beginning and 93.1MB in the end (delta: 14.7MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 31.67ms. Allocated memory is still 155.2MB. Free memory was 93.1MB in the beginning and 91.3MB in the end (delta: 1.8MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 30.60ms. Allocated memory is still 155.2MB. Free memory was 91.3MB in the beginning and 89.7MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 8.0GB. * IcfgBuilder took 380.05ms. Allocated memory is still 155.2MB. Free memory was 89.7MB in the beginning and 58.7MB in the end (delta: 31.0MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. * TraceAbstraction took 3535.50ms. Allocated memory was 155.2MB in the beginning and 356.5MB in the end (delta: 201.3MB). Free memory was 57.7MB in the beginning and 294.5MB in the end (delta: -236.8MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 98]: 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 5 procedures, 78 locations, 81 edges, 3 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.5s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.0s, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 354 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 354 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 20 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1782 IncrementalHoareTripleChecker+Invalid, 1802 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 20 mSolverCounterUnsat, 0 mSDtfsCounter, 1782 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 60 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=295occurred in iteration=4, InterpolantAutomatonStates: 50, 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.2s InterpolantComputationTime, 398 NumberOfCodeBlocks, 398 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 389 ConstructedInterpolants, 0 QuantifiedInterpolants, 949 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-04-14 00:51:12,405 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...