/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.automaton.type.used.in.concurrency.analysis PETRI_NET -i ../../../trunk/examples/svcomp/weaver/test-easy10.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 20:59:18,115 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 20:59:18,165 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2025-04-13 20:59:18,171 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 20:59:18,171 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 20:59:18,193 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 20:59:18,194 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 20:59:18,194 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 20:59:18,194 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 20:59:18,194 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 20:59:18,194 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 20:59:18,194 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 20:59:18,194 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 20:59:18,194 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 20:59:18,194 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 20:59:18,194 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 20:59:18,195 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 20:59:18,195 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 20:59:18,195 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 20:59:18,195 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 20:59:18,195 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 20:59:18,195 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 20:59:18,195 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 20:59:18,195 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 20:59:18,195 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 20:59:18,195 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 20:59:18,195 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 20:59:18,195 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 20:59:18,195 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 20:59:18,195 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 20:59:18,196 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 20:59:18,196 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 20:59:18,196 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 20:59:18,196 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 20:59:18,196 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 20:59:18,196 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 20:59:18,197 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 20:59:18,197 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 20:59:18,197 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 20:59:18,197 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 20:59:18,197 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 20:59:18,197 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 20:59:18,197 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 20:59:18,197 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 20:59:18,197 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 20:59:18,197 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 20:59:18,197 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 20:59:18,197 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Automaton type used in concurrency analysis -> PETRI_NET [2025-04-13 20:59:18,399 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 20:59:18,405 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 20:59:18,407 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 20:59:18,408 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 20:59:18,409 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 20:59:18,410 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/test-easy10.wvr.c [2025-04-13 20:59:19,690 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/69842752a/a14a4111b6124edcaf9a162539dd393c/FLAG045c18c01 [2025-04-13 20:59:19,872 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 20:59:19,872 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/test-easy10.wvr.c [2025-04-13 20:59:19,879 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/69842752a/a14a4111b6124edcaf9a162539dd393c/FLAG045c18c01 [2025-04-13 20:59:20,690 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/69842752a/a14a4111b6124edcaf9a162539dd393c [2025-04-13 20:59:20,692 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 20:59:20,693 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 20:59:20,694 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 20:59:20,694 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 20:59:20,697 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 20:59:20,698 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 08:59:20" (1/1) ... [2025-04-13 20:59:20,700 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51e62010 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:59:20, skipping insertion in model container [2025-04-13 20:59:20,700 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 08:59:20" (1/1) ... [2025-04-13 20:59:20,713 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 20:59:20,886 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/test-easy10.wvr.c[2547,2560] [2025-04-13 20:59:20,890 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 20:59:20,897 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 20:59:20,929 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/test-easy10.wvr.c[2547,2560] [2025-04-13 20:59:20,930 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 20:59:20,941 INFO L204 MainTranslator]: Completed translation [2025-04-13 20:59:20,942 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:59:20 WrapperNode [2025-04-13 20:59:20,942 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 20:59:20,943 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 20:59:20,943 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 20:59:20,943 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 20:59:20,948 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:59:20" (1/1) ... [2025-04-13 20:59:20,954 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:59:20" (1/1) ... [2025-04-13 20:59:20,976 INFO L138 Inliner]: procedures = 20, calls = 16, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 147 [2025-04-13 20:59:20,977 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 20:59:20,977 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 20:59:20,977 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 20:59:20,977 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 20:59:20,983 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:59:20" (1/1) ... [2025-04-13 20:59:20,983 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:59:20" (1/1) ... [2025-04-13 20:59:20,984 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:59:20" (1/1) ... [2025-04-13 20:59:20,998 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-04-13 20:59:20,998 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:59:20" (1/1) ... [2025-04-13 20:59:20,998 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:59:20" (1/1) ... [2025-04-13 20:59:21,001 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:59:20" (1/1) ... [2025-04-13 20:59:21,001 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:59:20" (1/1) ... [2025-04-13 20:59:21,002 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:59:20" (1/1) ... [2025-04-13 20:59:21,003 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:59:20" (1/1) ... [2025-04-13 20:59:21,003 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:59:20" (1/1) ... [2025-04-13 20:59:21,006 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 20:59:21,006 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-13 20:59:21,006 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-13 20:59:21,006 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-13 20:59:21,007 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:59:20" (1/1) ... [2025-04-13 20:59:21,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 20:59:21,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:59:21,031 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-13 20:59:21,033 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-13 20:59:21,047 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 20:59:21,047 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-13 20:59:21,047 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-13 20:59:21,048 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-13 20:59:21,048 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-13 20:59:21,048 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-13 20:59:21,048 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-13 20:59:21,048 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-04-13 20:59:21,048 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-04-13 20:59:21,048 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 20:59:21,048 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 20:59:21,048 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 20:59:21,049 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-13 20:59:21,110 INFO L234 CfgBuilder]: Building ICFG [2025-04-13 20:59:21,111 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 20:59:21,271 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 20:59:21,272 INFO L289 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 20:59:21,272 INFO L294 CfgBuilder]: Performing block encoding [2025-04-13 20:59:21,407 INFO L313 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 20:59:21,407 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 08:59:21 BoogieIcfgContainer [2025-04-13 20:59:21,407 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-13 20:59:21,409 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 20:59:21,409 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 20:59:21,413 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 20:59:21,413 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 08:59:20" (1/3) ... [2025-04-13 20:59:21,414 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23bfe169 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 08:59:21, skipping insertion in model container [2025-04-13 20:59:21,414 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:59:20" (2/3) ... [2025-04-13 20:59:21,414 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23bfe169 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 08:59:21, skipping insertion in model container [2025-04-13 20:59:21,414 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 08:59:21" (3/3) ... [2025-04-13 20:59:21,415 INFO L128 eAbstractionObserver]: Analyzing ICFG test-easy10.wvr.c [2025-04-13 20:59:21,425 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 20:59:21,426 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG test-easy10.wvr.c that has 5 procedures, 60 locations, 55 edges, 1 initial locations, 0 loop locations, and 1 error locations. [2025-04-13 20:59:21,426 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 20:59:21,462 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-04-13 20:59:21,490 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 72 places, 59 transitions, 146 flow [2025-04-13 20:59:21,526 INFO L116 PetriNetUnfolderBase]: 0/55 cut-off events. [2025-04-13 20:59:21,528 INFO L117 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-04-13 20:59:21,529 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72 conditions, 55 events. 0/55 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 99 event pairs, 0 based on Foata normal form. 0/54 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2025-04-13 20:59:21,529 INFO L82 GeneralOperation]: Start removeDead. Operand has 72 places, 59 transitions, 146 flow [2025-04-13 20:59:21,535 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 67 places, 54 transitions, 132 flow [2025-04-13 20:59:21,541 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 20:59:21,553 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;@5c2a6e25, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 20:59:21,553 INFO L341 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-04-13 20:59:21,569 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 20:59:21,569 INFO L116 PetriNetUnfolderBase]: 0/53 cut-off events. [2025-04-13 20:59:21,569 INFO L117 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-04-13 20:59:21,569 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:59:21,569 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:59:21,570 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 2 more)] === [2025-04-13 20:59:21,574 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:59:21,575 INFO L85 PathProgramCache]: Analyzing trace with hash 420772776, now seen corresponding path program 1 times [2025-04-13 20:59:21,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:59:21,580 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605900904] [2025-04-13 20:59:21,580 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:59:21,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:59:21,640 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-04-13 20:59:21,697 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 20:59:21,698 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:59:21,698 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:59:22,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:59:22,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:59:22,050 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605900904] [2025-04-13 20:59:22,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605900904] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:59:22,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:59:22,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 20:59:22,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189001083] [2025-04-13 20:59:22,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:59:22,056 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 20:59:22,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:59:22,077 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 20:59:22,077 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 20:59:22,087 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 59 [2025-04-13 20:59:22,089 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 54 transitions, 132 flow. Second operand has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:59:22,089 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:59:22,089 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 59 [2025-04-13 20:59:22,089 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:59:22,303 INFO L116 PetriNetUnfolderBase]: 597/1168 cut-off events. [2025-04-13 20:59:22,304 INFO L117 PetriNetUnfolderBase]: For 124/124 co-relation queries the response was YES. [2025-04-13 20:59:22,309 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2203 conditions, 1168 events. 597/1168 cut-off events. For 124/124 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 7096 event pairs, 424 based on Foata normal form. 25/1147 useless extension candidates. Maximal degree in co-relation 2104. Up to 853 conditions per place. [2025-04-13 20:59:22,316 INFO L140 encePairwiseOnDemand]: 56/59 looper letters, 34 selfloop transitions, 2 changer transitions 0/63 dead transitions. [2025-04-13 20:59:22,316 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 63 transitions, 228 flow [2025-04-13 20:59:22,317 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 20:59:22,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 20:59:22,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 130 transitions. [2025-04-13 20:59:22,324 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7344632768361582 [2025-04-13 20:59:22,325 INFO L175 Difference]: Start difference. First operand has 67 places, 54 transitions, 132 flow. Second operand 3 states and 130 transitions. [2025-04-13 20:59:22,326 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 63 transitions, 228 flow [2025-04-13 20:59:22,332 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 63 transitions, 208 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-04-13 20:59:22,334 INFO L231 Difference]: Finished difference. Result has 62 places, 54 transitions, 124 flow [2025-04-13 20:59:22,338 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=124, PETRI_PLACES=62, PETRI_TRANSITIONS=54} [2025-04-13 20:59:22,340 INFO L279 CegarLoopForPetriNet]: 67 programPoint places, -5 predicate places. [2025-04-13 20:59:22,340 INFO L485 AbstractCegarLoop]: Abstraction has has 62 places, 54 transitions, 124 flow [2025-04-13 20:59:22,340 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:59:22,340 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:59:22,340 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:59:22,340 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 20:59:22,340 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 2 more)] === [2025-04-13 20:59:22,342 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:59:22,342 INFO L85 PathProgramCache]: Analyzing trace with hash -1263403940, now seen corresponding path program 2 times [2025-04-13 20:59:22,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:59:22,343 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637771860] [2025-04-13 20:59:22,343 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:59:22,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:59:22,369 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 20:59:22,382 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 20:59:22,382 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 20:59:22,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:59:22,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:59:22,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:59:22,544 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637771860] [2025-04-13 20:59:22,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637771860] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:59:22,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:59:22,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 20:59:22,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636745773] [2025-04-13 20:59:22,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:59:22,545 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 20:59:22,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:59:22,546 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 20:59:22,546 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 20:59:22,549 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 59 [2025-04-13 20:59:22,549 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 54 transitions, 124 flow. Second operand has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:59:22,549 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:59:22,549 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 59 [2025-04-13 20:59:22,549 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:59:22,687 INFO L116 PetriNetUnfolderBase]: 633/1238 cut-off events. [2025-04-13 20:59:22,687 INFO L117 PetriNetUnfolderBase]: For 128/128 co-relation queries the response was YES. [2025-04-13 20:59:22,691 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2337 conditions, 1238 events. 633/1238 cut-off events. For 128/128 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 7487 event pairs, 156 based on Foata normal form. 16/1216 useless extension candidates. Maximal degree in co-relation 2304. Up to 825 conditions per place. [2025-04-13 20:59:22,698 INFO L140 encePairwiseOnDemand]: 56/59 looper letters, 34 selfloop transitions, 2 changer transitions 0/63 dead transitions. [2025-04-13 20:59:22,698 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 63 transitions, 219 flow [2025-04-13 20:59:22,698 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 20:59:22,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 20:59:22,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 130 transitions. [2025-04-13 20:59:22,700 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7344632768361582 [2025-04-13 20:59:22,700 INFO L175 Difference]: Start difference. First operand has 62 places, 54 transitions, 124 flow. Second operand 3 states and 130 transitions. [2025-04-13 20:59:22,700 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 63 transitions, 219 flow [2025-04-13 20:59:22,701 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 63 transitions, 215 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-13 20:59:22,702 INFO L231 Difference]: Finished difference. Result has 63 places, 54 transitions, 128 flow [2025-04-13 20:59:22,702 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=128, PETRI_PLACES=63, PETRI_TRANSITIONS=54} [2025-04-13 20:59:22,703 INFO L279 CegarLoopForPetriNet]: 67 programPoint places, -4 predicate places. [2025-04-13 20:59:22,703 INFO L485 AbstractCegarLoop]: Abstraction has has 63 places, 54 transitions, 128 flow [2025-04-13 20:59:22,703 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:59:22,703 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:59:22,703 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:59:22,703 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 20:59:22,703 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 2 more)] === [2025-04-13 20:59:22,706 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:59:22,706 INFO L85 PathProgramCache]: Analyzing trace with hash -1495598740, now seen corresponding path program 3 times [2025-04-13 20:59:22,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:59:22,707 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414804207] [2025-04-13 20:59:22,707 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:59:22,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:59:22,721 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 54 statements into 1 equivalence classes. [2025-04-13 20:59:22,732 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 20:59:22,733 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 20:59:22,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:59:22,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:59:22,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:59:22,858 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414804207] [2025-04-13 20:59:22,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414804207] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:59:22,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:59:22,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 20:59:22,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344655073] [2025-04-13 20:59:22,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:59:22,858 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 20:59:22,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:59:22,858 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 20:59:22,859 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 20:59:22,861 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 59 [2025-04-13 20:59:22,862 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 54 transitions, 128 flow. Second operand has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:59:22,862 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:59:22,862 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 59 [2025-04-13 20:59:22,862 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:59:22,989 INFO L116 PetriNetUnfolderBase]: 599/1172 cut-off events. [2025-04-13 20:59:22,989 INFO L117 PetriNetUnfolderBase]: For 164/168 co-relation queries the response was YES. [2025-04-13 20:59:22,992 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2284 conditions, 1172 events. 599/1172 cut-off events. For 164/168 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 7219 event pairs, 424 based on Foata normal form. 24/1136 useless extension candidates. Maximal degree in co-relation 2117. Up to 857 conditions per place. [2025-04-13 20:59:22,997 INFO L140 encePairwiseOnDemand]: 56/59 looper letters, 36 selfloop transitions, 2 changer transitions 0/65 dead transitions. [2025-04-13 20:59:22,997 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 65 transitions, 231 flow [2025-04-13 20:59:22,997 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 20:59:22,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 20:59:22,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 132 transitions. [2025-04-13 20:59:22,999 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7457627118644068 [2025-04-13 20:59:22,999 INFO L175 Difference]: Start difference. First operand has 63 places, 54 transitions, 128 flow. Second operand 3 states and 132 transitions. [2025-04-13 20:59:22,999 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 65 transitions, 231 flow [2025-04-13 20:59:23,000 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 65 transitions, 227 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-13 20:59:23,001 INFO L231 Difference]: Finished difference. Result has 64 places, 54 transitions, 132 flow [2025-04-13 20:59:23,002 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=132, PETRI_PLACES=64, PETRI_TRANSITIONS=54} [2025-04-13 20:59:23,002 INFO L279 CegarLoopForPetriNet]: 67 programPoint places, -3 predicate places. [2025-04-13 20:59:23,002 INFO L485 AbstractCegarLoop]: Abstraction has has 64 places, 54 transitions, 132 flow [2025-04-13 20:59:23,002 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:59:23,002 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:59:23,002 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:59:23,003 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 20:59:23,003 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 2 more)] === [2025-04-13 20:59:23,003 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:59:23,003 INFO L85 PathProgramCache]: Analyzing trace with hash -48586660, now seen corresponding path program 4 times [2025-04-13 20:59:23,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:59:23,003 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436130545] [2025-04-13 20:59:23,003 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:59:23,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:59:23,013 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 54 statements into 2 equivalence classes. [2025-04-13 20:59:23,102 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 20:59:23,102 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 20:59:23,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:59:24,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:59:24,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:59:24,603 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436130545] [2025-04-13 20:59:24,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436130545] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:59:24,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:59:24,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 20:59:24,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487765157] [2025-04-13 20:59:24,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:59:24,603 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 20:59:24,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:59:24,604 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 20:59:24,604 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2025-04-13 20:59:24,808 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 59 [2025-04-13 20:59:24,808 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 54 transitions, 132 flow. Second operand has 14 states, 14 states have (on average 15.285714285714286) internal successors, (214), 14 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:59:24,808 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:59:24,809 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 59 [2025-04-13 20:59:24,809 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:59:27,610 INFO L116 PetriNetUnfolderBase]: 23943/34296 cut-off events. [2025-04-13 20:59:27,611 INFO L117 PetriNetUnfolderBase]: For 4641/4641 co-relation queries the response was YES. [2025-04-13 20:59:27,666 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72975 conditions, 34296 events. 23943/34296 cut-off events. For 4641/4641 co-relation queries the response was YES. Maximal size of possible extension queue 942. Compared 213816 event pairs, 3243 based on Foata normal form. 1/34289 useless extension candidates. Maximal degree in co-relation 36310. Up to 10059 conditions per place. [2025-04-13 20:59:27,798 INFO L140 encePairwiseOnDemand]: 42/59 looper letters, 213 selfloop transitions, 17 changer transitions 18/256 dead transitions. [2025-04-13 20:59:27,798 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 256 transitions, 1105 flow [2025-04-13 20:59:27,801 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 20:59:27,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-04-13 20:59:27,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 429 transitions. [2025-04-13 20:59:27,802 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4847457627118644 [2025-04-13 20:59:27,802 INFO L175 Difference]: Start difference. First operand has 64 places, 54 transitions, 132 flow. Second operand 15 states and 429 transitions. [2025-04-13 20:59:27,802 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 256 transitions, 1105 flow [2025-04-13 20:59:27,821 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 256 transitions, 1101 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-13 20:59:27,824 INFO L231 Difference]: Finished difference. Result has 88 places, 67 transitions, 249 flow [2025-04-13 20:59:27,824 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=249, PETRI_PLACES=88, PETRI_TRANSITIONS=67} [2025-04-13 20:59:27,825 INFO L279 CegarLoopForPetriNet]: 67 programPoint places, 21 predicate places. [2025-04-13 20:59:27,825 INFO L485 AbstractCegarLoop]: Abstraction has has 88 places, 67 transitions, 249 flow [2025-04-13 20:59:27,825 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 15.285714285714286) internal successors, (214), 14 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:59:27,825 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:59:27,826 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:59:27,826 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 20:59:27,826 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 2 more)] === [2025-04-13 20:59:27,826 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:59:27,827 INFO L85 PathProgramCache]: Analyzing trace with hash 447378706, now seen corresponding path program 5 times [2025-04-13 20:59:27,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:59:27,827 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820878925] [2025-04-13 20:59:27,827 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:59:27,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:59:27,840 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 20:59:27,850 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 20:59:27,850 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 20:59:27,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:59:27,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:59:27,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:59:27,967 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820878925] [2025-04-13 20:59:27,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820878925] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:59:27,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:59:27,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 20:59:27,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801862545] [2025-04-13 20:59:27,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:59:27,968 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 20:59:27,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:59:27,969 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 20:59:27,969 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 20:59:27,971 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 59 [2025-04-13 20:59:27,971 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 67 transitions, 249 flow. Second operand has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:59:27,971 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:59:27,971 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 59 [2025-04-13 20:59:27,971 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:59:28,386 INFO L116 PetriNetUnfolderBase]: 2704/5085 cut-off events. [2025-04-13 20:59:28,386 INFO L117 PetriNetUnfolderBase]: For 1570/1603 co-relation queries the response was YES. [2025-04-13 20:59:28,397 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11750 conditions, 5085 events. 2704/5085 cut-off events. For 1570/1603 co-relation queries the response was YES. Maximal size of possible extension queue 349. Compared 39244 event pairs, 1056 based on Foata normal form. 77/4660 useless extension candidates. Maximal degree in co-relation 11711. Up to 3703 conditions per place. [2025-04-13 20:59:28,414 INFO L140 encePairwiseOnDemand]: 56/59 looper letters, 32 selfloop transitions, 2 changer transitions 0/73 dead transitions. [2025-04-13 20:59:28,414 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 73 transitions, 331 flow [2025-04-13 20:59:28,414 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 20:59:28,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 20:59:28,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 128 transitions. [2025-04-13 20:59:28,415 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7231638418079096 [2025-04-13 20:59:28,415 INFO L175 Difference]: Start difference. First operand has 88 places, 67 transitions, 249 flow. Second operand 3 states and 128 transitions. [2025-04-13 20:59:28,415 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 73 transitions, 331 flow [2025-04-13 20:59:28,432 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 73 transitions, 320 flow, removed 3 selfloop flow, removed 4 redundant places. [2025-04-13 20:59:28,433 INFO L231 Difference]: Finished difference. Result has 85 places, 66 transitions, 240 flow [2025-04-13 20:59:28,434 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=232, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=240, PETRI_PLACES=85, PETRI_TRANSITIONS=66} [2025-04-13 20:59:28,435 INFO L279 CegarLoopForPetriNet]: 67 programPoint places, 18 predicate places. [2025-04-13 20:59:28,435 INFO L485 AbstractCegarLoop]: Abstraction has has 85 places, 66 transitions, 240 flow [2025-04-13 20:59:28,435 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:59:28,436 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:59:28,436 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:59:28,436 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-13 20:59:28,436 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 2 more)] === [2025-04-13 20:59:28,436 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:59:28,436 INFO L85 PathProgramCache]: Analyzing trace with hash -888918744, now seen corresponding path program 6 times [2025-04-13 20:59:28,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:59:28,436 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057733008] [2025-04-13 20:59:28,436 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 20:59:28,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:59:28,444 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 54 statements into 1 equivalence classes. [2025-04-13 20:59:28,478 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 20:59:28,478 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 20:59:28,478 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:59:29,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:59:29,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:59:29,519 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057733008] [2025-04-13 20:59:29,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057733008] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:59:29,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:59:29,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 20:59:29,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055836845] [2025-04-13 20:59:29,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:59:29,520 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 20:59:29,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:59:29,520 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 20:59:29,520 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2025-04-13 20:59:29,637 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 59 [2025-04-13 20:59:29,637 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 66 transitions, 240 flow. Second operand has 14 states, 14 states have (on average 15.285714285714286) internal successors, (214), 14 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:59:29,637 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:59:29,637 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 59 [2025-04-13 20:59:29,638 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:59:33,167 INFO L116 PetriNetUnfolderBase]: 37022/52998 cut-off events. [2025-04-13 20:59:33,167 INFO L117 PetriNetUnfolderBase]: For 36074/36074 co-relation queries the response was YES. [2025-04-13 20:59:33,363 INFO L83 FinitePrefix]: Finished finitePrefix Result has 142912 conditions, 52998 events. 37022/52998 cut-off events. For 36074/36074 co-relation queries the response was YES. Maximal size of possible extension queue 1485. Compared 351690 event pairs, 7321 based on Foata normal form. 1/52991 useless extension candidates. Maximal degree in co-relation 108644. Up to 17576 conditions per place. [2025-04-13 20:59:33,513 INFO L140 encePairwiseOnDemand]: 44/59 looper letters, 258 selfloop transitions, 26 changer transitions 18/310 dead transitions. [2025-04-13 20:59:33,513 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 310 transitions, 1676 flow [2025-04-13 20:59:33,514 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 20:59:33,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-04-13 20:59:33,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 440 transitions. [2025-04-13 20:59:33,517 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4971751412429379 [2025-04-13 20:59:33,517 INFO L175 Difference]: Start difference. First operand has 85 places, 66 transitions, 240 flow. Second operand 15 states and 440 transitions. [2025-04-13 20:59:33,517 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 310 transitions, 1676 flow [2025-04-13 20:59:33,877 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 310 transitions, 1672 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-13 20:59:33,879 INFO L231 Difference]: Finished difference. Result has 108 places, 83 transitions, 449 flow [2025-04-13 20:59:33,879 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=236, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=449, PETRI_PLACES=108, PETRI_TRANSITIONS=83} [2025-04-13 20:59:33,880 INFO L279 CegarLoopForPetriNet]: 67 programPoint places, 41 predicate places. [2025-04-13 20:59:33,880 INFO L485 AbstractCegarLoop]: Abstraction has has 108 places, 83 transitions, 449 flow [2025-04-13 20:59:33,880 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 15.285714285714286) internal successors, (214), 14 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:59:33,880 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:59:33,880 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:59:33,880 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-13 20:59:33,880 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 2 more)] === [2025-04-13 20:59:33,881 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:59:33,881 INFO L85 PathProgramCache]: Analyzing trace with hash 2141782778, now seen corresponding path program 7 times [2025-04-13 20:59:33,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:59:33,881 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328117117] [2025-04-13 20:59:33,881 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 20:59:33,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:59:33,886 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-04-13 20:59:33,930 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 20:59:33,931 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:59:33,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:59:35,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:59:35,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:59:35,027 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328117117] [2025-04-13 20:59:35,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328117117] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:59:35,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:59:35,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 20:59:35,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361218153] [2025-04-13 20:59:35,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:59:35,028 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 20:59:35,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:59:35,028 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 20:59:35,028 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2025-04-13 20:59:35,183 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 59 [2025-04-13 20:59:35,184 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 83 transitions, 449 flow. Second operand has 14 states, 14 states have (on average 15.285714285714286) internal successors, (214), 14 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:59:35,184 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:59:35,184 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 59 [2025-04-13 20:59:35,184 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:59:43,077 INFO L116 PetriNetUnfolderBase]: 79868/115183 cut-off events. [2025-04-13 20:59:43,077 INFO L117 PetriNetUnfolderBase]: For 204016/204016 co-relation queries the response was YES. [2025-04-13 20:59:43,665 INFO L83 FinitePrefix]: Finished finitePrefix Result has 362769 conditions, 115183 events. 79868/115183 cut-off events. For 204016/204016 co-relation queries the response was YES. Maximal size of possible extension queue 3561. Compared 851808 event pairs, 17298 based on Foata normal form. 1/115169 useless extension candidates. Maximal degree in co-relation 362501. Up to 36318 conditions per place. [2025-04-13 20:59:43,975 INFO L140 encePairwiseOnDemand]: 43/59 looper letters, 291 selfloop transitions, 36 changer transitions 10/345 dead transitions. [2025-04-13 20:59:43,975 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 345 transitions, 2464 flow [2025-04-13 20:59:43,976 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 20:59:43,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-04-13 20:59:43,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 428 transitions. [2025-04-13 20:59:43,977 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.48361581920903957 [2025-04-13 20:59:43,977 INFO L175 Difference]: Start difference. First operand has 108 places, 83 transitions, 449 flow. Second operand 15 states and 428 transitions. [2025-04-13 20:59:43,977 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 345 transitions, 2464 flow [2025-04-13 20:59:47,461 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 345 transitions, 2388 flow, removed 33 selfloop flow, removed 4 redundant places. [2025-04-13 20:59:47,464 INFO L231 Difference]: Finished difference. Result has 128 places, 112 transitions, 852 flow [2025-04-13 20:59:47,464 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=435, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=852, PETRI_PLACES=128, PETRI_TRANSITIONS=112} [2025-04-13 20:59:47,464 INFO L279 CegarLoopForPetriNet]: 67 programPoint places, 61 predicate places. [2025-04-13 20:59:47,464 INFO L485 AbstractCegarLoop]: Abstraction has has 128 places, 112 transitions, 852 flow [2025-04-13 20:59:47,464 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 15.285714285714286) internal successors, (214), 14 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:59:47,464 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:59:47,465 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:59:47,465 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-13 20:59:47,465 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 2 more)] === [2025-04-13 20:59:47,465 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:59:47,465 INFO L85 PathProgramCache]: Analyzing trace with hash -404834008, now seen corresponding path program 8 times [2025-04-13 20:59:47,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:59:47,465 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028892025] [2025-04-13 20:59:47,465 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:59:47,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:59:47,469 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 20:59:47,505 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 20:59:47,505 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 20:59:47,505 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:59:48,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:59:48,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:59:48,617 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028892025] [2025-04-13 20:59:48,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028892025] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:59:48,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:59:48,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 20:59:48,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855577672] [2025-04-13 20:59:48,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:59:48,617 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 20:59:48,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:59:48,618 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 20:59:48,618 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2025-04-13 20:59:48,771 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 59 [2025-04-13 20:59:48,772 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 112 transitions, 852 flow. Second operand has 14 states, 14 states have (on average 15.285714285714286) internal successors, (214), 14 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:59:48,772 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:59:48,772 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 59 [2025-04-13 20:59:48,772 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:00:03,883 INFO L116 PetriNetUnfolderBase]: 141567/207645 cut-off events. [2025-04-13 21:00:03,883 INFO L117 PetriNetUnfolderBase]: For 616110/616110 co-relation queries the response was YES. [2025-04-13 21:00:05,251 INFO L83 FinitePrefix]: Finished finitePrefix Result has 707000 conditions, 207645 events. 141567/207645 cut-off events. For 616110/616110 co-relation queries the response was YES. Maximal size of possible extension queue 6837. Compared 1704428 event pairs, 32145 based on Foata normal form. 1/207626 useless extension candidates. Maximal degree in co-relation 706173. Up to 61082 conditions per place. [2025-04-13 21:00:05,778 INFO L140 encePairwiseOnDemand]: 43/59 looper letters, 376 selfloop transitions, 55 changer transitions 10/449 dead transitions. [2025-04-13 21:00:05,778 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 449 transitions, 4061 flow [2025-04-13 21:00:05,779 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 21:00:05,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-04-13 21:00:05,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 452 transitions. [2025-04-13 21:00:05,780 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4788135593220339 [2025-04-13 21:00:05,780 INFO L175 Difference]: Start difference. First operand has 128 places, 112 transitions, 852 flow. Second operand 16 states and 452 transitions. [2025-04-13 21:00:05,780 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 449 transitions, 4061 flow [2025-04-13 21:00:18,578 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 449 transitions, 3965 flow, removed 41 selfloop flow, removed 3 redundant places. [2025-04-13 21:00:18,581 INFO L231 Difference]: Finished difference. Result has 151 places, 154 transitions, 1515 flow [2025-04-13 21:00:18,581 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=813, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=1515, PETRI_PLACES=151, PETRI_TRANSITIONS=154} [2025-04-13 21:00:18,582 INFO L279 CegarLoopForPetriNet]: 67 programPoint places, 84 predicate places. [2025-04-13 21:00:18,582 INFO L485 AbstractCegarLoop]: Abstraction has has 151 places, 154 transitions, 1515 flow [2025-04-13 21:00:18,582 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 15.285714285714286) internal successors, (214), 14 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:00:18,582 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:00:18,582 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:00:18,582 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-13 21:00:18,582 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 2 more)] === [2025-04-13 21:00:18,583 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:00:18,583 INFO L85 PathProgramCache]: Analyzing trace with hash 1076372508, now seen corresponding path program 9 times [2025-04-13 21:00:18,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:00:18,583 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511456602] [2025-04-13 21:00:18,583 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 21:00:18,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:00:18,589 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 54 statements into 1 equivalence classes. [2025-04-13 21:00:18,617 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 21:00:18,617 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 21:00:18,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:00:19,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:00:19,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:00:19,455 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511456602] [2025-04-13 21:00:19,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511456602] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:00:19,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:00:19,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 21:00:19,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217538245] [2025-04-13 21:00:19,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:00:19,456 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 21:00:19,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:00:19,457 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 21:00:19,457 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2025-04-13 21:00:19,574 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 59 [2025-04-13 21:00:19,574 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 154 transitions, 1515 flow. Second operand has 14 states, 14 states have (on average 15.285714285714286) internal successors, (214), 14 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:00:19,574 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:00:19,574 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 59 [2025-04-13 21:00:19,574 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:00:48,005 INFO L116 PetriNetUnfolderBase]: 220811/327772 cut-off events. [2025-04-13 21:00:48,005 INFO L117 PetriNetUnfolderBase]: For 1484345/1484345 co-relation queries the response was YES. [2025-04-13 21:00:50,617 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1198483 conditions, 327772 events. 220811/327772 cut-off events. For 1484345/1484345 co-relation queries the response was YES. Maximal size of possible extension queue 12228. Compared 2908852 event pairs, 50905 based on Foata normal form. 1/327764 useless extension candidates. Maximal degree in co-relation 1196802. Up to 94313 conditions per place. [2025-04-13 21:00:51,598 INFO L140 encePairwiseOnDemand]: 42/59 looper letters, 426 selfloop transitions, 69 changer transitions 12/515 dead transitions. [2025-04-13 21:00:51,598 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 515 transitions, 5574 flow [2025-04-13 21:00:51,599 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 21:00:51,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-04-13 21:00:51,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 434 transitions. [2025-04-13 21:00:51,600 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4903954802259887 [2025-04-13 21:00:51,600 INFO L175 Difference]: Start difference. First operand has 151 places, 154 transitions, 1515 flow. Second operand 15 states and 434 transitions. [2025-04-13 21:00:51,600 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 515 transitions, 5574 flow [2025-04-13 21:01:43,841 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 515 transitions, 5449 flow, removed 55 selfloop flow, removed 4 redundant places. [2025-04-13 21:01:43,845 INFO L231 Difference]: Finished difference. Result has 172 places, 200 transitions, 2371 flow [2025-04-13 21:01:43,845 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=1473, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=2371, PETRI_PLACES=172, PETRI_TRANSITIONS=200} [2025-04-13 21:01:43,846 INFO L279 CegarLoopForPetriNet]: 67 programPoint places, 105 predicate places. [2025-04-13 21:01:43,846 INFO L485 AbstractCegarLoop]: Abstraction has has 172 places, 200 transitions, 2371 flow [2025-04-13 21:01:43,846 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 15.285714285714286) internal successors, (214), 14 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:01:43,846 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:01:43,846 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:01:43,846 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-13 21:01:43,846 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 2 more)] === [2025-04-13 21:01:43,847 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:01:43,847 INFO L85 PathProgramCache]: Analyzing trace with hash -1068518000, now seen corresponding path program 10 times [2025-04-13 21:01:43,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:01:43,847 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443855431] [2025-04-13 21:01:43,847 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 21:01:43,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:01:43,852 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 54 statements into 2 equivalence classes. [2025-04-13 21:01:43,875 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 21:01:43,875 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 21:01:43,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:01:44,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:01:44,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:01:44,767 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443855431] [2025-04-13 21:01:44,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443855431] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:01:44,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:01:44,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-04-13 21:01:44,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335471002] [2025-04-13 21:01:44,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:01:44,768 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-13 21:01:44,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:01:44,768 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-13 21:01:44,768 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2025-04-13 21:01:44,863 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 59 [2025-04-13 21:01:44,863 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 200 transitions, 2371 flow. Second operand has 15 states, 15 states have (on average 15.066666666666666) internal successors, (226), 15 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:01:44,863 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:01:44,863 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 59 [2025-04-13 21:01:44,863 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand