/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline_IcfgBuilder.xml -s ../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.automaton.type.used.in.concurrency.analysis PETRI_NET --preprocessor.replace.while.statements.and.if-then-else.statements false -i ../../../trunk/examples/svcomp/weaver/test-easy1.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-14 01:35:46,405 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-14 01:35:46,459 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2025-04-14 01:35:46,466 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-14 01:35:46,466 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-14 01:35:46,486 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-14 01:35:46,486 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-14 01:35:46,486 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-14 01:35:46,486 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-14 01:35:46,487 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-14 01:35:46,488 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-14 01:35:46,488 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-14 01:35:46,488 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-14 01:35:46,488 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-14 01:35:46,489 INFO L153 SettingsManager]: * Use SBE=true [2025-04-14 01:35:46,489 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-14 01:35:46,489 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-14 01:35:46,489 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-14 01:35:46,489 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-14 01:35:46,489 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-14 01:35:46,489 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-14 01:35:46,489 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-14 01:35:46,489 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-14 01:35:46,489 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-14 01:35:46,489 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-14 01:35:46,489 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-14 01:35:46,489 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-14 01:35:46,489 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-14 01:35:46,490 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-14 01:35:46,490 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 01:35:46,490 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 01:35:46,490 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 01:35:46,490 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 01:35:46,490 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-14 01:35:46,490 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 01:35:46,490 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 01:35:46,490 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 01:35:46,490 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 01:35:46,490 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-14 01:35:46,490 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-14 01:35:46,490 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-14 01:35:46,490 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-14 01:35:46,490 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-14 01:35:46,491 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-14 01:35:46,491 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-14 01:35:46,491 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-14 01:35:46,491 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-14 01:35:46,491 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Automaton type used in concurrency analysis -> PETRI_NET Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Replace while statements and if-then-else statements -> false [2025-04-14 01:35:46,717 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-14 01:35:46,726 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-14 01:35:46,727 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-14 01:35:46,728 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-14 01:35:46,730 INFO L274 PluginConnector]: CDTParser initialized [2025-04-14 01:35:46,730 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/test-easy1.wvr.c [2025-04-14 01:35:48,036 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b14f8d07f/6e15ee1df46743c39961d935bb268380/FLAGad1235d65 [2025-04-14 01:35:48,229 INFO L389 CDTParser]: Found 1 translation units. [2025-04-14 01:35:48,229 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/test-easy1.wvr.c [2025-04-14 01:35:48,234 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b14f8d07f/6e15ee1df46743c39961d935bb268380/FLAGad1235d65 [2025-04-14 01:35:49,036 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b14f8d07f/6e15ee1df46743c39961d935bb268380 [2025-04-14 01:35:49,038 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-14 01:35:49,039 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-14 01:35:49,040 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-14 01:35:49,040 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-14 01:35:49,043 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-14 01:35:49,044 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 01:35:49" (1/1) ... [2025-04-14 01:35:49,044 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2611fc29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:35:49, skipping insertion in model container [2025-04-14 01:35:49,044 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 01:35:49" (1/1) ... [2025-04-14 01:35:49,056 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-14 01:35:49,220 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/test-easy1.wvr.c[1902,1915] [2025-04-14 01:35:49,224 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 01:35:49,231 INFO L200 MainTranslator]: Completed pre-run [2025-04-14 01:35:49,249 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/test-easy1.wvr.c[1902,1915] [2025-04-14 01:35:49,249 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 01:35:49,264 INFO L204 MainTranslator]: Completed translation [2025-04-14 01:35:49,265 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:35:49 WrapperNode [2025-04-14 01:35:49,265 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-14 01:35:49,266 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-14 01:35:49,266 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-14 01:35:49,266 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-14 01:35:49,271 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:35:49" (1/1) ... [2025-04-14 01:35:49,277 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:35:49" (1/1) ... [2025-04-14 01:35:49,292 INFO L138 Inliner]: procedures = 20, calls = 10, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 45 [2025-04-14 01:35:49,292 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-14 01:35:49,293 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-14 01:35:49,293 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-14 01:35:49,293 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-14 01:35:49,300 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:35:49" (1/1) ... [2025-04-14 01:35:49,300 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:35:49" (1/1) ... [2025-04-14 01:35:49,304 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:35:49" (1/1) ... [2025-04-14 01:35:49,316 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-04-14 01:35:49,316 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:35:49" (1/1) ... [2025-04-14 01:35:49,316 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:35:49" (1/1) ... [2025-04-14 01:35:49,318 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:35:49" (1/1) ... [2025-04-14 01:35:49,320 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:35:49" (1/1) ... [2025-04-14 01:35:49,321 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:35:49" (1/1) ... [2025-04-14 01:35:49,321 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:35:49" (1/1) ... [2025-04-14 01:35:49,323 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-14 01:35:49,327 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-04-14 01:35:49,327 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-04-14 01:35:49,327 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-04-14 01:35:49,328 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:35:49" (1/1) ... [2025-04-14 01:35:49,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 01:35:49,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:35:49,355 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-14 01:35:49,357 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-14 01:35:49,373 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-14 01:35:49,374 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-14 01:35:49,374 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-14 01:35:49,374 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-14 01:35:49,374 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-14 01:35:49,374 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-14 01:35:49,374 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-14 01:35:49,374 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-14 01:35:49,375 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-14 01:35:49,431 INFO L256 CfgBuilder]: Building ICFG [2025-04-14 01:35:49,432 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-14 01:35:49,530 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-14 01:35:49,531 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-14 01:35:49,531 INFO L318 CfgBuilder]: Performing block encoding [2025-04-14 01:35:49,633 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-14 01:35:49,634 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 01:35:49 BoogieIcfgContainer [2025-04-14 01:35:49,634 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-04-14 01:35:49,637 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-14 01:35:49,637 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-14 01:35:49,640 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-14 01:35:49,640 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.04 01:35:49" (1/3) ... [2025-04-14 01:35:49,641 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e43d2c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 01:35:49, skipping insertion in model container [2025-04-14 01:35:49,641 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:35:49" (2/3) ... [2025-04-14 01:35:49,642 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e43d2c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 01:35:49, skipping insertion in model container [2025-04-14 01:35:49,642 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 01:35:49" (3/3) ... [2025-04-14 01:35:49,643 INFO L128 eAbstractionObserver]: Analyzing ICFG test-easy1.wvr.c [2025-04-14 01:35:49,653 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-14 01:35:49,654 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG test-easy1.wvr.c that has 3 procedures, 16 locations, 15 edges, 1 initial locations, 2 loop locations, and 1 error locations. [2025-04-14 01:35:49,654 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-14 01:35:49,686 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-14 01:35:49,708 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 22 places, 17 transitions, 48 flow [2025-04-14 01:35:49,726 INFO L116 PetriNetUnfolderBase]: 2/15 cut-off events. [2025-04-14 01:35:49,727 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-14 01:35:49,729 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24 conditions, 15 events. 2/15 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 9 event pairs, 0 based on Foata normal form. 0/12 useless extension candidates. Maximal degree in co-relation 11. Up to 2 conditions per place. [2025-04-14 01:35:49,729 INFO L82 GeneralOperation]: Start removeDead. Operand has 22 places, 17 transitions, 48 flow [2025-04-14 01:35:49,735 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 19 places, 14 transitions, 40 flow [2025-04-14 01:35:49,744 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-14 01:35:49,755 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;@19dd1f81, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 01:35:49,755 INFO L341 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-04-14 01:35:49,766 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-14 01:35:49,766 INFO L116 PetriNetUnfolderBase]: 2/13 cut-off events. [2025-04-14 01:35:49,766 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-14 01:35:49,766 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:35:49,767 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:35:49,767 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 01:35:49,773 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:35:49,774 INFO L85 PathProgramCache]: Analyzing trace with hash -1018081054, now seen corresponding path program 1 times [2025-04-14 01:35:49,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:35:49,779 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136226399] [2025-04-14 01:35:49,779 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:35:49,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:35:49,838 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-14 01:35:49,857 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-14 01:35:49,857 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:35:49,857 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:35:49,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:35:49,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:35:49,962 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136226399] [2025-04-14 01:35:49,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136226399] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:35:49,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:35:49,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-14 01:35:49,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326935958] [2025-04-14 01:35:49,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:35:49,969 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 01:35:49,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:35:49,985 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 01:35:49,986 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 01:35:49,987 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 17 [2025-04-14 01:35:49,988 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 19 places, 14 transitions, 40 flow. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:35:49,989 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:35:49,989 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 17 [2025-04-14 01:35:49,989 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:35:50,085 INFO L116 PetriNetUnfolderBase]: 59/103 cut-off events. [2025-04-14 01:35:50,085 INFO L117 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2025-04-14 01:35:50,087 INFO L83 FinitePrefix]: Finished finitePrefix Result has 224 conditions, 103 events. 59/103 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 286 event pairs, 8 based on Foata normal form. 1/69 useless extension candidates. Maximal degree in co-relation 179. Up to 77 conditions per place. [2025-04-14 01:35:50,089 INFO L140 encePairwiseOnDemand]: 13/17 looper letters, 17 selfloop transitions, 3 changer transitions 1/23 dead transitions. [2025-04-14 01:35:50,089 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 21 places, 23 transitions, 109 flow [2025-04-14 01:35:50,090 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 01:35:50,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-14 01:35:50,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 34 transitions. [2025-04-14 01:35:50,098 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2025-04-14 01:35:50,099 INFO L175 Difference]: Start difference. First operand has 19 places, 14 transitions, 40 flow. Second operand 3 states and 34 transitions. [2025-04-14 01:35:50,099 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 21 places, 23 transitions, 109 flow [2025-04-14 01:35:50,105 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 17 places, 23 transitions, 95 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-04-14 01:35:50,106 INFO L231 Difference]: Finished difference. Result has 18 places, 16 transitions, 51 flow [2025-04-14 01:35:50,109 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=32, PETRI_DIFFERENCE_MINUEND_PLACES=15, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=14, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=51, PETRI_PLACES=18, PETRI_TRANSITIONS=16} [2025-04-14 01:35:50,112 INFO L279 CegarLoopForPetriNet]: 19 programPoint places, -1 predicate places. [2025-04-14 01:35:50,112 INFO L485 AbstractCegarLoop]: Abstraction has has 18 places, 16 transitions, 51 flow [2025-04-14 01:35:50,113 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:35:50,113 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:35:50,113 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:35:50,113 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-14 01:35:50,113 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 01:35:50,114 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:35:50,114 INFO L85 PathProgramCache]: Analyzing trace with hash 858072586, now seen corresponding path program 1 times [2025-04-14 01:35:50,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:35:50,114 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005431248] [2025-04-14 01:35:50,115 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:35:50,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:35:50,122 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-14 01:35:50,130 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-14 01:35:50,130 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:35:50,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:35:50,187 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:35:50,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:35:50,187 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005431248] [2025-04-14 01:35:50,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005431248] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:35:50,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:35:50,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 01:35:50,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93375939] [2025-04-14 01:35:50,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:35:50,188 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 01:35:50,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:35:50,189 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 01:35:50,189 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-14 01:35:50,189 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 17 [2025-04-14 01:35:50,189 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 18 places, 16 transitions, 51 flow. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:35:50,189 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:35:50,189 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 17 [2025-04-14 01:35:50,189 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:35:50,277 INFO L116 PetriNetUnfolderBase]: 60/113 cut-off events. [2025-04-14 01:35:50,277 INFO L117 PetriNetUnfolderBase]: For 28/28 co-relation queries the response was YES. [2025-04-14 01:35:50,278 INFO L83 FinitePrefix]: Finished finitePrefix Result has 278 conditions, 113 events. 60/113 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 321 event pairs, 6 based on Foata normal form. 6/119 useless extension candidates. Maximal degree in co-relation 79. Up to 46 conditions per place. [2025-04-14 01:35:50,279 INFO L140 encePairwiseOnDemand]: 12/17 looper letters, 26 selfloop transitions, 7 changer transitions 2/37 dead transitions. [2025-04-14 01:35:50,279 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 22 places, 37 transitions, 181 flow [2025-04-14 01:35:50,280 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 01:35:50,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 01:35:50,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 53 transitions. [2025-04-14 01:35:50,281 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6235294117647059 [2025-04-14 01:35:50,281 INFO L175 Difference]: Start difference. First operand has 18 places, 16 transitions, 51 flow. Second operand 5 states and 53 transitions. [2025-04-14 01:35:50,281 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 22 places, 37 transitions, 181 flow [2025-04-14 01:35:50,282 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 21 places, 37 transitions, 177 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-14 01:35:50,282 INFO L231 Difference]: Finished difference. Result has 24 places, 22 transitions, 104 flow [2025-04-14 01:35:50,282 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=17, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=16, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=104, PETRI_PLACES=24, PETRI_TRANSITIONS=22} [2025-04-14 01:35:50,283 INFO L279 CegarLoopForPetriNet]: 19 programPoint places, 5 predicate places. [2025-04-14 01:35:50,283 INFO L485 AbstractCegarLoop]: Abstraction has has 24 places, 22 transitions, 104 flow [2025-04-14 01:35:50,283 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:35:50,283 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:35:50,283 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:35:50,283 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-14 01:35:50,284 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 01:35:50,285 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:35:50,285 INFO L85 PathProgramCache]: Analyzing trace with hash -1534992601, now seen corresponding path program 1 times [2025-04-14 01:35:50,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:35:50,285 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661668492] [2025-04-14 01:35:50,285 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:35:50,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:35:50,295 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-14 01:35:50,301 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-14 01:35:50,301 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:35:50,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:35:50,354 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:35:50,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:35:50,354 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661668492] [2025-04-14 01:35:50,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661668492] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:35:50,355 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [295568185] [2025-04-14 01:35:50,355 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:35:50,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:35:50,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:35:50,357 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 01:35:50,358 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-04-14 01:35:50,391 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-14 01:35:50,406 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-14 01:35:50,406 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:35:50,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:35:50,408 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-14 01:35:50,410 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:35:50,485 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:35:50,485 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:35:50,532 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:35:50,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [295568185] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-14 01:35:50,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-14 01:35:50,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 6 [2025-04-14 01:35:50,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944996920] [2025-04-14 01:35:50,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:35:50,533 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 01:35:50,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:35:50,533 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 01:35:50,533 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-04-14 01:35:50,534 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 17 [2025-04-14 01:35:50,534 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 22 transitions, 104 flow. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:35:50,534 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:35:50,534 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 17 [2025-04-14 01:35:50,534 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:35:50,600 INFO L116 PetriNetUnfolderBase]: 61/130 cut-off events. [2025-04-14 01:35:50,600 INFO L117 PetriNetUnfolderBase]: For 119/119 co-relation queries the response was YES. [2025-04-14 01:35:50,600 INFO L83 FinitePrefix]: Finished finitePrefix Result has 423 conditions, 130 events. 61/130 cut-off events. For 119/119 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 434 event pairs, 10 based on Foata normal form. 5/135 useless extension candidates. Maximal degree in co-relation 288. Up to 52 conditions per place. [2025-04-14 01:35:50,601 INFO L140 encePairwiseOnDemand]: 12/17 looper letters, 28 selfloop transitions, 8 changer transitions 2/40 dead transitions. [2025-04-14 01:35:50,601 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 40 transitions, 254 flow [2025-04-14 01:35:50,603 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 01:35:50,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-14 01:35:50,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 46 transitions. [2025-04-14 01:35:50,605 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6764705882352942 [2025-04-14 01:35:50,605 INFO L175 Difference]: Start difference. First operand has 24 places, 22 transitions, 104 flow. Second operand 4 states and 46 transitions. [2025-04-14 01:35:50,605 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 40 transitions, 254 flow [2025-04-14 01:35:50,607 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 40 transitions, 254 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-14 01:35:50,608 INFO L231 Difference]: Finished difference. Result has 29 places, 25 transitions, 151 flow [2025-04-14 01:35:50,608 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=151, PETRI_PLACES=29, PETRI_TRANSITIONS=25} [2025-04-14 01:35:50,608 INFO L279 CegarLoopForPetriNet]: 19 programPoint places, 10 predicate places. [2025-04-14 01:35:50,608 INFO L485 AbstractCegarLoop]: Abstraction has has 29 places, 25 transitions, 151 flow [2025-04-14 01:35:50,610 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:35:50,610 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:35:50,610 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:35:50,617 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-04-14 01:35:50,815 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:35:50,816 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 01:35:50,816 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:35:50,816 INFO L85 PathProgramCache]: Analyzing trace with hash -830168555, now seen corresponding path program 2 times [2025-04-14 01:35:50,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:35:50,816 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101268911] [2025-04-14 01:35:50,816 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:35:50,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:35:50,821 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 13 statements into 2 equivalence classes. [2025-04-14 01:35:50,835 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 13 of 13 statements. [2025-04-14 01:35:50,835 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:35:50,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:35:50,883 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:35:50,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:35:50,883 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101268911] [2025-04-14 01:35:50,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101268911] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:35:50,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:35:50,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 01:35:50,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475909831] [2025-04-14 01:35:50,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:35:50,883 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 01:35:50,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:35:50,884 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 01:35:50,884 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-14 01:35:50,884 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 17 [2025-04-14 01:35:50,884 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 25 transitions, 151 flow. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:35:50,884 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:35:50,884 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 17 [2025-04-14 01:35:50,884 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:35:50,945 INFO L116 PetriNetUnfolderBase]: 51/108 cut-off events. [2025-04-14 01:35:50,945 INFO L117 PetriNetUnfolderBase]: For 238/240 co-relation queries the response was YES. [2025-04-14 01:35:50,946 INFO L83 FinitePrefix]: Finished finitePrefix Result has 418 conditions, 108 events. 51/108 cut-off events. For 238/240 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 314 event pairs, 5 based on Foata normal form. 2/110 useless extension candidates. Maximal degree in co-relation 275. Up to 39 conditions per place. [2025-04-14 01:35:50,946 INFO L140 encePairwiseOnDemand]: 12/17 looper letters, 28 selfloop transitions, 7 changer transitions 2/39 dead transitions. [2025-04-14 01:35:50,946 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 39 transitions, 289 flow [2025-04-14 01:35:50,947 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 01:35:50,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 01:35:50,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 50 transitions. [2025-04-14 01:35:50,948 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5882352941176471 [2025-04-14 01:35:50,948 INFO L175 Difference]: Start difference. First operand has 29 places, 25 transitions, 151 flow. Second operand 5 states and 50 transitions. [2025-04-14 01:35:50,948 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 39 transitions, 289 flow [2025-04-14 01:35:50,950 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 39 transitions, 285 flow, removed 2 selfloop flow, removed 0 redundant places. [2025-04-14 01:35:50,950 INFO L231 Difference]: Finished difference. Result has 34 places, 25 transitions, 170 flow [2025-04-14 01:35:50,950 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=170, PETRI_PLACES=34, PETRI_TRANSITIONS=25} [2025-04-14 01:35:50,951 INFO L279 CegarLoopForPetriNet]: 19 programPoint places, 15 predicate places. [2025-04-14 01:35:50,951 INFO L485 AbstractCegarLoop]: Abstraction has has 34 places, 25 transitions, 170 flow [2025-04-14 01:35:50,951 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:35:50,951 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:35:50,951 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:35:50,951 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-14 01:35:50,951 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 01:35:50,953 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:35:50,953 INFO L85 PathProgramCache]: Analyzing trace with hash -10584462, now seen corresponding path program 2 times [2025-04-14 01:35:50,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:35:50,953 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658714916] [2025-04-14 01:35:50,953 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:35:50,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:35:50,959 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 13 statements into 2 equivalence classes. [2025-04-14 01:35:50,981 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 13 of 13 statements. [2025-04-14 01:35:50,981 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:35:50,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:35:51,026 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:35:51,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:35:51,026 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658714916] [2025-04-14 01:35:51,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658714916] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:35:51,027 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1011255717] [2025-04-14 01:35:51,027 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:35:51,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:35:51,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:35:51,028 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 01:35:51,030 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-04-14 01:35:51,055 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 13 statements into 2 equivalence classes. [2025-04-14 01:35:51,067 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 13 of 13 statements. [2025-04-14 01:35:51,067 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:35:51,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:35:51,068 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-14 01:35:51,069 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:35:51,133 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:35:51,134 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:35:51,216 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:35:51,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1011255717] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-14 01:35:51,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-14 01:35:51,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 8 [2025-04-14 01:35:51,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861190676] [2025-04-14 01:35:51,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:35:51,217 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 01:35:51,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:35:51,217 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 01:35:51,217 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2025-04-14 01:35:51,217 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 17 [2025-04-14 01:35:51,218 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 25 transitions, 170 flow. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:35:51,219 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:35:51,219 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 17 [2025-04-14 01:35:51,219 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:35:51,287 INFO L116 PetriNetUnfolderBase]: 77/159 cut-off events. [2025-04-14 01:35:51,287 INFO L117 PetriNetUnfolderBase]: For 320/320 co-relation queries the response was YES. [2025-04-14 01:35:51,288 INFO L83 FinitePrefix]: Finished finitePrefix Result has 669 conditions, 159 events. 77/159 cut-off events. For 320/320 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 534 event pairs, 5 based on Foata normal form. 2/161 useless extension candidates. Maximal degree in co-relation 345. Up to 61 conditions per place. [2025-04-14 01:35:51,291 INFO L140 encePairwiseOnDemand]: 11/17 looper letters, 33 selfloop transitions, 13 changer transitions 4/52 dead transitions. [2025-04-14 01:35:51,291 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 52 transitions, 417 flow [2025-04-14 01:35:51,292 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 01:35:51,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 01:35:51,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 58 transitions. [2025-04-14 01:35:51,293 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6823529411764706 [2025-04-14 01:35:51,293 INFO L175 Difference]: Start difference. First operand has 34 places, 25 transitions, 170 flow. Second operand 5 states and 58 transitions. [2025-04-14 01:35:51,293 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 52 transitions, 417 flow [2025-04-14 01:35:51,298 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 52 transitions, 396 flow, removed 6 selfloop flow, removed 1 redundant places. [2025-04-14 01:35:51,299 INFO L231 Difference]: Finished difference. Result has 41 places, 31 transitions, 280 flow [2025-04-14 01:35:51,299 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=280, PETRI_PLACES=41, PETRI_TRANSITIONS=31} [2025-04-14 01:35:51,299 INFO L279 CegarLoopForPetriNet]: 19 programPoint places, 22 predicate places. [2025-04-14 01:35:51,299 INFO L485 AbstractCegarLoop]: Abstraction has has 41 places, 31 transitions, 280 flow [2025-04-14 01:35:51,299 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:35:51,299 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:35:51,299 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:35:51,306 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-04-14 01:35:51,500 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:35:51,500 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 01:35:51,501 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:35:51,501 INFO L85 PathProgramCache]: Analyzing trace with hash 429891645, now seen corresponding path program 1 times [2025-04-14 01:35:51,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:35:51,501 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863528963] [2025-04-14 01:35:51,501 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:35:51,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:35:51,505 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-14 01:35:51,509 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-14 01:35:51,510 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:35:51,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:35:51,577 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:35:51,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:35:51,577 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863528963] [2025-04-14 01:35:51,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [863528963] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:35:51,577 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1316532454] [2025-04-14 01:35:51,577 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:35:51,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:35:51,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:35:51,581 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 01:35:51,583 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-04-14 01:35:51,610 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-14 01:35:51,619 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-14 01:35:51,619 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:35:51,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:35:51,620 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-14 01:35:51,621 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:35:51,670 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:35:51,670 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-14 01:35:51,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1316532454] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:35:51,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-14 01:35:51,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [3] total 8 [2025-04-14 01:35:51,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536786514] [2025-04-14 01:35:51,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:35:51,671 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-14 01:35:51,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:35:51,671 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-14 01:35:51,671 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-04-14 01:35:51,671 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 17 [2025-04-14 01:35:51,671 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 31 transitions, 280 flow. Second operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:35:51,671 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:35:51,671 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 17 [2025-04-14 01:35:51,671 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:35:51,747 INFO L116 PetriNetUnfolderBase]: 73/150 cut-off events. [2025-04-14 01:35:51,748 INFO L117 PetriNetUnfolderBase]: For 535/535 co-relation queries the response was YES. [2025-04-14 01:35:51,748 INFO L83 FinitePrefix]: Finished finitePrefix Result has 733 conditions, 150 events. 73/150 cut-off events. For 535/535 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 488 event pairs, 3 based on Foata normal form. 2/152 useless extension candidates. Maximal degree in co-relation 504. Up to 57 conditions per place. [2025-04-14 01:35:51,749 INFO L140 encePairwiseOnDemand]: 12/17 looper letters, 26 selfloop transitions, 4 changer transitions 20/52 dead transitions. [2025-04-14 01:35:51,749 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 52 transitions, 493 flow [2025-04-14 01:35:51,752 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 01:35:51,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-14 01:35:51,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 58 transitions. [2025-04-14 01:35:51,752 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5686274509803921 [2025-04-14 01:35:51,752 INFO L175 Difference]: Start difference. First operand has 41 places, 31 transitions, 280 flow. Second operand 6 states and 58 transitions. [2025-04-14 01:35:51,752 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 52 transitions, 493 flow [2025-04-14 01:35:51,757 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 52 transitions, 453 flow, removed 13 selfloop flow, removed 2 redundant places. [2025-04-14 01:35:51,758 INFO L231 Difference]: Finished difference. Result has 47 places, 26 transitions, 220 flow [2025-04-14 01:35:51,758 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=245, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=220, PETRI_PLACES=47, PETRI_TRANSITIONS=26} [2025-04-14 01:35:51,759 INFO L279 CegarLoopForPetriNet]: 19 programPoint places, 28 predicate places. [2025-04-14 01:35:51,759 INFO L485 AbstractCegarLoop]: Abstraction has has 47 places, 26 transitions, 220 flow [2025-04-14 01:35:51,759 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:35:51,759 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:35:51,759 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:35:51,766 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-04-14 01:35:51,960 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:35:51,960 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 01:35:51,961 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:35:51,961 INFO L85 PathProgramCache]: Analyzing trace with hash -1807269425, now seen corresponding path program 2 times [2025-04-14 01:35:51,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:35:51,961 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503276953] [2025-04-14 01:35:51,961 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:35:51,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:35:51,966 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-04-14 01:35:51,971 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-04-14 01:35:51,971 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:35:51,971 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:35:52,057 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:35:52,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:35:52,058 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503276953] [2025-04-14 01:35:52,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503276953] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:35:52,058 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2136495899] [2025-04-14 01:35:52,058 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:35:52,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:35:52,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:35:52,060 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 01:35:52,063 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-04-14 01:35:52,098 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-04-14 01:35:52,111 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-04-14 01:35:52,112 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:35:52,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:35:52,112 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-14 01:35:52,113 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:35:52,176 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:35:52,177 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-14 01:35:52,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2136495899] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:35:52,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-14 01:35:52,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [4] total 9 [2025-04-14 01:35:52,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837411444] [2025-04-14 01:35:52,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:35:52,177 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-14 01:35:52,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:35:52,178 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-14 01:35:52,178 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2025-04-14 01:35:52,178 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 17 [2025-04-14 01:35:52,179 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 26 transitions, 220 flow. Second operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:35:52,179 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:35:52,179 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 17 [2025-04-14 01:35:52,179 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:35:52,254 INFO L116 PetriNetUnfolderBase]: 53/118 cut-off events. [2025-04-14 01:35:52,254 INFO L117 PetriNetUnfolderBase]: For 539/541 co-relation queries the response was YES. [2025-04-14 01:35:52,255 INFO L83 FinitePrefix]: Finished finitePrefix Result has 577 conditions, 118 events. 53/118 cut-off events. For 539/541 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 339 event pairs, 9 based on Foata normal form. 2/120 useless extension candidates. Maximal degree in co-relation 548. Up to 41 conditions per place. [2025-04-14 01:35:52,258 INFO L140 encePairwiseOnDemand]: 12/17 looper letters, 28 selfloop transitions, 10 changer transitions 6/46 dead transitions. [2025-04-14 01:35:52,258 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 46 transitions, 420 flow [2025-04-14 01:35:52,259 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 01:35:52,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-14 01:35:52,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 57 transitions. [2025-04-14 01:35:52,260 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5588235294117647 [2025-04-14 01:35:52,260 INFO L175 Difference]: Start difference. First operand has 47 places, 26 transitions, 220 flow. Second operand 6 states and 57 transitions. [2025-04-14 01:35:52,260 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 46 transitions, 420 flow [2025-04-14 01:35:52,262 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 46 transitions, 383 flow, removed 10 selfloop flow, removed 6 redundant places. [2025-04-14 01:35:52,263 INFO L231 Difference]: Finished difference. Result has 47 places, 28 transitions, 259 flow [2025-04-14 01:35:52,263 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=195, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=259, PETRI_PLACES=47, PETRI_TRANSITIONS=28} [2025-04-14 01:35:52,263 INFO L279 CegarLoopForPetriNet]: 19 programPoint places, 28 predicate places. [2025-04-14 01:35:52,263 INFO L485 AbstractCegarLoop]: Abstraction has has 47 places, 28 transitions, 259 flow [2025-04-14 01:35:52,264 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:35:52,264 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:35:52,264 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:35:52,271 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-04-14 01:35:52,469 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:35:52,469 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 01:35:52,470 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:35:52,470 INFO L85 PathProgramCache]: Analyzing trace with hash 474087691, now seen corresponding path program 3 times [2025-04-14 01:35:52,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:35:52,470 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494097283] [2025-04-14 01:35:52,470 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 01:35:52,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:35:52,473 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 14 statements into 2 equivalence classes. [2025-04-14 01:35:52,476 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-04-14 01:35:52,476 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-14 01:35:52,476 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:35:52,527 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:35:52,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:35:52,528 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494097283] [2025-04-14 01:35:52,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494097283] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:35:52,528 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1057146456] [2025-04-14 01:35:52,528 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 01:35:52,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:35:52,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:35:52,529 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 01:35:52,530 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-04-14 01:35:52,558 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 14 statements into 2 equivalence classes. [2025-04-14 01:35:52,571 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-04-14 01:35:52,572 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-14 01:35:52,572 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:35:52,572 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-14 01:35:52,573 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:35:52,616 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:35:52,616 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-14 01:35:52,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1057146456] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:35:52,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-14 01:35:52,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [3] total 8 [2025-04-14 01:35:52,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415654664] [2025-04-14 01:35:52,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:35:52,616 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-14 01:35:52,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:35:52,617 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-14 01:35:52,617 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-04-14 01:35:52,617 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 17 [2025-04-14 01:35:52,617 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 28 transitions, 259 flow. Second operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:35:52,617 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:35:52,617 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 17 [2025-04-14 01:35:52,617 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:35:52,673 INFO L116 PetriNetUnfolderBase]: 48/102 cut-off events. [2025-04-14 01:35:52,673 INFO L117 PetriNetUnfolderBase]: For 543/545 co-relation queries the response was YES. [2025-04-14 01:35:52,674 INFO L83 FinitePrefix]: Finished finitePrefix Result has 545 conditions, 102 events. 48/102 cut-off events. For 543/545 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 258 event pairs, 9 based on Foata normal form. 1/103 useless extension candidates. Maximal degree in co-relation 521. Up to 37 conditions per place. [2025-04-14 01:35:52,674 INFO L140 encePairwiseOnDemand]: 12/17 looper letters, 23 selfloop transitions, 7 changer transitions 9/41 dead transitions. [2025-04-14 01:35:52,674 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 41 transitions, 404 flow [2025-04-14 01:35:52,675 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 01:35:52,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-14 01:35:52,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 53 transitions. [2025-04-14 01:35:52,675 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5196078431372549 [2025-04-14 01:35:52,675 INFO L175 Difference]: Start difference. First operand has 47 places, 28 transitions, 259 flow. Second operand 6 states and 53 transitions. [2025-04-14 01:35:52,675 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 41 transitions, 404 flow [2025-04-14 01:35:52,677 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 41 transitions, 393 flow, removed 4 selfloop flow, removed 2 redundant places. [2025-04-14 01:35:52,677 INFO L231 Difference]: Finished difference. Result has 51 places, 25 transitions, 225 flow [2025-04-14 01:35:52,678 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=252, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=225, PETRI_PLACES=51, PETRI_TRANSITIONS=25} [2025-04-14 01:35:52,678 INFO L279 CegarLoopForPetriNet]: 19 programPoint places, 32 predicate places. [2025-04-14 01:35:52,678 INFO L485 AbstractCegarLoop]: Abstraction has has 51 places, 25 transitions, 225 flow [2025-04-14 01:35:52,678 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:35:52,678 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:35:52,678 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:35:52,687 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-04-14 01:35:52,881 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:35:52,881 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 01:35:52,882 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:35:52,882 INFO L85 PathProgramCache]: Analyzing trace with hash -327490845, now seen corresponding path program 4 times [2025-04-14 01:35:52,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:35:52,882 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200442121] [2025-04-14 01:35:52,882 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 01:35:52,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:35:52,885 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 14 statements into 2 equivalence classes. [2025-04-14 01:35:52,887 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-04-14 01:35:52,887 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 01:35:52,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:35:52,924 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:35:52,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:35:52,925 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200442121] [2025-04-14 01:35:52,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200442121] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:35:52,925 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1571815344] [2025-04-14 01:35:52,925 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 01:35:52,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:35:52,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:35:52,927 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 01:35:52,928 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-04-14 01:35:52,950 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 14 statements into 2 equivalence classes. [2025-04-14 01:35:52,959 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-04-14 01:35:52,959 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 01:35:52,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:35:52,960 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-14 01:35:52,961 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:35:53,003 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:35:53,004 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-14 01:35:53,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1571815344] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:35:53,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-14 01:35:53,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [2] total 7 [2025-04-14 01:35:53,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207031488] [2025-04-14 01:35:53,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:35:53,004 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-14 01:35:53,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:35:53,005 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-14 01:35:53,005 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-04-14 01:35:53,005 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 17 [2025-04-14 01:35:53,005 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 25 transitions, 225 flow. Second operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:35:53,005 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:35:53,005 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 17 [2025-04-14 01:35:53,005 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:35:53,048 INFO L116 PetriNetUnfolderBase]: 35/77 cut-off events. [2025-04-14 01:35:53,048 INFO L117 PetriNetUnfolderBase]: For 455/457 co-relation queries the response was YES. [2025-04-14 01:35:53,048 INFO L83 FinitePrefix]: Finished finitePrefix Result has 419 conditions, 77 events. 35/77 cut-off events. For 455/457 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 174 event pairs, 6 based on Foata normal form. 1/78 useless extension candidates. Maximal degree in co-relation 397. Up to 25 conditions per place. [2025-04-14 01:35:53,049 INFO L140 encePairwiseOnDemand]: 12/17 looper letters, 17 selfloop transitions, 2 changer transitions 13/34 dead transitions. [2025-04-14 01:35:53,049 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 34 transitions, 330 flow [2025-04-14 01:35:53,049 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 01:35:53,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-14 01:35:53,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 49 transitions. [2025-04-14 01:35:53,049 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4803921568627451 [2025-04-14 01:35:53,050 INFO L175 Difference]: Start difference. First operand has 51 places, 25 transitions, 225 flow. Second operand 6 states and 49 transitions. [2025-04-14 01:35:53,050 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 34 transitions, 330 flow [2025-04-14 01:35:53,051 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 34 transitions, 300 flow, removed 6 selfloop flow, removed 6 redundant places. [2025-04-14 01:35:53,051 INFO L231 Difference]: Finished difference. Result has 49 places, 17 transitions, 113 flow [2025-04-14 01:35:53,051 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=197, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=113, PETRI_PLACES=49, PETRI_TRANSITIONS=17} [2025-04-14 01:35:53,052 INFO L279 CegarLoopForPetriNet]: 19 programPoint places, 30 predicate places. [2025-04-14 01:35:53,052 INFO L485 AbstractCegarLoop]: Abstraction has has 49 places, 17 transitions, 113 flow [2025-04-14 01:35:53,052 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:35:53,052 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:35:53,052 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:35:53,059 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-04-14 01:35:53,253 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:35:53,253 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 01:35:53,254 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:35:53,254 INFO L85 PathProgramCache]: Analyzing trace with hash 1631843676, now seen corresponding path program 5 times [2025-04-14 01:35:53,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:35:53,254 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734104730] [2025-04-14 01:35:53,254 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 01:35:53,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:35:53,258 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-04-14 01:35:53,260 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-04-14 01:35:53,261 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:35:53,261 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:35:53,300 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:35:53,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:35:53,301 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734104730] [2025-04-14 01:35:53,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1734104730] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:35:53,301 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [835912563] [2025-04-14 01:35:53,301 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 01:35:53,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:35:53,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:35:53,306 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 01:35:53,308 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-04-14 01:35:53,335 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-04-14 01:35:53,343 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-04-14 01:35:53,344 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:35:53,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:35:53,344 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-14 01:35:53,345 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:35:53,395 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:35:53,395 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:35:53,438 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:35:53,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [835912563] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:35:53,438 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:35:53,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-04-14 01:35:53,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936467122] [2025-04-14 01:35:53,438 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:35:53,438 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-14 01:35:53,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:35:53,439 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-14 01:35:53,439 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2025-04-14 01:35:53,439 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 17 [2025-04-14 01:35:53,439 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 17 transitions, 113 flow. Second operand has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:35:53,439 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:35:53,439 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 17 [2025-04-14 01:35:53,439 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:35:53,521 INFO L116 PetriNetUnfolderBase]: 21/53 cut-off events. [2025-04-14 01:35:53,521 INFO L117 PetriNetUnfolderBase]: For 320/320 co-relation queries the response was YES. [2025-04-14 01:35:53,522 INFO L83 FinitePrefix]: Finished finitePrefix Result has 264 conditions, 53 events. 21/53 cut-off events. For 320/320 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 86 event pairs, 0 based on Foata normal form. 5/58 useless extension candidates. Maximal degree in co-relation 244. Up to 19 conditions per place. [2025-04-14 01:35:53,522 INFO L140 encePairwiseOnDemand]: 12/17 looper letters, 20 selfloop transitions, 6 changer transitions 3/31 dead transitions. [2025-04-14 01:35:53,522 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 31 transitions, 227 flow [2025-04-14 01:35:53,522 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-14 01:35:53,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-14 01:35:53,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 63 transitions. [2025-04-14 01:35:53,523 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4632352941176471 [2025-04-14 01:35:53,523 INFO L175 Difference]: Start difference. First operand has 49 places, 17 transitions, 113 flow. Second operand 8 states and 63 transitions. [2025-04-14 01:35:53,523 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 31 transitions, 227 flow [2025-04-14 01:35:53,523 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 31 transitions, 189 flow, removed 11 selfloop flow, removed 10 redundant places. [2025-04-14 01:35:53,524 INFO L231 Difference]: Finished difference. Result has 41 places, 18 transitions, 111 flow [2025-04-14 01:35:53,524 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=87, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=111, PETRI_PLACES=41, PETRI_TRANSITIONS=18} [2025-04-14 01:35:53,524 INFO L279 CegarLoopForPetriNet]: 19 programPoint places, 22 predicate places. [2025-04-14 01:35:53,524 INFO L485 AbstractCegarLoop]: Abstraction has has 41 places, 18 transitions, 111 flow [2025-04-14 01:35:53,525 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:35:53,525 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:35:53,525 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:35:53,530 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-04-14 01:35:53,729 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:35:53,729 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 01:35:53,729 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:35:53,729 INFO L85 PathProgramCache]: Analyzing trace with hash -771899296, now seen corresponding path program 6 times [2025-04-14 01:35:53,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:35:53,729 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506470304] [2025-04-14 01:35:53,729 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-14 01:35:53,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:35:53,733 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 16 statements into 2 equivalence classes. [2025-04-14 01:35:53,736 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-04-14 01:35:53,736 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-14 01:35:53,736 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:35:53,812 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:35:53,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:35:53,813 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506470304] [2025-04-14 01:35:53,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506470304] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:35:53,813 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2067786341] [2025-04-14 01:35:53,813 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-14 01:35:53,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:35:53,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:35:53,815 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 01:35:53,815 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-04-14 01:35:53,844 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 16 statements into 2 equivalence classes. [2025-04-14 01:35:53,854 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-04-14 01:35:53,854 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-14 01:35:53,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:35:53,855 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-14 01:35:53,856 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:35:53,904 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-14 01:35:53,905 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-14 01:35:53,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2067786341] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:35:53,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-14 01:35:53,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 10 [2025-04-14 01:35:53,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108340318] [2025-04-14 01:35:53,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:35:53,905 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-14 01:35:53,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:35:53,906 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-14 01:35:53,906 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2025-04-14 01:35:53,906 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 17 [2025-04-14 01:35:53,906 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 18 transitions, 111 flow. Second operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 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-14 01:35:53,906 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:35:53,906 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 17 [2025-04-14 01:35:53,906 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:35:53,947 INFO L116 PetriNetUnfolderBase]: 19/52 cut-off events. [2025-04-14 01:35:53,947 INFO L117 PetriNetUnfolderBase]: For 146/146 co-relation queries the response was YES. [2025-04-14 01:35:53,948 INFO L83 FinitePrefix]: Finished finitePrefix Result has 241 conditions, 52 events. 19/52 cut-off events. For 146/146 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 80 event pairs, 0 based on Foata normal form. 1/53 useless extension candidates. Maximal degree in co-relation 168. Up to 18 conditions per place. [2025-04-14 01:35:53,948 INFO L140 encePairwiseOnDemand]: 12/17 looper letters, 19 selfloop transitions, 3 changer transitions 4/28 dead transitions. [2025-04-14 01:35:53,948 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 28 transitions, 193 flow [2025-04-14 01:35:53,948 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 01:35:53,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-14 01:35:53,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 49 transitions. [2025-04-14 01:35:53,949 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4803921568627451 [2025-04-14 01:35:53,949 INFO L175 Difference]: Start difference. First operand has 41 places, 18 transitions, 111 flow. Second operand 6 states and 49 transitions. [2025-04-14 01:35:53,949 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 28 transitions, 193 flow [2025-04-14 01:35:53,949 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 28 transitions, 164 flow, removed 8 selfloop flow, removed 7 redundant places. [2025-04-14 01:35:53,950 INFO L231 Difference]: Finished difference. Result has 40 places, 18 transitions, 93 flow [2025-04-14 01:35:53,950 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=93, PETRI_PLACES=40, PETRI_TRANSITIONS=18} [2025-04-14 01:35:53,950 INFO L279 CegarLoopForPetriNet]: 19 programPoint places, 21 predicate places. [2025-04-14 01:35:53,950 INFO L485 AbstractCegarLoop]: Abstraction has has 40 places, 18 transitions, 93 flow [2025-04-14 01:35:53,950 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 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-14 01:35:53,950 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:35:53,950 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:35:53,956 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-04-14 01:35:54,151 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-04-14 01:35:54,151 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 01:35:54,152 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:35:54,152 INFO L85 PathProgramCache]: Analyzing trace with hash -1516563620, now seen corresponding path program 7 times [2025-04-14 01:35:54,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:35:54,152 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516890271] [2025-04-14 01:35:54,152 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-14 01:35:54,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:35:54,162 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-14 01:35:54,165 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-14 01:35:54,166 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:35:54,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:35:54,248 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:35:54,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:35:54,249 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516890271] [2025-04-14 01:35:54,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1516890271] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:35:54,249 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1441201876] [2025-04-14 01:35:54,249 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-14 01:35:54,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:35:54,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:35:54,251 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 01:35:54,253 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-04-14 01:35:54,278 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-14 01:35:54,288 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-14 01:35:54,288 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:35:54,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:35:54,289 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-14 01:35:54,290 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:35:54,340 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-14 01:35:54,341 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-14 01:35:54,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1441201876] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:35:54,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-14 01:35:54,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 11 [2025-04-14 01:35:54,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646980300] [2025-04-14 01:35:54,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:35:54,341 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-14 01:35:54,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:35:54,342 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-14 01:35:54,342 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2025-04-14 01:35:54,342 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 17 [2025-04-14 01:35:54,342 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 18 transitions, 93 flow. Second operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 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-14 01:35:54,342 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:35:54,342 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 17 [2025-04-14 01:35:54,342 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:35:54,378 INFO L116 PetriNetUnfolderBase]: 18/46 cut-off events. [2025-04-14 01:35:54,379 INFO L117 PetriNetUnfolderBase]: For 114/114 co-relation queries the response was YES. [2025-04-14 01:35:54,379 INFO L83 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 46 events. 18/46 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 62 event pairs, 0 based on Foata normal form. 1/47 useless extension candidates. Maximal degree in co-relation 175. Up to 18 conditions per place. [2025-04-14 01:35:54,379 INFO L140 encePairwiseOnDemand]: 12/17 looper letters, 0 selfloop transitions, 0 changer transitions 25/25 dead transitions. [2025-04-14 01:35:54,379 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 25 transitions, 162 flow [2025-04-14 01:35:54,379 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 01:35:54,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-14 01:35:54,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 46 transitions. [2025-04-14 01:35:54,380 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.45098039215686275 [2025-04-14 01:35:54,380 INFO L175 Difference]: Start difference. First operand has 40 places, 18 transitions, 93 flow. Second operand 6 states and 46 transitions. [2025-04-14 01:35:54,380 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 25 transitions, 162 flow [2025-04-14 01:35:54,381 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 25 transitions, 156 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-04-14 01:35:54,381 INFO L231 Difference]: Finished difference. Result has 40 places, 0 transitions, 0 flow [2025-04-14 01:35:54,381 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=0, PETRI_PLACES=40, PETRI_TRANSITIONS=0} [2025-04-14 01:35:54,381 INFO L279 CegarLoopForPetriNet]: 19 programPoint places, 21 predicate places. [2025-04-14 01:35:54,381 INFO L485 AbstractCegarLoop]: Abstraction has has 40 places, 0 transitions, 0 flow [2025-04-14 01:35:54,382 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 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-14 01:35:54,383 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2025-04-14 01:35:54,384 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2025-04-14 01:35:54,384 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2025-04-14 01:35:54,394 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-04-14 01:35:54,588 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:35:54,588 INFO L422 BasicCegarLoop]: Path program histogram: [7, 2, 2, 1] [2025-04-14 01:35:54,591 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-14 01:35:54,591 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-14 01:35:54,595 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.04 01:35:54 BasicIcfg [2025-04-14 01:35:54,595 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-14 01:35:54,595 INFO L158 Benchmark]: Toolchain (without parser) took 5556.35ms. Allocated memory is still 125.8MB. Free memory was 91.3MB in the beginning and 45.3MB in the end (delta: 46.0MB). Peak memory consumption was 48.9MB. Max. memory is 8.0GB. [2025-04-14 01:35:54,596 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 167.8MB. Free memory is still 94.1MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 01:35:54,596 INFO L158 Benchmark]: CACSL2BoogieTranslator took 225.56ms. Allocated memory is still 125.8MB. Free memory was 90.9MB in the beginning and 76.9MB in the end (delta: 14.0MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-14 01:35:54,596 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.28ms. Allocated memory is still 125.8MB. Free memory was 76.9MB in the beginning and 75.2MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 01:35:54,596 INFO L158 Benchmark]: Boogie Preprocessor took 30.53ms. Allocated memory is still 125.8MB. Free memory was 75.2MB in the beginning and 74.1MB in the end (delta: 1.1MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-14 01:35:54,596 INFO L158 Benchmark]: IcfgBuilder took 306.49ms. Allocated memory is still 125.8MB. Free memory was 74.1MB in the beginning and 51.1MB in the end (delta: 23.1MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2025-04-14 01:35:54,596 INFO L158 Benchmark]: TraceAbstraction took 4958.22ms. Allocated memory is still 125.8MB. Free memory was 50.6MB in the beginning and 45.3MB in the end (delta: 5.3MB). Peak memory consumption was 7.0MB. Max. memory is 8.0GB. [2025-04-14 01:35:54,597 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.20ms. Allocated memory is still 167.8MB. Free memory is still 94.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 225.56ms. Allocated memory is still 125.8MB. Free memory was 90.9MB in the beginning and 76.9MB in the end (delta: 14.0MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 26.28ms. Allocated memory is still 125.8MB. Free memory was 76.9MB in the beginning and 75.2MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 30.53ms. Allocated memory is still 125.8MB. Free memory was 75.2MB in the beginning and 74.1MB in the end (delta: 1.1MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * IcfgBuilder took 306.49ms. Allocated memory is still 125.8MB. Free memory was 74.1MB in the beginning and 51.1MB in the end (delta: 23.1MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * TraceAbstraction took 4958.22ms. Allocated memory is still 125.8MB. Free memory was 50.6MB in the beginning and 45.3MB in the end (delta: 5.3MB). Peak memory consumption was 7.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 70]: 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 5 procedures, 24 locations, 27 edges, 3 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 4.9s, OverallIterations: 12, TraceHistogramMax: 2, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 176 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 176 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 25 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 668 IncrementalHoareTripleChecker+Invalid, 693 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 25 mSolverCounterUnsat, 0 mSDtfsCounter, 668 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 209 GetRequests, 127 SyntacticMatches, 3 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=280occurred in iteration=5, InterpolantAutomatonStates: 66, 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.2s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 296 NumberOfCodeBlocks, 296 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 313 ConstructedInterpolants, 0 QuantifiedInterpolants, 1344 SizeOfPredicates, 0 NumberOfNonLiveVariables, 801 ConjunctsInSsa, 56 ConjunctsInUnsatCore, 24 InterpolantComputations, 11 PerfectInterpolantSequences, 31/57 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-04-14 01:35:54,610 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...