/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline_IcfgBuilder.xml -s ../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.automaton.type.used.in.concurrency.analysis PETRI_NET --preprocessor.replace.while.statements.and.if-then-else.statements false -i ../../../trunk/examples/svcomp/weaver/parallel-misc-3-extended.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-14 00:53:15,812 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-14 00:53:15,859 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2025-04-14 00:53:15,866 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-14 00:53:15,866 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-14 00:53:15,890 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-14 00:53:15,890 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-14 00:53:15,890 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-14 00:53:15,891 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-14 00:53:15,891 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-14 00:53:15,892 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-14 00:53:15,892 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-14 00:53:15,892 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-14 00:53:15,892 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-14 00:53:15,892 INFO L153 SettingsManager]: * Use SBE=true [2025-04-14 00:53:15,892 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-14 00:53:15,892 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-14 00:53:15,892 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-14 00:53:15,892 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-14 00:53:15,892 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-14 00:53:15,893 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-14 00:53:15,893 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-14 00:53:15,893 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-14 00:53:15,893 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-14 00:53:15,893 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-14 00:53:15,893 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-14 00:53:15,893 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-14 00:53:15,893 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-14 00:53:15,893 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-14 00:53:15,893 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 00:53:15,893 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 00:53:15,893 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 00:53:15,893 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 00:53:15,893 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-14 00:53:15,893 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 00:53:15,893 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 00:53:15,893 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 00:53:15,893 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 00:53:15,893 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-14 00:53:15,894 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-14 00:53:15,894 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-14 00:53:15,894 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-14 00:53:15,894 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-14 00:53:15,894 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-14 00:53:15,894 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-14 00:53:15,894 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-14 00:53:15,894 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-14 00:53:15,894 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Automaton type used in concurrency analysis -> PETRI_NET Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Replace while statements and if-then-else statements -> false [2025-04-14 00:53:16,109 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-14 00:53:16,114 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-14 00:53:16,116 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-14 00:53:16,116 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-14 00:53:16,117 INFO L274 PluginConnector]: CDTParser initialized [2025-04-14 00:53:16,117 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/parallel-misc-3-extended.wvr.c [2025-04-14 00:53:17,399 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/31856d9b0/b6f3813a76ec4c5483c4c59992bb5ccb/FLAG39e89aeb3 [2025-04-14 00:53:17,583 INFO L389 CDTParser]: Found 1 translation units. [2025-04-14 00:53:17,584 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-misc-3-extended.wvr.c [2025-04-14 00:53:17,589 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/31856d9b0/b6f3813a76ec4c5483c4c59992bb5ccb/FLAG39e89aeb3 [2025-04-14 00:53:18,399 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/31856d9b0/b6f3813a76ec4c5483c4c59992bb5ccb [2025-04-14 00:53:18,400 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-14 00:53:18,401 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-14 00:53:18,402 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-14 00:53:18,402 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-14 00:53:18,405 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-14 00:53:18,406 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 12:53:18" (1/1) ... [2025-04-14 00:53:18,406 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19eb6c3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:53:18, skipping insertion in model container [2025-04-14 00:53:18,407 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 12:53:18" (1/1) ... [2025-04-14 00:53:18,420 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-14 00:53:18,605 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-extended.wvr.c[2421,2434] [2025-04-14 00:53:18,608 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 00:53:18,618 INFO L200 MainTranslator]: Completed pre-run [2025-04-14 00:53:18,642 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-extended.wvr.c[2421,2434] [2025-04-14 00:53:18,643 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 00:53:18,655 INFO L204 MainTranslator]: Completed translation [2025-04-14 00:53:18,655 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:53:18 WrapperNode [2025-04-14 00:53:18,655 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-14 00:53:18,656 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-14 00:53:18,656 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-14 00:53:18,657 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-14 00:53:18,661 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:53:18" (1/1) ... [2025-04-14 00:53:18,669 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:53:18" (1/1) ... [2025-04-14 00:53:18,684 INFO L138 Inliner]: procedures = 19, calls = 10, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 52 [2025-04-14 00:53:18,684 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-14 00:53:18,685 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-14 00:53:18,685 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-14 00:53:18,685 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-14 00:53:18,693 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:53:18" (1/1) ... [2025-04-14 00:53:18,693 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:53:18" (1/1) ... [2025-04-14 00:53:18,697 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:53:18" (1/1) ... [2025-04-14 00:53:18,713 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-04-14 00:53:18,713 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:53:18" (1/1) ... [2025-04-14 00:53:18,713 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:53:18" (1/1) ... [2025-04-14 00:53:18,715 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:53:18" (1/1) ... [2025-04-14 00:53:18,716 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:53:18" (1/1) ... [2025-04-14 00:53:18,717 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:53:18" (1/1) ... [2025-04-14 00:53:18,717 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:53:18" (1/1) ... [2025-04-14 00:53:18,719 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-14 00:53:18,720 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-04-14 00:53:18,720 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-04-14 00:53:18,720 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-04-14 00:53:18,721 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:53:18" (1/1) ... [2025-04-14 00:53:18,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 00:53:18,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:53:18,745 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-14 00:53:18,747 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-14 00:53:18,762 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-14 00:53:18,762 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-14 00:53:18,763 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-14 00:53:18,763 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-14 00:53:18,763 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-14 00:53:18,763 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-14 00:53:18,763 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-14 00:53:18,763 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-14 00:53:18,763 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-14 00:53:18,763 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-14 00:53:18,764 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-14 00:53:18,830 INFO L256 CfgBuilder]: Building ICFG [2025-04-14 00:53:18,831 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-14 00:53:18,996 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-14 00:53:18,997 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-14 00:53:18,997 INFO L318 CfgBuilder]: Performing block encoding [2025-04-14 00:53:19,136 WARN L179 LargeBlockEncoding]: Complex 2:3 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-14 00:53:19,148 WARN L179 LargeBlockEncoding]: Complex 3:3 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-14 00:53:19,158 WARN L179 LargeBlockEncoding]: Complex 2:3 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-14 00:53:19,166 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-14 00:53:19,167 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 12:53:19 BoogieIcfgContainer [2025-04-14 00:53:19,167 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-04-14 00:53:19,168 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-14 00:53:19,168 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-14 00:53:19,171 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-14 00:53:19,171 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.04 12:53:18" (1/3) ... [2025-04-14 00:53:19,172 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f9eabd7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 12:53:19, skipping insertion in model container [2025-04-14 00:53:19,172 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:53:18" (2/3) ... [2025-04-14 00:53:19,172 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f9eabd7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 12:53:19, skipping insertion in model container [2025-04-14 00:53:19,172 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 12:53:19" (3/3) ... [2025-04-14 00:53:19,173 INFO L128 eAbstractionObserver]: Analyzing ICFG parallel-misc-3-extended.wvr.c [2025-04-14 00:53:19,182 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-14 00:53:19,183 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG parallel-misc-3-extended.wvr.c that has 4 procedures, 29 locations, 39 edges, 1 initial locations, 3 loop locations, and 1 error locations. [2025-04-14 00:53:19,183 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-14 00:53:19,240 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-14 00:53:19,262 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 42 transitions, 105 flow [2025-04-14 00:53:19,291 INFO L116 PetriNetUnfolderBase]: 14/39 cut-off events. [2025-04-14 00:53:19,293 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-14 00:53:19,296 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52 conditions, 39 events. 14/39 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 45 event pairs, 0 based on Foata normal form. 0/24 useless extension candidates. Maximal degree in co-relation 36. Up to 3 conditions per place. [2025-04-14 00:53:19,297 INFO L82 GeneralOperation]: Start removeDead. Operand has 38 places, 42 transitions, 105 flow [2025-04-14 00:53:19,299 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 34 places, 38 transitions, 94 flow [2025-04-14 00:53:19,305 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-14 00:53:19,314 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;@233328bb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 00:53:19,314 INFO L341 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-04-14 00:53:19,325 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-14 00:53:19,325 INFO L116 PetriNetUnfolderBase]: 14/37 cut-off events. [2025-04-14 00:53:19,325 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-14 00:53:19,325 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:53:19,326 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:53:19,326 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 00:53:19,331 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:53:19,331 INFO L85 PathProgramCache]: Analyzing trace with hash 512843903, now seen corresponding path program 1 times [2025-04-14 00:53:19,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:53:19,337 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571563190] [2025-04-14 00:53:19,337 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:53:19,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:53:19,394 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-14 00:53:19,416 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-14 00:53:19,416 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:53:19,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:53:19,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:53:19,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:53:19,530 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571563190] [2025-04-14 00:53:19,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571563190] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:53:19,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:53:19,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-14 00:53:19,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010295847] [2025-04-14 00:53:19,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:53:19,538 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 00:53:19,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:53:19,557 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 00:53:19,558 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 00:53:19,558 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 42 [2025-04-14 00:53:19,560 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 38 transitions, 94 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-14 00:53:19,560 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:53:19,560 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 42 [2025-04-14 00:53:19,562 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:53:19,915 INFO L116 PetriNetUnfolderBase]: 2193/2781 cut-off events. [2025-04-14 00:53:19,915 INFO L117 PetriNetUnfolderBase]: For 106/106 co-relation queries the response was YES. [2025-04-14 00:53:19,921 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5729 conditions, 2781 events. 2193/2781 cut-off events. For 106/106 co-relation queries the response was YES. Maximal size of possible extension queue 163. Compared 9503 event pairs, 310 based on Foata normal form. 1/1616 useless extension candidates. Maximal degree in co-relation 5294. Up to 2286 conditions per place. [2025-04-14 00:53:19,936 INFO L140 encePairwiseOnDemand]: 34/42 looper letters, 53 selfloop transitions, 7 changer transitions 1/61 dead transitions. [2025-04-14 00:53:19,937 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 61 transitions, 277 flow [2025-04-14 00:53:19,937 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 00:53:19,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-14 00:53:19,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 71 transitions. [2025-04-14 00:53:19,948 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5634920634920635 [2025-04-14 00:53:19,949 INFO L175 Difference]: Start difference. First operand has 34 places, 38 transitions, 94 flow. Second operand 3 states and 71 transitions. [2025-04-14 00:53:19,950 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 61 transitions, 277 flow [2025-04-14 00:53:19,957 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 61 transitions, 255 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-04-14 00:53:19,960 INFO L231 Difference]: Finished difference. Result has 31 places, 44 transitions, 129 flow [2025-04-14 00:53:19,962 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=129, PETRI_PLACES=31, PETRI_TRANSITIONS=44} [2025-04-14 00:53:19,965 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, -3 predicate places. [2025-04-14 00:53:19,966 INFO L485 AbstractCegarLoop]: Abstraction has has 31 places, 44 transitions, 129 flow [2025-04-14 00:53:19,966 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-14 00:53:19,966 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:53:19,966 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:53:19,966 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-14 00:53:19,966 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 00:53:19,968 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:53:19,968 INFO L85 PathProgramCache]: Analyzing trace with hash 1735414344, now seen corresponding path program 1 times [2025-04-14 00:53:19,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:53:19,968 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323800131] [2025-04-14 00:53:19,968 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:53:19,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:53:19,981 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-14 00:53:20,003 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-14 00:53:20,004 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:53:20,004 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:53:20,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:53:20,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:53:20,086 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323800131] [2025-04-14 00:53:20,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323800131] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:53:20,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:53:20,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-14 00:53:20,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423925253] [2025-04-14 00:53:20,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:53:20,087 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 00:53:20,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:53:20,087 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 00:53:20,087 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 00:53:20,088 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 42 [2025-04-14 00:53:20,088 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 44 transitions, 129 flow. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:53:20,088 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:53:20,088 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 42 [2025-04-14 00:53:20,088 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:53:20,329 INFO L116 PetriNetUnfolderBase]: 1992/2531 cut-off events. [2025-04-14 00:53:20,329 INFO L117 PetriNetUnfolderBase]: For 471/471 co-relation queries the response was YES. [2025-04-14 00:53:20,332 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5941 conditions, 2531 events. 1992/2531 cut-off events. For 471/471 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 8043 event pairs, 743 based on Foata normal form. 0/1522 useless extension candidates. Maximal degree in co-relation 1744. Up to 2156 conditions per place. [2025-04-14 00:53:20,342 INFO L140 encePairwiseOnDemand]: 39/42 looper letters, 64 selfloop transitions, 2 changer transitions 0/66 dead transitions. [2025-04-14 00:53:20,342 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 66 transitions, 315 flow [2025-04-14 00:53:20,343 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 00:53:20,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-14 00:53:20,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 70 transitions. [2025-04-14 00:53:20,344 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5555555555555556 [2025-04-14 00:53:20,344 INFO L175 Difference]: Start difference. First operand has 31 places, 44 transitions, 129 flow. Second operand 3 states and 70 transitions. [2025-04-14 00:53:20,344 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 66 transitions, 315 flow [2025-04-14 00:53:20,345 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 66 transitions, 306 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-04-14 00:53:20,346 INFO L231 Difference]: Finished difference. Result has 32 places, 43 transitions, 122 flow [2025-04-14 00:53:20,346 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=122, PETRI_PLACES=32, PETRI_TRANSITIONS=43} [2025-04-14 00:53:20,348 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, -2 predicate places. [2025-04-14 00:53:20,348 INFO L485 AbstractCegarLoop]: Abstraction has has 32 places, 43 transitions, 122 flow [2025-04-14 00:53:20,348 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:53:20,348 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:53:20,348 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:53:20,348 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-14 00:53:20,348 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 00:53:20,356 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:53:20,356 INFO L85 PathProgramCache]: Analyzing trace with hash 53455528, now seen corresponding path program 1 times [2025-04-14 00:53:20,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:53:20,358 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785485238] [2025-04-14 00:53:20,358 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:53:20,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:53:20,366 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-14 00:53:20,379 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-14 00:53:20,379 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:53:20,379 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:53:20,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:53:20,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:53:20,439 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785485238] [2025-04-14 00:53:20,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785485238] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:53:20,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:53:20,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-14 00:53:20,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805400239] [2025-04-14 00:53:20,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:53:20,440 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 00:53:20,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:53:20,440 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 00:53:20,440 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 00:53:20,441 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 42 [2025-04-14 00:53:20,441 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 43 transitions, 122 flow. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:53:20,441 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:53:20,441 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 42 [2025-04-14 00:53:20,441 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:53:20,649 INFO L116 PetriNetUnfolderBase]: 1815/2310 cut-off events. [2025-04-14 00:53:20,649 INFO L117 PetriNetUnfolderBase]: For 479/479 co-relation queries the response was YES. [2025-04-14 00:53:20,651 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5320 conditions, 2310 events. 1815/2310 cut-off events. For 479/479 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 7232 event pairs, 641 based on Foata normal form. 0/1498 useless extension candidates. Maximal degree in co-relation 4451. Up to 1870 conditions per place. [2025-04-14 00:53:20,659 INFO L140 encePairwiseOnDemand]: 38/42 looper letters, 59 selfloop transitions, 3 changer transitions 0/62 dead transitions. [2025-04-14 00:53:20,659 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 62 transitions, 296 flow [2025-04-14 00:53:20,659 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 00:53:20,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-14 00:53:20,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 66 transitions. [2025-04-14 00:53:20,661 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5238095238095238 [2025-04-14 00:53:20,661 INFO L175 Difference]: Start difference. First operand has 32 places, 43 transitions, 122 flow. Second operand 3 states and 66 transitions. [2025-04-14 00:53:20,661 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 62 transitions, 296 flow [2025-04-14 00:53:20,663 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 62 transitions, 290 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-14 00:53:20,664 INFO L231 Difference]: Finished difference. Result has 32 places, 42 transitions, 122 flow [2025-04-14 00:53:20,664 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=122, PETRI_PLACES=32, PETRI_TRANSITIONS=42} [2025-04-14 00:53:20,665 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, -2 predicate places. [2025-04-14 00:53:20,665 INFO L485 AbstractCegarLoop]: Abstraction has has 32 places, 42 transitions, 122 flow [2025-04-14 00:53:20,665 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:53:20,665 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:53:20,665 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-14 00:53:20,665 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-14 00:53:20,665 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 00:53:20,668 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:53:20,668 INFO L85 PathProgramCache]: Analyzing trace with hash -584361985, now seen corresponding path program 1 times [2025-04-14 00:53:20,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:53:20,668 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407586808] [2025-04-14 00:53:20,668 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:53:20,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:53:20,675 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-14 00:53:20,681 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-14 00:53:20,681 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:53:20,681 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:53:20,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:53:20,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:53:20,774 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407586808] [2025-04-14 00:53:20,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407586808] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:53:20,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:53:20,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-14 00:53:20,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539865219] [2025-04-14 00:53:20,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:53:20,775 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 00:53:20,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:53:20,775 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 00:53:20,775 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 00:53:20,776 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 42 [2025-04-14 00:53:20,776 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 42 transitions, 122 flow. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:53:20,776 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:53:20,776 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 42 [2025-04-14 00:53:20,776 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:53:21,025 INFO L116 PetriNetUnfolderBase]: 1972/2514 cut-off events. [2025-04-14 00:53:21,026 INFO L117 PetriNetUnfolderBase]: For 492/492 co-relation queries the response was YES. [2025-04-14 00:53:21,028 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5790 conditions, 2514 events. 1972/2514 cut-off events. For 492/492 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 8041 event pairs, 460 based on Foata normal form. 0/1709 useless extension candidates. Maximal degree in co-relation 4521. Up to 1301 conditions per place. [2025-04-14 00:53:21,035 INFO L140 encePairwiseOnDemand]: 37/42 looper letters, 60 selfloop transitions, 4 changer transitions 0/64 dead transitions. [2025-04-14 00:53:21,036 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 64 transitions, 306 flow [2025-04-14 00:53:21,036 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 00:53:21,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-14 00:53:21,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 70 transitions. [2025-04-14 00:53:21,037 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5555555555555556 [2025-04-14 00:53:21,037 INFO L175 Difference]: Start difference. First operand has 32 places, 42 transitions, 122 flow. Second operand 3 states and 70 transitions. [2025-04-14 00:53:21,037 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 64 transitions, 306 flow [2025-04-14 00:53:21,038 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 64 transitions, 296 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-14 00:53:21,039 INFO L231 Difference]: Finished difference. Result has 33 places, 42 transitions, 130 flow [2025-04-14 00:53:21,039 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=130, PETRI_PLACES=33, PETRI_TRANSITIONS=42} [2025-04-14 00:53:21,039 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, -1 predicate places. [2025-04-14 00:53:21,039 INFO L485 AbstractCegarLoop]: Abstraction has has 33 places, 42 transitions, 130 flow [2025-04-14 00:53:21,039 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:53:21,039 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:53:21,039 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-14 00:53:21,039 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-14 00:53:21,040 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 00:53:21,040 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:53:21,040 INFO L85 PathProgramCache]: Analyzing trace with hash -1958511481, now seen corresponding path program 1 times [2025-04-14 00:53:21,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:53:21,040 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526896191] [2025-04-14 00:53:21,040 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:53:21,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:53:21,046 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-14 00:53:21,052 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-14 00:53:21,052 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:53:21,052 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:53:21,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:53:21,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:53:21,112 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526896191] [2025-04-14 00:53:21,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526896191] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:53:21,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:53:21,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-14 00:53:21,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223104394] [2025-04-14 00:53:21,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:53:21,113 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 00:53:21,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:53:21,113 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 00:53:21,113 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 00:53:21,113 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 42 [2025-04-14 00:53:21,113 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 42 transitions, 130 flow. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:53:21,114 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:53:21,114 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 42 [2025-04-14 00:53:21,114 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:53:21,304 INFO L116 PetriNetUnfolderBase]: 1861/2391 cut-off events. [2025-04-14 00:53:21,304 INFO L117 PetriNetUnfolderBase]: For 565/565 co-relation queries the response was YES. [2025-04-14 00:53:21,306 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5922 conditions, 2391 events. 1861/2391 cut-off events. For 565/565 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 7392 event pairs, 697 based on Foata normal form. 0/1608 useless extension candidates. Maximal degree in co-relation 2584. Up to 2043 conditions per place. [2025-04-14 00:53:21,312 INFO L140 encePairwiseOnDemand]: 39/42 looper letters, 60 selfloop transitions, 2 changer transitions 0/62 dead transitions. [2025-04-14 00:53:21,312 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 62 transitions, 317 flow [2025-04-14 00:53:21,313 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 00:53:21,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-14 00:53:21,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 63 transitions. [2025-04-14 00:53:21,313 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5 [2025-04-14 00:53:21,313 INFO L175 Difference]: Start difference. First operand has 33 places, 42 transitions, 130 flow. Second operand 3 states and 63 transitions. [2025-04-14 00:53:21,313 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 62 transitions, 317 flow [2025-04-14 00:53:21,314 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 62 transitions, 310 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-14 00:53:21,315 INFO L231 Difference]: Finished difference. Result has 34 places, 41 transitions, 128 flow [2025-04-14 00:53:21,315 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=128, PETRI_PLACES=34, PETRI_TRANSITIONS=41} [2025-04-14 00:53:21,315 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 0 predicate places. [2025-04-14 00:53:21,315 INFO L485 AbstractCegarLoop]: Abstraction has has 34 places, 41 transitions, 128 flow [2025-04-14 00:53:21,315 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:53:21,315 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:53:21,315 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:53:21,316 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-14 00:53:21,316 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 00:53:21,316 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:53:21,316 INFO L85 PathProgramCache]: Analyzing trace with hash -640281692, now seen corresponding path program 1 times [2025-04-14 00:53:21,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:53:21,316 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752992825] [2025-04-14 00:53:21,316 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:53:21,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:53:21,321 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-14 00:53:21,331 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-14 00:53:21,331 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:53:21,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:53:21,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:53:21,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:53:21,466 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752992825] [2025-04-14 00:53:21,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752992825] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:53:21,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:53:21,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 00:53:21,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144911292] [2025-04-14 00:53:21,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:53:21,466 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 00:53:21,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:53:21,467 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 00:53:21,467 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-14 00:53:21,467 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 42 [2025-04-14 00:53:21,467 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 41 transitions, 128 flow. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:53:21,467 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:53:21,467 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 42 [2025-04-14 00:53:21,467 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:53:21,639 INFO L116 PetriNetUnfolderBase]: 1583/2095 cut-off events. [2025-04-14 00:53:21,639 INFO L117 PetriNetUnfolderBase]: For 433/433 co-relation queries the response was YES. [2025-04-14 00:53:21,641 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5219 conditions, 2095 events. 1583/2095 cut-off events. For 433/433 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 7123 event pairs, 358 based on Foata normal form. 0/1552 useless extension candidates. Maximal degree in co-relation 4391. Up to 1001 conditions per place. [2025-04-14 00:53:21,647 INFO L140 encePairwiseOnDemand]: 35/42 looper letters, 73 selfloop transitions, 4 changer transitions 0/77 dead transitions. [2025-04-14 00:53:21,648 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 77 transitions, 396 flow [2025-04-14 00:53:21,648 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 00:53:21,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-14 00:53:21,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 82 transitions. [2025-04-14 00:53:21,650 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4880952380952381 [2025-04-14 00:53:21,650 INFO L175 Difference]: Start difference. First operand has 34 places, 41 transitions, 128 flow. Second operand 4 states and 82 transitions. [2025-04-14 00:53:21,650 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 77 transitions, 396 flow [2025-04-14 00:53:21,652 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 77 transitions, 388 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-14 00:53:21,652 INFO L231 Difference]: Finished difference. Result has 35 places, 37 transitions, 122 flow [2025-04-14 00:53:21,652 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=122, PETRI_PLACES=35, PETRI_TRANSITIONS=37} [2025-04-14 00:53:21,655 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 1 predicate places. [2025-04-14 00:53:21,655 INFO L485 AbstractCegarLoop]: Abstraction has has 35 places, 37 transitions, 122 flow [2025-04-14 00:53:21,655 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:53:21,655 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:53:21,655 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:53:21,656 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-14 00:53:21,656 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 00:53:21,656 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:53:21,656 INFO L85 PathProgramCache]: Analyzing trace with hash 1048852068, now seen corresponding path program 1 times [2025-04-14 00:53:21,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:53:21,656 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046947119] [2025-04-14 00:53:21,656 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:53:21,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:53:21,664 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-14 00:53:21,683 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-14 00:53:21,683 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:53:21,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:53:21,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:53:21,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:53:21,831 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046947119] [2025-04-14 00:53:21,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046947119] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:53:21,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:53:21,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 00:53:21,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333952908] [2025-04-14 00:53:21,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:53:21,831 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 00:53:21,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:53:21,831 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 00:53:21,831 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-14 00:53:21,832 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 42 [2025-04-14 00:53:21,832 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 37 transitions, 122 flow. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:53:21,832 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:53:21,832 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 42 [2025-04-14 00:53:21,832 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:53:21,991 INFO L116 PetriNetUnfolderBase]: 1506/2018 cut-off events. [2025-04-14 00:53:21,991 INFO L117 PetriNetUnfolderBase]: For 473/473 co-relation queries the response was YES. [2025-04-14 00:53:21,992 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5131 conditions, 2018 events. 1506/2018 cut-off events. For 473/473 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 6692 event pairs, 422 based on Foata normal form. 0/1547 useless extension candidates. Maximal degree in co-relation 2293. Up to 1030 conditions per place. [2025-04-14 00:53:21,997 INFO L140 encePairwiseOnDemand]: 38/42 looper letters, 68 selfloop transitions, 4 changer transitions 0/72 dead transitions. [2025-04-14 00:53:21,997 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 72 transitions, 366 flow [2025-04-14 00:53:21,998 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 00:53:21,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-14 00:53:21,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 81 transitions. [2025-04-14 00:53:21,998 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.48214285714285715 [2025-04-14 00:53:21,998 INFO L175 Difference]: Start difference. First operand has 35 places, 37 transitions, 122 flow. Second operand 4 states and 81 transitions. [2025-04-14 00:53:21,998 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 72 transitions, 366 flow [2025-04-14 00:53:21,999 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 72 transitions, 346 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-04-14 00:53:22,000 INFO L231 Difference]: Finished difference. Result has 35 places, 36 transitions, 118 flow [2025-04-14 00:53:22,000 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=118, PETRI_PLACES=35, PETRI_TRANSITIONS=36} [2025-04-14 00:53:22,001 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 1 predicate places. [2025-04-14 00:53:22,001 INFO L485 AbstractCegarLoop]: Abstraction has has 35 places, 36 transitions, 118 flow [2025-04-14 00:53:22,001 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:53:22,001 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:53:22,001 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:53:22,002 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-14 00:53:22,002 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 00:53:22,002 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:53:22,002 INFO L85 PathProgramCache]: Analyzing trace with hash -1066787569, now seen corresponding path program 1 times [2025-04-14 00:53:22,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:53:22,002 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764738405] [2025-04-14 00:53:22,002 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:53:22,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:53:22,010 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-14 00:53:22,025 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-14 00:53:22,025 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:53:22,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:53:22,144 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-14 00:53:22,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:53:22,144 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764738405] [2025-04-14 00:53:22,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764738405] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:53:22,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:53:22,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 00:53:22,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704919741] [2025-04-14 00:53:22,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:53:22,145 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 00:53:22,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:53:22,145 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 00:53:22,145 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-14 00:53:22,145 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 42 [2025-04-14 00:53:22,145 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 36 transitions, 118 flow. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:53:22,145 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:53:22,145 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 42 [2025-04-14 00:53:22,145 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:53:22,319 INFO L116 PetriNetUnfolderBase]: 1619/2202 cut-off events. [2025-04-14 00:53:22,319 INFO L117 PetriNetUnfolderBase]: For 754/754 co-relation queries the response was YES. [2025-04-14 00:53:22,321 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5633 conditions, 2202 events. 1619/2202 cut-off events. For 754/754 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 7293 event pairs, 543 based on Foata normal form. 0/1782 useless extension candidates. Maximal degree in co-relation 2284. Up to 1230 conditions per place. [2025-04-14 00:53:22,329 INFO L140 encePairwiseOnDemand]: 37/42 looper letters, 65 selfloop transitions, 4 changer transitions 0/69 dead transitions. [2025-04-14 00:53:22,329 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 69 transitions, 368 flow [2025-04-14 00:53:22,330 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 00:53:22,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-14 00:53:22,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 78 transitions. [2025-04-14 00:53:22,330 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4642857142857143 [2025-04-14 00:53:22,331 INFO L175 Difference]: Start difference. First operand has 35 places, 36 transitions, 118 flow. Second operand 4 states and 78 transitions. [2025-04-14 00:53:22,331 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 69 transitions, 368 flow [2025-04-14 00:53:22,331 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 69 transitions, 357 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-14 00:53:22,332 INFO L231 Difference]: Finished difference. Result has 37 places, 35 transitions, 122 flow [2025-04-14 00:53:22,332 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=107, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=122, PETRI_PLACES=37, PETRI_TRANSITIONS=35} [2025-04-14 00:53:22,332 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 3 predicate places. [2025-04-14 00:53:22,332 INFO L485 AbstractCegarLoop]: Abstraction has has 37 places, 35 transitions, 122 flow [2025-04-14 00:53:22,332 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:53:22,332 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:53:22,332 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:53:22,333 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-14 00:53:22,333 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 00:53:22,333 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:53:22,333 INFO L85 PathProgramCache]: Analyzing trace with hash 1121930520, now seen corresponding path program 1 times [2025-04-14 00:53:22,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:53:22,333 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127408723] [2025-04-14 00:53:22,333 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:53:22,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:53:22,341 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-14 00:53:22,358 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-14 00:53:22,358 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:53:22,358 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:53:22,481 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:53:22,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:53:22,481 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127408723] [2025-04-14 00:53:22,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1127408723] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:53:22,481 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1473937893] [2025-04-14 00:53:22,481 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:53:22,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:53:22,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:53:22,484 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-14 00:53:22,485 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-14 00:53:22,524 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-14 00:53:22,544 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-14 00:53:22,544 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:53:22,544 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:53:22,550 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-04-14 00:53:22,552 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:53:22,608 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:53:22,608 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:53:22,662 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:53:22,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1473937893] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:53:22,663 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:53:22,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 3 [2025-04-14 00:53:22,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770544240] [2025-04-14 00:53:22,663 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:53:22,663 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 00:53:22,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:53:22,663 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 00:53:22,663 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-14 00:53:22,663 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 42 [2025-04-14 00:53:22,664 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 35 transitions, 122 flow. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:53:22,664 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:53:22,664 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 42 [2025-04-14 00:53:22,664 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:53:23,128 INFO L116 PetriNetUnfolderBase]: 4816/6542 cut-off events. [2025-04-14 00:53:23,128 INFO L117 PetriNetUnfolderBase]: For 2430/2430 co-relation queries the response was YES. [2025-04-14 00:53:23,132 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17594 conditions, 6542 events. 4816/6542 cut-off events. For 2430/2430 co-relation queries the response was YES. Maximal size of possible extension queue 206. Compared 27409 event pairs, 959 based on Foata normal form. 1/5775 useless extension candidates. Maximal degree in co-relation 8073. Up to 2687 conditions per place. [2025-04-14 00:53:23,144 INFO L140 encePairwiseOnDemand]: 34/42 looper letters, 94 selfloop transitions, 22 changer transitions 1/117 dead transitions. [2025-04-14 00:53:23,144 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 117 transitions, 631 flow [2025-04-14 00:53:23,144 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 00:53:23,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 00:53:23,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 122 transitions. [2025-04-14 00:53:23,145 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.580952380952381 [2025-04-14 00:53:23,145 INFO L175 Difference]: Start difference. First operand has 37 places, 35 transitions, 122 flow. Second operand 5 states and 122 transitions. [2025-04-14 00:53:23,145 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 117 transitions, 631 flow [2025-04-14 00:53:23,146 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 117 transitions, 626 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-14 00:53:23,146 INFO L231 Difference]: Finished difference. Result has 41 places, 53 transitions, 263 flow [2025-04-14 00:53:23,147 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=263, PETRI_PLACES=41, PETRI_TRANSITIONS=53} [2025-04-14 00:53:23,147 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 7 predicate places. [2025-04-14 00:53:23,147 INFO L485 AbstractCegarLoop]: Abstraction has has 41 places, 53 transitions, 263 flow [2025-04-14 00:53:23,147 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:53:23,147 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:53:23,147 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:53:23,153 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-14 00:53:23,352 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:53:23,352 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 00:53:23,352 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:53:23,353 INFO L85 PathProgramCache]: Analyzing trace with hash 518033702, now seen corresponding path program 2 times [2025-04-14 00:53:23,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:53:23,353 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194925408] [2025-04-14 00:53:23,353 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:53:23,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:53:23,359 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-04-14 00:53:23,379 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-14 00:53:23,380 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 00:53:23,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:53:23,498 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-14 00:53:23,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:53:23,498 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194925408] [2025-04-14 00:53:23,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194925408] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:53:23,499 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [353305353] [2025-04-14 00:53:23,499 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:53:23,499 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:53:23,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:53:23,501 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 00:53:23,502 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-04-14 00:53:23,540 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-04-14 00:53:23,559 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-14 00:53:23,559 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 00:53:23,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:53:23,561 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-04-14 00:53:23,562 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:53:23,597 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-14 00:53:23,597 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:53:23,624 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-14 00:53:23,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [353305353] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:53:23,624 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:53:23,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 4 [2025-04-14 00:53:23,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424047253] [2025-04-14 00:53:23,624 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:53:23,624 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-14 00:53:23,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:53:23,625 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-14 00:53:23,625 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-14 00:53:23,625 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 42 [2025-04-14 00:53:23,625 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 53 transitions, 263 flow. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:53:23,625 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:53:23,625 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 42 [2025-04-14 00:53:23,625 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:53:24,341 INFO L116 PetriNetUnfolderBase]: 7150/9679 cut-off events. [2025-04-14 00:53:24,342 INFO L117 PetriNetUnfolderBase]: For 7932/7932 co-relation queries the response was YES. [2025-04-14 00:53:24,349 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29246 conditions, 9679 events. 7150/9679 cut-off events. For 7932/7932 co-relation queries the response was YES. Maximal size of possible extension queue 285. Compared 42898 event pairs, 1637 based on Foata normal form. 1/8543 useless extension candidates. Maximal degree in co-relation 10969. Up to 3043 conditions per place. [2025-04-14 00:53:24,369 INFO L140 encePairwiseOnDemand]: 34/42 looper letters, 103 selfloop transitions, 44 changer transitions 1/148 dead transitions. [2025-04-14 00:53:24,369 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 148 transitions, 916 flow [2025-04-14 00:53:24,369 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 00:53:24,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-14 00:53:24,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 138 transitions. [2025-04-14 00:53:24,370 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5476190476190477 [2025-04-14 00:53:24,370 INFO L175 Difference]: Start difference. First operand has 41 places, 53 transitions, 263 flow. Second operand 6 states and 138 transitions. [2025-04-14 00:53:24,370 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 148 transitions, 916 flow [2025-04-14 00:53:24,374 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 148 transitions, 836 flow, removed 40 selfloop flow, removed 0 redundant places. [2025-04-14 00:53:24,375 INFO L231 Difference]: Finished difference. Result has 47 places, 75 transitions, 439 flow [2025-04-14 00:53:24,375 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=227, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=439, PETRI_PLACES=47, PETRI_TRANSITIONS=75} [2025-04-14 00:53:24,375 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 13 predicate places. [2025-04-14 00:53:24,375 INFO L485 AbstractCegarLoop]: Abstraction has has 47 places, 75 transitions, 439 flow [2025-04-14 00:53:24,375 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:53:24,375 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:53:24,375 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:53:24,382 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-04-14 00:53:24,576 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-04-14 00:53:24,576 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 00:53:24,576 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:53:24,576 INFO L85 PathProgramCache]: Analyzing trace with hash -1886099560, now seen corresponding path program 3 times [2025-04-14 00:53:24,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:53:24,577 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799968464] [2025-04-14 00:53:24,577 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 00:53:24,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:53:24,583 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 2 equivalence classes. [2025-04-14 00:53:24,602 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-14 00:53:24,603 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-14 00:53:24,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:53:24,701 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-14 00:53:24,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:53:24,702 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799968464] [2025-04-14 00:53:24,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799968464] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:53:24,702 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [306345295] [2025-04-14 00:53:24,702 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 00:53:24,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:53:24,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:53:24,704 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 00:53:24,705 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-04-14 00:53:24,745 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 2 equivalence classes. [2025-04-14 00:53:24,763 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-14 00:53:24,763 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-14 00:53:24,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:53:24,764 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-04-14 00:53:24,765 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:53:24,799 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-14 00:53:24,799 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:53:24,826 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-14 00:53:24,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [306345295] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:53:24,826 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:53:24,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 4 [2025-04-14 00:53:24,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960950402] [2025-04-14 00:53:24,826 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:53:24,826 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-14 00:53:24,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:53:24,827 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-14 00:53:24,827 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-14 00:53:24,827 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 42 [2025-04-14 00:53:24,827 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 75 transitions, 439 flow. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:53:24,827 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:53:24,827 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 42 [2025-04-14 00:53:24,827 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:53:25,630 INFO L116 PetriNetUnfolderBase]: 10263/13898 cut-off events. [2025-04-14 00:53:25,631 INFO L117 PetriNetUnfolderBase]: For 13086/13086 co-relation queries the response was YES. [2025-04-14 00:53:25,647 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43336 conditions, 13898 events. 10263/13898 cut-off events. For 13086/13086 co-relation queries the response was YES. Maximal size of possible extension queue 448. Compared 66385 event pairs, 2186 based on Foata normal form. 1/12262 useless extension candidates. Maximal degree in co-relation 17106. Up to 6134 conditions per place. [2025-04-14 00:53:25,679 INFO L140 encePairwiseOnDemand]: 34/42 looper letters, 134 selfloop transitions, 46 changer transitions 1/181 dead transitions. [2025-04-14 00:53:25,680 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 181 transitions, 1203 flow [2025-04-14 00:53:25,680 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 00:53:25,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-14 00:53:25,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 147 transitions. [2025-04-14 00:53:25,681 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5833333333333334 [2025-04-14 00:53:25,681 INFO L175 Difference]: Start difference. First operand has 47 places, 75 transitions, 439 flow. Second operand 6 states and 147 transitions. [2025-04-14 00:53:25,681 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 181 transitions, 1203 flow [2025-04-14 00:53:25,690 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 181 transitions, 1120 flow, removed 35 selfloop flow, removed 1 redundant places. [2025-04-14 00:53:25,692 INFO L231 Difference]: Finished difference. Result has 52 places, 99 transitions, 628 flow [2025-04-14 00:53:25,692 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=404, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=628, PETRI_PLACES=52, PETRI_TRANSITIONS=99} [2025-04-14 00:53:25,692 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 18 predicate places. [2025-04-14 00:53:25,692 INFO L485 AbstractCegarLoop]: Abstraction has has 52 places, 99 transitions, 628 flow [2025-04-14 00:53:25,693 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:53:25,693 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:53:25,693 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:53:25,698 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-04-14 00:53:25,897 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:53:25,897 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 00:53:25,897 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:53:25,897 INFO L85 PathProgramCache]: Analyzing trace with hash 1227264472, now seen corresponding path program 4 times [2025-04-14 00:53:25,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:53:25,897 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746814468] [2025-04-14 00:53:25,897 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 00:53:25,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:53:25,905 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 26 statements into 2 equivalence classes. [2025-04-14 00:53:25,911 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-14 00:53:25,911 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 00:53:25,911 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:53:26,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:53:26,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:53:26,003 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746814468] [2025-04-14 00:53:26,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1746814468] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:53:26,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:53:26,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-14 00:53:26,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326302347] [2025-04-14 00:53:26,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:53:26,003 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-14 00:53:26,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:53:26,004 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-14 00:53:26,004 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-04-14 00:53:26,004 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 42 [2025-04-14 00:53:26,004 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 99 transitions, 628 flow. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:53:26,004 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:53:26,004 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 42 [2025-04-14 00:53:26,004 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:53:27,244 INFO L116 PetriNetUnfolderBase]: 12601/17043 cut-off events. [2025-04-14 00:53:27,244 INFO L117 PetriNetUnfolderBase]: For 20501/20501 co-relation queries the response was YES. [2025-04-14 00:53:27,259 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54663 conditions, 17043 events. 12601/17043 cut-off events. For 20501/20501 co-relation queries the response was YES. Maximal size of possible extension queue 608. Compared 83900 event pairs, 2974 based on Foata normal form. 1/15028 useless extension candidates. Maximal degree in co-relation 19723. Up to 5383 conditions per place. [2025-04-14 00:53:27,299 INFO L140 encePairwiseOnDemand]: 34/42 looper letters, 121 selfloop transitions, 96 changer transitions 1/218 dead transitions. [2025-04-14 00:53:27,299 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 218 transitions, 1515 flow [2025-04-14 00:53:27,299 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-14 00:53:27,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-14 00:53:27,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 163 transitions. [2025-04-14 00:53:27,300 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5544217687074829 [2025-04-14 00:53:27,300 INFO L175 Difference]: Start difference. First operand has 52 places, 99 transitions, 628 flow. Second operand 7 states and 163 transitions. [2025-04-14 00:53:27,300 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 218 transitions, 1515 flow [2025-04-14 00:53:27,309 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 218 transitions, 1503 flow, removed 6 selfloop flow, removed 0 redundant places. [2025-04-14 00:53:27,311 INFO L231 Difference]: Finished difference. Result has 59 places, 127 transitions, 1030 flow [2025-04-14 00:53:27,311 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=616, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=74, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1030, PETRI_PLACES=59, PETRI_TRANSITIONS=127} [2025-04-14 00:53:27,311 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 25 predicate places. [2025-04-14 00:53:27,311 INFO L485 AbstractCegarLoop]: Abstraction has has 59 places, 127 transitions, 1030 flow [2025-04-14 00:53:27,312 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:53:27,312 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:53:27,312 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:53:27,312 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-14 00:53:27,312 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 00:53:27,312 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:53:27,312 INFO L85 PathProgramCache]: Analyzing trace with hash 351381806, now seen corresponding path program 5 times [2025-04-14 00:53:27,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:53:27,312 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79716492] [2025-04-14 00:53:27,312 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 00:53:27,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:53:27,317 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-04-14 00:53:27,323 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-14 00:53:27,323 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 00:53:27,323 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:53:27,416 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-14 00:53:27,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:53:27,416 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79716492] [2025-04-14 00:53:27,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79716492] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:53:27,416 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [575213669] [2025-04-14 00:53:27,416 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 00:53:27,416 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:53:27,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:53:27,418 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 00:53:27,420 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-04-14 00:53:27,456 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-04-14 00:53:27,471 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-14 00:53:27,471 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 00:53:27,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:53:27,472 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-04-14 00:53:27,473 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:53:27,507 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-14 00:53:27,507 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:53:27,530 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-14 00:53:27,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [575213669] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:53:27,530 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:53:27,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 6 [2025-04-14 00:53:27,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466279878] [2025-04-14 00:53:27,530 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:53:27,530 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-14 00:53:27,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:53:27,530 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-14 00:53:27,531 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-04-14 00:53:27,531 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 42 [2025-04-14 00:53:27,531 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 127 transitions, 1030 flow. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:53:27,531 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:53:27,531 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 42 [2025-04-14 00:53:27,531 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:53:28,767 INFO L116 PetriNetUnfolderBase]: 14979/20244 cut-off events. [2025-04-14 00:53:28,768 INFO L117 PetriNetUnfolderBase]: For 41959/41959 co-relation queries the response was YES. [2025-04-14 00:53:28,797 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71992 conditions, 20244 events. 14979/20244 cut-off events. For 41959/41959 co-relation queries the response was YES. Maximal size of possible extension queue 797. Compared 102613 event pairs, 3668 based on Foata normal form. 1/17850 useless extension candidates. Maximal degree in co-relation 24140. Up to 6337 conditions per place. [2025-04-14 00:53:28,849 INFO L140 encePairwiseOnDemand]: 34/42 looper letters, 125 selfloop transitions, 127 changer transitions 1/253 dead transitions. [2025-04-14 00:53:28,849 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 253 transitions, 2081 flow [2025-04-14 00:53:28,849 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-14 00:53:28,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-14 00:53:28,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 173 transitions. [2025-04-14 00:53:28,850 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5148809523809523 [2025-04-14 00:53:28,850 INFO L175 Difference]: Start difference. First operand has 59 places, 127 transitions, 1030 flow. Second operand 8 states and 173 transitions. [2025-04-14 00:53:28,850 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 253 transitions, 2081 flow [2025-04-14 00:53:28,875 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 253 transitions, 1865 flow, removed 86 selfloop flow, removed 2 redundant places. [2025-04-14 00:53:28,878 INFO L231 Difference]: Finished difference. Result has 65 places, 158 transitions, 1379 flow [2025-04-14 00:53:28,878 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=938, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=102, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1379, PETRI_PLACES=65, PETRI_TRANSITIONS=158} [2025-04-14 00:53:28,878 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 31 predicate places. [2025-04-14 00:53:28,878 INFO L485 AbstractCegarLoop]: Abstraction has has 65 places, 158 transitions, 1379 flow [2025-04-14 00:53:28,878 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:53:28,878 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:53:28,879 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:53:28,884 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-04-14 00:53:29,079 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:53:29,079 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 00:53:29,080 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:53:29,080 INFO L85 PathProgramCache]: Analyzing trace with hash 1403734811, now seen corresponding path program 6 times [2025-04-14 00:53:29,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:53:29,080 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848475401] [2025-04-14 00:53:29,080 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-14 00:53:29,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:53:29,086 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 28 statements into 2 equivalence classes. [2025-04-14 00:53:29,096 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-14 00:53:29,096 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-14 00:53:29,096 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:53:29,154 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:53:29,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:53:29,154 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848475401] [2025-04-14 00:53:29,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848475401] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:53:29,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:53:29,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 00:53:29,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003545421] [2025-04-14 00:53:29,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:53:29,154 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 00:53:29,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:53:29,155 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 00:53:29,155 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 00:53:29,155 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 42 [2025-04-14 00:53:29,155 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 158 transitions, 1379 flow. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:53:29,155 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:53:29,155 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 42 [2025-04-14 00:53:29,155 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:53:30,440 INFO L116 PetriNetUnfolderBase]: 14113/19332 cut-off events. [2025-04-14 00:53:30,440 INFO L117 PetriNetUnfolderBase]: For 51580/51580 co-relation queries the response was YES. [2025-04-14 00:53:30,461 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71909 conditions, 19332 events. 14113/19332 cut-off events. For 51580/51580 co-relation queries the response was YES. Maximal size of possible extension queue 735. Compared 102525 event pairs, 3835 based on Foata normal form. 755/17696 useless extension candidates. Maximal degree in co-relation 28644. Up to 11352 conditions per place. [2025-04-14 00:53:30,506 INFO L140 encePairwiseOnDemand]: 39/42 looper letters, 255 selfloop transitions, 3 changer transitions 0/258 dead transitions. [2025-04-14 00:53:30,506 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 258 transitions, 2758 flow [2025-04-14 00:53:30,507 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 00:53:30,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-14 00:53:30,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 57 transitions. [2025-04-14 00:53:30,507 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4523809523809524 [2025-04-14 00:53:30,507 INFO L175 Difference]: Start difference. First operand has 65 places, 158 transitions, 1379 flow. Second operand 3 states and 57 transitions. [2025-04-14 00:53:30,507 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 258 transitions, 2758 flow [2025-04-14 00:53:30,560 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 258 transitions, 2657 flow, removed 17 selfloop flow, removed 2 redundant places. [2025-04-14 00:53:30,562 INFO L231 Difference]: Finished difference. Result has 65 places, 157 transitions, 1316 flow [2025-04-14 00:53:30,562 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1310, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=154, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1316, PETRI_PLACES=65, PETRI_TRANSITIONS=157} [2025-04-14 00:53:30,562 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 31 predicate places. [2025-04-14 00:53:30,563 INFO L485 AbstractCegarLoop]: Abstraction has has 65 places, 157 transitions, 1316 flow [2025-04-14 00:53:30,563 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:53:30,563 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:53:30,563 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:53:30,563 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-04-14 00:53:30,563 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 00:53:30,563 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:53:30,563 INFO L85 PathProgramCache]: Analyzing trace with hash 61896186, now seen corresponding path program 1 times [2025-04-14 00:53:30,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:53:30,563 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758999419] [2025-04-14 00:53:30,563 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:53:30,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:53:30,568 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-14 00:53:30,573 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-14 00:53:30,573 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:53:30,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:53:30,625 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-14 00:53:30,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:53:30,626 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758999419] [2025-04-14 00:53:30,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1758999419] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:53:30,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:53:30,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 00:53:30,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889438566] [2025-04-14 00:53:30,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:53:30,626 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 00:53:30,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:53:30,626 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 00:53:30,626 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 00:53:30,626 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 42 [2025-04-14 00:53:30,627 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 157 transitions, 1316 flow. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:53:30,627 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:53:30,627 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 42 [2025-04-14 00:53:30,627 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:53:31,183 INFO L116 PetriNetUnfolderBase]: 8037/11167 cut-off events. [2025-04-14 00:53:31,183 INFO L117 PetriNetUnfolderBase]: For 29177/29177 co-relation queries the response was YES. [2025-04-14 00:53:31,203 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40574 conditions, 11167 events. 8037/11167 cut-off events. For 29177/29177 co-relation queries the response was YES. Maximal size of possible extension queue 437. Compared 55882 event pairs, 2747 based on Foata normal form. 0/10115 useless extension candidates. Maximal degree in co-relation 19677. Up to 7636 conditions per place. [2025-04-14 00:53:31,232 INFO L140 encePairwiseOnDemand]: 38/42 looper letters, 230 selfloop transitions, 3 changer transitions 0/233 dead transitions. [2025-04-14 00:53:31,233 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 233 transitions, 2405 flow [2025-04-14 00:53:31,233 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 00:53:31,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-14 00:53:31,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 56 transitions. [2025-04-14 00:53:31,233 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4444444444444444 [2025-04-14 00:53:31,233 INFO L175 Difference]: Start difference. First operand has 65 places, 157 transitions, 1316 flow. Second operand 3 states and 56 transitions. [2025-04-14 00:53:31,233 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 233 transitions, 2405 flow [2025-04-14 00:53:31,274 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 233 transitions, 2393 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-14 00:53:31,276 INFO L231 Difference]: Finished difference. Result has 65 places, 135 transitions, 1119 flow [2025-04-14 00:53:31,276 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1113, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1119, PETRI_PLACES=65, PETRI_TRANSITIONS=135} [2025-04-14 00:53:31,276 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 31 predicate places. [2025-04-14 00:53:31,276 INFO L485 AbstractCegarLoop]: Abstraction has has 65 places, 135 transitions, 1119 flow [2025-04-14 00:53:31,276 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:53:31,276 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:53:31,276 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:53:31,277 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-04-14 00:53:31,277 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 00:53:31,277 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:53:31,277 INFO L85 PathProgramCache]: Analyzing trace with hash 1621850727, now seen corresponding path program 7 times [2025-04-14 00:53:31,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:53:31,277 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884410841] [2025-04-14 00:53:31,277 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-14 00:53:31,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:53:31,282 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-14 00:53:31,288 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-14 00:53:31,288 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:53:31,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:53:31,338 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-14 00:53:31,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:53:31,338 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884410841] [2025-04-14 00:53:31,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884410841] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:53:31,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:53:31,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 00:53:31,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713470160] [2025-04-14 00:53:31,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:53:31,338 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 00:53:31,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:53:31,339 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 00:53:31,339 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 00:53:31,339 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 42 [2025-04-14 00:53:31,339 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 135 transitions, 1119 flow. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:53:31,339 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:53:31,339 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 42 [2025-04-14 00:53:31,339 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:53:31,639 INFO L116 PetriNetUnfolderBase]: 3968/5637 cut-off events. [2025-04-14 00:53:31,639 INFO L117 PetriNetUnfolderBase]: For 14566/14566 co-relation queries the response was YES. [2025-04-14 00:53:31,646 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20295 conditions, 5637 events. 3968/5637 cut-off events. For 14566/14566 co-relation queries the response was YES. Maximal size of possible extension queue 221. Compared 26116 event pairs, 1600 based on Foata normal form. 308/5320 useless extension candidates. Maximal degree in co-relation 10658. Up to 3864 conditions per place. [2025-04-14 00:53:31,651 INFO L140 encePairwiseOnDemand]: 39/42 looper letters, 0 selfloop transitions, 0 changer transitions 170/170 dead transitions. [2025-04-14 00:53:31,651 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 170 transitions, 1734 flow [2025-04-14 00:53:31,651 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 00:53:31,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-14 00:53:31,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 53 transitions. [2025-04-14 00:53:31,652 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.42063492063492064 [2025-04-14 00:53:31,652 INFO L175 Difference]: Start difference. First operand has 65 places, 135 transitions, 1119 flow. Second operand 3 states and 53 transitions. [2025-04-14 00:53:31,652 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 170 transitions, 1734 flow [2025-04-14 00:53:31,674 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 170 transitions, 1664 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-04-14 00:53:31,675 INFO L231 Difference]: Finished difference. Result has 61 places, 0 transitions, 0 flow [2025-04-14 00:53:31,675 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=837, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=61, PETRI_TRANSITIONS=0} [2025-04-14 00:53:31,675 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 27 predicate places. [2025-04-14 00:53:31,675 INFO L485 AbstractCegarLoop]: Abstraction has has 61 places, 0 transitions, 0 flow [2025-04-14 00:53:31,675 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:53:31,677 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2025-04-14 00:53:31,677 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2025-04-14 00:53:31,677 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2025-04-14 00:53:31,677 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2025-04-14 00:53:31,678 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-04-14 00:53:31,678 INFO L422 BasicCegarLoop]: Path program histogram: [7, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:53:31,680 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-14 00:53:31,680 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-14 00:53:31,683 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.04 12:53:31 BasicIcfg [2025-04-14 00:53:31,683 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-14 00:53:31,683 INFO L158 Benchmark]: Toolchain (without parser) took 13281.91ms. Allocated memory was 155.2MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 110.0MB in the beginning and 1.1GB in the end (delta: -961.7MB). Peak memory consumption was 333.4MB. Max. memory is 8.0GB. [2025-04-14 00:53:31,683 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 159.4MB. Free memory is still 86.2MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 00:53:31,683 INFO L158 Benchmark]: CACSL2BoogieTranslator took 253.37ms. Allocated memory is still 155.2MB. Free memory was 110.0MB in the beginning and 95.1MB in the end (delta: 14.8MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-14 00:53:31,684 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.18ms. Allocated memory is still 155.2MB. Free memory was 95.1MB in the beginning and 93.6MB in the end (delta: 1.5MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-14 00:53:31,684 INFO L158 Benchmark]: Boogie Preprocessor took 34.65ms. Allocated memory is still 155.2MB. Free memory was 93.6MB in the beginning and 92.4MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 00:53:31,684 INFO L158 Benchmark]: IcfgBuilder took 446.96ms. Allocated memory is still 155.2MB. Free memory was 92.4MB in the beginning and 54.0MB in the end (delta: 38.4MB). Peak memory consumption was 37.7MB. Max. memory is 8.0GB. [2025-04-14 00:53:31,684 INFO L158 Benchmark]: TraceAbstraction took 12514.76ms. Allocated memory was 155.2MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 53.3MB in the beginning and 1.1GB in the end (delta: -1.0GB). Peak memory consumption was 278.8MB. Max. memory is 8.0GB. [2025-04-14 00:53:31,685 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 159.4MB. Free memory is still 86.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 253.37ms. Allocated memory is still 155.2MB. Free memory was 110.0MB in the beginning and 95.1MB in the end (delta: 14.8MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 28.18ms. Allocated memory is still 155.2MB. Free memory was 95.1MB in the beginning and 93.6MB in the end (delta: 1.5MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 34.65ms. Allocated memory is still 155.2MB. Free memory was 93.6MB in the beginning and 92.4MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 8.0GB. * IcfgBuilder took 446.96ms. Allocated memory is still 155.2MB. Free memory was 92.4MB in the beginning and 54.0MB in the end (delta: 38.4MB). Peak memory consumption was 37.7MB. Max. memory is 8.0GB. * TraceAbstraction took 12514.76ms. Allocated memory was 155.2MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 53.3MB in the beginning and 1.1GB in the end (delta: -1.0GB). Peak memory consumption was 278.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 113]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 48 locations, 75 edges, 4 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 12.4s, OverallIterations: 16, TraceHistogramMax: 2, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.0s, AutomataDifference: 9.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 543 SdHoareTripleChecker+Valid, 2.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 543 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 77 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3151 IncrementalHoareTripleChecker+Invalid, 3228 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 77 mSolverCounterUnsat, 0 mSDtfsCounter, 3151 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 266 GetRequests, 230 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1379occurred in iteration=13, InterpolantAutomatonStates: 68, 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.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 466 NumberOfCodeBlocks, 466 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 546 ConstructedInterpolants, 0 QuantifiedInterpolants, 1548 SizeOfPredicates, 8 NumberOfNonLiveVariables, 712 ConjunctsInSsa, 76 ConjunctsInUnsatCore, 24 InterpolantComputations, 12 PerfectInterpolantSequences, 8/23 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-04-14 00:53:31,696 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...