/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.automaton.type.used.in.concurrency.analysis PETRI_NET -i ../../../trunk/examples/svcomp/weaver/parallel-misc-3-extended.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 20:16:19,479 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 20:16:19,531 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2025-04-13 20:16:19,535 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 20:16:19,535 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 20:16:19,559 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 20:16:19,560 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 20:16:19,560 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 20:16:19,560 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 20:16:19,560 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 20:16:19,561 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 20:16:19,561 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 20:16:19,561 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 20:16:19,561 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 20:16:19,561 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 20:16:19,562 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 20:16:19,562 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 20:16:19,562 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 20:16:19,562 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 20:16:19,562 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 20:16:19,562 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 20:16:19,562 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 20:16:19,562 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 20:16:19,562 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 20:16:19,562 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 20:16:19,562 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 20:16:19,562 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 20:16:19,562 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 20:16:19,563 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 20:16:19,563 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 20:16:19,563 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 20:16:19,563 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 20:16:19,563 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 20:16:19,563 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 20:16:19,563 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 20:16:19,563 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 20:16:19,563 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 20:16:19,563 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 20:16:19,563 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 20:16:19,563 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 20:16:19,563 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 20:16:19,563 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 20:16:19,563 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 20:16:19,564 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 20:16:19,564 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 20:16:19,564 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 20:16:19,564 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 20:16:19,564 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Automaton type used in concurrency analysis -> PETRI_NET [2025-04-13 20:16:19,786 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 20:16:19,793 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 20:16:19,795 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 20:16:19,795 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 20:16:19,797 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 20:16:19,798 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/parallel-misc-3-extended.wvr.c [2025-04-13 20:16:21,025 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f3ce91e3/e9a73bc0c15749979fcf6cafe3151d29/FLAGe31a2e4fa [2025-04-13 20:16:21,206 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 20:16:21,222 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-misc-3-extended.wvr.c [2025-04-13 20:16:21,228 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f3ce91e3/e9a73bc0c15749979fcf6cafe3151d29/FLAGe31a2e4fa [2025-04-13 20:16:22,225 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f3ce91e3/e9a73bc0c15749979fcf6cafe3151d29 [2025-04-13 20:16:22,227 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 20:16:22,228 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 20:16:22,229 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 20:16:22,229 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 20:16:22,232 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 20:16:22,232 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 08:16:22" (1/1) ... [2025-04-13 20:16:22,233 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c9681c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:16:22, skipping insertion in model container [2025-04-13 20:16:22,233 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 08:16:22" (1/1) ... [2025-04-13 20:16:22,243 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 20:16:22,411 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-misc-3-extended.wvr.c[2421,2434] [2025-04-13 20:16:22,414 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 20:16:22,423 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 20:16:22,454 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-misc-3-extended.wvr.c[2421,2434] [2025-04-13 20:16:22,455 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 20:16:22,466 INFO L204 MainTranslator]: Completed translation [2025-04-13 20:16:22,467 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:16:22 WrapperNode [2025-04-13 20:16:22,467 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 20:16:22,468 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 20:16:22,468 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 20:16:22,469 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 20:16:22,473 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:16:22" (1/1) ... [2025-04-13 20:16:22,480 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:16:22" (1/1) ... [2025-04-13 20:16:22,495 INFO L138 Inliner]: procedures = 19, calls = 10, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 52 [2025-04-13 20:16:22,496 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 20:16:22,496 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 20:16:22,496 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 20:16:22,496 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 20:16:22,502 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:16:22" (1/1) ... [2025-04-13 20:16:22,503 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:16:22" (1/1) ... [2025-04-13 20:16:22,504 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:16:22" (1/1) ... [2025-04-13 20:16:22,519 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-04-13 20:16:22,519 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:16:22" (1/1) ... [2025-04-13 20:16:22,519 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:16:22" (1/1) ... [2025-04-13 20:16:22,524 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:16:22" (1/1) ... [2025-04-13 20:16:22,525 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:16:22" (1/1) ... [2025-04-13 20:16:22,527 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:16:22" (1/1) ... [2025-04-13 20:16:22,528 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:16:22" (1/1) ... [2025-04-13 20:16:22,528 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:16:22" (1/1) ... [2025-04-13 20:16:22,534 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 20:16:22,535 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-13 20:16:22,535 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-13 20:16:22,535 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-13 20:16:22,539 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:16:22" (1/1) ... [2025-04-13 20:16:22,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 20:16:22,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:16:22,560 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-13 20:16:22,563 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-13 20:16:22,578 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 20:16:22,579 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-13 20:16:22,579 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-13 20:16:22,579 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-13 20:16:22,579 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-13 20:16:22,579 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-13 20:16:22,579 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-13 20:16:22,579 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 20:16:22,579 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 20:16:22,579 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 20:16:22,580 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-13 20:16:22,641 INFO L234 CfgBuilder]: Building ICFG [2025-04-13 20:16:22,642 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 20:16:22,771 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 20:16:22,772 INFO L289 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 20:16:22,772 INFO L294 CfgBuilder]: Performing block encoding [2025-04-13 20:16:22,952 WARN L179 LargeBlockEncoding]: Complex 3:3 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 20:16:22,973 WARN L179 LargeBlockEncoding]: Complex 2:3 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 20:16:22,987 WARN L179 LargeBlockEncoding]: Complex 2:3 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 20:16:22,996 INFO L313 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 20:16:22,997 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 08:16:22 BoogieIcfgContainer [2025-04-13 20:16:22,997 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-13 20:16:22,999 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 20:16:22,999 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 20:16:23,004 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 20:16:23,005 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 08:16:22" (1/3) ... [2025-04-13 20:16:23,005 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a065fa0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 08:16:23, skipping insertion in model container [2025-04-13 20:16:23,005 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:16:22" (2/3) ... [2025-04-13 20:16:23,005 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a065fa0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 08:16:23, skipping insertion in model container [2025-04-13 20:16:23,005 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 08:16:22" (3/3) ... [2025-04-13 20:16:23,006 INFO L128 eAbstractionObserver]: Analyzing ICFG parallel-misc-3-extended.wvr.c [2025-04-13 20:16:23,016 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 20:16:23,019 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG parallel-misc-3-extended.wvr.c that has 4 procedures, 29 locations, 39 edges, 1 initial locations, 3 loop locations, and 1 error locations. [2025-04-13 20:16:23,019 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 20:16:23,094 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-13 20:16:23,120 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 42 transitions, 105 flow [2025-04-13 20:16:23,150 INFO L116 PetriNetUnfolderBase]: 14/39 cut-off events. [2025-04-13 20:16:23,153 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-13 20:16:23,154 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52 conditions, 39 events. 14/39 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 62 event pairs, 0 based on Foata normal form. 0/24 useless extension candidates. Maximal degree in co-relation 36. Up to 3 conditions per place. [2025-04-13 20:16:23,154 INFO L82 GeneralOperation]: Start removeDead. Operand has 38 places, 42 transitions, 105 flow [2025-04-13 20:16:23,158 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 34 places, 38 transitions, 94 flow [2025-04-13 20:16:23,165 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 20:16:23,173 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;@55e1a7ed, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 20:16:23,173 INFO L341 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-04-13 20:16:23,201 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 20:16:23,203 INFO L116 PetriNetUnfolderBase]: 14/37 cut-off events. [2025-04-13 20:16:23,203 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-13 20:16:23,203 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:16:23,203 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:16:23,204 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:16:23,207 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:16:23,207 INFO L85 PathProgramCache]: Analyzing trace with hash 1645948702, now seen corresponding path program 1 times [2025-04-13 20:16:23,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:16:23,215 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268719885] [2025-04-13 20:16:23,215 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:16:23,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:16:23,268 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-13 20:16:23,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 20:16:23,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:16:23,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:16:23,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:16:23,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:16:23,388 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268719885] [2025-04-13 20:16:23,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268719885] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:16:23,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:16:23,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-13 20:16:23,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624794334] [2025-04-13 20:16:23,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:16:23,396 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 20:16:23,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:16:23,414 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 20:16:23,415 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 20:16:23,432 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 42 [2025-04-13 20:16:23,434 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 38 transitions, 94 flow. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:16:23,435 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:16:23,435 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 42 [2025-04-13 20:16:23,435 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:16:23,786 INFO L116 PetriNetUnfolderBase]: 2193/2781 cut-off events. [2025-04-13 20:16:23,786 INFO L117 PetriNetUnfolderBase]: For 181/181 co-relation queries the response was YES. [2025-04-13 20:16:23,790 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5729 conditions, 2781 events. 2193/2781 cut-off events. For 181/181 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 9369 event pairs, 310 based on Foata normal form. 1/1616 useless extension candidates. Maximal degree in co-relation 5294. Up to 2286 conditions per place. [2025-04-13 20:16:23,805 INFO L140 encePairwiseOnDemand]: 34/42 looper letters, 53 selfloop transitions, 7 changer transitions 1/61 dead transitions. [2025-04-13 20:16:23,805 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 61 transitions, 277 flow [2025-04-13 20:16:23,807 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 20:16:23,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 20:16:23,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 71 transitions. [2025-04-13 20:16:23,817 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5634920634920635 [2025-04-13 20:16:23,818 INFO L175 Difference]: Start difference. First operand has 34 places, 38 transitions, 94 flow. Second operand 3 states and 71 transitions. [2025-04-13 20:16:23,819 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 61 transitions, 277 flow [2025-04-13 20:16:23,824 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 61 transitions, 255 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-04-13 20:16:23,827 INFO L231 Difference]: Finished difference. Result has 31 places, 44 transitions, 129 flow [2025-04-13 20:16:23,829 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=129, PETRI_PLACES=31, PETRI_TRANSITIONS=44} [2025-04-13 20:16:23,832 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, -3 predicate places. [2025-04-13 20:16:23,832 INFO L485 AbstractCegarLoop]: Abstraction has has 31 places, 44 transitions, 129 flow [2025-04-13 20:16:23,832 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:16:23,832 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:16:23,832 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:16:23,833 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 20:16:23,833 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:16:23,833 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:16:23,833 INFO L85 PathProgramCache]: Analyzing trace with hash 347268775, now seen corresponding path program 1 times [2025-04-13 20:16:23,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:16:23,833 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225684630] [2025-04-13 20:16:23,833 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:16:23,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:16:23,846 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-13 20:16:23,859 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 20:16:23,859 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:16:23,859 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:16:23,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:16:23,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:16:23,939 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225684630] [2025-04-13 20:16:23,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [225684630] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:16:23,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:16:23,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 20:16:23,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626766437] [2025-04-13 20:16:23,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:16:23,940 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 20:16:23,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:16:23,940 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 20:16:23,940 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 20:16:23,941 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 42 [2025-04-13 20:16:23,941 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 44 transitions, 129 flow. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:16:23,941 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:16:23,941 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 42 [2025-04-13 20:16:23,941 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:16:24,188 INFO L116 PetriNetUnfolderBase]: 1873/2390 cut-off events. [2025-04-13 20:16:24,188 INFO L117 PetriNetUnfolderBase]: For 221/235 co-relation queries the response was YES. [2025-04-13 20:16:24,195 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5218 conditions, 2390 events. 1873/2390 cut-off events. For 221/235 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 7955 event pairs, 608 based on Foata normal form. 4/1288 useless extension candidates. Maximal degree in co-relation 1935. Up to 1748 conditions per place. [2025-04-13 20:16:24,203 INFO L140 encePairwiseOnDemand]: 38/42 looper letters, 49 selfloop transitions, 3 changer transitions 0/60 dead transitions. [2025-04-13 20:16:24,203 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 60 transitions, 267 flow [2025-04-13 20:16:24,205 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 20:16:24,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 20:16:24,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 72 transitions. [2025-04-13 20:16:24,205 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5714285714285714 [2025-04-13 20:16:24,206 INFO L175 Difference]: Start difference. First operand has 31 places, 44 transitions, 129 flow. Second operand 3 states and 72 transitions. [2025-04-13 20:16:24,206 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 60 transitions, 267 flow [2025-04-13 20:16:24,207 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 60 transitions, 258 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-04-13 20:16:24,207 INFO L231 Difference]: Finished difference. Result has 32 places, 43 transitions, 124 flow [2025-04-13 20:16:24,207 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=124, PETRI_PLACES=32, PETRI_TRANSITIONS=43} [2025-04-13 20:16:24,208 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, -2 predicate places. [2025-04-13 20:16:24,208 INFO L485 AbstractCegarLoop]: Abstraction has has 32 places, 43 transitions, 124 flow [2025-04-13 20:16:24,208 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:16:24,208 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:16:24,208 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:16:24,208 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 20:16:24,209 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:16:24,210 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:16:24,210 INFO L85 PathProgramCache]: Analyzing trace with hash -298749135, now seen corresponding path program 1 times [2025-04-13 20:16:24,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:16:24,211 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568055620] [2025-04-13 20:16:24,211 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:16:24,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:16:24,219 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-13 20:16:24,233 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 20:16:24,233 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:16:24,233 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:16:24,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:16:24,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:16:24,326 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568055620] [2025-04-13 20:16:24,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568055620] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:16:24,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:16:24,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 20:16:24,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731042769] [2025-04-13 20:16:24,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:16:24,326 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 20:16:24,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:16:24,327 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 20:16:24,327 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 20:16:24,327 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 42 [2025-04-13 20:16:24,327 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 43 transitions, 124 flow. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:16:24,328 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:16:24,328 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 42 [2025-04-13 20:16:24,328 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:16:24,552 INFO L116 PetriNetUnfolderBase]: 1724/2212 cut-off events. [2025-04-13 20:16:24,552 INFO L117 PetriNetUnfolderBase]: For 315/329 co-relation queries the response was YES. [2025-04-13 20:16:24,557 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4803 conditions, 2212 events. 1724/2212 cut-off events. For 315/329 co-relation queries the response was YES. Maximal size of possible extension queue 151. Compared 7270 event pairs, 539 based on Foata normal form. 0/1320 useless extension candidates. Maximal degree in co-relation 3886. Up to 1587 conditions per place. [2025-04-13 20:16:24,565 INFO L140 encePairwiseOnDemand]: 39/42 looper letters, 52 selfloop transitions, 2 changer transitions 0/62 dead transitions. [2025-04-13 20:16:24,565 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 62 transitions, 280 flow [2025-04-13 20:16:24,566 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 20:16:24,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 20:16:24,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 74 transitions. [2025-04-13 20:16:24,567 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5873015873015873 [2025-04-13 20:16:24,567 INFO L175 Difference]: Start difference. First operand has 32 places, 43 transitions, 124 flow. Second operand 3 states and 74 transitions. [2025-04-13 20:16:24,567 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 62 transitions, 280 flow [2025-04-13 20:16:24,568 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 62 transitions, 270 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-13 20:16:24,569 INFO L231 Difference]: Finished difference. Result has 32 places, 42 transitions, 120 flow [2025-04-13 20:16:24,569 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=120, PETRI_PLACES=32, PETRI_TRANSITIONS=42} [2025-04-13 20:16:24,572 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, -2 predicate places. [2025-04-13 20:16:24,572 INFO L485 AbstractCegarLoop]: Abstraction has has 32 places, 42 transitions, 120 flow [2025-04-13 20:16:24,572 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:16:24,572 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:16:24,572 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:16:24,573 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 20:16:24,573 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:16:24,573 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:16:24,573 INFO L85 PathProgramCache]: Analyzing trace with hash 1488090198, now seen corresponding path program 1 times [2025-04-13 20:16:24,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:16:24,573 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697444131] [2025-04-13 20:16:24,573 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:16:24,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:16:24,582 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-13 20:16:24,596 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 20:16:24,596 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:16:24,596 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:16:24,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:16:24,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:16:24,687 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697444131] [2025-04-13 20:16:24,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697444131] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:16:24,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:16:24,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 20:16:24,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244560575] [2025-04-13 20:16:24,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:16:24,687 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 20:16:24,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:16:24,688 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 20:16:24,688 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 20:16:24,688 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 42 [2025-04-13 20:16:24,688 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 42 transitions, 120 flow. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:16:24,688 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:16:24,688 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 42 [2025-04-13 20:16:24,688 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:16:24,898 INFO L116 PetriNetUnfolderBase]: 1583/2055 cut-off events. [2025-04-13 20:16:24,898 INFO L117 PetriNetUnfolderBase]: For 330/344 co-relation queries the response was YES. [2025-04-13 20:16:24,900 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4493 conditions, 2055 events. 1583/2055 cut-off events. For 330/344 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 6872 event pairs, 509 based on Foata normal form. 0/1303 useless extension candidates. Maximal degree in co-relation 3537. Up to 1532 conditions per place. [2025-04-13 20:16:24,907 INFO L140 encePairwiseOnDemand]: 39/42 looper letters, 49 selfloop transitions, 2 changer transitions 0/59 dead transitions. [2025-04-13 20:16:24,908 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 59 transitions, 264 flow [2025-04-13 20:16:24,908 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 20:16:24,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 20:16:24,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 71 transitions. [2025-04-13 20:16:24,909 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5634920634920635 [2025-04-13 20:16:24,909 INFO L175 Difference]: Start difference. First operand has 32 places, 42 transitions, 120 flow. Second operand 3 states and 71 transitions. [2025-04-13 20:16:24,909 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 59 transitions, 264 flow [2025-04-13 20:16:24,910 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 59 transitions, 258 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-13 20:16:24,911 INFO L231 Difference]: Finished difference. Result has 32 places, 41 transitions, 118 flow [2025-04-13 20:16:24,911 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=118, PETRI_PLACES=32, PETRI_TRANSITIONS=41} [2025-04-13 20:16:24,912 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, -2 predicate places. [2025-04-13 20:16:24,912 INFO L485 AbstractCegarLoop]: Abstraction has has 32 places, 41 transitions, 118 flow [2025-04-13 20:16:24,912 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:16:24,912 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:16:24,912 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:16:24,912 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 20:16:24,912 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:16:24,912 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:16:24,912 INFO L85 PathProgramCache]: Analyzing trace with hash -1737969917, now seen corresponding path program 1 times [2025-04-13 20:16:24,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:16:24,913 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372839520] [2025-04-13 20:16:24,913 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:16:24,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:16:24,919 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-13 20:16:24,939 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 20:16:24,939 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:16:24,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:16:25,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:16:25,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:16:25,103 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372839520] [2025-04-13 20:16:25,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372839520] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:16:25,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:16:25,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 20:16:25,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745921663] [2025-04-13 20:16:25,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:16:25,103 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 20:16:25,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:16:25,104 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 20:16:25,105 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-13 20:16:25,105 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 42 [2025-04-13 20:16:25,105 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 41 transitions, 118 flow. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:16:25,105 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:16:25,105 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 42 [2025-04-13 20:16:25,105 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:16:25,266 INFO L116 PetriNetUnfolderBase]: 1211/1639 cut-off events. [2025-04-13 20:16:25,266 INFO L117 PetriNetUnfolderBase]: For 174/185 co-relation queries the response was YES. [2025-04-13 20:16:25,268 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3558 conditions, 1639 events. 1211/1639 cut-off events. For 174/185 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 5992 event pairs, 298 based on Foata normal form. 10/1125 useless extension candidates. Maximal degree in co-relation 2935. Up to 708 conditions per place. [2025-04-13 20:16:25,272 INFO L140 encePairwiseOnDemand]: 35/42 looper letters, 55 selfloop transitions, 4 changer transitions 0/67 dead transitions. [2025-04-13 20:16:25,272 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 67 transitions, 294 flow [2025-04-13 20:16:25,273 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 20:16:25,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-13 20:16:25,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 89 transitions. [2025-04-13 20:16:25,275 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5297619047619048 [2025-04-13 20:16:25,275 INFO L175 Difference]: Start difference. First operand has 32 places, 41 transitions, 118 flow. Second operand 4 states and 89 transitions. [2025-04-13 20:16:25,275 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 67 transitions, 294 flow [2025-04-13 20:16:25,276 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 67 transitions, 286 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-13 20:16:25,277 INFO L231 Difference]: Finished difference. Result has 33 places, 37 transitions, 112 flow [2025-04-13 20:16:25,277 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=112, PETRI_PLACES=33, PETRI_TRANSITIONS=37} [2025-04-13 20:16:25,277 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, -1 predicate places. [2025-04-13 20:16:25,279 INFO L485 AbstractCegarLoop]: Abstraction has has 33 places, 37 transitions, 112 flow [2025-04-13 20:16:25,279 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:16:25,279 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:16:25,279 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:16:25,280 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-13 20:16:25,280 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:16:25,280 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:16:25,280 INFO L85 PathProgramCache]: Analyzing trace with hash 1471357431, now seen corresponding path program 1 times [2025-04-13 20:16:25,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:16:25,281 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462358738] [2025-04-13 20:16:25,281 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:16:25,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:16:25,287 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-13 20:16:25,307 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 20:16:25,307 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:16:25,307 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:16:25,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:16:25,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:16:25,465 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462358738] [2025-04-13 20:16:25,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462358738] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:16:25,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:16:25,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 20:16:25,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781105248] [2025-04-13 20:16:25,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:16:25,465 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 20:16:25,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:16:25,466 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 20:16:25,466 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-13 20:16:25,466 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 42 [2025-04-13 20:16:25,466 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 37 transitions, 112 flow. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:16:25,466 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:16:25,466 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 42 [2025-04-13 20:16:25,466 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:16:25,629 INFO L116 PetriNetUnfolderBase]: 1184/1680 cut-off events. [2025-04-13 20:16:25,629 INFO L117 PetriNetUnfolderBase]: For 251/263 co-relation queries the response was YES. [2025-04-13 20:16:25,631 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3750 conditions, 1680 events. 1184/1680 cut-off events. For 251/263 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 6290 event pairs, 330 based on Foata normal form. 0/1229 useless extension candidates. Maximal degree in co-relation 1519. Up to 737 conditions per place. [2025-04-13 20:16:25,635 INFO L140 encePairwiseOnDemand]: 37/42 looper letters, 57 selfloop transitions, 4 changer transitions 0/68 dead transitions. [2025-04-13 20:16:25,635 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 68 transitions, 318 flow [2025-04-13 20:16:25,635 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 20:16:25,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-13 20:16:25,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 91 transitions. [2025-04-13 20:16:25,636 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5416666666666666 [2025-04-13 20:16:25,636 INFO L175 Difference]: Start difference. First operand has 33 places, 37 transitions, 112 flow. Second operand 4 states and 91 transitions. [2025-04-13 20:16:25,636 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 68 transitions, 318 flow [2025-04-13 20:16:25,638 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 68 transitions, 298 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-04-13 20:16:25,638 INFO L231 Difference]: Finished difference. Result has 34 places, 36 transitions, 113 flow [2025-04-13 20:16:25,638 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=113, PETRI_PLACES=34, PETRI_TRANSITIONS=36} [2025-04-13 20:16:25,639 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 0 predicate places. [2025-04-13 20:16:25,639 INFO L485 AbstractCegarLoop]: Abstraction has has 34 places, 36 transitions, 113 flow [2025-04-13 20:16:25,639 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:16:25,639 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:16:25,639 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:16:25,639 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-13 20:16:25,639 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:16:25,639 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:16:25,639 INFO L85 PathProgramCache]: Analyzing trace with hash -228593204, now seen corresponding path program 1 times [2025-04-13 20:16:25,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:16:25,639 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411265794] [2025-04-13 20:16:25,640 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:16:25,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:16:25,645 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-13 20:16:25,651 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 20:16:25,651 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:16:25,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:16:25,697 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:16:25,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:16:25,697 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411265794] [2025-04-13 20:16:25,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411265794] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:16:25,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:16:25,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 20:16:25,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610773955] [2025-04-13 20:16:25,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:16:25,697 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 20:16:25,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:16:25,698 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 20:16:25,698 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 20:16:25,698 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 42 [2025-04-13 20:16:25,698 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 36 transitions, 113 flow. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:16:25,698 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:16:25,698 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 42 [2025-04-13 20:16:25,698 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:16:25,831 INFO L116 PetriNetUnfolderBase]: 1425/1979 cut-off events. [2025-04-13 20:16:25,831 INFO L117 PetriNetUnfolderBase]: For 967/994 co-relation queries the response was YES. [2025-04-13 20:16:25,833 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4881 conditions, 1979 events. 1425/1979 cut-off events. For 967/994 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 7719 event pairs, 412 based on Foata normal form. 0/1555 useless extension candidates. Maximal degree in co-relation 1709. Up to 960 conditions per place. [2025-04-13 20:16:25,839 INFO L140 encePairwiseOnDemand]: 37/42 looper letters, 41 selfloop transitions, 4 changer transitions 0/51 dead transitions. [2025-04-13 20:16:25,839 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 51 transitions, 247 flow [2025-04-13 20:16:25,839 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 20:16:25,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 20:16:25,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 65 transitions. [2025-04-13 20:16:25,840 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5158730158730159 [2025-04-13 20:16:25,840 INFO L175 Difference]: Start difference. First operand has 34 places, 36 transitions, 113 flow. Second operand 3 states and 65 transitions. [2025-04-13 20:16:25,840 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 51 transitions, 247 flow [2025-04-13 20:16:25,841 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 51 transitions, 244 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-13 20:16:25,841 INFO L231 Difference]: Finished difference. Result has 36 places, 36 transitions, 125 flow [2025-04-13 20:16:25,841 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=105, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=125, PETRI_PLACES=36, PETRI_TRANSITIONS=36} [2025-04-13 20:16:25,842 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 2 predicate places. [2025-04-13 20:16:25,842 INFO L485 AbstractCegarLoop]: Abstraction has has 36 places, 36 transitions, 125 flow [2025-04-13 20:16:25,842 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:16:25,842 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:16:25,842 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:16:25,842 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-13 20:16:25,842 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:16:25,842 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:16:25,842 INFO L85 PathProgramCache]: Analyzing trace with hash 1607495490, now seen corresponding path program 1 times [2025-04-13 20:16:25,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:16:25,843 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277062334] [2025-04-13 20:16:25,843 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:16:25,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:16:25,856 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-13 20:16:25,869 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 20:16:25,869 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:16:25,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:16:25,978 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:16:25,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:16:25,978 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277062334] [2025-04-13 20:16:25,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277062334] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:16:25,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:16:25,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 20:16:25,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866288180] [2025-04-13 20:16:25,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:16:25,978 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 20:16:25,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:16:25,979 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 20:16:25,979 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-13 20:16:25,979 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 42 [2025-04-13 20:16:25,979 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 36 transitions, 125 flow. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:16:25,979 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:16:25,979 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 42 [2025-04-13 20:16:25,979 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:16:26,132 INFO L116 PetriNetUnfolderBase]: 1361/1915 cut-off events. [2025-04-13 20:16:26,133 INFO L117 PetriNetUnfolderBase]: For 1259/1286 co-relation queries the response was YES. [2025-04-13 20:16:26,135 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4923 conditions, 1915 events. 1361/1915 cut-off events. For 1259/1286 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 7504 event pairs, 412 based on Foata normal form. 0/1612 useless extension candidates. Maximal degree in co-relation 2477. Up to 960 conditions per place. [2025-04-13 20:16:26,140 INFO L140 encePairwiseOnDemand]: 38/42 looper letters, 55 selfloop transitions, 4 changer transitions 0/65 dead transitions. [2025-04-13 20:16:26,140 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 65 transitions, 328 flow [2025-04-13 20:16:26,140 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 20:16:26,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-13 20:16:26,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 84 transitions. [2025-04-13 20:16:26,141 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5 [2025-04-13 20:16:26,141 INFO L175 Difference]: Start difference. First operand has 36 places, 36 transitions, 125 flow. Second operand 4 states and 84 transitions. [2025-04-13 20:16:26,141 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 65 transitions, 328 flow [2025-04-13 20:16:26,143 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 65 transitions, 325 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-13 20:16:26,143 INFO L231 Difference]: Finished difference. Result has 38 places, 35 transitions, 125 flow [2025-04-13 20:16:26,143 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=117, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=125, PETRI_PLACES=38, PETRI_TRANSITIONS=35} [2025-04-13 20:16:26,144 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 4 predicate places. [2025-04-13 20:16:26,144 INFO L485 AbstractCegarLoop]: Abstraction has has 38 places, 35 transitions, 125 flow [2025-04-13 20:16:26,144 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:16:26,144 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:16:26,144 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:16:26,144 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-13 20:16:26,144 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:16:26,144 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:16:26,145 INFO L85 PathProgramCache]: Analyzing trace with hash -1383499131, now seen corresponding path program 1 times [2025-04-13 20:16:26,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:16:26,145 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143872729] [2025-04-13 20:16:26,145 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:16:26,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:16:26,151 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-13 20:16:26,162 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 20:16:26,162 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:16:26,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:16:26,288 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:16:26,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:16:26,288 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143872729] [2025-04-13 20:16:26,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143872729] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:16:26,288 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1641544476] [2025-04-13 20:16:26,288 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:16:26,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:16:26,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:16:26,290 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:16:26,292 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-04-13 20:16:26,337 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-13 20:16:26,357 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 20:16:26,358 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:16:26,358 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:16:26,362 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-04-13 20:16:26,365 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:16:26,422 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:16:26,422 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:16:26,469 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:16:26,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1641544476] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:16:26,469 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:16:26,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 4 [2025-04-13 20:16:26,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117356907] [2025-04-13 20:16:26,470 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:16:26,470 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 20:16:26,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:16:26,470 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 20:16:26,470 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-13 20:16:26,476 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 42 [2025-04-13 20:16:26,476 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 35 transitions, 125 flow. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:16:26,476 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:16:26,476 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 42 [2025-04-13 20:16:26,476 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:16:26,994 INFO L116 PetriNetUnfolderBase]: 4952/6730 cut-off events. [2025-04-13 20:16:26,994 INFO L117 PetriNetUnfolderBase]: For 3069/3069 co-relation queries the response was YES. [2025-04-13 20:16:26,999 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18339 conditions, 6730 events. 4952/6730 cut-off events. For 3069/3069 co-relation queries the response was YES. Maximal size of possible extension queue 212. Compared 28345 event pairs, 1090 based on Foata normal form. 1/5973 useless extension candidates. Maximal degree in co-relation 8138. Up to 2651 conditions per place. [2025-04-13 20:16:27,016 INFO L140 encePairwiseOnDemand]: 34/42 looper letters, 103 selfloop transitions, 26 changer transitions 1/130 dead transitions. [2025-04-13 20:16:27,017 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 130 transitions, 708 flow [2025-04-13 20:16:27,017 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 20:16:27,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-13 20:16:27,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 138 transitions. [2025-04-13 20:16:27,017 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5476190476190477 [2025-04-13 20:16:27,017 INFO L175 Difference]: Start difference. First operand has 38 places, 35 transitions, 125 flow. Second operand 6 states and 138 transitions. [2025-04-13 20:16:27,018 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 130 transitions, 708 flow [2025-04-13 20:16:27,019 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 130 transitions, 693 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-13 20:16:27,021 INFO L231 Difference]: Finished difference. Result has 42 places, 57 transitions, 287 flow [2025-04-13 20:16:27,021 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=287, PETRI_PLACES=42, PETRI_TRANSITIONS=57} [2025-04-13 20:16:27,021 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 8 predicate places. [2025-04-13 20:16:27,021 INFO L485 AbstractCegarLoop]: Abstraction has has 42 places, 57 transitions, 287 flow [2025-04-13 20:16:27,021 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:16:27,021 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:16:27,021 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:16:27,028 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-04-13 20:16:27,222 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:16:27,222 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:16:27,222 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:16:27,223 INFO L85 PathProgramCache]: Analyzing trace with hash -1370067561, now seen corresponding path program 2 times [2025-04-13 20:16:27,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:16:27,223 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611136114] [2025-04-13 20:16:27,223 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:16:27,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:16:27,238 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-04-13 20:16:27,268 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 20:16:27,268 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:16:27,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:16:27,441 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:16:27,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:16:27,441 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611136114] [2025-04-13 20:16:27,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611136114] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:16:27,441 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [174237663] [2025-04-13 20:16:27,441 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:16:27,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:16:27,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:16:27,444 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:16:27,445 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-04-13 20:16:27,487 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-04-13 20:16:27,508 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 20:16:27,508 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:16:27,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:16:27,511 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-04-13 20:16:27,513 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:16:27,546 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:16:27,546 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:16:27,572 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:16:27,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [174237663] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:16:27,573 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:16:27,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 4 [2025-04-13 20:16:27,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689525678] [2025-04-13 20:16:27,573 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:16:27,573 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 20:16:27,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:16:27,573 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 20:16:27,574 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-13 20:16:27,578 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 42 [2025-04-13 20:16:27,578 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 57 transitions, 287 flow. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:16:27,578 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:16:27,578 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 42 [2025-04-13 20:16:27,578 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:16:28,414 INFO L116 PetriNetUnfolderBase]: 10263/13898 cut-off events. [2025-04-13 20:16:28,414 INFO L117 PetriNetUnfolderBase]: For 11198/11198 co-relation queries the response was YES. [2025-04-13 20:16:28,425 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42206 conditions, 13898 events. 10263/13898 cut-off events. For 11198/11198 co-relation queries the response was YES. Maximal size of possible extension queue 453. Compared 66335 event pairs, 2186 based on Foata normal form. 1/12300 useless extension candidates. Maximal degree in co-relation 16244. Up to 6134 conditions per place. [2025-04-13 20:16:28,466 INFO L140 encePairwiseOnDemand]: 34/42 looper letters, 134 selfloop transitions, 46 changer transitions 1/181 dead transitions. [2025-04-13 20:16:28,466 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 181 transitions, 1168 flow [2025-04-13 20:16:28,467 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 20:16:28,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-13 20:16:28,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 147 transitions. [2025-04-13 20:16:28,468 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5833333333333334 [2025-04-13 20:16:28,468 INFO L175 Difference]: Start difference. First operand has 42 places, 57 transitions, 287 flow. Second operand 6 states and 147 transitions. [2025-04-13 20:16:28,468 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 181 transitions, 1168 flow [2025-04-13 20:16:28,474 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 181 transitions, 1052 flow, removed 58 selfloop flow, removed 0 redundant places. [2025-04-13 20:16:28,475 INFO L231 Difference]: Finished difference. Result has 50 places, 99 transitions, 636 flow [2025-04-13 20:16:28,476 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=243, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=636, PETRI_PLACES=50, PETRI_TRANSITIONS=99} [2025-04-13 20:16:28,476 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 16 predicate places. [2025-04-13 20:16:28,476 INFO L485 AbstractCegarLoop]: Abstraction has has 50 places, 99 transitions, 636 flow [2025-04-13 20:16:28,476 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:16:28,476 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:16:28,476 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:16:28,486 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-04-13 20:16:28,677 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-04-13 20:16:28,677 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:16:28,678 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:16:28,678 INFO L85 PathProgramCache]: Analyzing trace with hash 1743296471, now seen corresponding path program 3 times [2025-04-13 20:16:28,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:16:28,678 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109060383] [2025-04-13 20:16:28,678 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:16:28,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:16:28,685 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 1 equivalence classes. [2025-04-13 20:16:28,696 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 20:16:28,696 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 20:16:28,696 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:16:28,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:16:28,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:16:28,844 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109060383] [2025-04-13 20:16:28,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109060383] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:16:28,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:16:28,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 20:16:28,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857529220] [2025-04-13 20:16:28,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:16:28,844 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 20:16:28,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:16:28,844 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 20:16:28,844 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-04-13 20:16:28,848 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 42 [2025-04-13 20:16:28,848 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 99 transitions, 636 flow. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:16:28,848 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:16:28,848 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 42 [2025-04-13 20:16:28,848 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:16:30,113 INFO L116 PetriNetUnfolderBase]: 12601/17043 cut-off events. [2025-04-13 20:16:30,113 INFO L117 PetriNetUnfolderBase]: For 20383/20383 co-relation queries the response was YES. [2025-04-13 20:16:30,126 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55066 conditions, 17043 events. 12601/17043 cut-off events. For 20383/20383 co-relation queries the response was YES. Maximal size of possible extension queue 590. Compared 83841 event pairs, 2974 based on Foata normal form. 1/15065 useless extension candidates. Maximal degree in co-relation 19461. Up to 5383 conditions per place. [2025-04-13 20:16:30,167 INFO L140 encePairwiseOnDemand]: 34/42 looper letters, 121 selfloop transitions, 96 changer transitions 1/218 dead transitions. [2025-04-13 20:16:30,167 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 218 transitions, 1523 flow [2025-04-13 20:16:30,172 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 20:16:30,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-13 20:16:30,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 163 transitions. [2025-04-13 20:16:30,172 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5544217687074829 [2025-04-13 20:16:30,172 INFO L175 Difference]: Start difference. First operand has 50 places, 99 transitions, 636 flow. Second operand 7 states and 163 transitions. [2025-04-13 20:16:30,172 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 218 transitions, 1523 flow [2025-04-13 20:16:30,199 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 218 transitions, 1499 flow, removed 12 selfloop flow, removed 0 redundant places. [2025-04-13 20:16:30,201 INFO L231 Difference]: Finished difference. Result has 57 places, 127 transitions, 1026 flow [2025-04-13 20:16:30,201 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=612, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=74, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1026, PETRI_PLACES=57, PETRI_TRANSITIONS=127} [2025-04-13 20:16:30,202 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 23 predicate places. [2025-04-13 20:16:30,202 INFO L485 AbstractCegarLoop]: Abstraction has has 57 places, 127 transitions, 1026 flow [2025-04-13 20:16:30,202 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:16:30,202 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:16:30,202 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:16:30,202 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-13 20:16:30,202 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:16:30,203 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:16:30,203 INFO L85 PathProgramCache]: Analyzing trace with hash 867413805, now seen corresponding path program 4 times [2025-04-13 20:16:30,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:16:30,203 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271555085] [2025-04-13 20:16:30,203 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:16:30,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:16:30,209 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 26 statements into 2 equivalence classes. [2025-04-13 20:16:30,217 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 20:16:30,217 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 20:16:30,217 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:16:30,323 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:16:30,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:16:30,323 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271555085] [2025-04-13 20:16:30,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271555085] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:16:30,323 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1662124497] [2025-04-13 20:16:30,323 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:16:30,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:16:30,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:16:30,325 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:16:30,326 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-04-13 20:16:30,363 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 26 statements into 2 equivalence classes. [2025-04-13 20:16:30,379 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 20:16:30,379 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 20:16:30,379 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:16:30,380 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-04-13 20:16:30,380 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:16:30,409 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:16:30,409 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:16:30,439 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:16:30,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1662124497] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:16:30,439 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:16:30,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 6 [2025-04-13 20:16:30,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061325617] [2025-04-13 20:16:30,439 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:16:30,439 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 20:16:30,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:16:30,440 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 20:16:30,440 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-04-13 20:16:30,451 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 42 [2025-04-13 20:16:30,452 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 127 transitions, 1026 flow. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:16:30,452 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:16:30,452 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 42 [2025-04-13 20:16:30,452 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:16:31,782 INFO L116 PetriNetUnfolderBase]: 14979/20244 cut-off events. [2025-04-13 20:16:31,783 INFO L117 PetriNetUnfolderBase]: For 40380/40380 co-relation queries the response was YES. [2025-04-13 20:16:31,804 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72034 conditions, 20244 events. 14979/20244 cut-off events. For 40380/40380 co-relation queries the response was YES. Maximal size of possible extension queue 765. Compared 102669 event pairs, 3672 based on Foata normal form. 1/17886 useless extension candidates. Maximal degree in co-relation 23795. Up to 6337 conditions per place. [2025-04-13 20:16:31,853 INFO L140 encePairwiseOnDemand]: 34/42 looper letters, 125 selfloop transitions, 127 changer transitions 1/253 dead transitions. [2025-04-13 20:16:31,853 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 253 transitions, 2077 flow [2025-04-13 20:16:31,853 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 20:16:31,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-13 20:16:31,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 173 transitions. [2025-04-13 20:16:31,854 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5148809523809523 [2025-04-13 20:16:31,854 INFO L175 Difference]: Start difference. First operand has 57 places, 127 transitions, 1026 flow. Second operand 8 states and 173 transitions. [2025-04-13 20:16:31,854 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 253 transitions, 2077 flow [2025-04-13 20:16:31,894 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 253 transitions, 1883 flow, removed 86 selfloop flow, removed 1 redundant places. [2025-04-13 20:16:31,897 INFO L231 Difference]: Finished difference. Result has 64 places, 158 transitions, 1397 flow [2025-04-13 20:16:31,897 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=956, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=102, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1397, PETRI_PLACES=64, PETRI_TRANSITIONS=158} [2025-04-13 20:16:31,897 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 30 predicate places. [2025-04-13 20:16:31,897 INFO L485 AbstractCegarLoop]: Abstraction has has 64 places, 158 transitions, 1397 flow [2025-04-13 20:16:31,897 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:16:31,897 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:16:31,897 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:16:31,903 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-04-13 20:16:32,098 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:16:32,098 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:16:32,099 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:16:32,099 INFO L85 PathProgramCache]: Analyzing trace with hash 76883137, now seen corresponding path program 1 times [2025-04-13 20:16:32,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:16:32,099 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029278751] [2025-04-13 20:16:32,099 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:16:32,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:16:32,104 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-13 20:16:32,112 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 20:16:32,113 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:16:32,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:16:32,171 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 20:16:32,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:16:32,172 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029278751] [2025-04-13 20:16:32,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029278751] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:16:32,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:16:32,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 20:16:32,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898331692] [2025-04-13 20:16:32,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:16:32,172 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 20:16:32,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:16:32,172 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 20:16:32,172 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 20:16:32,172 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 42 [2025-04-13 20:16:32,172 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 158 transitions, 1397 flow. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:16:32,172 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:16:32,173 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 42 [2025-04-13 20:16:32,173 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:16:33,068 INFO L116 PetriNetUnfolderBase]: 7262/10378 cut-off events. [2025-04-13 20:16:33,068 INFO L117 PetriNetUnfolderBase]: For 25078/25539 co-relation queries the response was YES. [2025-04-13 20:16:33,090 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36102 conditions, 10378 events. 7262/10378 cut-off events. For 25078/25539 co-relation queries the response was YES. Maximal size of possible extension queue 621. Compared 59262 event pairs, 2109 based on Foata normal form. 273/9287 useless extension candidates. Maximal degree in co-relation 17609. Up to 5993 conditions per place. [2025-04-13 20:16:33,127 INFO L140 encePairwiseOnDemand]: 38/42 looper letters, 62 selfloop transitions, 3 changer transitions 0/151 dead transitions. [2025-04-13 20:16:33,128 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 151 transitions, 1374 flow [2025-04-13 20:16:33,128 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 20:16:33,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 20:16:33,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 60 transitions. [2025-04-13 20:16:33,128 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.47619047619047616 [2025-04-13 20:16:33,129 INFO L175 Difference]: Start difference. First operand has 64 places, 158 transitions, 1397 flow. Second operand 3 states and 60 transitions. [2025-04-13 20:16:33,129 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 151 transitions, 1374 flow [2025-04-13 20:16:33,170 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 151 transitions, 1318 flow, removed 10 selfloop flow, removed 1 redundant places. [2025-04-13 20:16:33,172 INFO L231 Difference]: Finished difference. Result has 65 places, 136 transitions, 1142 flow [2025-04-13 20:16:33,172 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1136, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1142, PETRI_PLACES=65, PETRI_TRANSITIONS=136} [2025-04-13 20:16:33,173 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 31 predicate places. [2025-04-13 20:16:33,173 INFO L485 AbstractCegarLoop]: Abstraction has has 65 places, 136 transitions, 1142 flow [2025-04-13 20:16:33,173 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:16:33,173 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:16:33,173 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:16:33,173 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-04-13 20:16:33,173 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:16:33,173 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:16:33,173 INFO L85 PathProgramCache]: Analyzing trace with hash -2057100364, now seen corresponding path program 5 times [2025-04-13 20:16:33,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:16:33,173 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217922782] [2025-04-13 20:16:33,174 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:16:33,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:16:33,183 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 28 statements into 3 equivalence classes. [2025-04-13 20:16:33,188 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 6 of 28 statements. [2025-04-13 20:16:33,188 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:16:33,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:16:33,213 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:16:33,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:16:33,214 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217922782] [2025-04-13 20:16:33,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [217922782] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:16:33,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:16:33,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 20:16:33,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088002135] [2025-04-13 20:16:33,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:16:33,214 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 20:16:33,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:16:33,215 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 20:16:33,215 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 20:16:33,215 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 42 [2025-04-13 20:16:33,215 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 136 transitions, 1142 flow. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:16:33,215 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:16:33,215 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 42 [2025-04-13 20:16:33,215 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:16:33,850 INFO L116 PetriNetUnfolderBase]: 6468/9419 cut-off events. [2025-04-13 20:16:33,850 INFO L117 PetriNetUnfolderBase]: For 23256/23636 co-relation queries the response was YES. [2025-04-13 20:16:33,866 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33490 conditions, 9419 events. 6468/9419 cut-off events. For 23256/23636 co-relation queries the response was YES. Maximal size of possible extension queue 573. Compared 53525 event pairs, 1824 based on Foata normal form. 523/8703 useless extension candidates. Maximal degree in co-relation 16389. Up to 5035 conditions per place. [2025-04-13 20:16:33,892 INFO L140 encePairwiseOnDemand]: 39/42 looper letters, 83 selfloop transitions, 3 changer transitions 0/172 dead transitions. [2025-04-13 20:16:33,892 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 172 transitions, 1572 flow [2025-04-13 20:16:33,893 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 20:16:33,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 20:16:33,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 61 transitions. [2025-04-13 20:16:33,893 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.48412698412698413 [2025-04-13 20:16:33,893 INFO L175 Difference]: Start difference. First operand has 65 places, 136 transitions, 1142 flow. Second operand 3 states and 61 transitions. [2025-04-13 20:16:33,893 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 172 transitions, 1572 flow [2025-04-13 20:16:33,915 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 172 transitions, 1557 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-04-13 20:16:33,916 INFO L231 Difference]: Finished difference. Result has 64 places, 135 transitions, 1135 flow [2025-04-13 20:16:33,916 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1129, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1135, PETRI_PLACES=64, PETRI_TRANSITIONS=135} [2025-04-13 20:16:33,918 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 30 predicate places. [2025-04-13 20:16:33,918 INFO L485 AbstractCegarLoop]: Abstraction has has 64 places, 135 transitions, 1135 flow [2025-04-13 20:16:33,918 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:16:33,918 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:16:33,918 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:16:33,918 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-04-13 20:16:33,918 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:16:33,918 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:16:33,918 INFO L85 PathProgramCache]: Analyzing trace with hash 448381316, now seen corresponding path program 6 times [2025-04-13 20:16:33,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:16:33,919 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157803828] [2025-04-13 20:16:33,919 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 20:16:33,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:16:33,925 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 28 statements into 2 equivalence classes. [2025-04-13 20:16:33,937 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 20:16:33,937 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 20:16:33,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:16:33,990 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:16:33,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:16:33,990 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157803828] [2025-04-13 20:16:33,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157803828] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:16:33,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:16:33,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 20:16:33,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779038564] [2025-04-13 20:16:33,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:16:33,990 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 20:16:33,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:16:33,991 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 20:16:33,991 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 20:16:33,991 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 42 [2025-04-13 20:16:33,991 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 135 transitions, 1135 flow. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:16:33,991 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:16:33,991 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 42 [2025-04-13 20:16:33,991 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:16:34,246 INFO L116 PetriNetUnfolderBase]: 2916/4489 cut-off events. [2025-04-13 20:16:34,246 INFO L117 PetriNetUnfolderBase]: For 12002/12163 co-relation queries the response was YES. [2025-04-13 20:16:34,253 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15920 conditions, 4489 events. 2916/4489 cut-off events. For 12002/12163 co-relation queries the response was YES. Maximal size of possible extension queue 258. Compared 24545 event pairs, 1294 based on Foata normal form. 357/3961 useless extension candidates. Maximal degree in co-relation 8322. Up to 2897 conditions per place. [2025-04-13 20:16:34,256 INFO L140 encePairwiseOnDemand]: 39/42 looper letters, 0 selfloop transitions, 0 changer transitions 140/140 dead transitions. [2025-04-13 20:16:34,257 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 140 transitions, 1297 flow [2025-04-13 20:16:34,257 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 20:16:34,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 20:16:34,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 59 transitions. [2025-04-13 20:16:34,257 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.46825396825396826 [2025-04-13 20:16:34,257 INFO L175 Difference]: Start difference. First operand has 64 places, 135 transitions, 1135 flow. Second operand 3 states and 59 transitions. [2025-04-13 20:16:34,257 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 140 transitions, 1297 flow [2025-04-13 20:16:34,271 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 140 transitions, 1235 flow, removed 1 selfloop flow, removed 5 redundant places. [2025-04-13 20:16:34,272 INFO L231 Difference]: Finished difference. Result has 60 places, 0 transitions, 0 flow [2025-04-13 20:16:34,272 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=851, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=60, PETRI_TRANSITIONS=0} [2025-04-13 20:16:34,272 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 26 predicate places. [2025-04-13 20:16:34,272 INFO L485 AbstractCegarLoop]: Abstraction has has 60 places, 0 transitions, 0 flow [2025-04-13 20:16:34,272 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:16:34,274 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2025-04-13 20:16:34,274 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2025-04-13 20:16:34,274 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2025-04-13 20:16:34,274 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2025-04-13 20:16:34,274 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-04-13 20:16:34,275 INFO L422 BasicCegarLoop]: Path program histogram: [6, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:16:34,277 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-13 20:16:34,277 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-13 20:16:34,280 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 08:16:34 BasicIcfg [2025-04-13 20:16:34,280 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-13 20:16:34,280 INFO L158 Benchmark]: Toolchain (without parser) took 12052.66ms. Allocated memory was 142.6MB in the beginning and 1.5GB in the end (delta: 1.4GB). Free memory was 101.2MB in the beginning and 681.6MB in the end (delta: -580.3MB). Peak memory consumption was 819.0MB. Max. memory is 8.0GB. [2025-04-13 20:16:34,281 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 155.2MB. Free memory is still 87.6MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 20:16:34,281 INFO L158 Benchmark]: CACSL2BoogieTranslator took 239.36ms. Allocated memory is still 142.6MB. Free memory was 101.2MB in the beginning and 86.4MB in the end (delta: 14.9MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-13 20:16:34,281 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.33ms. Allocated memory is still 142.6MB. Free memory was 86.4MB in the beginning and 85.0MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 20:16:34,281 INFO L158 Benchmark]: Boogie Preprocessor took 38.23ms. Allocated memory is still 142.6MB. Free memory was 85.0MB in the beginning and 83.3MB in the end (delta: 1.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 20:16:34,281 INFO L158 Benchmark]: RCFGBuilder took 461.69ms. Allocated memory is still 142.6MB. Free memory was 83.3MB in the beginning and 45.6MB in the end (delta: 37.7MB). Peak memory consumption was 37.7MB. Max. memory is 8.0GB. [2025-04-13 20:16:34,281 INFO L158 Benchmark]: TraceAbstraction took 11281.09ms. Allocated memory was 142.6MB in the beginning and 1.5GB in the end (delta: 1.4GB). Free memory was 45.1MB in the beginning and 681.6MB in the end (delta: -636.5MB). Peak memory consumption was 764.5MB. Max. memory is 8.0GB. [2025-04-13 20:16:34,282 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 155.2MB. Free memory is still 87.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 239.36ms. Allocated memory is still 142.6MB. Free memory was 101.2MB in the beginning and 86.4MB in the end (delta: 14.9MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 27.33ms. Allocated memory is still 142.6MB. Free memory was 86.4MB in the beginning and 85.0MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 38.23ms. Allocated memory is still 142.6MB. Free memory was 85.0MB in the beginning and 83.3MB in the end (delta: 1.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 461.69ms. Allocated memory is still 142.6MB. Free memory was 83.3MB in the beginning and 45.6MB in the end (delta: 37.7MB). Peak memory consumption was 37.7MB. Max. memory is 8.0GB. * TraceAbstraction took 11281.09ms. Allocated memory was 142.6MB in the beginning and 1.5GB in the end (delta: 1.4GB). Free memory was 45.1MB in the beginning and 681.6MB in the end (delta: -636.5MB). Peak memory consumption was 764.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 113]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 48 locations, 75 edges, 4 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 11.2s, OverallIterations: 15, TraceHistogramMax: 2, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 8.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 447 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 435 mSDsluCounter, 4 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 76 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2798 IncrementalHoareTripleChecker+Invalid, 2874 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 76 mSolverCounterUnsat, 4 mSDtfsCounter, 2798 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 208 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1397occurred in iteration=12, InterpolantAutomatonStates: 63, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 420 NumberOfCodeBlocks, 398 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 477 ConstructedInterpolants, 0 QuantifiedInterpolants, 1499 SizeOfPredicates, 6 NumberOfNonLiveVariables, 534 ConjunctsInSsa, 57 ConjunctsInUnsatCore, 21 InterpolantComputations, 12 PerfectInterpolantSequences, 10/22 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-04-13 20:16:34,294 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...