/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.automaton.type.used.in.concurrency.analysis PETRI_NET -i ../../../trunk/examples/svcomp/weaver/parallel-misc-3.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 20:16:27,799 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 20:16:27,833 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2025-04-13 20:16:27,839 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 20:16:27,840 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 20:16:27,860 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 20:16:27,861 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 20:16:27,861 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 20:16:27,861 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 20:16:27,861 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 20:16:27,861 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 20:16:27,861 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 20:16:27,861 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 20:16:27,861 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 20:16:27,864 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 20:16:27,864 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 20:16:27,864 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 20:16:27,864 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 20:16:27,864 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 20:16:27,864 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 20:16:27,864 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 20:16:27,864 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 20:16:27,864 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 20:16:27,864 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 20:16:27,864 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 20:16:27,865 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 20:16:27,865 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 20:16:27,865 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 20:16:27,865 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 20:16:27,865 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 20:16:27,865 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 20:16:27,865 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 20:16:27,865 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 20:16:27,865 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 20:16:27,865 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 20:16:27,865 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 20:16:27,865 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 20:16:27,865 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 20:16:27,865 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 20:16:27,865 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 20:16:27,865 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 20:16:27,865 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 20:16:27,865 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 20:16:27,865 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 20:16:27,866 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 20:16:27,866 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 20:16:27,866 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 20:16:27,866 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Automaton type used in concurrency analysis -> PETRI_NET [2025-04-13 20:16:28,069 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 20:16:28,078 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 20:16:28,080 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 20:16:28,080 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 20:16:28,081 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 20:16:28,083 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/parallel-misc-3.wvr.c [2025-04-13 20:16:29,333 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a487418c/deb733002b5c4b009bf2b90b858d89a1/FLAG710610feb [2025-04-13 20:16:29,511 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 20:16:29,512 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-misc-3.wvr.c [2025-04-13 20:16:29,518 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a487418c/deb733002b5c4b009bf2b90b858d89a1/FLAG710610feb [2025-04-13 20:16:30,334 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a487418c/deb733002b5c4b009bf2b90b858d89a1 [2025-04-13 20:16:30,336 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 20:16:30,337 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 20:16:30,338 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 20:16:30,338 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 20:16:30,341 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 20:16:30,341 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 08:16:30" (1/1) ... [2025-04-13 20:16:30,342 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@700220ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:16:30, skipping insertion in model container [2025-04-13 20:16:30,342 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 08:16:30" (1/1) ... [2025-04-13 20:16:30,354 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 20:16:30,485 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-misc-3.wvr.c[2092,2105] [2025-04-13 20:16:30,489 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 20:16:30,495 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 20:16:30,512 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-misc-3.wvr.c[2092,2105] [2025-04-13 20:16:30,513 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 20:16:30,525 INFO L204 MainTranslator]: Completed translation [2025-04-13 20:16:30,525 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:16:30 WrapperNode [2025-04-13 20:16:30,525 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 20:16:30,526 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 20:16:30,526 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 20:16:30,526 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 20:16:30,530 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:16:30" (1/1) ... [2025-04-13 20:16:30,535 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:16:30" (1/1) ... [2025-04-13 20:16:30,547 INFO L138 Inliner]: procedures = 18, calls = 9, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 40 [2025-04-13 20:16:30,548 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 20:16:30,548 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 20:16:30,548 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 20:16:30,548 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 20:16:30,553 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:16:30" (1/1) ... [2025-04-13 20:16:30,554 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:16:30" (1/1) ... [2025-04-13 20:16:30,559 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:16:30" (1/1) ... [2025-04-13 20:16:30,569 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-04-13 20:16:30,570 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:16:30" (1/1) ... [2025-04-13 20:16:30,570 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:16:30" (1/1) ... [2025-04-13 20:16:30,574 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:16:30" (1/1) ... [2025-04-13 20:16:30,575 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:16:30" (1/1) ... [2025-04-13 20:16:30,577 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:16:30" (1/1) ... [2025-04-13 20:16:30,577 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:16:30" (1/1) ... [2025-04-13 20:16:30,578 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:16:30" (1/1) ... [2025-04-13 20:16:30,580 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 20:16:30,580 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-13 20:16:30,581 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-13 20:16:30,581 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-13 20:16:30,581 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:16:30" (1/1) ... [2025-04-13 20:16:30,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 20:16:30,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:16:30,604 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-13 20:16:30,606 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-13 20:16:30,623 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 20:16:30,624 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-13 20:16:30,624 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-13 20:16:30,624 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-13 20:16:30,624 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-13 20:16:30,624 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 20:16:30,624 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 20:16:30,624 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 20:16:30,625 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-13 20:16:30,686 INFO L234 CfgBuilder]: Building ICFG [2025-04-13 20:16:30,687 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 20:16:30,835 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 20:16:30,836 INFO L289 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 20:16:30,836 INFO L294 CfgBuilder]: Performing block encoding [2025-04-13 20:16:30,953 WARN L179 LargeBlockEncoding]: Complex 2:3 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 20:16:30,965 WARN L179 LargeBlockEncoding]: Complex 3:3 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 20:16:30,981 INFO L313 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 20:16:30,981 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 08:16:30 BoogieIcfgContainer [2025-04-13 20:16:30,982 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-13 20:16:30,985 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 20:16:30,985 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 20:16:30,988 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 20:16:30,989 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 08:16:30" (1/3) ... [2025-04-13 20:16:30,989 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@405e63d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 08:16:30, skipping insertion in model container [2025-04-13 20:16:30,989 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:16:30" (2/3) ... [2025-04-13 20:16:30,989 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@405e63d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 08:16:30, skipping insertion in model container [2025-04-13 20:16:30,989 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 08:16:30" (3/3) ... [2025-04-13 20:16:30,991 INFO L128 eAbstractionObserver]: Analyzing ICFG parallel-misc-3.wvr.c [2025-04-13 20:16:31,000 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 20:16:31,001 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG parallel-misc-3.wvr.c that has 3 procedures, 21 locations, 28 edges, 1 initial locations, 2 loop locations, and 1 error locations. [2025-04-13 20:16:31,002 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 20:16:31,059 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-13 20:16:31,087 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 27 places, 30 transitions, 74 flow [2025-04-13 20:16:31,113 INFO L116 PetriNetUnfolderBase]: 10/28 cut-off events. [2025-04-13 20:16:31,117 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-13 20:16:31,121 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37 conditions, 28 events. 10/28 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 36 event pairs, 0 based on Foata normal form. 0/17 useless extension candidates. Maximal degree in co-relation 24. Up to 3 conditions per place. [2025-04-13 20:16:31,121 INFO L82 GeneralOperation]: Start removeDead. Operand has 27 places, 30 transitions, 74 flow [2025-04-13 20:16:31,123 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 24 places, 27 transitions, 66 flow [2025-04-13 20:16:31,128 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 20:16:31,136 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;@41f337d1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 20:16:31,136 INFO L341 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-04-13 20:16:31,147 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 20:16:31,148 INFO L116 PetriNetUnfolderBase]: 10/26 cut-off events. [2025-04-13 20:16:31,148 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-13 20:16:31,148 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:16:31,148 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:16:31,148 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-13 20:16:31,152 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:16:31,153 INFO L85 PathProgramCache]: Analyzing trace with hash -1428847026, now seen corresponding path program 1 times [2025-04-13 20:16:31,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:16:31,158 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577796024] [2025-04-13 20:16:31,158 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:16:31,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:16:31,204 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-13 20:16:31,223 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-13 20:16:31,224 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:16:31,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:16:31,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:16:31,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:16:31,298 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577796024] [2025-04-13 20:16:31,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577796024] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:16:31,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:16:31,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-13 20:16:31,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105595124] [2025-04-13 20:16:31,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:16:31,305 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 20:16:31,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:16:31,321 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 20:16:31,321 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 20:16:31,333 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 30 [2025-04-13 20:16:31,335 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 27 transitions, 66 flow. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:16:31,338 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:16:31,338 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 30 [2025-04-13 20:16:31,339 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:16:31,492 INFO L116 PetriNetUnfolderBase]: 269/390 cut-off events. [2025-04-13 20:16:31,492 INFO L117 PetriNetUnfolderBase]: For 27/27 co-relation queries the response was YES. [2025-04-13 20:16:31,493 INFO L83 FinitePrefix]: Finished finitePrefix Result has 815 conditions, 390 events. 269/390 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 1196 event pairs, 42 based on Foata normal form. 1/241 useless extension candidates. Maximal degree in co-relation 744. Up to 303 conditions per place. [2025-04-13 20:16:31,497 INFO L140 encePairwiseOnDemand]: 24/30 looper letters, 36 selfloop transitions, 5 changer transitions 1/42 dead transitions. [2025-04-13 20:16:31,497 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 42 transitions, 189 flow [2025-04-13 20:16:31,498 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 20:16:31,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 20:16:31,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 49 transitions. [2025-04-13 20:16:31,505 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5444444444444444 [2025-04-13 20:16:31,506 INFO L175 Difference]: Start difference. First operand has 24 places, 27 transitions, 66 flow. Second operand 3 states and 49 transitions. [2025-04-13 20:16:31,506 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 42 transitions, 189 flow [2025-04-13 20:16:31,509 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 22 places, 42 transitions, 175 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-04-13 20:16:31,510 INFO L231 Difference]: Finished difference. Result has 23 places, 31 transitions, 91 flow [2025-04-13 20:16:31,512 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=20, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=91, PETRI_PLACES=23, PETRI_TRANSITIONS=31} [2025-04-13 20:16:31,513 INFO L279 CegarLoopForPetriNet]: 24 programPoint places, -1 predicate places. [2025-04-13 20:16:31,514 INFO L485 AbstractCegarLoop]: Abstraction has has 23 places, 31 transitions, 91 flow [2025-04-13 20:16:31,514 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:16:31,514 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:16:31,514 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:16:31,514 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 20:16:31,514 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-13 20:16:31,514 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:16:31,515 INFO L85 PathProgramCache]: Analyzing trace with hash 2132765179, now seen corresponding path program 1 times [2025-04-13 20:16:31,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:16:31,515 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468667065] [2025-04-13 20:16:31,515 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:16:31,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:16:31,520 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-13 20:16:31,535 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-13 20:16:31,535 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:16:31,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:16:31,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:16:31,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:16:31,618 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468667065] [2025-04-13 20:16:31,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468667065] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:16:31,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:16:31,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 20:16:31,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112840340] [2025-04-13 20:16:31,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:16:31,619 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 20:16:31,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:16:31,620 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 20:16:31,620 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 20:16:31,620 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 30 [2025-04-13 20:16:31,620 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 31 transitions, 91 flow. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:16:31,620 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:16:31,620 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 30 [2025-04-13 20:16:31,620 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:16:31,724 INFO L116 PetriNetUnfolderBase]: 236/340 cut-off events. [2025-04-13 20:16:31,725 INFO L117 PetriNetUnfolderBase]: For 22/30 co-relation queries the response was YES. [2025-04-13 20:16:31,726 INFO L83 FinitePrefix]: Finished finitePrefix Result has 771 conditions, 340 events. 236/340 cut-off events. For 22/30 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 966 event pairs, 78 based on Foata normal form. 2/191 useless extension candidates. Maximal degree in co-relation 265. Up to 269 conditions per place. [2025-04-13 20:16:31,727 INFO L140 encePairwiseOnDemand]: 26/30 looper letters, 32 selfloop transitions, 3 changer transitions 0/39 dead transitions. [2025-04-13 20:16:31,727 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 39 transitions, 178 flow [2025-04-13 20:16:31,728 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 20:16:31,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 20:16:31,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 46 transitions. [2025-04-13 20:16:31,729 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5111111111111111 [2025-04-13 20:16:31,729 INFO L175 Difference]: Start difference. First operand has 23 places, 31 transitions, 91 flow. Second operand 3 states and 46 transitions. [2025-04-13 20:16:31,729 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 39 transitions, 178 flow [2025-04-13 20:16:31,730 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 39 transitions, 171 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-04-13 20:16:31,730 INFO L231 Difference]: Finished difference. Result has 24 places, 30 transitions, 88 flow [2025-04-13 20:16:31,731 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=88, PETRI_PLACES=24, PETRI_TRANSITIONS=30} [2025-04-13 20:16:31,731 INFO L279 CegarLoopForPetriNet]: 24 programPoint places, 0 predicate places. [2025-04-13 20:16:31,731 INFO L485 AbstractCegarLoop]: Abstraction has has 24 places, 30 transitions, 88 flow [2025-04-13 20:16:31,731 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:16:31,731 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:16:31,731 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:16:31,731 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 20:16:31,731 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-13 20:16:31,732 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:16:31,732 INFO L85 PathProgramCache]: Analyzing trace with hash 1747537435, now seen corresponding path program 1 times [2025-04-13 20:16:31,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:16:31,732 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198916366] [2025-04-13 20:16:31,732 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:16:31,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:16:31,741 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-13 20:16:31,751 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-13 20:16:31,751 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:16:31,751 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:16:31,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:16:31,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:16:31,810 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198916366] [2025-04-13 20:16:31,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198916366] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:16:31,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:16:31,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 20:16:31,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064095762] [2025-04-13 20:16:31,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:16:31,810 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 20:16:31,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:16:31,811 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 20:16:31,811 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 20:16:31,811 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 30 [2025-04-13 20:16:31,811 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 30 transitions, 88 flow. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:16:31,811 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:16:31,811 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 30 [2025-04-13 20:16:31,811 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:16:31,894 INFO L116 PetriNetUnfolderBase]: 214/312 cut-off events. [2025-04-13 20:16:31,894 INFO L117 PetriNetUnfolderBase]: For 37/45 co-relation queries the response was YES. [2025-04-13 20:16:31,895 INFO L83 FinitePrefix]: Finished finitePrefix Result has 707 conditions, 312 events. 214/312 cut-off events. For 37/45 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 869 event pairs, 69 based on Foata normal form. 0/201 useless extension candidates. Maximal degree in co-relation 564. Up to 248 conditions per place. [2025-04-13 20:16:31,896 INFO L140 encePairwiseOnDemand]: 27/30 looper letters, 35 selfloop transitions, 2 changer transitions 0/41 dead transitions. [2025-04-13 20:16:31,896 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 41 transitions, 193 flow [2025-04-13 20:16:31,898 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 20:16:31,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 20:16:31,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 48 transitions. [2025-04-13 20:16:31,899 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5333333333333333 [2025-04-13 20:16:31,899 INFO L175 Difference]: Start difference. First operand has 24 places, 30 transitions, 88 flow. Second operand 3 states and 48 transitions. [2025-04-13 20:16:31,899 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 41 transitions, 193 flow [2025-04-13 20:16:31,900 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 41 transitions, 183 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-13 20:16:31,900 INFO L231 Difference]: Finished difference. Result has 24 places, 29 transitions, 84 flow [2025-04-13 20:16:31,900 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=84, PETRI_PLACES=24, PETRI_TRANSITIONS=29} [2025-04-13 20:16:31,901 INFO L279 CegarLoopForPetriNet]: 24 programPoint places, 0 predicate places. [2025-04-13 20:16:31,901 INFO L485 AbstractCegarLoop]: Abstraction has has 24 places, 29 transitions, 84 flow [2025-04-13 20:16:31,901 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:16:31,901 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:16:31,901 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:16:31,901 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 20:16:31,901 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-13 20:16:31,902 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:16:31,902 INFO L85 PathProgramCache]: Analyzing trace with hash 1793815772, now seen corresponding path program 1 times [2025-04-13 20:16:31,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:16:31,902 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758995936] [2025-04-13 20:16:31,902 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:16:31,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:16:31,911 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-13 20:16:31,926 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 20:16:31,927 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:16:31,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:16:32,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:16:32,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:16:32,079 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758995936] [2025-04-13 20:16:32,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [758995936] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:16:32,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:16:32,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 20:16:32,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064007428] [2025-04-13 20:16:32,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:16:32,080 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 20:16:32,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:16:32,080 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 20:16:32,080 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-13 20:16:32,080 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 30 [2025-04-13 20:16:32,080 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 29 transitions, 84 flow. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:16:32,080 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:16:32,081 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 30 [2025-04-13 20:16:32,081 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:16:32,153 INFO L116 PetriNetUnfolderBase]: 142/228 cut-off events. [2025-04-13 20:16:32,153 INFO L117 PetriNetUnfolderBase]: For 30/32 co-relation queries the response was YES. [2025-04-13 20:16:32,154 INFO L83 FinitePrefix]: Finished finitePrefix Result has 518 conditions, 228 events. 142/228 cut-off events. For 30/32 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 673 event pairs, 38 based on Foata normal form. 1/171 useless extension candidates. Maximal degree in co-relation 415. Up to 108 conditions per place. [2025-04-13 20:16:32,155 INFO L140 encePairwiseOnDemand]: 23/30 looper letters, 33 selfloop transitions, 4 changer transitions 0/41 dead transitions. [2025-04-13 20:16:32,155 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 41 transitions, 186 flow [2025-04-13 20:16:32,156 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 20:16:32,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-13 20:16:32,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 55 transitions. [2025-04-13 20:16:32,156 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4583333333333333 [2025-04-13 20:16:32,156 INFO L175 Difference]: Start difference. First operand has 24 places, 29 transitions, 84 flow. Second operand 4 states and 55 transitions. [2025-04-13 20:16:32,156 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 41 transitions, 186 flow [2025-04-13 20:16:32,157 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 41 transitions, 178 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-13 20:16:32,157 INFO L231 Difference]: Finished difference. Result has 25 places, 25 transitions, 78 flow [2025-04-13 20:16:32,158 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=78, PETRI_PLACES=25, PETRI_TRANSITIONS=25} [2025-04-13 20:16:32,158 INFO L279 CegarLoopForPetriNet]: 24 programPoint places, 1 predicate places. [2025-04-13 20:16:32,158 INFO L485 AbstractCegarLoop]: Abstraction has has 25 places, 25 transitions, 78 flow [2025-04-13 20:16:32,158 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:16:32,158 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:16:32,158 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:16:32,158 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 20:16:32,158 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-13 20:16:32,159 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:16:32,159 INFO L85 PathProgramCache]: Analyzing trace with hash 922329138, now seen corresponding path program 1 times [2025-04-13 20:16:32,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:16:32,159 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325263910] [2025-04-13 20:16:32,159 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:16:32,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:16:32,165 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-13 20:16:32,172 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 20:16:32,172 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:16:32,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:16:32,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:16:32,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:16:32,293 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325263910] [2025-04-13 20:16:32,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325263910] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:16:32,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:16:32,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 20:16:32,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887031658] [2025-04-13 20:16:32,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:16:32,294 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 20:16:32,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:16:32,294 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 20:16:32,294 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-13 20:16:32,294 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 30 [2025-04-13 20:16:32,294 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 25 transitions, 78 flow. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:16:32,294 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:16:32,295 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 30 [2025-04-13 20:16:32,295 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:16:32,376 INFO L116 PetriNetUnfolderBase]: 134/229 cut-off events. [2025-04-13 20:16:32,376 INFO L117 PetriNetUnfolderBase]: For 34/40 co-relation queries the response was YES. [2025-04-13 20:16:32,377 INFO L83 FinitePrefix]: Finished finitePrefix Result has 540 conditions, 229 events. 134/229 cut-off events. For 34/40 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 645 event pairs, 41 based on Foata normal form. 0/183 useless extension candidates. Maximal degree in co-relation 192. Up to 119 conditions per place. [2025-04-13 20:16:32,378 INFO L140 encePairwiseOnDemand]: 25/30 looper letters, 35 selfloop transitions, 4 changer transitions 0/42 dead transitions. [2025-04-13 20:16:32,378 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 42 transitions, 210 flow [2025-04-13 20:16:32,378 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 20:16:32,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-13 20:16:32,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 57 transitions. [2025-04-13 20:16:32,379 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.475 [2025-04-13 20:16:32,379 INFO L175 Difference]: Start difference. First operand has 25 places, 25 transitions, 78 flow. Second operand 4 states and 57 transitions. [2025-04-13 20:16:32,379 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 42 transitions, 210 flow [2025-04-13 20:16:32,380 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 42 transitions, 190 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-04-13 20:16:32,381 INFO L231 Difference]: Finished difference. Result has 26 places, 24 transitions, 79 flow [2025-04-13 20:16:32,381 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=79, PETRI_PLACES=26, PETRI_TRANSITIONS=24} [2025-04-13 20:16:32,381 INFO L279 CegarLoopForPetriNet]: 24 programPoint places, 2 predicate places. [2025-04-13 20:16:32,382 INFO L485 AbstractCegarLoop]: Abstraction has has 26 places, 24 transitions, 79 flow [2025-04-13 20:16:32,382 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:16:32,382 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:16:32,382 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:16:32,382 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-13 20:16:32,382 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-13 20:16:32,382 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:16:32,382 INFO L85 PathProgramCache]: Analyzing trace with hash 1209207225, now seen corresponding path program 1 times [2025-04-13 20:16:32,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:16:32,382 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244843889] [2025-04-13 20:16:32,383 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:16:32,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:16:32,391 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-13 20:16:32,405 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 20:16:32,405 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:16:32,405 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:16:32,496 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:16:32,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:16:32,496 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244843889] [2025-04-13 20:16:32,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244843889] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:16:32,496 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [761808217] [2025-04-13 20:16:32,496 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:16:32,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:16:32,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:16:32,500 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:16:32,501 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-04-13 20:16:32,535 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-13 20:16:32,549 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 20:16:32,549 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:16:32,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:16:32,550 INFO L256 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-04-13 20:16:32,553 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:16:32,590 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:16:32,590 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:16:32,618 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:16:32,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [761808217] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:16:32,618 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:16:32,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 3 [2025-04-13 20:16:32,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871324720] [2025-04-13 20:16:32,619 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:16:32,619 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 20:16:32,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:16:32,619 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 20:16:32,619 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 20:16:32,621 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 30 [2025-04-13 20:16:32,621 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 24 transitions, 79 flow. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:16:32,621 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:16:32,621 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 30 [2025-04-13 20:16:32,622 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:16:32,768 INFO L116 PetriNetUnfolderBase]: 412/660 cut-off events. [2025-04-13 20:16:32,769 INFO L117 PetriNetUnfolderBase]: For 144/144 co-relation queries the response was YES. [2025-04-13 20:16:32,770 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1695 conditions, 660 events. 412/660 cut-off events. For 144/144 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 2378 event pairs, 96 based on Foata normal form. 1/589 useless extension candidates. Maximal degree in co-relation 632. Up to 283 conditions per place. [2025-04-13 20:16:32,772 INFO L140 encePairwiseOnDemand]: 24/30 looper letters, 56 selfloop transitions, 14 changer transitions 1/71 dead transitions. [2025-04-13 20:16:32,772 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 71 transitions, 366 flow [2025-04-13 20:16:32,773 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 20:16:32,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 20:16:32,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 77 transitions. [2025-04-13 20:16:32,774 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5133333333333333 [2025-04-13 20:16:32,774 INFO L175 Difference]: Start difference. First operand has 26 places, 24 transitions, 79 flow. Second operand 5 states and 77 transitions. [2025-04-13 20:16:32,774 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 71 transitions, 366 flow [2025-04-13 20:16:32,775 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 71 transitions, 362 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-13 20:16:32,776 INFO L231 Difference]: Finished difference. Result has 30 places, 35 transitions, 168 flow [2025-04-13 20:16:32,776 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=77, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=168, PETRI_PLACES=30, PETRI_TRANSITIONS=35} [2025-04-13 20:16:32,777 INFO L279 CegarLoopForPetriNet]: 24 programPoint places, 6 predicate places. [2025-04-13 20:16:32,777 INFO L485 AbstractCegarLoop]: Abstraction has has 30 places, 35 transitions, 168 flow [2025-04-13 20:16:32,777 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:16:32,777 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:16:32,777 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:16:32,783 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-04-13 20:16:32,977 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-04-13 20:16:32,978 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-13 20:16:32,978 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:16:32,978 INFO L85 PathProgramCache]: Analyzing trace with hash 1775075245, now seen corresponding path program 2 times [2025-04-13 20:16:32,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:16:32,978 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897277211] [2025-04-13 20:16:32,978 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:16:32,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:16:32,984 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 1 equivalence classes. [2025-04-13 20:16:32,989 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 20:16:32,989 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 20:16:32,989 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:16:33,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:16:33,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:16:33,063 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897277211] [2025-04-13 20:16:33,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897277211] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:16:33,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:16:33,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 20:16:33,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543519178] [2025-04-13 20:16:33,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:16:33,064 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 20:16:33,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:16:33,064 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 20:16:33,064 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-13 20:16:33,067 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 30 [2025-04-13 20:16:33,067 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 35 transitions, 168 flow. Second operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:16:33,067 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:16:33,067 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 30 [2025-04-13 20:16:33,067 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:16:33,243 INFO L116 PetriNetUnfolderBase]: 616/982 cut-off events. [2025-04-13 20:16:33,244 INFO L117 PetriNetUnfolderBase]: For 643/643 co-relation queries the response was YES. [2025-04-13 20:16:33,245 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2844 conditions, 982 events. 616/982 cut-off events. For 643/643 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 3985 event pairs, 155 based on Foata normal form. 1/875 useless extension candidates. Maximal degree in co-relation 1025. Up to 340 conditions per place. [2025-04-13 20:16:33,248 INFO L140 encePairwiseOnDemand]: 24/30 looper letters, 59 selfloop transitions, 27 changer transitions 1/87 dead transitions. [2025-04-13 20:16:33,248 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 87 transitions, 528 flow [2025-04-13 20:16:33,248 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 20:16:33,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-13 20:16:33,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 84 transitions. [2025-04-13 20:16:33,249 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4666666666666667 [2025-04-13 20:16:33,249 INFO L175 Difference]: Start difference. First operand has 30 places, 35 transitions, 168 flow. Second operand 6 states and 84 transitions. [2025-04-13 20:16:33,249 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 87 transitions, 528 flow [2025-04-13 20:16:33,250 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 87 transitions, 480 flow, removed 24 selfloop flow, removed 0 redundant places. [2025-04-13 20:16:33,251 INFO L231 Difference]: Finished difference. Result has 36 places, 48 transitions, 277 flow [2025-04-13 20:16:33,251 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=277, PETRI_PLACES=36, PETRI_TRANSITIONS=48} [2025-04-13 20:16:33,252 INFO L279 CegarLoopForPetriNet]: 24 programPoint places, 12 predicate places. [2025-04-13 20:16:33,252 INFO L485 AbstractCegarLoop]: Abstraction has has 36 places, 48 transitions, 277 flow [2025-04-13 20:16:33,252 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:16:33,252 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:16:33,252 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:16:33,252 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-13 20:16:33,252 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-13 20:16:33,252 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:16:33,253 INFO L85 PathProgramCache]: Analyzing trace with hash 232161449, now seen corresponding path program 1 times [2025-04-13 20:16:33,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:16:33,253 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452143398] [2025-04-13 20:16:33,253 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:16:33,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:16:33,258 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-13 20:16:33,267 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 20:16:33,268 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:16:33,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:16:33,335 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:16:33,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:16:33,335 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452143398] [2025-04-13 20:16:33,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452143398] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:16:33,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:16:33,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 20:16:33,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329300780] [2025-04-13 20:16:33,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:16:33,336 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 20:16:33,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:16:33,336 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 20:16:33,336 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 20:16:33,336 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 30 [2025-04-13 20:16:33,336 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 48 transitions, 277 flow. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:16:33,337 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:16:33,337 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 30 [2025-04-13 20:16:33,337 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:16:33,404 INFO L116 PetriNetUnfolderBase]: 312/528 cut-off events. [2025-04-13 20:16:33,404 INFO L117 PetriNetUnfolderBase]: For 615/639 co-relation queries the response was YES. [2025-04-13 20:16:33,405 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1568 conditions, 528 events. 312/528 cut-off events. For 615/639 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 2158 event pairs, 95 based on Foata normal form. 10/472 useless extension candidates. Maximal degree in co-relation 654. Up to 324 conditions per place. [2025-04-13 20:16:33,406 INFO L140 encePairwiseOnDemand]: 26/30 looper letters, 32 selfloop transitions, 3 changer transitions 0/49 dead transitions. [2025-04-13 20:16:33,406 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 49 transitions, 330 flow [2025-04-13 20:16:33,409 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 20:16:33,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 20:16:33,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 38 transitions. [2025-04-13 20:16:33,410 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4222222222222222 [2025-04-13 20:16:33,410 INFO L175 Difference]: Start difference. First operand has 36 places, 48 transitions, 277 flow. Second operand 3 states and 38 transitions. [2025-04-13 20:16:33,410 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 49 transitions, 330 flow [2025-04-13 20:16:33,411 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 49 transitions, 308 flow, removed 7 selfloop flow, removed 1 redundant places. [2025-04-13 20:16:33,412 INFO L231 Difference]: Finished difference. Result has 37 places, 41 transitions, 218 flow [2025-04-13 20:16:33,412 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=212, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=218, PETRI_PLACES=37, PETRI_TRANSITIONS=41} [2025-04-13 20:16:33,412 INFO L279 CegarLoopForPetriNet]: 24 programPoint places, 13 predicate places. [2025-04-13 20:16:33,412 INFO L485 AbstractCegarLoop]: Abstraction has has 37 places, 41 transitions, 218 flow [2025-04-13 20:16:33,414 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:16:33,414 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:16:33,414 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:16:33,414 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-13 20:16:33,414 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-13 20:16:33,414 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:16:33,414 INFO L85 PathProgramCache]: Analyzing trace with hash -1626525472, now seen corresponding path program 3 times [2025-04-13 20:16:33,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:16:33,414 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588129246] [2025-04-13 20:16:33,415 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:16:33,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:16:33,421 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 20 statements into 3 equivalence classes. [2025-04-13 20:16:33,437 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 20:16:33,437 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 20:16:33,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:16:33,499 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:16:33,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:16:33,499 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588129246] [2025-04-13 20:16:33,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [588129246] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:16:33,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:16:33,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 20:16:33,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089181806] [2025-04-13 20:16:33,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:16:33,500 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 20:16:33,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:16:33,500 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 20:16:33,500 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 20:16:33,500 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 30 [2025-04-13 20:16:33,500 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 41 transitions, 218 flow. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:16:33,500 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:16:33,500 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 30 [2025-04-13 20:16:33,500 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:16:33,559 INFO L116 PetriNetUnfolderBase]: 163/305 cut-off events. [2025-04-13 20:16:33,560 INFO L117 PetriNetUnfolderBase]: For 377/384 co-relation queries the response was YES. [2025-04-13 20:16:33,560 INFO L83 FinitePrefix]: Finished finitePrefix Result has 931 conditions, 305 events. 163/305 cut-off events. For 377/384 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1112 event pairs, 77 based on Foata normal form. 25/303 useless extension candidates. Maximal degree in co-relation 434. Up to 212 conditions per place. [2025-04-13 20:16:33,561 INFO L140 encePairwiseOnDemand]: 27/30 looper letters, 0 selfloop transitions, 0 changer transitions 44/44 dead transitions. [2025-04-13 20:16:33,561 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 44 transitions, 303 flow [2025-04-13 20:16:33,561 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 20:16:33,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 20:16:33,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 38 transitions. [2025-04-13 20:16:33,561 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4222222222222222 [2025-04-13 20:16:33,561 INFO L175 Difference]: Start difference. First operand has 37 places, 41 transitions, 218 flow. Second operand 3 states and 38 transitions. [2025-04-13 20:16:33,561 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 44 transitions, 303 flow [2025-04-13 20:16:33,563 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 44 transitions, 272 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-04-13 20:16:33,563 INFO L231 Difference]: Finished difference. Result has 33 places, 0 transitions, 0 flow [2025-04-13 20:16:33,563 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=145, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=33, PETRI_TRANSITIONS=0} [2025-04-13 20:16:33,563 INFO L279 CegarLoopForPetriNet]: 24 programPoint places, 9 predicate places. [2025-04-13 20:16:33,563 INFO L485 AbstractCegarLoop]: Abstraction has has 33 places, 0 transitions, 0 flow [2025-04-13 20:16:33,564 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:16:33,567 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2025-04-13 20:16:33,567 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2025-04-13 20:16:33,567 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2025-04-13 20:16:33,567 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-13 20:16:33,568 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1] [2025-04-13 20:16:33,570 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-13 20:16:33,570 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-13 20:16:33,574 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 08:16:33 BasicIcfg [2025-04-13 20:16:33,575 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-13 20:16:33,575 INFO L158 Benchmark]: Toolchain (without parser) took 3238.09ms. Allocated memory is still 155.2MB. Free memory was 110.9MB in the beginning and 110.7MB in the end (delta: 292.8kB). Peak memory consumption was 81.1MB. Max. memory is 8.0GB. [2025-04-13 20:16:33,575 INFO L158 Benchmark]: CDTParser took 1.32ms. Allocated memory is still 159.4MB. Free memory is still 86.3MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 20:16:33,575 INFO L158 Benchmark]: CACSL2BoogieTranslator took 187.65ms. Allocated memory is still 155.2MB. Free memory was 110.9MB in the beginning and 96.9MB in the end (delta: 14.0MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-13 20:16:33,575 INFO L158 Benchmark]: Boogie Procedure Inliner took 21.85ms. Allocated memory is still 155.2MB. Free memory was 96.9MB in the beginning and 95.3MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 20:16:33,575 INFO L158 Benchmark]: Boogie Preprocessor took 31.92ms. Allocated memory is still 155.2MB. Free memory was 95.3MB in the beginning and 93.6MB in the end (delta: 1.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 20:16:33,576 INFO L158 Benchmark]: RCFGBuilder took 401.12ms. Allocated memory is still 155.2MB. Free memory was 93.6MB in the beginning and 64.2MB in the end (delta: 29.3MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. [2025-04-13 20:16:33,576 INFO L158 Benchmark]: TraceAbstraction took 2589.81ms. Allocated memory is still 155.2MB. Free memory was 63.4MB in the beginning and 110.7MB in the end (delta: -47.3MB). Peak memory consumption was 34.9MB. Max. memory is 8.0GB. [2025-04-13 20:16:33,576 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.32ms. Allocated memory is still 159.4MB. Free memory is still 86.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 187.65ms. Allocated memory is still 155.2MB. Free memory was 110.9MB in the beginning and 96.9MB in the end (delta: 14.0MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 21.85ms. Allocated memory is still 155.2MB. Free memory was 96.9MB in the beginning and 95.3MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 31.92ms. Allocated memory is still 155.2MB. Free memory was 95.3MB in the beginning and 93.6MB in the end (delta: 1.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 401.12ms. Allocated memory is still 155.2MB. Free memory was 93.6MB in the beginning and 64.2MB in the end (delta: 29.3MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. * TraceAbstraction took 2589.81ms. Allocated memory is still 155.2MB. Free memory was 63.4MB in the beginning and 110.7MB in the end (delta: -47.3MB). Peak memory consumption was 34.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 91]: 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, 34 locations, 53 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: 2.5s, OverallIterations: 9, TraceHistogramMax: 2, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 129 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 127 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 27 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 673 IncrementalHoareTripleChecker+Invalid, 700 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 27 mSolverCounterUnsat, 0 mSDtfsCounter, 673 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 63 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=277occurred in iteration=7, InterpolantAutomatonStates: 34, 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, 0.8s InterpolantComputationTime, 158 NumberOfCodeBlocks, 158 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 165 ConstructedInterpolants, 0 QuantifiedInterpolants, 442 SizeOfPredicates, 2 NumberOfNonLiveVariables, 123 ConjunctsInSsa, 15 ConjunctsInUnsatCore, 11 InterpolantComputations, 8 PerfectInterpolantSequences, 5/8 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-04-13 20:16:33,589 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...