/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/popl20-threaded-sum-3.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-14 01:33:18,172 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-14 01:33:18,222 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 01:33:18,228 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-14 01:33:18,228 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-14 01:33:18,247 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-14 01:33:18,249 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-14 01:33:18,249 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-14 01:33:18,249 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-14 01:33:18,249 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-14 01:33:18,250 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-14 01:33:18,250 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-14 01:33:18,250 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-14 01:33:18,250 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-14 01:33:18,251 INFO L153 SettingsManager]: * Use SBE=true [2025-04-14 01:33:18,251 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-14 01:33:18,251 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-14 01:33:18,251 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-14 01:33:18,251 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-14 01:33:18,251 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-14 01:33:18,251 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-14 01:33:18,251 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-14 01:33:18,251 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-14 01:33:18,251 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-14 01:33:18,251 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-14 01:33:18,251 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-14 01:33:18,252 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-14 01:33:18,252 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-14 01:33:18,252 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-14 01:33:18,252 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 01:33:18,252 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 01:33:18,252 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 01:33:18,252 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 01:33:18,252 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-14 01:33:18,252 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 01:33:18,252 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 01:33:18,252 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 01:33:18,252 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 01:33:18,252 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-14 01:33:18,252 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-14 01:33:18,253 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-14 01:33:18,253 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-14 01:33:18,253 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-14 01:33:18,253 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-14 01:33:18,253 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-14 01:33:18,253 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-14 01:33:18,253 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-14 01:33:18,253 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 01:33:18,460 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-14 01:33:18,469 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-14 01:33:18,471 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-14 01:33:18,472 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-14 01:33:18,472 INFO L274 PluginConnector]: CDTParser initialized [2025-04-14 01:33:18,473 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-threaded-sum-3.wvr.c [2025-04-14 01:33:19,731 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d4d275b5b/670d7ea4d92b40f1b3b59a22cfbfd097/FLAG26440075a [2025-04-14 01:33:19,921 INFO L389 CDTParser]: Found 1 translation units. [2025-04-14 01:33:19,922 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-threaded-sum-3.wvr.c [2025-04-14 01:33:19,928 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d4d275b5b/670d7ea4d92b40f1b3b59a22cfbfd097/FLAG26440075a [2025-04-14 01:33:20,781 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d4d275b5b/670d7ea4d92b40f1b3b59a22cfbfd097 [2025-04-14 01:33:20,783 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-14 01:33:20,784 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-14 01:33:20,785 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-14 01:33:20,785 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-14 01:33:20,791 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-14 01:33:20,792 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 01:33:20" (1/1) ... [2025-04-14 01:33:20,792 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@496b9d89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:33:20, skipping insertion in model container [2025-04-14 01:33:20,792 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 01:33:20" (1/1) ... [2025-04-14 01:33:20,804 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-14 01:33:20,962 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/popl20-threaded-sum-3.wvr.c[2996,3009] [2025-04-14 01:33:20,969 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 01:33:20,977 INFO L200 MainTranslator]: Completed pre-run [2025-04-14 01:33:21,011 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/popl20-threaded-sum-3.wvr.c[2996,3009] [2025-04-14 01:33:21,011 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 01:33:21,023 INFO L204 MainTranslator]: Completed translation [2025-04-14 01:33:21,024 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:33:21 WrapperNode [2025-04-14 01:33:21,024 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-14 01:33:21,025 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-14 01:33:21,025 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-14 01:33:21,025 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-14 01:33:21,030 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:33:21" (1/1) ... [2025-04-14 01:33:21,038 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:33:21" (1/1) ... [2025-04-14 01:33:21,056 INFO L138 Inliner]: procedures = 21, calls = 31, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 65 [2025-04-14 01:33:21,057 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-14 01:33:21,057 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-14 01:33:21,057 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-14 01:33:21,057 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-14 01:33:21,063 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:33:21" (1/1) ... [2025-04-14 01:33:21,063 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:33:21" (1/1) ... [2025-04-14 01:33:21,065 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:33:21" (1/1) ... [2025-04-14 01:33:21,078 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 01:33:21,081 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:33:21" (1/1) ... [2025-04-14 01:33:21,081 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:33:21" (1/1) ... [2025-04-14 01:33:21,084 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:33:21" (1/1) ... [2025-04-14 01:33:21,088 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:33:21" (1/1) ... [2025-04-14 01:33:21,088 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:33:21" (1/1) ... [2025-04-14 01:33:21,089 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:33:21" (1/1) ... [2025-04-14 01:33:21,094 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-14 01:33:21,094 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-04-14 01:33:21,094 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-04-14 01:33:21,094 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-04-14 01:33:21,095 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:33:21" (1/1) ... [2025-04-14 01:33:21,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 01:33:21,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:33:21,117 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 01:33:21,120 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 01:33:21,136 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-14 01:33:21,136 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-14 01:33:21,136 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-14 01:33:21,136 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-14 01:33:21,136 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-14 01:33:21,136 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-14 01:33:21,136 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-14 01:33:21,136 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-14 01:33:21,136 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-04-14 01:33:21,136 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-04-14 01:33:21,136 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-14 01:33:21,136 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-14 01:33:21,137 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 01:33:21,199 INFO L256 CfgBuilder]: Building ICFG [2025-04-14 01:33:21,201 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-14 01:33:21,366 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-14 01:33:21,366 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-14 01:33:21,366 INFO L318 CfgBuilder]: Performing block encoding [2025-04-14 01:33:21,500 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-14 01:33:21,500 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 01:33:21 BoogieIcfgContainer [2025-04-14 01:33:21,501 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-04-14 01:33:21,502 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-14 01:33:21,502 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-14 01:33:21,505 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-14 01:33:21,505 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.04 01:33:20" (1/3) ... [2025-04-14 01:33:21,505 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5688374c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 01:33:21, skipping insertion in model container [2025-04-14 01:33:21,505 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:33:21" (2/3) ... [2025-04-14 01:33:21,506 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5688374c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 01:33:21, skipping insertion in model container [2025-04-14 01:33:21,506 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 01:33:21" (3/3) ... [2025-04-14 01:33:21,506 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-threaded-sum-3.wvr.c [2025-04-14 01:33:21,516 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-14 01:33:21,517 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-threaded-sum-3.wvr.c that has 4 procedures, 32 locations, 31 edges, 1 initial locations, 3 loop locations, and 1 error locations. [2025-04-14 01:33:21,517 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-14 01:33:21,562 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-14 01:33:21,588 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 34 transitions, 89 flow [2025-04-14 01:33:21,612 INFO L116 PetriNetUnfolderBase]: 3/31 cut-off events. [2025-04-14 01:33:21,615 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-14 01:33:21,616 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44 conditions, 31 events. 3/31 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 50 event pairs, 0 based on Foata normal form. 0/27 useless extension candidates. Maximal degree in co-relation 28. Up to 2 conditions per place. [2025-04-14 01:33:21,616 INFO L82 GeneralOperation]: Start removeDead. Operand has 41 places, 34 transitions, 89 flow [2025-04-14 01:33:21,621 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 37 places, 30 transitions, 78 flow [2025-04-14 01:33:21,627 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-14 01:33:21,633 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;@75f4402b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 01:33:21,634 INFO L341 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-04-14 01:33:21,643 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-14 01:33:21,643 INFO L116 PetriNetUnfolderBase]: 3/29 cut-off events. [2025-04-14 01:33:21,643 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-14 01:33:21,644 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:33:21,644 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 01:33:21,644 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:33:21,649 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:33:21,649 INFO L85 PathProgramCache]: Analyzing trace with hash -1389857579, now seen corresponding path program 1 times [2025-04-14 01:33:21,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:33:21,655 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678959213] [2025-04-14 01:33:21,656 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:33:21,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:33:21,708 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-14 01:33:21,764 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-14 01:33:21,765 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:33:21,765 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:33:22,171 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 01:33:22,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:33:22,171 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678959213] [2025-04-14 01:33:22,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678959213] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:33:22,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:33:22,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 01:33:22,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444690445] [2025-04-14 01:33:22,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:33:22,177 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 01:33:22,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:33:22,195 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 01:33:22,196 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-14 01:33:22,206 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 34 [2025-04-14 01:33:22,208 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 30 transitions, 78 flow. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 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:33:22,208 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:33:22,208 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 34 [2025-04-14 01:33:22,208 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:33:22,455 INFO L116 PetriNetUnfolderBase]: 644/1017 cut-off events. [2025-04-14 01:33:22,455 INFO L117 PetriNetUnfolderBase]: For 96/96 co-relation queries the response was YES. [2025-04-14 01:33:22,458 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2028 conditions, 1017 events. 644/1017 cut-off events. For 96/96 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 4529 event pairs, 47 based on Foata normal form. 35/1043 useless extension candidates. Maximal degree in co-relation 1805. Up to 727 conditions per place. [2025-04-14 01:33:22,464 INFO L140 encePairwiseOnDemand]: 29/34 looper letters, 43 selfloop transitions, 5 changer transitions 0/54 dead transitions. [2025-04-14 01:33:22,464 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 54 transitions, 234 flow [2025-04-14 01:33:22,466 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 01:33:22,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-14 01:33:22,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 85 transitions. [2025-04-14 01:33:22,476 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.625 [2025-04-14 01:33:22,477 INFO L175 Difference]: Start difference. First operand has 37 places, 30 transitions, 78 flow. Second operand 4 states and 85 transitions. [2025-04-14 01:33:22,477 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 54 transitions, 234 flow [2025-04-14 01:33:22,482 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 54 transitions, 214 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-04-14 01:33:22,485 INFO L231 Difference]: Finished difference. Result has 36 places, 34 transitions, 98 flow [2025-04-14 01:33:22,486 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=98, PETRI_PLACES=36, PETRI_TRANSITIONS=34} [2025-04-14 01:33:22,490 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, -1 predicate places. [2025-04-14 01:33:22,490 INFO L485 AbstractCegarLoop]: Abstraction has has 36 places, 34 transitions, 98 flow [2025-04-14 01:33:22,490 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 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:33:22,490 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:33:22,490 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:33:22,490 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-14 01:33:22,490 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:33:22,491 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:33:22,491 INFO L85 PathProgramCache]: Analyzing trace with hash 1402280897, now seen corresponding path program 1 times [2025-04-14 01:33:22,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:33:22,491 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205109264] [2025-04-14 01:33:22,491 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:33:22,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:33:22,501 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-14 01:33:22,513 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-14 01:33:22,514 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:33:22,514 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:33:22,751 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 01:33:22,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:33:22,752 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205109264] [2025-04-14 01:33:22,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205109264] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:33:22,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:33:22,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 01:33:22,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195595273] [2025-04-14 01:33:22,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:33:22,753 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 01:33:22,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:33:22,753 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 01:33:22,753 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-14 01:33:22,760 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 34 [2025-04-14 01:33:22,761 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 34 transitions, 98 flow. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 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:33:22,761 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:33:22,761 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 34 [2025-04-14 01:33:22,761 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:33:22,930 INFO L116 PetriNetUnfolderBase]: 592/906 cut-off events. [2025-04-14 01:33:22,930 INFO L117 PetriNetUnfolderBase]: For 246/246 co-relation queries the response was YES. [2025-04-14 01:33:22,932 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2082 conditions, 906 events. 592/906 cut-off events. For 246/246 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 3693 event pairs, 67 based on Foata normal form. 18/920 useless extension candidates. Maximal degree in co-relation 1505. Up to 710 conditions per place. [2025-04-14 01:33:22,936 INFO L140 encePairwiseOnDemand]: 29/34 looper letters, 39 selfloop transitions, 8 changer transitions 0/53 dead transitions. [2025-04-14 01:33:22,936 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 53 transitions, 246 flow [2025-04-14 01:33:22,937 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 01:33:22,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-14 01:33:22,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 82 transitions. [2025-04-14 01:33:22,937 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6029411764705882 [2025-04-14 01:33:22,937 INFO L175 Difference]: Start difference. First operand has 36 places, 34 transitions, 98 flow. Second operand 4 states and 82 transitions. [2025-04-14 01:33:22,937 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 53 transitions, 246 flow [2025-04-14 01:33:22,938 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 53 transitions, 246 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-14 01:33:22,939 INFO L231 Difference]: Finished difference. Result has 41 places, 38 transitions, 144 flow [2025-04-14 01:33:22,939 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=144, PETRI_PLACES=41, PETRI_TRANSITIONS=38} [2025-04-14 01:33:22,939 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 4 predicate places. [2025-04-14 01:33:22,939 INFO L485 AbstractCegarLoop]: Abstraction has has 41 places, 38 transitions, 144 flow [2025-04-14 01:33:22,939 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 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:33:22,940 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:33:22,940 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:33:22,940 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-14 01:33:22,940 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:33:22,940 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:33:22,940 INFO L85 PathProgramCache]: Analyzing trace with hash 1087345933, now seen corresponding path program 2 times [2025-04-14 01:33:22,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:33:22,940 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569858575] [2025-04-14 01:33:22,940 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:33:22,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:33:22,950 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-04-14 01:33:22,963 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 20 of 23 statements. [2025-04-14 01:33:22,963 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 01:33:22,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:33:23,159 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 01:33:23,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:33:23,159 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569858575] [2025-04-14 01:33:23,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569858575] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:33:23,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:33:23,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 01:33:23,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423044399] [2025-04-14 01:33:23,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:33:23,160 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 01:33:23,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:33:23,160 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 01:33:23,160 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-14 01:33:23,165 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 34 [2025-04-14 01:33:23,165 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 38 transitions, 144 flow. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 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:33:23,166 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:33:23,166 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 34 [2025-04-14 01:33:23,166 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:33:23,385 INFO L116 PetriNetUnfolderBase]: 886/1366 cut-off events. [2025-04-14 01:33:23,385 INFO L117 PetriNetUnfolderBase]: For 636/636 co-relation queries the response was YES. [2025-04-14 01:33:23,389 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3380 conditions, 1366 events. 886/1366 cut-off events. For 636/636 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 6422 event pairs, 135 based on Foata normal form. 44/1406 useless extension candidates. Maximal degree in co-relation 2427. Up to 864 conditions per place. [2025-04-14 01:33:23,395 INFO L140 encePairwiseOnDemand]: 27/34 looper letters, 62 selfloop transitions, 10 changer transitions 0/78 dead transitions. [2025-04-14 01:33:23,395 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 78 transitions, 430 flow [2025-04-14 01:33:23,397 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 01:33:23,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 01:33:23,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 108 transitions. [2025-04-14 01:33:23,398 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6352941176470588 [2025-04-14 01:33:23,398 INFO L175 Difference]: Start difference. First operand has 41 places, 38 transitions, 144 flow. Second operand 5 states and 108 transitions. [2025-04-14 01:33:23,398 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 78 transitions, 430 flow [2025-04-14 01:33:23,399 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 78 transitions, 417 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-14 01:33:23,400 INFO L231 Difference]: Finished difference. Result has 46 places, 43 transitions, 204 flow [2025-04-14 01:33:23,400 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=137, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=204, PETRI_PLACES=46, PETRI_TRANSITIONS=43} [2025-04-14 01:33:23,402 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 9 predicate places. [2025-04-14 01:33:23,402 INFO L485 AbstractCegarLoop]: Abstraction has has 46 places, 43 transitions, 204 flow [2025-04-14 01:33:23,403 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 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:33:23,403 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:33:23,403 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:33:23,403 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-14 01:33:23,403 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:33:23,403 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:33:23,404 INFO L85 PathProgramCache]: Analyzing trace with hash 462250223, now seen corresponding path program 3 times [2025-04-14 01:33:23,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:33:23,404 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554868083] [2025-04-14 01:33:23,404 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 01:33:23,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:33:23,417 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 23 statements into 2 equivalence classes. [2025-04-14 01:33:23,429 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 20 of 23 statements. [2025-04-14 01:33:23,430 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-14 01:33:23,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:33:23,572 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 01:33:23,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:33:23,572 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554868083] [2025-04-14 01:33:23,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554868083] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:33:23,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:33:23,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 01:33:23,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181603902] [2025-04-14 01:33:23,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:33:23,573 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 01:33:23,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:33:23,573 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 01:33:23,573 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-14 01:33:23,577 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 34 [2025-04-14 01:33:23,577 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 43 transitions, 204 flow. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 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:33:23,577 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:33:23,577 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 34 [2025-04-14 01:33:23,577 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:33:23,780 INFO L116 PetriNetUnfolderBase]: 1062/1678 cut-off events. [2025-04-14 01:33:23,780 INFO L117 PetriNetUnfolderBase]: For 1414/1414 co-relation queries the response was YES. [2025-04-14 01:33:23,784 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4465 conditions, 1678 events. 1062/1678 cut-off events. For 1414/1414 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 8562 event pairs, 138 based on Foata normal form. 60/1728 useless extension candidates. Maximal degree in co-relation 2095. Up to 784 conditions per place. [2025-04-14 01:33:23,792 INFO L140 encePairwiseOnDemand]: 30/34 looper letters, 65 selfloop transitions, 3 changer transitions 0/74 dead transitions. [2025-04-14 01:33:23,792 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 74 transitions, 482 flow [2025-04-14 01:33:23,793 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 01:33:23,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-14 01:33:23,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 85 transitions. [2025-04-14 01:33:23,794 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.625 [2025-04-14 01:33:23,794 INFO L175 Difference]: Start difference. First operand has 46 places, 43 transitions, 204 flow. Second operand 4 states and 85 transitions. [2025-04-14 01:33:23,794 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 74 transitions, 482 flow [2025-04-14 01:33:23,797 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 74 transitions, 467 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-14 01:33:23,798 INFO L231 Difference]: Finished difference. Result has 48 places, 44 transitions, 208 flow [2025-04-14 01:33:23,798 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=194, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=208, PETRI_PLACES=48, PETRI_TRANSITIONS=44} [2025-04-14 01:33:23,798 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 11 predicate places. [2025-04-14 01:33:23,800 INFO L485 AbstractCegarLoop]: Abstraction has has 48 places, 44 transitions, 208 flow [2025-04-14 01:33:23,800 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 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:33:23,800 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:33:23,800 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:33:23,800 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-14 01:33:23,800 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:33:23,801 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:33:23,801 INFO L85 PathProgramCache]: Analyzing trace with hash -1213960896, now seen corresponding path program 1 times [2025-04-14 01:33:23,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:33:23,801 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998928772] [2025-04-14 01:33:23,801 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:33:23,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:33:23,809 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-14 01:33:23,818 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-14 01:33:23,818 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:33:23,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:33:24,035 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 01:33:24,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:33:24,035 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998928772] [2025-04-14 01:33:24,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998928772] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:33:24,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:33:24,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 01:33:24,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809687493] [2025-04-14 01:33:24,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:33:24,036 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 01:33:24,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:33:24,036 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 01:33:24,036 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-14 01:33:24,039 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 34 [2025-04-14 01:33:24,039 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 44 transitions, 208 flow. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 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:33:24,039 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:33:24,039 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 34 [2025-04-14 01:33:24,039 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:33:24,265 INFO L116 PetriNetUnfolderBase]: 1470/2279 cut-off events. [2025-04-14 01:33:24,266 INFO L117 PetriNetUnfolderBase]: For 1916/1916 co-relation queries the response was YES. [2025-04-14 01:33:24,270 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6242 conditions, 2279 events. 1470/2279 cut-off events. For 1916/1916 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 12031 event pairs, 389 based on Foata normal form. 65/2335 useless extension candidates. Maximal degree in co-relation 2750. Up to 1408 conditions per place. [2025-04-14 01:33:24,278 INFO L140 encePairwiseOnDemand]: 28/34 looper letters, 59 selfloop transitions, 12 changer transitions 0/77 dead transitions. [2025-04-14 01:33:24,279 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 77 transitions, 474 flow [2025-04-14 01:33:24,279 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 01:33:24,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 01:33:24,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 103 transitions. [2025-04-14 01:33:24,281 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6058823529411764 [2025-04-14 01:33:24,281 INFO L175 Difference]: Start difference. First operand has 48 places, 44 transitions, 208 flow. Second operand 5 states and 103 transitions. [2025-04-14 01:33:24,281 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 77 transitions, 474 flow [2025-04-14 01:33:24,284 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 77 transitions, 466 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-14 01:33:24,284 INFO L231 Difference]: Finished difference. Result has 51 places, 45 transitions, 241 flow [2025-04-14 01:33:24,285 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=204, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=241, PETRI_PLACES=51, PETRI_TRANSITIONS=45} [2025-04-14 01:33:24,285 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 14 predicate places. [2025-04-14 01:33:24,285 INFO L485 AbstractCegarLoop]: Abstraction has has 51 places, 45 transitions, 241 flow [2025-04-14 01:33:24,285 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 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:33:24,285 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:33:24,285 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:33:24,285 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-14 01:33:24,286 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:33:24,286 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:33:24,286 INFO L85 PathProgramCache]: Analyzing trace with hash 378377994, now seen corresponding path program 2 times [2025-04-14 01:33:24,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:33:24,286 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133139217] [2025-04-14 01:33:24,286 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:33:24,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:33:24,290 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 1 equivalence classes. [2025-04-14 01:33:24,296 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-14 01:33:24,296 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 01:33:24,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:33:24,424 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 01:33:24,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:33:24,424 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133139217] [2025-04-14 01:33:24,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133139217] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:33:24,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:33:24,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 01:33:24,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366454034] [2025-04-14 01:33:24,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:33:24,425 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 01:33:24,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:33:24,425 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 01:33:24,425 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-14 01:33:24,429 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 34 [2025-04-14 01:33:24,429 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 45 transitions, 241 flow. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 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:33:24,429 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:33:24,429 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 34 [2025-04-14 01:33:24,429 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:33:24,679 INFO L116 PetriNetUnfolderBase]: 1920/2930 cut-off events. [2025-04-14 01:33:24,679 INFO L117 PetriNetUnfolderBase]: For 2872/2872 co-relation queries the response was YES. [2025-04-14 01:33:24,683 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8511 conditions, 2930 events. 1920/2930 cut-off events. For 2872/2872 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 15490 event pairs, 275 based on Foata normal form. 80/3006 useless extension candidates. Maximal degree in co-relation 4481. Up to 1493 conditions per place. [2025-04-14 01:33:24,693 INFO L140 encePairwiseOnDemand]: 28/34 looper letters, 82 selfloop transitions, 11 changer transitions 0/99 dead transitions. [2025-04-14 01:33:24,693 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 99 transitions, 655 flow [2025-04-14 01:33:24,693 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 01:33:24,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 01:33:24,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 115 transitions. [2025-04-14 01:33:24,694 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6764705882352942 [2025-04-14 01:33:24,694 INFO L175 Difference]: Start difference. First operand has 51 places, 45 transitions, 241 flow. Second operand 5 states and 115 transitions. [2025-04-14 01:33:24,694 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 99 transitions, 655 flow [2025-04-14 01:33:24,699 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 99 transitions, 627 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-04-14 01:33:24,700 INFO L231 Difference]: Finished difference. Result has 55 places, 50 transitions, 297 flow [2025-04-14 01:33:24,701 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=224, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=297, PETRI_PLACES=55, PETRI_TRANSITIONS=50} [2025-04-14 01:33:24,701 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 18 predicate places. [2025-04-14 01:33:24,701 INFO L485 AbstractCegarLoop]: Abstraction has has 55 places, 50 transitions, 297 flow [2025-04-14 01:33:24,701 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 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:33:24,701 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:33:24,701 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:33:24,701 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-14 01:33:24,701 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:33:24,702 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:33:24,702 INFO L85 PathProgramCache]: Analyzing trace with hash -1467872404, now seen corresponding path program 1 times [2025-04-14 01:33:24,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:33:24,702 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745412694] [2025-04-14 01:33:24,702 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:33:24,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:33:24,706 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-14 01:33:24,731 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-14 01:33:24,731 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:33:24,731 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:33:26,743 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 01:33:26,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:33:26,743 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745412694] [2025-04-14 01:33:26,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745412694] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:33:26,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:33:26,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-14 01:33:26,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248219322] [2025-04-14 01:33:26,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:33:26,744 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-14 01:33:26,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:33:26,744 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-14 01:33:26,744 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-04-14 01:33:26,773 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 34 [2025-04-14 01:33:26,774 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 50 transitions, 297 flow. Second operand has 11 states, 11 states have (on average 10.090909090909092) internal successors, (111), 11 states have internal predecessors, (111), 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:33:26,774 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:33:26,774 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 34 [2025-04-14 01:33:26,774 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:33:30,174 INFO L116 PetriNetUnfolderBase]: 4612/6962 cut-off events. [2025-04-14 01:33:30,175 INFO L117 PetriNetUnfolderBase]: For 12348/12348 co-relation queries the response was YES. [2025-04-14 01:33:30,186 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22885 conditions, 6962 events. 4612/6962 cut-off events. For 12348/12348 co-relation queries the response was YES. Maximal size of possible extension queue 385. Compared 40204 event pairs, 485 based on Foata normal form. 2/6963 useless extension candidates. Maximal degree in co-relation 9058. Up to 3645 conditions per place. [2025-04-14 01:33:30,213 INFO L140 encePairwiseOnDemand]: 20/34 looper letters, 196 selfloop transitions, 92 changer transitions 21/314 dead transitions. [2025-04-14 01:33:30,213 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 314 transitions, 2125 flow [2025-04-14 01:33:30,214 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-04-14 01:33:30,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2025-04-14 01:33:30,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 498 transitions. [2025-04-14 01:33:30,215 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5424836601307189 [2025-04-14 01:33:30,216 INFO L175 Difference]: Start difference. First operand has 55 places, 50 transitions, 297 flow. Second operand 27 states and 498 transitions. [2025-04-14 01:33:30,216 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 314 transitions, 2125 flow [2025-04-14 01:33:30,226 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 314 transitions, 2097 flow, removed 5 selfloop flow, removed 1 redundant places. [2025-04-14 01:33:30,232 INFO L231 Difference]: Finished difference. Result has 98 places, 139 transitions, 1251 flow [2025-04-14 01:33:30,232 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=290, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=27, PETRI_FLOW=1251, PETRI_PLACES=98, PETRI_TRANSITIONS=139} [2025-04-14 01:33:30,233 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 61 predicate places. [2025-04-14 01:33:30,233 INFO L485 AbstractCegarLoop]: Abstraction has has 98 places, 139 transitions, 1251 flow [2025-04-14 01:33:30,233 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.090909090909092) internal successors, (111), 11 states have internal predecessors, (111), 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:33:30,233 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:33:30,233 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:33:30,233 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-14 01:33:30,233 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:33:30,234 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:33:30,234 INFO L85 PathProgramCache]: Analyzing trace with hash 31414462, now seen corresponding path program 2 times [2025-04-14 01:33:30,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:33:30,234 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770305003] [2025-04-14 01:33:30,234 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:33:30,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:33:30,240 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-04-14 01:33:30,254 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-04-14 01:33:30,254 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:33:30,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:33:30,376 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 01:33:30,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:33:30,376 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770305003] [2025-04-14 01:33:30,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [770305003] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:33:30,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:33:30,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-14 01:33:30,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846233480] [2025-04-14 01:33:30,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:33:30,376 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 01:33:30,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:33:30,377 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 01:33:30,377 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-14 01:33:30,384 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 34 [2025-04-14 01:33:30,384 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 139 transitions, 1251 flow. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 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:33:30,384 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:33:30,384 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 34 [2025-04-14 01:33:30,384 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:33:31,602 INFO L116 PetriNetUnfolderBase]: 10694/16057 cut-off events. [2025-04-14 01:33:31,602 INFO L117 PetriNetUnfolderBase]: For 76692/76939 co-relation queries the response was YES. [2025-04-14 01:33:31,648 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69885 conditions, 16057 events. 10694/16057 cut-off events. For 76692/76939 co-relation queries the response was YES. Maximal size of possible extension queue 1007. Compared 106778 event pairs, 1424 based on Foata normal form. 305/16239 useless extension candidates. Maximal degree in co-relation 69780. Up to 4477 conditions per place. [2025-04-14 01:33:31,698 INFO L140 encePairwiseOnDemand]: 27/34 looper letters, 333 selfloop transitions, 56 changer transitions 0/396 dead transitions. [2025-04-14 01:33:31,699 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 396 transitions, 4225 flow [2025-04-14 01:33:31,699 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 01:33:31,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-14 01:33:31,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 138 transitions. [2025-04-14 01:33:31,700 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6764705882352942 [2025-04-14 01:33:31,700 INFO L175 Difference]: Start difference. First operand has 98 places, 139 transitions, 1251 flow. Second operand 6 states and 138 transitions. [2025-04-14 01:33:31,700 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 396 transitions, 4225 flow [2025-04-14 01:33:31,827 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 396 transitions, 3810 flow, removed 193 selfloop flow, removed 4 redundant places. [2025-04-14 01:33:31,831 INFO L231 Difference]: Finished difference. Result has 101 places, 182 transitions, 1647 flow [2025-04-14 01:33:31,831 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=1108, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1647, PETRI_PLACES=101, PETRI_TRANSITIONS=182} [2025-04-14 01:33:31,831 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 64 predicate places. [2025-04-14 01:33:31,831 INFO L485 AbstractCegarLoop]: Abstraction has has 101 places, 182 transitions, 1647 flow [2025-04-14 01:33:31,831 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 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:33:31,831 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:33:31,832 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:33:31,833 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-14 01:33:31,833 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:33:31,833 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:33:31,834 INFO L85 PathProgramCache]: Analyzing trace with hash -1997537448, now seen corresponding path program 3 times [2025-04-14 01:33:31,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:33:31,834 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922342779] [2025-04-14 01:33:31,834 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 01:33:31,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:33:31,837 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 27 statements into 1 equivalence classes. [2025-04-14 01:33:31,856 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-14 01:33:31,856 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-14 01:33:31,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:33:34,156 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 01:33:34,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:33:34,157 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922342779] [2025-04-14 01:33:34,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922342779] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:33:34,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:33:34,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-14 01:33:34,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014499047] [2025-04-14 01:33:34,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:33:34,157 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-14 01:33:34,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:33:34,157 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-14 01:33:34,157 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2025-04-14 01:33:34,212 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 34 [2025-04-14 01:33:34,212 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 182 transitions, 1647 flow. Second operand has 13 states, 13 states have (on average 9.76923076923077) internal successors, (127), 13 states have internal predecessors, (127), 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:33:34,212 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:33:34,212 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 34 [2025-04-14 01:33:34,212 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:33:38,906 INFO L116 PetriNetUnfolderBase]: 15057/22536 cut-off events. [2025-04-14 01:33:38,907 INFO L117 PetriNetUnfolderBase]: For 122256/122573 co-relation queries the response was YES. [2025-04-14 01:33:38,988 INFO L83 FinitePrefix]: Finished finitePrefix Result has 106001 conditions, 22536 events. 15057/22536 cut-off events. For 122256/122573 co-relation queries the response was YES. Maximal size of possible extension queue 1403. Compared 155838 event pairs, 1413 based on Foata normal form. 50/22432 useless extension candidates. Maximal degree in co-relation 85268. Up to 13031 conditions per place. [2025-04-14 01:33:39,187 INFO L140 encePairwiseOnDemand]: 21/34 looper letters, 335 selfloop transitions, 266 changer transitions 13/621 dead transitions. [2025-04-14 01:33:39,187 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 621 transitions, 6357 flow [2025-04-14 01:33:39,187 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-04-14 01:33:39,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2025-04-14 01:33:39,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 491 transitions. [2025-04-14 01:33:39,189 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5157563025210085 [2025-04-14 01:33:39,189 INFO L175 Difference]: Start difference. First operand has 101 places, 182 transitions, 1647 flow. Second operand 28 states and 491 transitions. [2025-04-14 01:33:39,189 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 621 transitions, 6357 flow [2025-04-14 01:33:39,363 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 621 transitions, 6337 flow, removed 10 selfloop flow, removed 0 redundant places. [2025-04-14 01:33:39,370 INFO L231 Difference]: Finished difference. Result has 144 places, 384 transitions, 4530 flow [2025-04-14 01:33:39,370 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=1639, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=182, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=93, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=28, PETRI_FLOW=4530, PETRI_PLACES=144, PETRI_TRANSITIONS=384} [2025-04-14 01:33:39,371 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 107 predicate places. [2025-04-14 01:33:39,371 INFO L485 AbstractCegarLoop]: Abstraction has has 144 places, 384 transitions, 4530 flow [2025-04-14 01:33:39,371 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 9.76923076923077) internal successors, (127), 13 states have internal predecessors, (127), 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:33:39,371 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:33:39,371 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:33:39,371 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-14 01:33:39,371 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:33:39,371 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:33:39,371 INFO L85 PathProgramCache]: Analyzing trace with hash -1728756498, now seen corresponding path program 4 times [2025-04-14 01:33:39,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:33:39,372 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060252500] [2025-04-14 01:33:39,372 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 01:33:39,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:33:39,378 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 27 statements into 2 equivalence classes. [2025-04-14 01:33:39,383 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-04-14 01:33:39,383 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 01:33:39,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:33:39,464 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 01:33:39,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:33:39,464 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060252500] [2025-04-14 01:33:39,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060252500] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:33:39,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:33:39,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-14 01:33:39,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554124185] [2025-04-14 01:33:39,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:33:39,465 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 01:33:39,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:33:39,465 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 01:33:39,465 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-14 01:33:39,470 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 34 [2025-04-14 01:33:39,470 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 384 transitions, 4530 flow. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 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:33:39,470 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:33:39,470 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 34 [2025-04-14 01:33:39,470 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:33:42,526 INFO L116 PetriNetUnfolderBase]: 16770/25050 cut-off events. [2025-04-14 01:33:42,526 INFO L117 PetriNetUnfolderBase]: For 226074/226476 co-relation queries the response was YES. [2025-04-14 01:33:42,705 INFO L83 FinitePrefix]: Finished finitePrefix Result has 142680 conditions, 25050 events. 16770/25050 cut-off events. For 226074/226476 co-relation queries the response was YES. Maximal size of possible extension queue 1550. Compared 175116 event pairs, 1274 based on Foata normal form. 1125/25978 useless extension candidates. Maximal degree in co-relation 142308. Up to 8037 conditions per place. [2025-04-14 01:33:42,802 INFO L140 encePairwiseOnDemand]: 26/34 looper letters, 616 selfloop transitions, 171 changer transitions 0/794 dead transitions. [2025-04-14 01:33:42,803 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 794 transitions, 10957 flow [2025-04-14 01:33:42,803 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-14 01:33:42,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-14 01:33:42,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 170 transitions. [2025-04-14 01:33:42,804 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5555555555555556 [2025-04-14 01:33:42,804 INFO L175 Difference]: Start difference. First operand has 144 places, 384 transitions, 4530 flow. Second operand 9 states and 170 transitions. [2025-04-14 01:33:42,804 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 794 transitions, 10957 flow [2025-04-14 01:33:43,965 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 794 transitions, 10348 flow, removed 292 selfloop flow, removed 3 redundant places. [2025-04-14 01:33:43,972 INFO L231 Difference]: Finished difference. Result has 155 places, 434 transitions, 5470 flow [2025-04-14 01:33:43,972 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=4199, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=374, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=111, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=255, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5470, PETRI_PLACES=155, PETRI_TRANSITIONS=434} [2025-04-14 01:33:43,973 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 118 predicate places. [2025-04-14 01:33:43,973 INFO L485 AbstractCegarLoop]: Abstraction has has 155 places, 434 transitions, 5470 flow [2025-04-14 01:33:43,973 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 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:33:43,973 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:33:43,973 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:33:43,973 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-14 01:33:43,973 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:33:43,973 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:33:43,973 INFO L85 PathProgramCache]: Analyzing trace with hash -288492146, now seen corresponding path program 5 times [2025-04-14 01:33:43,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:33:43,973 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801624972] [2025-04-14 01:33:43,974 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 01:33:43,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:33:43,977 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 27 statements into 1 equivalence classes. [2025-04-14 01:33:43,983 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-14 01:33:43,983 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 01:33:43,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:33:44,083 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 01:33:44,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:33:44,083 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801624972] [2025-04-14 01:33:44,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801624972] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:33:44,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:33:44,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-14 01:33:44,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765768668] [2025-04-14 01:33:44,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:33:44,084 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-14 01:33:44,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:33:44,084 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-14 01:33:44,084 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-14 01:33:44,090 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 34 [2025-04-14 01:33:44,091 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 434 transitions, 5470 flow. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 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 01:33:44,091 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:33:44,091 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 34 [2025-04-14 01:33:44,091 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:33:47,333 INFO L116 PetriNetUnfolderBase]: 17347/25746 cut-off events. [2025-04-14 01:33:47,333 INFO L117 PetriNetUnfolderBase]: For 267728/268106 co-relation queries the response was YES. [2025-04-14 01:33:47,548 INFO L83 FinitePrefix]: Finished finitePrefix Result has 157804 conditions, 25746 events. 17347/25746 cut-off events. For 267728/268106 co-relation queries the response was YES. Maximal size of possible extension queue 1417. Compared 177578 event pairs, 953 based on Foata normal form. 804/26358 useless extension candidates. Maximal degree in co-relation 157444. Up to 7407 conditions per place. [2025-04-14 01:33:47,911 INFO L140 encePairwiseOnDemand]: 26/34 looper letters, 488 selfloop transitions, 189 changer transitions 0/684 dead transitions. [2025-04-14 01:33:47,911 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 684 transitions, 9399 flow [2025-04-14 01:33:47,911 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-14 01:33:47,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-14 01:33:47,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 167 transitions. [2025-04-14 01:33:47,912 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.545751633986928 [2025-04-14 01:33:47,912 INFO L175 Difference]: Start difference. First operand has 155 places, 434 transitions, 5470 flow. Second operand 9 states and 167 transitions. [2025-04-14 01:33:47,912 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 684 transitions, 9399 flow [2025-04-14 01:33:48,800 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 684 transitions, 9319 flow, removed 38 selfloop flow, removed 1 redundant places. [2025-04-14 01:33:48,807 INFO L231 Difference]: Finished difference. Result has 166 places, 449 transitions, 6246 flow [2025-04-14 01:33:48,807 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=4864, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=397, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=141, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=239, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=6246, PETRI_PLACES=166, PETRI_TRANSITIONS=449} [2025-04-14 01:33:48,808 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 129 predicate places. [2025-04-14 01:33:48,808 INFO L485 AbstractCegarLoop]: Abstraction has has 166 places, 449 transitions, 6246 flow [2025-04-14 01:33:48,808 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 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 01:33:48,808 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:33:48,808 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:33:48,808 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-14 01:33:48,808 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:33:48,809 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:33:48,809 INFO L85 PathProgramCache]: Analyzing trace with hash -528407104, now seen corresponding path program 6 times [2025-04-14 01:33:48,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:33:48,809 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312240720] [2025-04-14 01:33:48,809 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-14 01:33:48,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:33:48,812 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 27 statements into 2 equivalence classes. [2025-04-14 01:33:48,828 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-04-14 01:33:48,828 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-14 01:33:48,828 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:33:49,750 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 01:33:49,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:33:49,751 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312240720] [2025-04-14 01:33:49,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312240720] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:33:49,751 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [923995414] [2025-04-14 01:33:49,751 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-14 01:33:49,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:33:49,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:33:49,754 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 01:33:49,754 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 01:33:49,787 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 27 statements into 2 equivalence classes. [2025-04-14 01:33:49,827 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-04-14 01:33:49,828 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-14 01:33:49,828 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:33:49,830 INFO L256 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-04-14 01:33:49,832 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:33:50,739 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 01:33:50,739 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:33:56,103 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 01:33:56,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [923995414] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:33:56,103 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:33:56,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 9] total 25 [2025-04-14 01:33:56,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936488162] [2025-04-14 01:33:56,103 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:33:56,105 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-04-14 01:33:56,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:33:56,105 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-04-14 01:33:56,106 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=559, Unknown=1, NotChecked=0, Total=702 [2025-04-14 01:33:56,117 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34 [2025-04-14 01:33:56,118 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 449 transitions, 6246 flow. Second operand has 27 states, 27 states have (on average 9.555555555555555) internal successors, (258), 27 states have internal predecessors, (258), 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:33:56,118 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:33:56,118 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34 [2025-04-14 01:33:56,118 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:34:09,599 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:34:17,063 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.60s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 01:34:45,046 WARN L286 SmtUtils]: Spent 8.36s on a formula simplification. DAG size of input: 133 DAG size of output: 100 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-14 01:35:18,895 INFO L116 PetriNetUnfolderBase]: 109252/158754 cut-off events. [2025-04-14 01:35:18,895 INFO L117 PetriNetUnfolderBase]: For 1621415/1622703 co-relation queries the response was YES. [2025-04-14 01:35:20,968 INFO L83 FinitePrefix]: Finished finitePrefix Result has 942901 conditions, 158754 events. 109252/158754 cut-off events. For 1621415/1622703 co-relation queries the response was YES. Maximal size of possible extension queue 6072. Compared 1248932 event pairs, 2429 based on Foata normal form. 1065/159642 useless extension candidates. Maximal degree in co-relation 942429. Up to 37302 conditions per place. [2025-04-14 01:35:21,677 INFO L140 encePairwiseOnDemand]: 20/34 looper letters, 1400 selfloop transitions, 1425 changer transitions 629/3470 dead transitions. [2025-04-14 01:35:21,677 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 273 places, 3470 transitions, 50890 flow [2025-04-14 01:35:21,678 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2025-04-14 01:35:21,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2025-04-14 01:35:21,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 1919 transitions. [2025-04-14 01:35:21,683 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5226034858387799 [2025-04-14 01:35:21,683 INFO L175 Difference]: Start difference. First operand has 166 places, 449 transitions, 6246 flow. Second operand 108 states and 1919 transitions. [2025-04-14 01:35:21,683 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 273 places, 3470 transitions, 50890 flow [2025-04-14 01:35:46,137 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 273 places, 3470 transitions, 50752 flow, removed 69 selfloop flow, removed 0 redundant places. [2025-04-14 01:35:46,163 INFO L231 Difference]: Finished difference. Result has 343 places, 1784 transitions, 30949 flow [2025-04-14 01:35:46,164 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=6232, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=449, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=308, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=108, PETRI_FLOW=30949, PETRI_PLACES=343, PETRI_TRANSITIONS=1784} [2025-04-14 01:35:46,165 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 306 predicate places. [2025-04-14 01:35:46,165 INFO L485 AbstractCegarLoop]: Abstraction has has 343 places, 1784 transitions, 30949 flow [2025-04-14 01:35:46,165 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 9.555555555555555) internal successors, (258), 27 states have internal predecessors, (258), 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:35:46,165 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:35:46,165 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:35:46,172 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 01:35:46,367 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,SelfDestructingSolverStorable11 [2025-04-14 01:35:46,367 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:35:46,367 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:35:46,367 INFO L85 PathProgramCache]: Analyzing trace with hash -618295146, now seen corresponding path program 7 times [2025-04-14 01:35:46,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:35:46,368 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216567239] [2025-04-14 01:35:46,368 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-14 01:35:46,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:35:46,372 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-14 01:35:46,388 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-14 01:35:46,388 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:35:46,388 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:35:47,219 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 01:35:47,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:35:47,219 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216567239] [2025-04-14 01:35:47,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216567239] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:35:47,219 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [745410982] [2025-04-14 01:35:47,219 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-14 01:35:47,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:35:47,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:35:47,221 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 01:35:47,222 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 01:35:47,252 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-14 01:35:47,284 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-14 01:35:47,284 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:35:47,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:35:47,285 INFO L256 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-04-14 01:35:47,286 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:35:47,818 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 01:35:47,818 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:36:04,616 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 01:36:04,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [745410982] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:36:04,617 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:36:04,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 8] total 24 [2025-04-14 01:36:04,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123441867] [2025-04-14 01:36:04,617 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:36:04,617 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-04-14 01:36:04,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:36:04,618 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-04-14 01:36:04,618 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=501, Unknown=4, NotChecked=0, Total=650 [2025-04-14 01:36:04,621 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34 [2025-04-14 01:36:04,622 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 343 places, 1784 transitions, 30949 flow. Second operand has 26 states, 26 states have (on average 9.653846153846153) internal successors, (251), 26 states have internal predecessors, (251), 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:36:04,622 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:36:04,622 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34 [2025-04-14 01:36:04,622 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:36:19,323 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 []