/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-2.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-14 00:52:50,352 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-14 00:52:50,403 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:52:50,410 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-14 00:52:50,410 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-14 00:52:50,424 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-14 00:52:50,424 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-14 00:52:50,424 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-14 00:52:50,425 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-14 00:52:50,425 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-14 00:52:50,425 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-14 00:52:50,425 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-14 00:52:50,425 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-14 00:52:50,425 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-14 00:52:50,425 INFO L153 SettingsManager]: * Use SBE=true [2025-04-14 00:52:50,425 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-14 00:52:50,425 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-14 00:52:50,425 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-14 00:52:50,425 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-14 00:52:50,425 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-14 00:52:50,426 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-14 00:52:50,426 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-14 00:52:50,426 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-14 00:52:50,426 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-14 00:52:50,426 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-14 00:52:50,426 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-14 00:52:50,426 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-14 00:52:50,426 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-14 00:52:50,426 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-14 00:52:50,426 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 00:52:50,426 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 00:52:50,426 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 00:52:50,426 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 00:52:50,426 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-14 00:52:50,426 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 00:52:50,426 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 00:52:50,427 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 00:52:50,427 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 00:52:50,427 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-14 00:52:50,427 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-14 00:52:50,427 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-14 00:52:50,427 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-14 00:52:50,427 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-14 00:52:50,427 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-14 00:52:50,427 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-14 00:52:50,427 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-14 00:52:50,427 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-14 00:52:50,427 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:52:50,666 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-14 00:52:50,674 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-14 00:52:50,677 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-14 00:52:50,678 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-14 00:52:50,680 INFO L274 PluginConnector]: CDTParser initialized [2025-04-14 00:52:50,681 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/parallel-misc-2.wvr.c [2025-04-14 00:52:52,035 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6608e3b08/1209db027c954828a2e3618e049ac261/FLAG2273f799c [2025-04-14 00:52:52,251 INFO L389 CDTParser]: Found 1 translation units. [2025-04-14 00:52:52,252 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-misc-2.wvr.c [2025-04-14 00:52:52,263 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6608e3b08/1209db027c954828a2e3618e049ac261/FLAG2273f799c [2025-04-14 00:52:53,085 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6608e3b08/1209db027c954828a2e3618e049ac261 [2025-04-14 00:52:53,087 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-14 00:52:53,088 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-14 00:52:53,089 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-14 00:52:53,089 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-14 00:52:53,092 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-14 00:52:53,092 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 12:52:53" (1/1) ... [2025-04-14 00:52:53,094 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53ad7b52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:52:53, skipping insertion in model container [2025-04-14 00:52:53,094 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 12:52:53" (1/1) ... [2025-04-14 00:52:53,106 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-14 00:52:53,274 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-2.wvr.c[2249,2262] [2025-04-14 00:52:53,278 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 00:52:53,286 INFO L200 MainTranslator]: Completed pre-run [2025-04-14 00:52:53,317 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-2.wvr.c[2249,2262] [2025-04-14 00:52:53,318 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 00:52:53,330 INFO L204 MainTranslator]: Completed translation [2025-04-14 00:52:53,332 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:52:53 WrapperNode [2025-04-14 00:52:53,332 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-14 00:52:53,333 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-14 00:52:53,333 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-14 00:52:53,333 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-14 00:52:53,337 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:52:53" (1/1) ... [2025-04-14 00:52:53,343 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:52:53" (1/1) ... [2025-04-14 00:52:53,357 INFO L138 Inliner]: procedures = 18, calls = 10, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 62 [2025-04-14 00:52:53,358 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-14 00:52:53,358 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-14 00:52:53,358 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-14 00:52:53,358 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-14 00:52:53,366 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:52:53" (1/1) ... [2025-04-14 00:52:53,366 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:52:53" (1/1) ... [2025-04-14 00:52:53,372 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:52:53" (1/1) ... [2025-04-14 00:52:53,385 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:52:53,385 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:52:53" (1/1) ... [2025-04-14 00:52:53,385 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:52:53" (1/1) ... [2025-04-14 00:52:53,391 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:52:53" (1/1) ... [2025-04-14 00:52:53,392 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:52:53" (1/1) ... [2025-04-14 00:52:53,393 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:52:53" (1/1) ... [2025-04-14 00:52:53,393 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:52:53" (1/1) ... [2025-04-14 00:52:53,399 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-14 00:52:53,400 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-04-14 00:52:53,400 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-04-14 00:52:53,400 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-04-14 00:52:53,401 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:52:53" (1/1) ... [2025-04-14 00:52:53,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 00:52:53,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:52:53,426 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:52:53,428 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:52:53,444 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-14 00:52:53,444 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-14 00:52:53,444 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-14 00:52:53,445 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-14 00:52:53,445 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-14 00:52:53,445 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-14 00:52:53,445 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-14 00:52:53,445 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-14 00:52:53,446 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:52:53,502 INFO L256 CfgBuilder]: Building ICFG [2025-04-14 00:52:53,503 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-14 00:52:53,634 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-14 00:52:53,634 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-14 00:52:53,635 INFO L318 CfgBuilder]: Performing block encoding [2025-04-14 00:52:53,787 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:52:53,803 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:52:53,812 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-14 00:52:53,812 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 12:52:53 BoogieIcfgContainer [2025-04-14 00:52:53,812 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-04-14 00:52:53,813 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-14 00:52:53,813 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-14 00:52:53,816 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-14 00:52:53,816 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.04 12:52:53" (1/3) ... [2025-04-14 00:52:53,817 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@727dbe31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 12:52:53, skipping insertion in model container [2025-04-14 00:52:53,817 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:52:53" (2/3) ... [2025-04-14 00:52:53,818 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@727dbe31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 12:52:53, skipping insertion in model container [2025-04-14 00:52:53,818 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 12:52:53" (3/3) ... [2025-04-14 00:52:53,819 INFO L128 eAbstractionObserver]: Analyzing ICFG parallel-misc-2.wvr.c [2025-04-14 00:52:53,828 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-14 00:52:53,829 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG parallel-misc-2.wvr.c that has 3 procedures, 23 locations, 30 edges, 1 initial locations, 2 loop locations, and 1 error locations. [2025-04-14 00:52:53,830 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-14 00:52:53,876 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-14 00:52:53,905 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 32 transitions, 78 flow [2025-04-14 00:52:53,933 INFO L116 PetriNetUnfolderBase]: 10/30 cut-off events. [2025-04-14 00:52:53,935 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-14 00:52:53,939 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39 conditions, 30 events. 10/30 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 35 event pairs, 0 based on Foata normal form. 0/19 useless extension candidates. Maximal degree in co-relation 24. Up to 3 conditions per place. [2025-04-14 00:52:53,939 INFO L82 GeneralOperation]: Start removeDead. Operand has 29 places, 32 transitions, 78 flow [2025-04-14 00:52:53,943 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 26 places, 29 transitions, 70 flow [2025-04-14 00:52:53,951 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-14 00:52:53,959 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;@171745c0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 00:52:53,959 INFO L341 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-04-14 00:52:53,972 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-14 00:52:53,974 INFO L116 PetriNetUnfolderBase]: 10/28 cut-off events. [2025-04-14 00:52:53,974 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-14 00:52:53,974 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:52:53,975 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:52:53,975 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:52:53,978 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:52:53,979 INFO L85 PathProgramCache]: Analyzing trace with hash -754110914, now seen corresponding path program 1 times [2025-04-14 00:52:53,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:52:53,985 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973833268] [2025-04-14 00:52:53,985 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:52:53,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:52:54,056 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-14 00:52:54,082 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-14 00:52:54,083 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:52:54,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:52:54,249 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:52:54,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:52:54,250 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973833268] [2025-04-14 00:52:54,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973833268] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:52:54,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:52:54,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-14 00:52:54,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164691211] [2025-04-14 00:52:54,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:52:54,257 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 00:52:54,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:52:54,274 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 00:52:54,275 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 00:52:54,276 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 32 [2025-04-14 00:52:54,278 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 29 transitions, 70 flow. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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:52:54,278 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:52:54,278 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 32 [2025-04-14 00:52:54,278 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:52:54,434 INFO L116 PetriNetUnfolderBase]: 269/392 cut-off events. [2025-04-14 00:52:54,434 INFO L117 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2025-04-14 00:52:54,435 INFO L83 FinitePrefix]: Finished finitePrefix Result has 819 conditions, 392 events. 269/392 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1217 event pairs, 42 based on Foata normal form. 1/243 useless extension candidates. Maximal degree in co-relation 744. Up to 304 conditions per place. [2025-04-14 00:52:54,441 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 36 selfloop transitions, 7 changer transitions 1/44 dead transitions. [2025-04-14 00:52:54,441 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 44 transitions, 197 flow [2025-04-14 00:52:54,442 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 00:52:54,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-14 00:52:54,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 51 transitions. [2025-04-14 00:52:54,450 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.53125 [2025-04-14 00:52:54,450 INFO L175 Difference]: Start difference. First operand has 26 places, 29 transitions, 70 flow. Second operand 3 states and 51 transitions. [2025-04-14 00:52:54,451 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 44 transitions, 197 flow [2025-04-14 00:52:54,456 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 44 transitions, 183 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-04-14 00:52:54,458 INFO L231 Difference]: Finished difference. Result has 25 places, 33 transitions, 101 flow [2025-04-14 00:52:54,460 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=101, PETRI_PLACES=25, PETRI_TRANSITIONS=33} [2025-04-14 00:52:54,462 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, -1 predicate places. [2025-04-14 00:52:54,462 INFO L485 AbstractCegarLoop]: Abstraction has has 25 places, 33 transitions, 101 flow [2025-04-14 00:52:54,463 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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:52:54,463 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:52:54,463 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:52:54,463 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-14 00:52:54,463 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:52:54,463 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:52:54,465 INFO L85 PathProgramCache]: Analyzing trace with hash 822128765, now seen corresponding path program 1 times [2025-04-14 00:52:54,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:52:54,465 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307495063] [2025-04-14 00:52:54,465 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:52:54,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:52:54,473 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-14 00:52:54,496 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-14 00:52:54,496 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:52:54,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:52:54,604 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:52:54,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:52:54,604 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307495063] [2025-04-14 00:52:54,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307495063] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:52:54,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:52:54,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 00:52:54,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94901562] [2025-04-14 00:52:54,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:52:54,605 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 00:52:54,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:52:54,605 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 00:52:54,605 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-14 00:52:54,605 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 32 [2025-04-14 00:52:54,605 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 33 transitions, 101 flow. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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:52:54,606 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:52:54,606 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 32 [2025-04-14 00:52:54,606 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:52:54,882 INFO L116 PetriNetUnfolderBase]: 392/552 cut-off events. [2025-04-14 00:52:54,883 INFO L117 PetriNetUnfolderBase]: For 51/51 co-relation queries the response was YES. [2025-04-14 00:52:54,885 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1267 conditions, 552 events. 392/552 cut-off events. For 51/51 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 1732 event pairs, 48 based on Foata normal form. 0/322 useless extension candidates. Maximal degree in co-relation 550. Up to 296 conditions per place. [2025-04-14 00:52:54,888 INFO L140 encePairwiseOnDemand]: 15/32 looper letters, 61 selfloop transitions, 26 changer transitions 5/92 dead transitions. [2025-04-14 00:52:54,888 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 92 transitions, 436 flow [2025-04-14 00:52:54,889 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 00:52:54,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 00:52:54,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 98 transitions. [2025-04-14 00:52:54,892 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6125 [2025-04-14 00:52:54,892 INFO L175 Difference]: Start difference. First operand has 25 places, 33 transitions, 101 flow. Second operand 5 states and 98 transitions. [2025-04-14 00:52:54,892 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 92 transitions, 436 flow [2025-04-14 00:52:54,894 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 92 transitions, 425 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-14 00:52:54,896 INFO L231 Difference]: Finished difference. Result has 31 places, 55 transitions, 267 flow [2025-04-14 00:52:54,896 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=267, PETRI_PLACES=31, PETRI_TRANSITIONS=55} [2025-04-14 00:52:54,897 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 5 predicate places. [2025-04-14 00:52:54,897 INFO L485 AbstractCegarLoop]: Abstraction has has 31 places, 55 transitions, 267 flow [2025-04-14 00:52:54,897 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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:52:54,897 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:52:54,897 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:52:54,897 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-14 00:52:54,897 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:52:54,897 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:52:54,898 INFO L85 PathProgramCache]: Analyzing trace with hash 1555026403, now seen corresponding path program 2 times [2025-04-14 00:52:54,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:52:54,898 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957194694] [2025-04-14 00:52:54,898 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:52:54,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:52:54,907 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 1 equivalence classes. [2025-04-14 00:52:54,922 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-14 00:52:54,922 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 00:52:54,922 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:52:55,015 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:52:55,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:52:55,015 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957194694] [2025-04-14 00:52:55,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957194694] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:52:55,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:52:55,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 00:52:55,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725385619] [2025-04-14 00:52:55,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:52:55,016 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 00:52:55,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:52:55,016 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 00:52:55,016 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-14 00:52:55,016 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 32 [2025-04-14 00:52:55,016 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 55 transitions, 267 flow. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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:52:55,016 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:52:55,017 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 32 [2025-04-14 00:52:55,017 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:52:55,173 INFO L116 PetriNetUnfolderBase]: 375/534 cut-off events. [2025-04-14 00:52:55,173 INFO L117 PetriNetUnfolderBase]: For 259/259 co-relation queries the response was YES. [2025-04-14 00:52:55,174 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1734 conditions, 534 events. 375/534 cut-off events. For 259/259 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 1709 event pairs, 13 based on Foata normal form. 14/412 useless extension candidates. Maximal degree in co-relation 674. Up to 247 conditions per place. [2025-04-14 00:52:55,177 INFO L140 encePairwiseOnDemand]: 16/32 looper letters, 57 selfloop transitions, 31 changer transitions 4/92 dead transitions. [2025-04-14 00:52:55,177 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 92 transitions, 598 flow [2025-04-14 00:52:55,178 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 00:52:55,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 00:52:55,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 83 transitions. [2025-04-14 00:52:55,179 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.51875 [2025-04-14 00:52:55,179 INFO L175 Difference]: Start difference. First operand has 31 places, 55 transitions, 267 flow. Second operand 5 states and 83 transitions. [2025-04-14 00:52:55,179 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 92 transitions, 598 flow [2025-04-14 00:52:55,181 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 92 transitions, 598 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-14 00:52:55,182 INFO L231 Difference]: Finished difference. Result has 38 places, 64 transitions, 448 flow [2025-04-14 00:52:55,182 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=251, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=448, PETRI_PLACES=38, PETRI_TRANSITIONS=64} [2025-04-14 00:52:55,183 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 12 predicate places. [2025-04-14 00:52:55,183 INFO L485 AbstractCegarLoop]: Abstraction has has 38 places, 64 transitions, 448 flow [2025-04-14 00:52:55,183 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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:52:55,184 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:52:55,184 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:52:55,184 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-14 00:52:55,184 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:52:55,184 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:52:55,185 INFO L85 PathProgramCache]: Analyzing trace with hash 1281900817, now seen corresponding path program 1 times [2025-04-14 00:52:55,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:52:55,185 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878092505] [2025-04-14 00:52:55,185 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:52:55,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:52:55,190 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-14 00:52:55,199 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-14 00:52:55,199 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:52:55,199 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:52:55,278 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:52:55,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:52:55,278 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878092505] [2025-04-14 00:52:55,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878092505] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:52:55,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:52:55,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 00:52:55,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723784878] [2025-04-14 00:52:55,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:52:55,279 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 00:52:55,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:52:55,279 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 00:52:55,279 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-14 00:52:55,279 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 32 [2025-04-14 00:52:55,281 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 64 transitions, 448 flow. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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:52:55,281 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:52:55,281 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 32 [2025-04-14 00:52:55,281 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:52:55,437 INFO L116 PetriNetUnfolderBase]: 389/552 cut-off events. [2025-04-14 00:52:55,437 INFO L117 PetriNetUnfolderBase]: For 758/758 co-relation queries the response was YES. [2025-04-14 00:52:55,438 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2258 conditions, 552 events. 389/552 cut-off events. For 758/758 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 1735 event pairs, 40 based on Foata normal form. 2/433 useless extension candidates. Maximal degree in co-relation 887. Up to 305 conditions per place. [2025-04-14 00:52:55,441 INFO L140 encePairwiseOnDemand]: 16/32 looper letters, 68 selfloop transitions, 31 changer transitions 0/99 dead transitions. [2025-04-14 00:52:55,441 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 99 transitions, 822 flow [2025-04-14 00:52:55,441 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 00:52:55,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 00:52:55,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 87 transitions. [2025-04-14 00:52:55,444 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.54375 [2025-04-14 00:52:55,444 INFO L175 Difference]: Start difference. First operand has 38 places, 64 transitions, 448 flow. Second operand 5 states and 87 transitions. [2025-04-14 00:52:55,444 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 99 transitions, 822 flow [2025-04-14 00:52:55,449 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 99 transitions, 803 flow, removed 3 selfloop flow, removed 1 redundant places. [2025-04-14 00:52:55,450 INFO L231 Difference]: Finished difference. Result has 43 places, 75 transitions, 629 flow [2025-04-14 00:52:55,451 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=431, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=629, PETRI_PLACES=43, PETRI_TRANSITIONS=75} [2025-04-14 00:52:55,451 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 17 predicate places. [2025-04-14 00:52:55,451 INFO L485 AbstractCegarLoop]: Abstraction has has 43 places, 75 transitions, 629 flow [2025-04-14 00:52:55,451 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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:52:55,451 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:52:55,451 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:52:55,451 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-14 00:52:55,452 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:52:55,452 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:52:55,452 INFO L85 PathProgramCache]: Analyzing trace with hash -444923091, now seen corresponding path program 2 times [2025-04-14 00:52:55,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:52:55,452 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571776950] [2025-04-14 00:52:55,452 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:52:55,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:52:55,460 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 1 equivalence classes. [2025-04-14 00:52:55,466 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-14 00:52:55,466 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 00:52:55,466 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:52:55,531 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:52:55,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:52:55,532 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571776950] [2025-04-14 00:52:55,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [571776950] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:52:55,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:52:55,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 00:52:55,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009994116] [2025-04-14 00:52:55,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:52:55,532 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 00:52:55,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:52:55,533 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 00:52:55,533 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-14 00:52:55,533 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 32 [2025-04-14 00:52:55,533 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 75 transitions, 629 flow. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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:52:55,533 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:52:55,533 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 32 [2025-04-14 00:52:55,533 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:52:55,714 INFO L116 PetriNetUnfolderBase]: 370/534 cut-off events. [2025-04-14 00:52:55,714 INFO L117 PetriNetUnfolderBase]: For 1356/1356 co-relation queries the response was YES. [2025-04-14 00:52:55,715 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2329 conditions, 534 events. 370/534 cut-off events. For 1356/1356 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1658 event pairs, 15 based on Foata normal form. 19/433 useless extension candidates. Maximal degree in co-relation 1567. Up to 245 conditions per place. [2025-04-14 00:52:55,719 INFO L140 encePairwiseOnDemand]: 17/32 looper letters, 70 selfloop transitions, 22 changer transitions 1/93 dead transitions. [2025-04-14 00:52:55,719 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 93 transitions, 852 flow [2025-04-14 00:52:55,719 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 00:52:55,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 00:52:55,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 80 transitions. [2025-04-14 00:52:55,721 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5 [2025-04-14 00:52:55,721 INFO L175 Difference]: Start difference. First operand has 43 places, 75 transitions, 629 flow. Second operand 5 states and 80 transitions. [2025-04-14 00:52:55,724 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 93 transitions, 852 flow [2025-04-14 00:52:55,729 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 93 transitions, 821 flow, removed 10 selfloop flow, removed 1 redundant places. [2025-04-14 00:52:55,736 INFO L231 Difference]: Finished difference. Result has 47 places, 69 transitions, 588 flow [2025-04-14 00:52:55,737 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=508, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=588, PETRI_PLACES=47, PETRI_TRANSITIONS=69} [2025-04-14 00:52:55,737 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 21 predicate places. [2025-04-14 00:52:55,737 INFO L485 AbstractCegarLoop]: Abstraction has has 47 places, 69 transitions, 588 flow [2025-04-14 00:52:55,737 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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:52:55,737 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:52:55,738 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:52:55,738 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-14 00:52:55,738 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:52:55,738 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:52:55,738 INFO L85 PathProgramCache]: Analyzing trace with hash -386751202, now seen corresponding path program 1 times [2025-04-14 00:52:55,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:52:55,738 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786389927] [2025-04-14 00:52:55,738 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:52:55,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:52:55,747 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-14 00:52:55,787 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-14 00:52:55,787 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:52:55,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:52:55,992 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:52:55,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:52:55,992 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786389927] [2025-04-14 00:52:55,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [786389927] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:52:55,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:52:55,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-14 00:52:55,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807734040] [2025-04-14 00:52:55,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:52:55,993 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 00:52:55,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:52:55,993 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 00:52:55,993 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-14 00:52:55,993 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 32 [2025-04-14 00:52:55,994 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 69 transitions, 588 flow. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 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:52:55,994 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:52:55,994 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 32 [2025-04-14 00:52:55,994 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:52:56,178 INFO L116 PetriNetUnfolderBase]: 457/659 cut-off events. [2025-04-14 00:52:56,178 INFO L117 PetriNetUnfolderBase]: For 1933/1933 co-relation queries the response was YES. [2025-04-14 00:52:56,180 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3160 conditions, 659 events. 457/659 cut-off events. For 1933/1933 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2138 event pairs, 12 based on Foata normal form. 36/539 useless extension candidates. Maximal degree in co-relation 1707. Up to 460 conditions per place. [2025-04-14 00:52:56,185 INFO L140 encePairwiseOnDemand]: 17/32 looper letters, 83 selfloop transitions, 25 changer transitions 0/108 dead transitions. [2025-04-14 00:52:56,186 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 108 transitions, 1080 flow [2025-04-14 00:52:56,186 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 00:52:56,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 00:52:56,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 73 transitions. [2025-04-14 00:52:56,187 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.45625 [2025-04-14 00:52:56,187 INFO L175 Difference]: Start difference. First operand has 47 places, 69 transitions, 588 flow. Second operand 5 states and 73 transitions. [2025-04-14 00:52:56,187 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 108 transitions, 1080 flow [2025-04-14 00:52:56,191 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 108 transitions, 1031 flow, removed 3 selfloop flow, removed 3 redundant places. [2025-04-14 00:52:56,193 INFO L231 Difference]: Finished difference. Result has 50 places, 85 transitions, 803 flow [2025-04-14 00:52:56,194 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=552, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=803, PETRI_PLACES=50, PETRI_TRANSITIONS=85} [2025-04-14 00:52:56,196 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 24 predicate places. [2025-04-14 00:52:56,196 INFO L485 AbstractCegarLoop]: Abstraction has has 50 places, 85 transitions, 803 flow [2025-04-14 00:52:56,196 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 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:52:56,196 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:52:56,197 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:52:56,197 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-14 00:52:56,197 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:52:56,197 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:52:56,197 INFO L85 PathProgramCache]: Analyzing trace with hash 1563842538, now seen corresponding path program 2 times [2025-04-14 00:52:56,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:52:56,197 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811732874] [2025-04-14 00:52:56,197 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:52:56,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:52:56,205 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 1 equivalence classes. [2025-04-14 00:52:56,221 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-14 00:52:56,221 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 00:52:56,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:52:56,343 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:52:56,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:52:56,344 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811732874] [2025-04-14 00:52:56,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811732874] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:52:56,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:52:56,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 00:52:56,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384059988] [2025-04-14 00:52:56,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:52:56,344 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 00:52:56,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:52:56,345 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 00:52:56,345 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-14 00:52:56,345 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 32 [2025-04-14 00:52:56,345 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 85 transitions, 803 flow. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:52:56,345 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:52:56,345 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 32 [2025-04-14 00:52:56,345 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:52:56,498 INFO L116 PetriNetUnfolderBase]: 513/748 cut-off events. [2025-04-14 00:52:56,499 INFO L117 PetriNetUnfolderBase]: For 2420/2420 co-relation queries the response was YES. [2025-04-14 00:52:56,502 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3744 conditions, 748 events. 513/748 cut-off events. For 2420/2420 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 2453 event pairs, 38 based on Foata normal form. 32/601 useless extension candidates. Maximal degree in co-relation 3445. Up to 405 conditions per place. [2025-04-14 00:52:56,508 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 91 selfloop transitions, 13 changer transitions 0/104 dead transitions. [2025-04-14 00:52:56,508 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 104 transitions, 1143 flow [2025-04-14 00:52:56,509 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 00:52:56,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-14 00:52:56,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 59 transitions. [2025-04-14 00:52:56,509 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4609375 [2025-04-14 00:52:56,509 INFO L175 Difference]: Start difference. First operand has 50 places, 85 transitions, 803 flow. Second operand 4 states and 59 transitions. [2025-04-14 00:52:56,509 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 104 transitions, 1143 flow [2025-04-14 00:52:56,515 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 104 transitions, 1113 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-04-14 00:52:56,519 INFO L231 Difference]: Finished difference. Result has 52 places, 87 transitions, 841 flow [2025-04-14 00:52:56,520 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=753, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=841, PETRI_PLACES=52, PETRI_TRANSITIONS=87} [2025-04-14 00:52:56,521 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 26 predicate places. [2025-04-14 00:52:56,521 INFO L485 AbstractCegarLoop]: Abstraction has has 52 places, 87 transitions, 841 flow [2025-04-14 00:52:56,521 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:52:56,521 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:52:56,521 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:52:56,521 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-14 00:52:56,521 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:52:56,522 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:52:56,522 INFO L85 PathProgramCache]: Analyzing trace with hash -1319147245, now seen corresponding path program 1 times [2025-04-14 00:52:56,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:52:56,522 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998575805] [2025-04-14 00:52:56,522 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:52:56,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:52:56,535 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-14 00:52:56,546 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-14 00:52:56,547 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:52:56,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:52:56,647 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:52:56,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:52:56,647 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998575805] [2025-04-14 00:52:56,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998575805] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:52:56,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:52:56,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 00:52:56,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829540617] [2025-04-14 00:52:56,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:52:56,648 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 00:52:56,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:52:56,648 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 00:52:56,648 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 00:52:56,648 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 32 [2025-04-14 00:52:56,649 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 87 transitions, 841 flow. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:52:56,649 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:52:56,649 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 32 [2025-04-14 00:52:56,649 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:52:56,796 INFO L116 PetriNetUnfolderBase]: 647/938 cut-off events. [2025-04-14 00:52:56,796 INFO L117 PetriNetUnfolderBase]: For 3795/3795 co-relation queries the response was YES. [2025-04-14 00:52:56,798 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4994 conditions, 938 events. 647/938 cut-off events. For 3795/3795 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 3255 event pairs, 144 based on Foata normal form. 0/735 useless extension candidates. Maximal degree in co-relation 4515. Up to 612 conditions per place. [2025-04-14 00:52:56,802 INFO L140 encePairwiseOnDemand]: 26/32 looper letters, 106 selfloop transitions, 20 changer transitions 0/126 dead transitions. [2025-04-14 00:52:56,802 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 126 transitions, 1499 flow [2025-04-14 00:52:56,802 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 00:52:56,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-14 00:52:56,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 48 transitions. [2025-04-14 00:52:56,803 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5 [2025-04-14 00:52:56,803 INFO L175 Difference]: Start difference. First operand has 52 places, 87 transitions, 841 flow. Second operand 3 states and 48 transitions. [2025-04-14 00:52:56,803 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 126 transitions, 1499 flow [2025-04-14 00:52:56,807 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 126 transitions, 1481 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-14 00:52:56,808 INFO L231 Difference]: Finished difference. Result has 53 places, 96 transitions, 1008 flow [2025-04-14 00:52:56,808 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=827, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1008, PETRI_PLACES=53, PETRI_TRANSITIONS=96} [2025-04-14 00:52:56,809 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 27 predicate places. [2025-04-14 00:52:56,809 INFO L485 AbstractCegarLoop]: Abstraction has has 53 places, 96 transitions, 1008 flow [2025-04-14 00:52:56,809 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:52:56,809 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:52:56,809 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:52:56,809 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-14 00:52:56,809 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:52:56,809 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:52:56,810 INFO L85 PathProgramCache]: Analyzing trace with hash -500766273, now seen corresponding path program 1 times [2025-04-14 00:52:56,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:52:56,810 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959414818] [2025-04-14 00:52:56,810 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:52:56,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:52:56,815 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-14 00:52:56,822 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-14 00:52:56,823 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:52:56,823 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:52:56,921 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:52:56,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:52:56,921 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959414818] [2025-04-14 00:52:56,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959414818] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:52:56,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:52:56,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 00:52:56,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10991403] [2025-04-14 00:52:56,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:52:56,922 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 00:52:56,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:52:56,922 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 00:52:56,922 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-14 00:52:56,922 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 32 [2025-04-14 00:52:56,922 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 96 transitions, 1008 flow. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 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:52:56,922 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:52:56,922 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 32 [2025-04-14 00:52:56,922 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:52:57,098 INFO L116 PetriNetUnfolderBase]: 731/1062 cut-off events. [2025-04-14 00:52:57,098 INFO L117 PetriNetUnfolderBase]: For 7167/7167 co-relation queries the response was YES. [2025-04-14 00:52:57,101 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5814 conditions, 1062 events. 731/1062 cut-off events. For 7167/7167 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 3821 event pairs, 79 based on Foata normal form. 32/948 useless extension candidates. Maximal degree in co-relation 5281. Up to 627 conditions per place. [2025-04-14 00:52:57,106 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 84 selfloop transitions, 33 changer transitions 0/117 dead transitions. [2025-04-14 00:52:57,106 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 117 transitions, 1396 flow [2025-04-14 00:52:57,106 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 00:52:57,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-14 00:52:57,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 60 transitions. [2025-04-14 00:52:57,107 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.46875 [2025-04-14 00:52:57,107 INFO L175 Difference]: Start difference. First operand has 53 places, 96 transitions, 1008 flow. Second operand 4 states and 60 transitions. [2025-04-14 00:52:57,107 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 117 transitions, 1396 flow [2025-04-14 00:52:57,114 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 117 transitions, 1372 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-14 00:52:57,115 INFO L231 Difference]: Finished difference. Result has 56 places, 100 transitions, 1150 flow [2025-04-14 00:52:57,115 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=944, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1150, PETRI_PLACES=56, PETRI_TRANSITIONS=100} [2025-04-14 00:52:57,116 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 30 predicate places. [2025-04-14 00:52:57,116 INFO L485 AbstractCegarLoop]: Abstraction has has 56 places, 100 transitions, 1150 flow [2025-04-14 00:52:57,116 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 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:52:57,116 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:52:57,116 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:52:57,116 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-14 00:52:57,116 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:52:57,117 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:52:57,117 INFO L85 PathProgramCache]: Analyzing trace with hash -1807494718, now seen corresponding path program 1 times [2025-04-14 00:52:57,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:52:57,117 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415809869] [2025-04-14 00:52:57,117 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:52:57,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:52:57,123 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-14 00:52:57,135 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-14 00:52:57,138 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:52:57,139 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:52:57,203 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:52:57,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:52:57,203 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415809869] [2025-04-14 00:52:57,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415809869] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:52:57,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:52:57,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 00:52:57,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672663205] [2025-04-14 00:52:57,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:52:57,204 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 00:52:57,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:52:57,204 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 00:52:57,204 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 00:52:57,204 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 32 [2025-04-14 00:52:57,204 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 100 transitions, 1150 flow. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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:52:57,204 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:52:57,204 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 32 [2025-04-14 00:52:57,204 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:52:57,321 INFO L116 PetriNetUnfolderBase]: 669/1000 cut-off events. [2025-04-14 00:52:57,322 INFO L117 PetriNetUnfolderBase]: For 6381/6381 co-relation queries the response was YES. [2025-04-14 00:52:57,324 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5633 conditions, 1000 events. 669/1000 cut-off events. For 6381/6381 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 3747 event pairs, 170 based on Foata normal form. 0/852 useless extension candidates. Maximal degree in co-relation 5117. Up to 637 conditions per place. [2025-04-14 00:52:57,328 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 86 selfloop transitions, 25 changer transitions 0/111 dead transitions. [2025-04-14 00:52:57,328 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 111 transitions, 1438 flow [2025-04-14 00:52:57,329 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 00:52:57,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-14 00:52:57,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 43 transitions. [2025-04-14 00:52:57,329 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4479166666666667 [2025-04-14 00:52:57,329 INFO L175 Difference]: Start difference. First operand has 56 places, 100 transitions, 1150 flow. Second operand 3 states and 43 transitions. [2025-04-14 00:52:57,329 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 111 transitions, 1438 flow [2025-04-14 00:52:57,335 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 111 transitions, 1391 flow, removed 10 selfloop flow, removed 2 redundant places. [2025-04-14 00:52:57,337 INFO L231 Difference]: Finished difference. Result has 56 places, 91 transitions, 1028 flow [2025-04-14 00:52:57,337 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=978, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1028, PETRI_PLACES=56, PETRI_TRANSITIONS=91} [2025-04-14 00:52:57,338 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 30 predicate places. [2025-04-14 00:52:57,338 INFO L485 AbstractCegarLoop]: Abstraction has has 56 places, 91 transitions, 1028 flow [2025-04-14 00:52:57,338 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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:52:57,338 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:52:57,338 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:52:57,338 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-14 00:52:57,338 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:52:57,338 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:52:57,339 INFO L85 PathProgramCache]: Analyzing trace with hash -1295995731, now seen corresponding path program 1 times [2025-04-14 00:52:57,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:52:57,339 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112732574] [2025-04-14 00:52:57,339 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:52:57,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:52:57,344 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-14 00:52:57,356 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-14 00:52:57,356 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:52:57,356 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:52:57,449 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:52:57,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:52:57,450 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112732574] [2025-04-14 00:52:57,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112732574] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:52:57,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:52:57,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 00:52:57,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388170650] [2025-04-14 00:52:57,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:52:57,450 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 00:52:57,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:52:57,451 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 00:52:57,451 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 00:52:57,451 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 32 [2025-04-14 00:52:57,451 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 91 transitions, 1028 flow. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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:52:57,451 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:52:57,451 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 32 [2025-04-14 00:52:57,451 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:52:57,595 INFO L116 PetriNetUnfolderBase]: 605/936 cut-off events. [2025-04-14 00:52:57,595 INFO L117 PetriNetUnfolderBase]: For 7430/7430 co-relation queries the response was YES. [2025-04-14 00:52:57,597 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5037 conditions, 936 events. 605/936 cut-off events. For 7430/7430 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 3631 event pairs, 165 based on Foata normal form. 0/936 useless extension candidates. Maximal degree in co-relation 4621. Up to 590 conditions per place. [2025-04-14 00:52:57,600 INFO L140 encePairwiseOnDemand]: 28/32 looper letters, 94 selfloop transitions, 18 changer transitions 0/112 dead transitions. [2025-04-14 00:52:57,600 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 112 transitions, 1478 flow [2025-04-14 00:52:57,601 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 00:52:57,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-14 00:52:57,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 45 transitions. [2025-04-14 00:52:57,601 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.46875 [2025-04-14 00:52:57,602 INFO L175 Difference]: Start difference. First operand has 56 places, 91 transitions, 1028 flow. Second operand 3 states and 45 transitions. [2025-04-14 00:52:57,602 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 112 transitions, 1478 flow [2025-04-14 00:52:57,607 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 112 transitions, 1402 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-14 00:52:57,609 INFO L231 Difference]: Finished difference. Result has 56 places, 85 transitions, 931 flow [2025-04-14 00:52:57,609 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=895, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=931, PETRI_PLACES=56, PETRI_TRANSITIONS=85} [2025-04-14 00:52:57,609 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 30 predicate places. [2025-04-14 00:52:57,609 INFO L485 AbstractCegarLoop]: Abstraction has has 56 places, 85 transitions, 931 flow [2025-04-14 00:52:57,610 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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:52:57,610 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:52:57,610 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:52:57,611 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-14 00:52:57,611 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:52:57,611 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:52:57,611 INFO L85 PathProgramCache]: Analyzing trace with hash 1981959419, now seen corresponding path program 1 times [2025-04-14 00:52:57,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:52:57,612 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512841772] [2025-04-14 00:52:57,612 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:52:57,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:52:57,619 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-14 00:52:57,631 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-14 00:52:57,632 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:52:57,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:52:57,751 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:52:57,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:52:57,752 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512841772] [2025-04-14 00:52:57,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [512841772] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:52:57,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:52:57,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-14 00:52:57,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871165703] [2025-04-14 00:52:57,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:52:57,752 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-14 00:52:57,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:52:57,753 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-14 00:52:57,753 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-14 00:52:57,753 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 32 [2025-04-14 00:52:57,753 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 85 transitions, 931 flow. Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 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:52:57,753 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:52:57,753 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 32 [2025-04-14 00:52:57,753 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:52:58,133 INFO L116 PetriNetUnfolderBase]: 1310/2086 cut-off events. [2025-04-14 00:52:58,134 INFO L117 PetriNetUnfolderBase]: For 15331/15331 co-relation queries the response was YES. [2025-04-14 00:52:58,138 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10583 conditions, 2086 events. 1310/2086 cut-off events. For 15331/15331 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 9966 event pairs, 198 based on Foata normal form. 1/1933 useless extension candidates. Maximal degree in co-relation 9224. Up to 902 conditions per place. [2025-04-14 00:52:58,148 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 212 selfloop transitions, 22 changer transitions 7/241 dead transitions. [2025-04-14 00:52:58,148 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 241 transitions, 3081 flow [2025-04-14 00:52:58,149 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 00:52:58,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-14 00:52:58,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 106 transitions. [2025-04-14 00:52:58,150 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5520833333333334 [2025-04-14 00:52:58,150 INFO L175 Difference]: Start difference. First operand has 56 places, 85 transitions, 931 flow. Second operand 6 states and 106 transitions. [2025-04-14 00:52:58,150 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 241 transitions, 3081 flow [2025-04-14 00:52:58,160 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 241 transitions, 2943 flow, removed 13 selfloop flow, removed 2 redundant places. [2025-04-14 00:52:58,164 INFO L231 Difference]: Finished difference. Result has 60 places, 98 transitions, 1008 flow [2025-04-14 00:52:58,164 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=887, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1008, PETRI_PLACES=60, PETRI_TRANSITIONS=98} [2025-04-14 00:52:58,165 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 34 predicate places. [2025-04-14 00:52:58,165 INFO L485 AbstractCegarLoop]: Abstraction has has 60 places, 98 transitions, 1008 flow [2025-04-14 00:52:58,165 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 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:52:58,165 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:52:58,165 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:52:58,166 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-14 00:52:58,166 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:52:58,166 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:52:58,166 INFO L85 PathProgramCache]: Analyzing trace with hash -920627489, now seen corresponding path program 1 times [2025-04-14 00:52:58,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:52:58,166 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594514569] [2025-04-14 00:52:58,166 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:52:58,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:52:58,174 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-14 00:52:58,189 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-14 00:52:58,189 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:52:58,193 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:52:58,314 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:52:58,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:52:58,315 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594514569] [2025-04-14 00:52:58,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [594514569] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:52:58,315 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1459346952] [2025-04-14 00:52:58,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:52:58,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:52:58,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:52:58,318 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:52:58,319 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:52:58,353 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-14 00:52:58,366 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-14 00:52:58,366 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:52:58,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:52:58,368 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-04-14 00:52:58,370 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:52:58,439 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:52:58,439 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:52:58,488 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:52:58,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1459346952] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:52:58,489 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:52:58,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 4 [2025-04-14 00:52:58,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897750887] [2025-04-14 00:52:58,489 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:52:58,489 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 00:52:58,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:52:58,490 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 00:52:58,490 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-14 00:52:58,490 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 32 [2025-04-14 00:52:58,490 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 98 transitions, 1008 flow. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:52:58,490 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:52:58,490 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 32 [2025-04-14 00:52:58,490 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:52:58,761 INFO L116 PetriNetUnfolderBase]: 1504/2429 cut-off events. [2025-04-14 00:52:58,761 INFO L117 PetriNetUnfolderBase]: For 15772/15772 co-relation queries the response was YES. [2025-04-14 00:52:58,767 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12382 conditions, 2429 events. 1504/2429 cut-off events. For 15772/15772 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 12216 event pairs, 217 based on Foata normal form. 1/2221 useless extension candidates. Maximal degree in co-relation 10758. Up to 1775 conditions per place. [2025-04-14 00:52:58,776 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 157 selfloop transitions, 24 changer transitions 5/186 dead transitions. [2025-04-14 00:52:58,776 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 186 transitions, 2154 flow [2025-04-14 00:52:58,778 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 00:52:58,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 00:52:58,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 84 transitions. [2025-04-14 00:52:58,778 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.525 [2025-04-14 00:52:58,778 INFO L175 Difference]: Start difference. First operand has 60 places, 98 transitions, 1008 flow. Second operand 5 states and 84 transitions. [2025-04-14 00:52:58,778 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 186 transitions, 2154 flow [2025-04-14 00:52:58,788 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 186 transitions, 2106 flow, removed 24 selfloop flow, removed 0 redundant places. [2025-04-14 00:52:58,790 INFO L231 Difference]: Finished difference. Result has 67 places, 113 transitions, 1161 flow [2025-04-14 00:52:58,790 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=982, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1161, PETRI_PLACES=67, PETRI_TRANSITIONS=113} [2025-04-14 00:52:58,791 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 41 predicate places. [2025-04-14 00:52:58,791 INFO L485 AbstractCegarLoop]: Abstraction has has 67 places, 113 transitions, 1161 flow [2025-04-14 00:52:58,791 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:52:58,791 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:52:58,791 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:52:58,798 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-04-14 00:52:58,995 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-04-14 00:52:58,995 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:52:58,995 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:52:58,995 INFO L85 PathProgramCache]: Analyzing trace with hash -586898317, now seen corresponding path program 2 times [2025-04-14 00:52:58,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:52:58,996 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844508669] [2025-04-14 00:52:58,996 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:52:58,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:52:59,002 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 1 equivalence classes. [2025-04-14 00:52:59,015 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-14 00:52:59,015 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 00:52:59,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:52:59,147 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:52:59,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:52:59,148 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844508669] [2025-04-14 00:52:59,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844508669] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:52:59,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:52:59,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-14 00:52:59,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249902061] [2025-04-14 00:52:59,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:52:59,148 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-14 00:52:59,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:52:59,149 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-14 00:52:59,149 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-14 00:52:59,149 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 32 [2025-04-14 00:52:59,149 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 113 transitions, 1161 flow. Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 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:52:59,149 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:52:59,149 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 32 [2025-04-14 00:52:59,149 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:52:59,654 INFO L116 PetriNetUnfolderBase]: 2306/3708 cut-off events. [2025-04-14 00:52:59,655 INFO L117 PetriNetUnfolderBase]: For 25356/25356 co-relation queries the response was YES. [2025-04-14 00:52:59,662 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19001 conditions, 3708 events. 2306/3708 cut-off events. For 25356/25356 co-relation queries the response was YES. Maximal size of possible extension queue 222. Compared 20661 event pairs, 260 based on Foata normal form. 1/3385 useless extension candidates. Maximal degree in co-relation 16253. Up to 1692 conditions per place. [2025-04-14 00:52:59,673 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 256 selfloop transitions, 39 changer transitions 8/303 dead transitions. [2025-04-14 00:52:59,673 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 303 transitions, 3716 flow [2025-04-14 00:52:59,674 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 00:52:59,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-14 00:52:59,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 121 transitions. [2025-04-14 00:52:59,674 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6302083333333334 [2025-04-14 00:52:59,674 INFO L175 Difference]: Start difference. First operand has 67 places, 113 transitions, 1161 flow. Second operand 6 states and 121 transitions. [2025-04-14 00:52:59,674 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 303 transitions, 3716 flow [2025-04-14 00:52:59,689 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 303 transitions, 3702 flow, removed 7 selfloop flow, removed 0 redundant places. [2025-04-14 00:52:59,691 INFO L231 Difference]: Finished difference. Result has 73 places, 128 transitions, 1351 flow [2025-04-14 00:52:59,691 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1147, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1351, PETRI_PLACES=73, PETRI_TRANSITIONS=128} [2025-04-14 00:52:59,691 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 47 predicate places. [2025-04-14 00:52:59,692 INFO L485 AbstractCegarLoop]: Abstraction has has 73 places, 128 transitions, 1351 flow [2025-04-14 00:52:59,692 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 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:52:59,692 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:52:59,692 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:52:59,692 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-04-14 00:52:59,692 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:52:59,692 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:52:59,692 INFO L85 PathProgramCache]: Analyzing trace with hash -1806294109, now seen corresponding path program 1 times [2025-04-14 00:52:59,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:52:59,692 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122731254] [2025-04-14 00:52:59,692 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:52:59,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:52:59,697 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-14 00:52:59,704 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-14 00:52:59,704 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:52:59,704 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:52:59,816 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:52:59,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:52:59,816 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122731254] [2025-04-14 00:52:59,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122731254] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:52:59,816 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [465618656] [2025-04-14 00:52:59,816 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:52:59,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:52:59,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:52:59,818 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:52:59,820 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:52:59,851 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-14 00:52:59,865 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-14 00:52:59,865 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:52:59,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:52:59,866 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-04-14 00:52:59,867 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:52:59,926 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:52:59,926 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:53:00,026 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:00,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [465618656] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:53:00,027 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:53:00,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 4 [2025-04-14 00:53:00,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449224134] [2025-04-14 00:53:00,027 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:53:00,027 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 00:53:00,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:53:00,027 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 00:53:00,028 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-14 00:53:00,028 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 32 [2025-04-14 00:53:00,028 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 128 transitions, 1351 flow. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:53:00,028 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:53:00,028 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 32 [2025-04-14 00:53:00,028 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:53:00,619 INFO L116 PetriNetUnfolderBase]: 2599/4200 cut-off events. [2025-04-14 00:53:00,619 INFO L117 PetriNetUnfolderBase]: For 30151/30151 co-relation queries the response was YES. [2025-04-14 00:53:00,627 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22241 conditions, 4200 events. 2599/4200 cut-off events. For 30151/30151 co-relation queries the response was YES. Maximal size of possible extension queue 258. Compared 24064 event pairs, 350 based on Foata normal form. 1/3831 useless extension candidates. Maximal degree in co-relation 18897. Up to 3549 conditions per place. [2025-04-14 00:53:00,639 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 191 selfloop transitions, 29 changer transitions 5/225 dead transitions. [2025-04-14 00:53:00,639 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 225 transitions, 2694 flow [2025-04-14 00:53:00,639 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 00:53:00,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 00:53:00,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 84 transitions. [2025-04-14 00:53:00,641 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.525 [2025-04-14 00:53:00,641 INFO L175 Difference]: Start difference. First operand has 73 places, 128 transitions, 1351 flow. Second operand 5 states and 84 transitions. [2025-04-14 00:53:00,641 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 225 transitions, 2694 flow [2025-04-14 00:53:00,662 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 225 transitions, 2628 flow, removed 33 selfloop flow, removed 0 redundant places. [2025-04-14 00:53:00,664 INFO L231 Difference]: Finished difference. Result has 80 places, 148 transitions, 1571 flow [2025-04-14 00:53:00,665 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1317, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1571, PETRI_PLACES=80, PETRI_TRANSITIONS=148} [2025-04-14 00:53:00,666 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 54 predicate places. [2025-04-14 00:53:00,666 INFO L485 AbstractCegarLoop]: Abstraction has has 80 places, 148 transitions, 1571 flow [2025-04-14 00:53:00,666 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:53:00,666 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:53:00,666 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:00,672 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-04-14 00:53:00,866 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,SelfDestructingSolverStorable14 [2025-04-14 00:53:00,867 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:53:00,867 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:53:00,867 INFO L85 PathProgramCache]: Analyzing trace with hash 1698399083, now seen corresponding path program 2 times [2025-04-14 00:53:00,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:53:00,867 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359668774] [2025-04-14 00:53:00,867 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:53:00,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:53:00,871 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 1 equivalence classes. [2025-04-14 00:53:00,877 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-14 00:53:00,880 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 00:53:00,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:53:00,961 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:00,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:53:00,961 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359668774] [2025-04-14 00:53:00,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359668774] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:53:00,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:53:00,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-14 00:53:00,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726990003] [2025-04-14 00:53:00,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:53:00,961 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-14 00:53:00,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:53:00,962 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-14 00:53:00,962 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-14 00:53:00,962 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 32 [2025-04-14 00:53:00,962 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 148 transitions, 1571 flow. Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 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:00,962 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:53:00,962 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 32 [2025-04-14 00:53:00,962 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:53:01,587 INFO L116 PetriNetUnfolderBase]: 3737/6054 cut-off events. [2025-04-14 00:53:01,588 INFO L117 PetriNetUnfolderBase]: For 45687/45687 co-relation queries the response was YES. [2025-04-14 00:53:01,604 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32140 conditions, 6054 events. 3737/6054 cut-off events. For 45687/45687 co-relation queries the response was YES. Maximal size of possible extension queue 375. Compared 37348 event pairs, 523 based on Foata normal form. 1/5568 useless extension candidates. Maximal degree in co-relation 26980. Up to 3038 conditions per place. [2025-04-14 00:53:01,630 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 272 selfloop transitions, 71 changer transitions 8/351 dead transitions. [2025-04-14 00:53:01,630 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 351 transitions, 4372 flow [2025-04-14 00:53:01,632 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 00:53:01,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-14 00:53:01,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 116 transitions. [2025-04-14 00:53:01,632 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6041666666666666 [2025-04-14 00:53:01,632 INFO L175 Difference]: Start difference. First operand has 80 places, 148 transitions, 1571 flow. Second operand 6 states and 116 transitions. [2025-04-14 00:53:01,633 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 351 transitions, 4372 flow [2025-04-14 00:53:01,720 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 351 transitions, 4362 flow, removed 5 selfloop flow, removed 0 redundant places. [2025-04-14 00:53:01,725 INFO L231 Difference]: Finished difference. Result has 89 places, 181 transitions, 2127 flow [2025-04-14 00:53:01,725 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1561, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2127, PETRI_PLACES=89, PETRI_TRANSITIONS=181} [2025-04-14 00:53:01,725 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 63 predicate places. [2025-04-14 00:53:01,726 INFO L485 AbstractCegarLoop]: Abstraction has has 89 places, 181 transitions, 2127 flow [2025-04-14 00:53:01,726 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 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:01,726 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:53:01,726 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:01,726 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-04-14 00:53:01,726 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:53:01,727 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:53:01,727 INFO L85 PathProgramCache]: Analyzing trace with hash -1731750087, now seen corresponding path program 1 times [2025-04-14 00:53:01,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:53:01,727 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214122754] [2025-04-14 00:53:01,727 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:53:01,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:53:01,734 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-14 00:53:01,746 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-14 00:53:01,747 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:53:01,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:53:01,858 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:01,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:53:01,858 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214122754] [2025-04-14 00:53:01,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214122754] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:53:01,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:53:01,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-14 00:53:01,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635989801] [2025-04-14 00:53:01,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:53:01,859 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-14 00:53:01,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:53:01,859 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-14 00:53:01,859 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-14 00:53:01,859 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 32 [2025-04-14 00:53:01,859 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 181 transitions, 2127 flow. Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 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:01,859 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:53:01,859 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 32 [2025-04-14 00:53:01,859 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:53:02,755 INFO L116 PetriNetUnfolderBase]: 4808/7801 cut-off events. [2025-04-14 00:53:02,755 INFO L117 PetriNetUnfolderBase]: For 66094/66094 co-relation queries the response was YES. [2025-04-14 00:53:02,776 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43398 conditions, 7801 events. 4808/7801 cut-off events. For 66094/66094 co-relation queries the response was YES. Maximal size of possible extension queue 514. Compared 50767 event pairs, 600 based on Foata normal form. 1/7193 useless extension candidates. Maximal degree in co-relation 36229. Up to 5591 conditions per place. [2025-04-14 00:53:02,806 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 338 selfloop transitions, 46 changer transitions 6/390 dead transitions. [2025-04-14 00:53:02,806 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 390 transitions, 5118 flow [2025-04-14 00:53:02,807 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 00:53:02,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-14 00:53:02,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 121 transitions. [2025-04-14 00:53:02,807 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6302083333333334 [2025-04-14 00:53:02,807 INFO L175 Difference]: Start difference. First operand has 89 places, 181 transitions, 2127 flow. Second operand 6 states and 121 transitions. [2025-04-14 00:53:02,807 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 390 transitions, 5118 flow [2025-04-14 00:53:02,885 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 390 transitions, 5056 flow, removed 31 selfloop flow, removed 0 redundant places. [2025-04-14 00:53:02,889 INFO L231 Difference]: Finished difference. Result has 97 places, 211 transitions, 2554 flow [2025-04-14 00:53:02,890 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2087, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=181, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2554, PETRI_PLACES=97, PETRI_TRANSITIONS=211} [2025-04-14 00:53:02,890 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 71 predicate places. [2025-04-14 00:53:02,890 INFO L485 AbstractCegarLoop]: Abstraction has has 97 places, 211 transitions, 2554 flow [2025-04-14 00:53:02,890 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 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:02,890 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:53:02,890 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:53:02,891 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-04-14 00:53:02,891 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:53:02,891 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:53:02,891 INFO L85 PathProgramCache]: Analyzing trace with hash -435621796, now seen corresponding path program 1 times [2025-04-14 00:53:02,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:53:02,891 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807556211] [2025-04-14 00:53:02,891 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:53:02,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:53:02,896 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-14 00:53:02,901 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-14 00:53:02,901 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:53:02,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:53:02,945 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 00:53:02,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:53:02,945 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807556211] [2025-04-14 00:53:02,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [807556211] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:53:02,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:53:02,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 00:53:02,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615473342] [2025-04-14 00:53:02,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:53:02,946 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 00:53:02,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:53:02,946 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 00:53:02,946 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 00:53:02,946 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 32 [2025-04-14 00:53:02,946 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 211 transitions, 2554 flow. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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:02,946 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:53:02,946 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 32 [2025-04-14 00:53:02,946 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:53:03,394 INFO L116 PetriNetUnfolderBase]: 2527/4384 cut-off events. [2025-04-14 00:53:03,394 INFO L117 PetriNetUnfolderBase]: For 42769/42769 co-relation queries the response was YES. [2025-04-14 00:53:03,414 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25185 conditions, 4384 events. 2527/4384 cut-off events. For 42769/42769 co-relation queries the response was YES. Maximal size of possible extension queue 283. Compared 28069 event pairs, 798 based on Foata normal form. 0/4310 useless extension candidates. Maximal degree in co-relation 20340. Up to 2994 conditions per place. [2025-04-14 00:53:03,426 INFO L140 encePairwiseOnDemand]: 25/32 looper letters, 204 selfloop transitions, 27 changer transitions 0/231 dead transitions. [2025-04-14 00:53:03,426 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 231 transitions, 3306 flow [2025-04-14 00:53:03,426 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 00:53:03,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-14 00:53:03,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 42 transitions. [2025-04-14 00:53:03,427 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4375 [2025-04-14 00:53:03,427 INFO L175 Difference]: Start difference. First operand has 97 places, 211 transitions, 2554 flow. Second operand 3 states and 42 transitions. [2025-04-14 00:53:03,427 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 231 transitions, 3306 flow [2025-04-14 00:53:03,479 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 231 transitions, 3245 flow, removed 23 selfloop flow, removed 1 redundant places. [2025-04-14 00:53:03,481 INFO L231 Difference]: Finished difference. Result has 98 places, 170 transitions, 2123 flow [2025-04-14 00:53:03,481 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2069, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=170, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=143, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2123, PETRI_PLACES=98, PETRI_TRANSITIONS=170} [2025-04-14 00:53:03,482 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 72 predicate places. [2025-04-14 00:53:03,482 INFO L485 AbstractCegarLoop]: Abstraction has has 98 places, 170 transitions, 2123 flow [2025-04-14 00:53:03,482 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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:03,482 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:53:03,482 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] [2025-04-14 00:53:03,482 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-04-14 00:53:03,482 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:53:03,483 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:53:03,483 INFO L85 PathProgramCache]: Analyzing trace with hash 1213657504, now seen corresponding path program 1 times [2025-04-14 00:53:03,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:53:03,483 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862676211] [2025-04-14 00:53:03,483 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:53:03,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:53:03,489 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-14 00:53:03,502 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-14 00:53:03,503 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:53:03,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:53:03,729 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:03,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:53:03,729 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862676211] [2025-04-14 00:53:03,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [862676211] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:53:03,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:53:03,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-14 00:53:03,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917620754] [2025-04-14 00:53:03,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:53:03,729 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-14 00:53:03,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:53:03,730 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-14 00:53:03,730 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-04-14 00:53:03,730 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 32 [2025-04-14 00:53:03,730 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 170 transitions, 2123 flow. Second operand has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 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:03,730 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:53:03,730 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 32 [2025-04-14 00:53:03,730 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:53:04,553 INFO L116 PetriNetUnfolderBase]: 3165/5514 cut-off events. [2025-04-14 00:53:04,553 INFO L117 PetriNetUnfolderBase]: For 61356/61356 co-relation queries the response was YES. [2025-04-14 00:53:04,574 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32276 conditions, 5514 events. 3165/5514 cut-off events. For 61356/61356 co-relation queries the response was YES. Maximal size of possible extension queue 356. Compared 36946 event pairs, 321 based on Foata normal form. 190/5652 useless extension candidates. Maximal degree in co-relation 25868. Up to 3926 conditions per place. [2025-04-14 00:53:04,594 INFO L140 encePairwiseOnDemand]: 18/32 looper letters, 297 selfloop transitions, 33 changer transitions 0/330 dead transitions. [2025-04-14 00:53:04,595 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 330 transitions, 4444 flow [2025-04-14 00:53:04,595 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-14 00:53:04,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-14 00:53:04,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 120 transitions. [2025-04-14 00:53:04,596 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.46875 [2025-04-14 00:53:04,596 INFO L175 Difference]: Start difference. First operand has 98 places, 170 transitions, 2123 flow. Second operand 8 states and 120 transitions. [2025-04-14 00:53:04,596 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 330 transitions, 4444 flow [2025-04-14 00:53:04,659 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 330 transitions, 4360 flow, removed 5 selfloop flow, removed 2 redundant places. [2025-04-14 00:53:04,664 INFO L231 Difference]: Finished difference. Result has 107 places, 186 transitions, 2417 flow [2025-04-14 00:53:04,664 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2065, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=170, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=141, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2417, PETRI_PLACES=107, PETRI_TRANSITIONS=186} [2025-04-14 00:53:04,664 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 81 predicate places. [2025-04-14 00:53:04,664 INFO L485 AbstractCegarLoop]: Abstraction has has 107 places, 186 transitions, 2417 flow [2025-04-14 00:53:04,665 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 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:04,665 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:53:04,665 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] [2025-04-14 00:53:04,665 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-04-14 00:53:04,665 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:53:04,665 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:53:04,665 INFO L85 PathProgramCache]: Analyzing trace with hash -1658347660, now seen corresponding path program 1 times [2025-04-14 00:53:04,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:53:04,666 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866962006] [2025-04-14 00:53:04,666 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:53:04,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:53:04,672 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-14 00:53:04,697 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-14 00:53:04,697 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:53:04,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:53:05,592 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:53:05,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:53:05,592 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866962006] [2025-04-14 00:53:05,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1866962006] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:53:05,592 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [266005408] [2025-04-14 00:53:05,592 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:53:05,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:53:05,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:53:05,597 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:05,606 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:05,640 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-14 00:53:05,700 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-14 00:53:05,701 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:53:05,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:53:05,702 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-04-14 00:53:05,703 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:53:05,877 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:53:05,877 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:53:06,046 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:53:06,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [266005408] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:53:06,047 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:53:06,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 15 [2025-04-14 00:53:06,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890736489] [2025-04-14 00:53:06,047 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:53:06,047 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-14 00:53:06,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:53:06,048 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-14 00:53:06,048 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2025-04-14 00:53:06,048 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 32 [2025-04-14 00:53:06,048 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 186 transitions, 2417 flow. Second operand has 15 states, 15 states have (on average 5.6) internal successors, (84), 15 states have internal predecessors, (84), 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:06,048 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:53:06,048 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 32 [2025-04-14 00:53:06,048 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:53:07,424 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:53:11,208 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.64s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:53:16,303 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:53:17,774 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:53:22,510 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:53:26,513 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:53:32,399 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:53:36,428 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:53:43,386 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.74s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:53:47,388 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:53:48,757 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:53:52,810 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:54:01,020 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:54:02,458 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:54:04,092 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.61s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:54:19,252 WARN L286 SmtUtils]: Spent 6.90s on a formula simplification. DAG size of input: 29 DAG size of output: 24 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-14 00:54:22,685 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.43s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:54:25,044 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.34s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:54:29,660 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:54:31,513 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.85s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:54:35,517 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:54:39,520 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:54:43,523 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:54:47,528 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:54:50,685 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.16s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:54:54,688 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:54:56,845 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:54:58,328 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:55:02,416 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:55:06,635 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:55:08,794 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:55:12,859 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:55:16,862 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:55:21,565 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:55:26,055 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:55:27,799 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.74s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:55:31,800 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:55:33,141 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:55:37,633 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:55:46,646 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:56:03,552 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:56:07,942 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:56:08,420 INFO L116 PetriNetUnfolderBase]: 7445/12888 cut-off events. [2025-04-14 00:56:08,420 INFO L117 PetriNetUnfolderBase]: For 181610/181610 co-relation queries the response was YES. [2025-04-14 00:56:08,482 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77870 conditions, 12888 events. 7445/12888 cut-off events. For 181610/181610 co-relation queries the response was YES. Maximal size of possible extension queue 652. Compared 96815 event pairs, 266 based on Foata normal form. 575/13345 useless extension candidates. Maximal degree in co-relation 71614. Up to 3610 conditions per place. [2025-04-14 00:56:08,523 INFO L140 encePairwiseOnDemand]: 15/32 looper letters, 767 selfloop transitions, 112 changer transitions 112/991 dead transitions. [2025-04-14 00:56:08,523 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 991 transitions, 13004 flow [2025-04-14 00:56:08,523 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-04-14 00:56:08,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2025-04-14 00:56:08,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 347 transitions. [2025-04-14 00:56:08,524 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3614583333333333 [2025-04-14 00:56:08,524 INFO L175 Difference]: Start difference. First operand has 107 places, 186 transitions, 2417 flow. Second operand 30 states and 347 transitions. [2025-04-14 00:56:08,524 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 991 transitions, 13004 flow [2025-04-14 00:56:08,719 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 991 transitions, 12894 flow, removed 44 selfloop flow, removed 2 redundant places. [2025-04-14 00:56:08,726 INFO L231 Difference]: Finished difference. Result has 143 places, 276 transitions, 3979 flow [2025-04-14 00:56:08,726 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2333, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=186, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=135, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=3979, PETRI_PLACES=143, PETRI_TRANSITIONS=276} [2025-04-14 00:56:08,726 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 117 predicate places. [2025-04-14 00:56:08,726 INFO L485 AbstractCegarLoop]: Abstraction has has 143 places, 276 transitions, 3979 flow [2025-04-14 00:56:08,726 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.6) internal successors, (84), 15 states have internal predecessors, (84), 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:56:08,726 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:56:08,727 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] [2025-04-14 00:56:08,732 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-04-14 00:56:08,927 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:56:08,927 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:56:08,928 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:56:08,928 INFO L85 PathProgramCache]: Analyzing trace with hash -1533117334, now seen corresponding path program 2 times [2025-04-14 00:56:08,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:56:08,928 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846931433] [2025-04-14 00:56:08,928 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:56:08,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:56:08,932 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-04-14 00:56:08,949 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 20 of 22 statements. [2025-04-14 00:56:08,949 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 00:56:08,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:56:09,087 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:56:09,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:56:09,087 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846931433] [2025-04-14 00:56:09,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846931433] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:56:09,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:56:09,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-14 00:56:09,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473135769] [2025-04-14 00:56:09,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:56:09,088 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-14 00:56:09,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:56:09,088 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-14 00:56:09,088 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-14 00:56:09,088 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 32 [2025-04-14 00:56:09,088 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 276 transitions, 3979 flow. Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 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:56:09,088 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:56:09,088 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 32 [2025-04-14 00:56:09,088 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:56:10,733 INFO L116 PetriNetUnfolderBase]: 7565/12976 cut-off events. [2025-04-14 00:56:10,733 INFO L117 PetriNetUnfolderBase]: For 234287/234287 co-relation queries the response was YES. [2025-04-14 00:56:10,782 INFO L83 FinitePrefix]: Finished finitePrefix Result has 92135 conditions, 12976 events. 7565/12976 cut-off events. For 234287/234287 co-relation queries the response was YES. Maximal size of possible extension queue 576. Compared 93449 event pairs, 759 based on Foata normal form. 388/13258 useless extension candidates. Maximal degree in co-relation 85900. Up to 7431 conditions per place. [2025-04-14 00:56:10,823 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 404 selfloop transitions, 77 changer transitions 10/491 dead transitions. [2025-04-14 00:56:10,824 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 491 transitions, 7578 flow [2025-04-14 00:56:10,824 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 00:56:10,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-14 00:56:10,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 94 transitions. [2025-04-14 00:56:10,825 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4895833333333333 [2025-04-14 00:56:10,825 INFO L175 Difference]: Start difference. First operand has 143 places, 276 transitions, 3979 flow. Second operand 6 states and 94 transitions. [2025-04-14 00:56:10,825 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 491 transitions, 7578 flow [2025-04-14 00:56:11,276 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 491 transitions, 6762 flow, removed 378 selfloop flow, removed 9 redundant places. [2025-04-14 00:56:11,281 INFO L231 Difference]: Finished difference. Result has 134 places, 286 transitions, 3702 flow [2025-04-14 00:56:11,281 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=3298, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=270, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=205, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3702, PETRI_PLACES=134, PETRI_TRANSITIONS=286} [2025-04-14 00:56:11,282 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 108 predicate places. [2025-04-14 00:56:11,282 INFO L485 AbstractCegarLoop]: Abstraction has has 134 places, 286 transitions, 3702 flow [2025-04-14 00:56:11,282 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 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:56:11,282 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:56:11,282 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] [2025-04-14 00:56:11,282 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-04-14 00:56:11,282 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:56:11,282 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:56:11,282 INFO L85 PathProgramCache]: Analyzing trace with hash 1663642122, now seen corresponding path program 1 times [2025-04-14 00:56:11,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:56:11,283 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189890051] [2025-04-14 00:56:11,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:56:11,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:56:11,286 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-14 00:56:11,294 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-14 00:56:11,294 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:56:11,294 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:56:11,580 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:56:11,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:56:11,580 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189890051] [2025-04-14 00:56:11,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189890051] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:56:11,580 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1609321922] [2025-04-14 00:56:11,580 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:56:11,580 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:56:11,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:56:11,583 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:56:11,584 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:56:11,612 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-14 00:56:11,640 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-14 00:56:11,640 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:56:11,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:56:11,641 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-04-14 00:56:11,642 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:56:11,795 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:56:11,795 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:56:12,125 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:56:12,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1609321922] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:56:12,126 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:56:12,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 6] total 17 [2025-04-14 00:56:12,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102819237] [2025-04-14 00:56:12,126 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:56:12,126 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-04-14 00:56:12,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:56:12,126 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-04-14 00:56:12,127 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2025-04-14 00:56:12,127 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 32 [2025-04-14 00:56:12,127 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 286 transitions, 3702 flow. Second operand has 17 states, 17 states have (on average 5.294117647058823) internal successors, (90), 17 states have internal predecessors, (90), 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:56:12,127 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:56:12,127 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 32 [2025-04-14 00:56:12,127 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:56:16,259 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:56:19,784 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.62s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:56:23,809 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:56:25,736 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:56:37,588 WARN L286 SmtUtils]: Spent 7.34s on a formula simplification. DAG size of input: 64 DAG size of output: 45 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-14 00:56:40,018 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.65s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:56:43,428 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.13s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:56:47,815 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:56:49,713 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.86s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:56:53,716 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:56:57,746 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:57:17,538 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:57:22,403 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:57:26,419 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:57:30,428 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:57:34,892 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:57:37,347 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.35s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:57:41,516 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:57:56,235 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:57:59,332 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.09s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:58:00,510 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:58:03,923 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.41s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:58:07,959 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:58:12,094 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:58:17,279 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:58:19,340 INFO L116 PetriNetUnfolderBase]: 12108/20110 cut-off events. [2025-04-14 00:58:19,341 INFO L117 PetriNetUnfolderBase]: For 320087/320087 co-relation queries the response was YES. [2025-04-14 00:58:19,462 INFO L83 FinitePrefix]: Finished finitePrefix Result has 136563 conditions, 20110 events. 12108/20110 cut-off events. For 320087/320087 co-relation queries the response was YES. Maximal size of possible extension queue 811. Compared 145864 event pairs, 559 based on Foata normal form. 536/20540 useless extension candidates. Maximal degree in co-relation 126046. Up to 9548 conditions per place. [2025-04-14 00:58:19,536 INFO L140 encePairwiseOnDemand]: 14/32 looper letters, 827 selfloop transitions, 192 changer transitions 4/1023 dead transitions. [2025-04-14 00:58:19,537 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 1023 transitions, 14109 flow [2025-04-14 00:58:19,537 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-14 00:58:19,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2025-04-14 00:58:19,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 280 transitions. [2025-04-14 00:58:19,538 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3645833333333333 [2025-04-14 00:58:19,538 INFO L175 Difference]: Start difference. First operand has 134 places, 286 transitions, 3702 flow. Second operand 24 states and 280 transitions. [2025-04-14 00:58:19,538 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 1023 transitions, 14109 flow [2025-04-14 00:58:20,085 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 1023 transitions, 13940 flow, removed 80 selfloop flow, removed 2 redundant places. [2025-04-14 00:58:20,093 INFO L231 Difference]: Finished difference. Result has 158 places, 391 transitions, 5604 flow [2025-04-14 00:58:20,093 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=3523, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=278, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=97, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=167, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=5604, PETRI_PLACES=158, PETRI_TRANSITIONS=391} [2025-04-14 00:58:20,093 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 132 predicate places. [2025-04-14 00:58:20,093 INFO L485 AbstractCegarLoop]: Abstraction has has 158 places, 391 transitions, 5604 flow [2025-04-14 00:58:20,094 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 5.294117647058823) internal successors, (90), 17 states have internal predecessors, (90), 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:58:20,094 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:58:20,094 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] [2025-04-14 00:58:20,099 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-04-14 00:58:20,294 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:58:20,294 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:58:20,295 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:58:20,295 INFO L85 PathProgramCache]: Analyzing trace with hash -1586972636, now seen corresponding path program 2 times [2025-04-14 00:58:20,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:58:20,295 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517260250] [2025-04-14 00:58:20,295 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:58:20,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:58:20,298 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-04-14 00:58:20,312 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-14 00:58:20,312 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 00:58:20,313 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:58:20,819 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:58:20,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:58:20,819 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517260250] [2025-04-14 00:58:20,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517260250] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:58:20,819 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1973086697] [2025-04-14 00:58:20,819 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:58:20,819 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:58:20,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:58:20,821 INFO L229 MonitoredProcess]: Starting monitored process 6 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:58:20,822 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-04-14 00:58:20,851 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-04-14 00:58:20,961 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-14 00:58:20,961 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 00:58:20,961 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:58:20,962 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-14 00:58:20,963 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:58:21,273 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:58:21,273 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:58:22,629 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:58:22,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1973086697] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:58:22,630 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:58:22,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 13 [2025-04-14 00:58:22,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791144152] [2025-04-14 00:58:22,630 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:58:22,630 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-14 00:58:22,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:58:22,631 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-14 00:58:22,631 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2025-04-14 00:58:22,631 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 32 [2025-04-14 00:58:22,631 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 391 transitions, 5604 flow. Second operand has 13 states, 13 states have (on average 5.461538461538462) internal successors, (71), 13 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:58:22,631 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:58:22,631 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 32 [2025-04-14 00:58:22,632 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:58:28,817 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:58:32,843 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:58:37,589 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:58:42,597 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.56s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:58:46,899 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:58:48,725 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.80s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:58:50,734 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:58:53,753 INFO L116 PetriNetUnfolderBase]: 14525/24098 cut-off events. [2025-04-14 00:58:53,753 INFO L117 PetriNetUnfolderBase]: For 442009/442009 co-relation queries the response was YES. [2025-04-14 00:58:53,946 INFO L83 FinitePrefix]: Finished finitePrefix Result has 176099 conditions, 24098 events. 14525/24098 cut-off events. For 442009/442009 co-relation queries the response was YES. Maximal size of possible extension queue 963. Compared 179270 event pairs, 1107 based on Foata normal form. 294/24282 useless extension candidates. Maximal degree in co-relation 166396. Up to 10995 conditions per place. [2025-04-14 00:58:54,037 INFO L140 encePairwiseOnDemand]: 19/32 looper letters, 749 selfloop transitions, 183 changer transitions 8/940 dead transitions. [2025-04-14 00:58:54,037 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 940 transitions, 14393 flow [2025-04-14 00:58:54,038 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-14 00:58:54,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-04-14 00:58:54,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 215 transitions. [2025-04-14 00:58:54,039 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3732638888888889 [2025-04-14 00:58:54,039 INFO L175 Difference]: Start difference. First operand has 158 places, 391 transitions, 5604 flow. Second operand 18 states and 215 transitions. [2025-04-14 00:58:54,039 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 940 transitions, 14393 flow [2025-04-14 00:58:55,835 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 169 places, 940 transitions, 13555 flow, removed 396 selfloop flow, removed 6 redundant places. [2025-04-14 00:58:55,843 INFO L231 Difference]: Finished difference. Result has 174 places, 442 transitions, 6473 flow [2025-04-14 00:58:55,843 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=5100, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=386, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=124, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=247, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=6473, PETRI_PLACES=174, PETRI_TRANSITIONS=442} [2025-04-14 00:58:55,844 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 148 predicate places. [2025-04-14 00:58:55,844 INFO L485 AbstractCegarLoop]: Abstraction has has 174 places, 442 transitions, 6473 flow [2025-04-14 00:58:55,844 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.461538461538462) internal successors, (71), 13 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:58:55,844 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:58:55,844 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] [2025-04-14 00:58:55,850 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-04-14 00:58:56,045 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-04-14 00:58:56,045 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:58:56,045 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:58:56,045 INFO L85 PathProgramCache]: Analyzing trace with hash -226841744, now seen corresponding path program 3 times [2025-04-14 00:58:56,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:58:56,046 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912013819] [2025-04-14 00:58:56,046 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 00:58:56,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:58:56,050 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 22 statements into 2 equivalence classes. [2025-04-14 00:58:56,068 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-14 00:58:56,068 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-14 00:58:56,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:58:56,467 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:58:56,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:58:56,468 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912013819] [2025-04-14 00:58:56,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1912013819] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:58:56,468 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [212890351] [2025-04-14 00:58:56,468 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 00:58:56,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:58:56,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:58:56,470 INFO L229 MonitoredProcess]: Starting monitored process 7 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:58:56,471 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-04-14 00:58:56,504 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 22 statements into 2 equivalence classes. [2025-04-14 00:58:56,544 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-14 00:58:56,544 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-14 00:58:56,544 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:58:56,545 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-14 00:58:56,546 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:58:57,094 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:58:57,094 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:59:05,886 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:59:05,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [212890351] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:59:05,886 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:59:05,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 14 [2025-04-14 00:59:05,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078261052] [2025-04-14 00:59:05,886 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:59:05,886 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-14 00:59:05,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:59:05,887 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-14 00:59:05,887 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2025-04-14 00:59:05,887 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 32 [2025-04-14 00:59:05,887 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 442 transitions, 6473 flow. Second operand has 14 states, 14 states have (on average 5.357142857142857) internal successors, (75), 14 states have internal predecessors, (75), 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:59:05,887 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:59:05,887 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 32 [2025-04-14 00:59:05,887 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:59:14,761 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:59:18,773 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:59:22,917 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:59:34,239 WARN L286 SmtUtils]: Spent 7.87s on a formula simplification. DAG size of input: 46 DAG size of output: 27 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-14 00:59:37,314 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.67s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:59:40,886 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.37s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:59:44,912 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:59:48,922 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:59:50,748 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.49s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:59:54,751 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 00:59:58,863 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 01:00:03,564 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 01:00:07,859 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 01:00:12,155 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.80s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 01:00:19,641 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 01:00:23,906 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 01:00:34,723 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.79s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 01:00:39,159 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 01:00:41,228 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 01:00:45,475 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 01:00:50,186 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 01:00:51,873 INFO L116 PetriNetUnfolderBase]: 16538/27463 cut-off events. [2025-04-14 01:00:51,873 INFO L117 PetriNetUnfolderBase]: For 443619/443619 co-relation queries the response was YES. [2025-04-14 01:00:52,110 INFO L83 FinitePrefix]: Finished finitePrefix Result has 194172 conditions, 27463 events. 16538/27463 cut-off events. For 443619/443619 co-relation queries the response was YES. Maximal size of possible extension queue 1067. Compared 207104 event pairs, 1037 based on Foata normal form. 164/27517 useless extension candidates. Maximal degree in co-relation 183104. Up to 16629 conditions per place. [2025-04-14 01:00:52,225 INFO L140 encePairwiseOnDemand]: 19/32 looper letters, 956 selfloop transitions, 217 changer transitions 3/1176 dead transitions. [2025-04-14 01:00:52,225 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 1176 transitions, 17531 flow [2025-04-14 01:00:52,226 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-14 01:00:52,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2025-04-14 01:00:52,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 260 transitions. [2025-04-14 01:00:52,227 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3693181818181818 [2025-04-14 01:00:52,227 INFO L175 Difference]: Start difference. First operand has 174 places, 442 transitions, 6473 flow. Second operand 22 states and 260 transitions. [2025-04-14 01:00:52,227 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 1176 transitions, 17531 flow [2025-04-14 01:00:55,042 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 184 places, 1176 transitions, 17283 flow, removed 13 selfloop flow, removed 9 redundant places. [2025-04-14 01:00:55,052 INFO L231 Difference]: Finished difference. Result has 192 places, 511 transitions, 8079 flow [2025-04-14 01:00:55,053 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=6194, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=439, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=148, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=253, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=8079, PETRI_PLACES=192, PETRI_TRANSITIONS=511} [2025-04-14 01:00:55,054 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 166 predicate places. [2025-04-14 01:00:55,054 INFO L485 AbstractCegarLoop]: Abstraction has has 192 places, 511 transitions, 8079 flow [2025-04-14 01:00:55,054 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.357142857142857) internal successors, (75), 14 states have internal predecessors, (75), 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 01:00:55,054 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:00:55,054 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:00:55,062 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-04-14 01:00:55,254 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:00:55,255 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 01:00:55,255 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:00:55,255 INFO L85 PathProgramCache]: Analyzing trace with hash 2057951943, now seen corresponding path program 1 times [2025-04-14 01:00:55,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:00:55,255 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669652898] [2025-04-14 01:00:55,256 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:00:55,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:00:55,260 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-14 01:00:55,271 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-14 01:00:55,271 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:00:55,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:00:55,523 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:00:55,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:00:55,524 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669652898] [2025-04-14 01:00:55,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669652898] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:00:55,524 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [675508822] [2025-04-14 01:00:55,524 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:00:55,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:00:55,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:00:55,526 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 01:00:55,527 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-04-14 01:00:55,565 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-14 01:00:55,646 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-14 01:00:55,646 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:00:55,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:00:55,647 INFO L256 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-04-14 01:00:55,648 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:00:55,904 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:00:55,904 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:01:04,422 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:01:04,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [675508822] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:01:04,422 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:01:04,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 20 [2025-04-14 01:01:04,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573020663] [2025-04-14 01:01:04,422 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:01:04,422 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-04-14 01:01:04,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:01:04,423 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-04-14 01:01:04,423 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2025-04-14 01:01:04,423 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 32 [2025-04-14 01:01:04,423 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 511 transitions, 8079 flow. Second operand has 20 states, 20 states have (on average 5.35) internal successors, (107), 20 states have internal predecessors, (107), 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 01:01:04,423 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:01:04,423 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 32 [2025-04-14 01:01:04,423 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:01:08,700 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 01:01:22,098 WARN L286 SmtUtils]: Spent 8.08s on a formula simplification. DAG size of input: 50 DAG size of output: 46 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-14 01:01:27,976 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 01:01:36,754 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.60s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 01:01:39,004 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.98s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 01:01:43,122 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 01:01:45,871 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.69s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 01:01:47,778 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.91s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 01:02:02,828 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.81s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 01:02:07,608 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.80s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 01:02:11,775 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 01:02:15,777 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 01:02:19,783 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 01:02:23,787 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 01:02:35,484 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 01:02:39,487 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 01:02:43,494 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 01:02:47,502 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 01:02:53,360 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 01:02:57,363 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 01:03:01,377 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 01:03:04,089 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.70s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 01:03:08,107 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 01:03:12,113 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 01:03:17,861 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 01:03:31,949 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 01:03:35,951 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 01:03:39,965 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 01:03:43,978 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 01:03:47,984 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 01:03:51,987 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 01:03:56,252 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 01:04:00,486 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 01:04:04,496 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 01:04:08,504 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 01:04:12,566 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 01:04:16,695 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 01:04:20,897 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 01:04:25,409 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 01:04:33,616 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 01:04:46,068 WARN L286 SmtUtils]: Spent 8.26s on a formula simplification. DAG size of input: 56 DAG size of output: 45 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-14 01:04:50,077 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 01:05:06,497 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 01:05:10,556 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 01:05:12,690 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.82s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 01:05:16,854 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 01:05:19,642 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.74s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 01:05:33,554 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 01:05:37,783 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 01:05:41,791 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 01:05:45,799 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 01:05:49,905 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 01:05:54,132 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 01:05:56,985 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 01:06:19,589 WARN L286 SmtUtils]: Spent 8.13s on a formula simplification. DAG size of input: 61 DAG size of output: 45 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-14 01:06:23,242 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.36s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 01:06:27,447 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 01:06:31,755 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 01:06:35,771 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 01:06:39,150 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.37s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 01:06:43,509 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 01:06:49,159 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 01:06:50,293 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 01:06:54,474 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 01:06:57,063 INFO L116 PetriNetUnfolderBase]: 21816/36643 cut-off events. [2025-04-14 01:06:57,064 INFO L117 PetriNetUnfolderBase]: For 696600/696600 co-relation queries the response was YES. [2025-04-14 01:06:57,430 INFO L83 FinitePrefix]: Finished finitePrefix Result has 267864 conditions, 36643 events. 21816/36643 cut-off events. For 696600/696600 co-relation queries the response was YES. Maximal size of possible extension queue 1456. Compared 295883 event pairs, 1685 based on Foata normal form. 877/37396 useless extension candidates. Maximal degree in co-relation 265154. Up to 25591 conditions per place. [2025-04-14 01:06:57,573 INFO L140 encePairwiseOnDemand]: 14/32 looper letters, 1619 selfloop transitions, 187 changer transitions 2/1808 dead transitions. [2025-04-14 01:06:57,573 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 229 places, 1808 transitions, 26539 flow [2025-04-14 01:06:57,574 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2025-04-14 01:06:57,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2025-04-14 01:06:57,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 485 transitions. [2025-04-14 01:06:57,575 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3886217948717949 [2025-04-14 01:06:57,575 INFO L175 Difference]: Start difference. First operand has 192 places, 511 transitions, 8079 flow. Second operand 39 states and 485 transitions. [2025-04-14 01:06:57,575 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 229 places, 1808 transitions, 26539 flow [2025-04-14 01:07:02,557 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 222 places, 1808 transitions, 26262 flow, removed 98 selfloop flow, removed 7 redundant places. [2025-04-14 01:07:02,571 INFO L231 Difference]: Finished difference. Result has 241 places, 637 transitions, 10492 flow [2025-04-14 01:07:02,572 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=7802, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=511, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=77, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=405, PETRI_DIFFERENCE_SUBTRAHEND_STATES=39, PETRI_FLOW=10492, PETRI_PLACES=241, PETRI_TRANSITIONS=637} [2025-04-14 01:07:02,572 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 215 predicate places. [2025-04-14 01:07:02,572 INFO L485 AbstractCegarLoop]: Abstraction has has 241 places, 637 transitions, 10492 flow [2025-04-14 01:07:02,572 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 5.35) internal successors, (107), 20 states have internal predecessors, (107), 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 01:07:02,572 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:07:02,573 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:07:02,579 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-04-14 01:07:02,773 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:07:02,774 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 01:07:02,774 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:07:02,774 INFO L85 PathProgramCache]: Analyzing trace with hash 343803737, now seen corresponding path program 1 times [2025-04-14 01:07:02,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:07:02,774 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475685583] [2025-04-14 01:07:02,774 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:07:02,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:07:02,778 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-14 01:07:02,788 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-14 01:07:02,788 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:07:02,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:07:02,927 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:07:02,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:07:02,928 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475685583] [2025-04-14 01:07:02,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475685583] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:07:02,928 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [824548704] [2025-04-14 01:07:02,928 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:07:02,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:07:02,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:07:02,930 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 01:07:02,931 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-04-14 01:07:02,961 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-14 01:07:03,014 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-14 01:07:03,014 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:07:03,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:07:03,015 INFO L256 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-04-14 01:07:03,016 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:07:03,156 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:07:03,157 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:07:03,390 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:07:03,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [824548704] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:07:03,391 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:07:03,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 12 [2025-04-14 01:07:03,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022745777] [2025-04-14 01:07:03,391 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:07:03,391 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-14 01:07:03,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:07:03,392 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-14 01:07:03,392 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2025-04-14 01:07:03,392 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 32 [2025-04-14 01:07:03,392 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 241 places, 637 transitions, 10492 flow. Second operand has 12 states, 12 states have (on average 5.833333333333333) internal successors, (70), 12 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:07:03,392 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:07:03,392 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 32 [2025-04-14 01:07:03,392 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:07:07,418 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.72s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 01:07:17,882 INFO L116 PetriNetUnfolderBase]: 31348/52080 cut-off events. [2025-04-14 01:07:17,882 INFO L117 PetriNetUnfolderBase]: For 1294723/1294723 co-relation queries the response was YES. Received shutdown request... [2025-04-14 01:07:18,790 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-04-14 01:07:18,790 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-04-14 01:07:18,799 INFO L83 FinitePrefix]: Finished finitePrefix Result has 412140 conditions, 52080 events. 31348/52080 cut-off events. For 1294723/1294723 co-relation queries the response was YES. Maximal size of possible extension queue 1869. Compared 426027 event pairs, 1595 based on Foata normal form. 807/52763 useless extension candidates. Maximal degree in co-relation 409858. Up to 29977 conditions per place. [2025-04-14 01:07:19,078 INFO L140 encePairwiseOnDemand]: 19/32 looper letters, 1080 selfloop transitions, 327 changer transitions 0/1407 dead transitions. [2025-04-14 01:07:19,078 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 257 places, 1407 transitions, 23198 flow [2025-04-14 01:07:19,079 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-14 01:07:19,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-04-14 01:07:19,088 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2025-04-14 01:07:19,100 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-04-14 01:07:19,289 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-04-14 01:07:19,289 WARN L610 AbstractCegarLoop]: Verification canceled: while ReachableStatesComputation was computing reachable states (1 states constructed, input type AutomatonWithImplicitSelfloops). [2025-04-14 01:07:19,293 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2025-04-14 01:07:19,293 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2025-04-14 01:07:19,293 INFO L422 BasicCegarLoop]: Path program histogram: [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:07:19,311 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-14 01:07:19,311 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-14 01:07:19,320 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.04 01:07:19 BasicIcfg [2025-04-14 01:07:19,320 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-14 01:07:19,324 INFO L158 Benchmark]: Toolchain (without parser) took 866232.48ms. Allocated memory was 125.8MB in the beginning and 2.9GB in the end (delta: 2.8GB). Free memory was 89.0MB in the beginning and 1.6GB in the end (delta: -1.5GB). Peak memory consumption was 1.9GB. Max. memory is 8.0GB. [2025-04-14 01:07:19,324 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 159.4MB. Free memory is still 87.4MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 01:07:19,324 INFO L158 Benchmark]: CACSL2BoogieTranslator took 243.26ms. Allocated memory is still 125.8MB. Free memory was 89.0MB in the beginning and 74.5MB in the end (delta: 14.4MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2025-04-14 01:07:19,324 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.08ms. Allocated memory is still 125.8MB. Free memory was 74.5MB in the beginning and 73.0MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 01:07:19,324 INFO L158 Benchmark]: Boogie Preprocessor took 41.23ms. Allocated memory is still 125.8MB. Free memory was 73.0MB in the beginning and 71.5MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 01:07:19,324 INFO L158 Benchmark]: IcfgBuilder took 412.12ms. Allocated memory is still 125.8MB. Free memory was 71.5MB in the beginning and 40.3MB in the end (delta: 31.2MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. [2025-04-14 01:07:19,324 INFO L158 Benchmark]: TraceAbstraction took 865506.55ms. Allocated memory was 125.8MB in the beginning and 2.9GB in the end (delta: 2.8GB). Free memory was 39.5MB in the beginning and 1.6GB in the end (delta: -1.6GB). Peak memory consumption was 1.8GB. Max. memory is 8.0GB. [2025-04-14 01:07:19,325 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.28ms. Allocated memory is still 159.4MB. Free memory is still 87.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 243.26ms. Allocated memory is still 125.8MB. Free memory was 89.0MB in the beginning and 74.5MB in the end (delta: 14.4MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 25.08ms. Allocated memory is still 125.8MB. Free memory was 74.5MB in the beginning and 73.0MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 41.23ms. Allocated memory is still 125.8MB. Free memory was 73.0MB in the beginning and 71.5MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 8.0GB. * IcfgBuilder took 412.12ms. Allocated memory is still 125.8MB. Free memory was 71.5MB in the beginning and 40.3MB in the end (delta: 31.2MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. * TraceAbstraction took 865506.55ms. Allocated memory was 125.8MB in the beginning and 2.9GB in the end (delta: 2.8GB). Free memory was 39.5MB in the beginning and 1.6GB in the end (delta: -1.6GB). Peak memory consumption was 1.8GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 90]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while ReachableStatesComputation was computing reachable states (1 states constructed, input type AutomatonWithImplicitSelfloops). - TimeoutResultAtElement [Line: 84]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while ReachableStatesComputation was computing reachable states (1 states constructed, input type AutomatonWithImplicitSelfloops). - TimeoutResultAtElement [Line: 85]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while ReachableStatesComputation was computing reachable states (1 states constructed, input type AutomatonWithImplicitSelfloops). - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 36 locations, 55 edges, 3 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 865.4s, OverallIterations: 26, TraceHistogramMax: 3, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 836.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 105 mSolverCounterUnknown, 1961 SdHoareTripleChecker+Valid, 569.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1961 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 568.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 628 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8257 IncrementalHoareTripleChecker+Invalid, 8990 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 628 mSolverCounterUnsat, 0 mSDtfsCounter, 8257 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 597 GetRequests, 340 SyntacticMatches, 32 SemanticMatches, 225 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1133 ImplicationChecksByTransitivity, 241.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=10492occurred in iteration=25, InterpolantAutomatonStates: 229, 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.8s SatisfiabilityAnalysisTime, 26.0s InterpolantComputationTime, 680 NumberOfCodeBlocks, 678 NumberOfCodeBlocksAsserted, 38 NumberOfCheckSat, 818 ConstructedInterpolants, 0 QuantifiedInterpolants, 8306 SizeOfPredicates, 46 NumberOfNonLiveVariables, 1181 ConjunctsInSsa, 102 ConjunctsInUnsatCore, 42 InterpolantComputations, 18 PerfectInterpolantSequences, 15/76 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 RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown