/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 ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf --traceabstraction.positions.where.we.compute.the.hoare.annotation All -i ../../../trunk/examples/svcomp/weaver/chl-array-int-trans.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.empire2-owicki-f61efc6-m [2025-03-14 22:04:26,640 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-14 22:04:26,688 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf [2025-03-14 22:04:26,704 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-14 22:04:26,704 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-14 22:04:26,704 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-14 22:04:26,705 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-14 22:04:26,705 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-14 22:04:26,705 INFO L153 SettingsManager]: * Use SBE=true [2025-03-14 22:04:26,705 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-14 22:04:26,705 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-14 22:04:26,705 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-14 22:04:26,705 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-14 22:04:26,705 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-14 22:04:26,705 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-14 22:04:26,705 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-14 22:04:26,705 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-14 22:04:26,705 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-14 22:04:26,706 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-14 22:04:26,706 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-14 22:04:26,706 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-14 22:04:26,706 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-03-14 22:04:26,706 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-14 22:04:26,706 INFO L153 SettingsManager]: * To the following directory=./dump/ [2025-03-14 22:04:26,706 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-14 22:04:26,706 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-14 22:04:26,706 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-14 22:04:26,706 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-14 22:04:26,706 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-14 22:04:26,706 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-14 22:04:26,706 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-14 22:04:26,706 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-14 22:04:26,706 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All [2025-03-14 22:04:26,972 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-14 22:04:26,981 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-14 22:04:26,983 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-14 22:04:26,984 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-14 22:04:26,984 INFO L274 PluginConnector]: CDTParser initialized [2025-03-14 22:04:26,985 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/chl-array-int-trans.wvr.c [2025-03-14 22:04:28,128 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1bdd5f0e1/7a92627a322544569b1fe2863062bdd7/FLAG40980ae5b [2025-03-14 22:04:28,292 INFO L384 CDTParser]: Found 1 translation units. [2025-03-14 22:04:28,293 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-array-int-trans.wvr.c [2025-03-14 22:04:28,298 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1bdd5f0e1/7a92627a322544569b1fe2863062bdd7/FLAG40980ae5b [2025-03-14 22:04:28,692 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1bdd5f0e1/7a92627a322544569b1fe2863062bdd7 [2025-03-14 22:04:28,694 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-14 22:04:28,695 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-03-14 22:04:28,695 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-14 22:04:28,695 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-14 22:04:28,698 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-14 22:04:28,699 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 10:04:28" (1/1) ... [2025-03-14 22:04:28,699 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a510fca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 10:04:28, skipping insertion in model container [2025-03-14 22:04:28,699 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 10:04:28" (1/1) ... [2025-03-14 22:04:28,710 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-14 22:04:28,809 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/chl-array-int-trans.wvr.c[2767,2780] [2025-03-14 22:04:28,816 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 22:04:28,822 INFO L200 MainTranslator]: Completed pre-run [2025-03-14 22:04:28,837 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/chl-array-int-trans.wvr.c[2767,2780] [2025-03-14 22:04:28,839 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 22:04:28,848 INFO L204 MainTranslator]: Completed translation [2025-03-14 22:04:28,849 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 10:04:28 WrapperNode [2025-03-14 22:04:28,849 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-14 22:04:28,850 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-14 22:04:28,850 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-14 22:04:28,850 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-14 22:04:28,854 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 10:04:28" (1/1) ... [2025-03-14 22:04:28,860 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 10:04:28" (1/1) ... [2025-03-14 22:04:28,886 INFO L138 Inliner]: procedures = 25, calls = 34, calls flagged for inlining = 13, calls inlined = 21, statements flattened = 252 [2025-03-14 22:04:28,886 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-14 22:04:28,887 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-14 22:04:28,887 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-14 22:04:28,887 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-14 22:04:28,892 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 10:04:28" (1/1) ... [2025-03-14 22:04:28,893 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 10:04:28" (1/1) ... [2025-03-14 22:04:28,898 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 10:04:28" (1/1) ... [2025-03-14 22:04:28,900 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 10:04:28" (1/1) ... [2025-03-14 22:04:28,912 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 10:04:28" (1/1) ... [2025-03-14 22:04:28,913 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 10:04:28" (1/1) ... [2025-03-14 22:04:28,920 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 10:04:28" (1/1) ... [2025-03-14 22:04:28,921 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 10:04:28" (1/1) ... [2025-03-14 22:04:28,926 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 10:04:28" (1/1) ... [2025-03-14 22:04:28,928 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-14 22:04:28,929 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-03-14 22:04:28,929 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-03-14 22:04:28,929 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-03-14 22:04:28,929 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 10:04:28" (1/1) ... [2025-03-14 22:04:28,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-14 22:04:28,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 22:04:28,959 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2025-03-14 22:04:28,962 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2025-03-14 22:04:28,982 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-14 22:04:28,982 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-14 22:04:28,982 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-14 22:04:28,982 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-14 22:04:28,982 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-14 22:04:28,982 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-14 22:04:28,982 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-14 22:04:28,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-14 22:04:28,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-14 22:04:28,982 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-14 22:04:28,982 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-14 22:04:28,982 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-14 22:04:28,982 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-14 22:04:28,983 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-14 22:04:29,079 INFO L234 CfgBuilder]: Building ICFG [2025-03-14 22:04:29,080 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-14 22:04:29,379 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-14 22:04:29,379 INFO L283 CfgBuilder]: Performing block encoding [2025-03-14 22:04:29,388 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-14 22:04:29,389 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-14 22:04:29,389 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.03 10:04:29 BoogieIcfgContainer [2025-03-14 22:04:29,389 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-03-14 22:04:29,391 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-14 22:04:29,391 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-14 22:04:29,394 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-14 22:04:29,394 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.03 10:04:28" (1/3) ... [2025-03-14 22:04:29,395 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d949145 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 10:04:29, skipping insertion in model container [2025-03-14 22:04:29,395 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 10:04:28" (2/3) ... [2025-03-14 22:04:29,395 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d949145 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 10:04:29, skipping insertion in model container [2025-03-14 22:04:29,395 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.03 10:04:29" (3/3) ... [2025-03-14 22:04:29,396 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-array-int-trans.wvr.c [2025-03-14 22:04:29,406 INFO L303 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-14 22:04:29,407 INFO L169 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-array-int-trans.wvr.c that has 4 procedures, 319 locations, 1 initial locations, 6 loop locations, and 1 error locations. [2025-03-14 22:04:29,407 INFO L581 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-14 22:04:29,496 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-14 22:04:29,534 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-14 22:04:29,545 INFO L333 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=All, 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;@4566273f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-14 22:04:29,545 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-03-14 22:04:29,638 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-14 22:04:29,638 INFO L124 PetriNetUnfolderBase]: 20/322 cut-off events. [2025-03-14 22:04:29,640 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-14 22:04:29,640 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:04:29,641 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 22:04:29,642 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 22:04:29,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:04:29,647 INFO L85 PathProgramCache]: Analyzing trace with hash 1697878174, now seen corresponding path program 1 times [2025-03-14 22:04:29,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:04:29,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885586489] [2025-03-14 22:04:29,654 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 22:04:29,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:04:29,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 22:04:30,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 22:04:30,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:04:30,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885586489] [2025-03-14 22:04:30,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885586489] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 22:04:30,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 22:04:30,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-14 22:04:30,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788907705] [2025-03-14 22:04:30,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 22:04:30,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-14 22:04:30,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:04:30,674 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-14 22:04:30,675 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2025-03-14 22:04:30,685 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 217 out of 340 [2025-03-14 22:04:30,693 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 328 places, 340 transitions, 701 flow. Second operand has 14 states, 14 states have (on average 223.14285714285714) internal successors, (3124), 14 states have internal predecessors, (3124), 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-03-14 22:04:30,693 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:04:30,694 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 217 of 340 [2025-03-14 22:04:30,696 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:04:32,062 INFO L124 PetriNetUnfolderBase]: 535/4765 cut-off events. [2025-03-14 22:04:32,062 INFO L125 PetriNetUnfolderBase]: For 231/231 co-relation queries the response was YES. [2025-03-14 22:04:32,090 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5737 conditions, 4765 events. 535/4765 cut-off events. For 231/231 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 47381 event pairs, 282 based on Foata normal form. 225/4483 useless extension candidates. Maximal degree in co-relation 2433. Up to 267 conditions per place. [2025-03-14 22:04:32,104 INFO L140 encePairwiseOnDemand]: 295/340 looper letters, 175 selfloop transitions, 23 changer transitions 19/427 dead transitions. [2025-03-14 22:04:32,104 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 346 places, 427 transitions, 1345 flow [2025-03-14 22:04:32,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-03-14 22:04:32,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2025-03-14 22:04:32,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 6112 transitions. [2025-03-14 22:04:32,134 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6657952069716776 [2025-03-14 22:04:32,136 INFO L298 CegarLoopForPetriNet]: 328 programPoint places, 18 predicate places. [2025-03-14 22:04:32,137 INFO L471 AbstractCegarLoop]: Abstraction has has 346 places, 427 transitions, 1345 flow [2025-03-14 22:04:32,138 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 223.14285714285714) internal successors, (3124), 14 states have internal predecessors, (3124), 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-03-14 22:04:32,138 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:04:32,138 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 22:04:32,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-14 22:04:32,141 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 22:04:32,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:04:32,142 INFO L85 PathProgramCache]: Analyzing trace with hash -118424460, now seen corresponding path program 1 times [2025-03-14 22:04:32,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:04:32,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989444573] [2025-03-14 22:04:32,142 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 22:04:32,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:04:32,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 22:04:32,642 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 22:04:32,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:04:32,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989444573] [2025-03-14 22:04:32,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989444573] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 22:04:32,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1028860820] [2025-03-14 22:04:32,642 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 22:04:32,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 22:04:32,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 22:04:32,646 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-03-14 22:04:32,647 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-03-14 22:04:32,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 22:04:32,754 INFO L256 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-14 22:04:32,759 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 22:04:33,254 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 22:04:33,254 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 22:04:33,662 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 22:04:33,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1028860820] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-14 22:04:33,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-14 22:04:33,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [15, 14] total 32 [2025-03-14 22:04:33,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906810002] [2025-03-14 22:04:33,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 22:04:33,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-14 22:04:33,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:04:33,666 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-14 22:04:33,667 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=870, Unknown=0, NotChecked=0, Total=992 [2025-03-14 22:04:33,670 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 213 out of 340 [2025-03-14 22:04:33,673 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 346 places, 427 transitions, 1345 flow. Second operand has 14 states, 14 states have (on average 219.64285714285714) internal successors, (3075), 14 states have internal predecessors, (3075), 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-03-14 22:04:33,673 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:04:33,673 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 213 of 340 [2025-03-14 22:04:33,673 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:04:35,250 INFO L124 PetriNetUnfolderBase]: 1183/8358 cut-off events. [2025-03-14 22:04:35,250 INFO L125 PetriNetUnfolderBase]: For 1034/1208 co-relation queries the response was YES. [2025-03-14 22:04:35,283 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11943 conditions, 8358 events. 1183/8358 cut-off events. For 1034/1208 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 90538 event pairs, 332 based on Foata normal form. 0/7361 useless extension candidates. Maximal degree in co-relation 4333. Up to 822 conditions per place. [2025-03-14 22:04:35,307 INFO L140 encePairwiseOnDemand]: 300/340 looper letters, 258 selfloop transitions, 40 changer transitions 28/533 dead transitions. [2025-03-14 22:04:35,307 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 369 places, 533 transitions, 2449 flow [2025-03-14 22:04:35,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-14 22:04:35,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2025-03-14 22:04:35,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 5398 transitions. [2025-03-14 22:04:35,329 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6615196078431372 [2025-03-14 22:04:35,330 INFO L298 CegarLoopForPetriNet]: 328 programPoint places, 41 predicate places. [2025-03-14 22:04:35,330 INFO L471 AbstractCegarLoop]: Abstraction has has 369 places, 533 transitions, 2449 flow [2025-03-14 22:04:35,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 219.64285714285714) internal successors, (3075), 14 states have internal predecessors, (3075), 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-03-14 22:04:35,331 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:04:35,331 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 22:04:35,339 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-14 22:04:35,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 22:04:35,536 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 22:04:35,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:04:35,537 INFO L85 PathProgramCache]: Analyzing trace with hash 944790878, now seen corresponding path program 2 times [2025-03-14 22:04:35,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:04:35,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330047768] [2025-03-14 22:04:35,538 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 22:04:35,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:04:35,574 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-14 22:04:35,575 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 22:04:35,737 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 22:04:35,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:04:35,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330047768] [2025-03-14 22:04:35,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330047768] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 22:04:35,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 22:04:35,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-14 22:04:35,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736849921] [2025-03-14 22:04:35,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 22:04:35,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-14 22:04:35,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:04:35,739 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-14 22:04:35,739 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-14 22:04:35,740 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 247 out of 340 [2025-03-14 22:04:35,743 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 369 places, 533 transitions, 2449 flow. Second operand has 7 states, 7 states have (on average 256.42857142857144) internal successors, (1795), 7 states have internal predecessors, (1795), 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-03-14 22:04:35,743 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:04:35,743 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 247 of 340 [2025-03-14 22:04:35,743 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:04:37,394 INFO L124 PetriNetUnfolderBase]: 1950/14044 cut-off events. [2025-03-14 22:04:37,395 INFO L125 PetriNetUnfolderBase]: For 2775/7985 co-relation queries the response was YES. [2025-03-14 22:04:37,456 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22818 conditions, 14044 events. 1950/14044 cut-off events. For 2775/7985 co-relation queries the response was YES. Maximal size of possible extension queue 326. Compared 173313 event pairs, 117 based on Foata normal form. 16/12270 useless extension candidates. Maximal degree in co-relation 8154. Up to 1495 conditions per place. [2025-03-14 22:04:37,493 INFO L140 encePairwiseOnDemand]: 324/340 looper letters, 365 selfloop transitions, 36 changer transitions 67/757 dead transitions. [2025-03-14 22:04:37,494 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 378 places, 757 transitions, 4825 flow [2025-03-14 22:04:37,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-14 22:04:37,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-14 22:04:37,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 2606 transitions. [2025-03-14 22:04:37,498 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7664705882352941 [2025-03-14 22:04:37,499 INFO L298 CegarLoopForPetriNet]: 328 programPoint places, 50 predicate places. [2025-03-14 22:04:37,499 INFO L471 AbstractCegarLoop]: Abstraction has has 378 places, 757 transitions, 4825 flow [2025-03-14 22:04:37,500 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 256.42857142857144) internal successors, (1795), 7 states have internal predecessors, (1795), 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-03-14 22:04:37,500 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:04:37,500 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 22:04:37,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-14 22:04:37,501 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 22:04:37,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:04:37,501 INFO L85 PathProgramCache]: Analyzing trace with hash -1339339654, now seen corresponding path program 3 times [2025-03-14 22:04:37,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:04:37,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778960460] [2025-03-14 22:04:37,502 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-14 22:04:37,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:04:37,530 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-14 22:04:37,530 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 22:04:37,804 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 22:04:37,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:04:37,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778960460] [2025-03-14 22:04:37,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778960460] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 22:04:37,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 22:04:37,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-14 22:04:37,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658473250] [2025-03-14 22:04:37,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 22:04:37,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-14 22:04:37,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:04:37,805 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-14 22:04:37,806 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2025-03-14 22:04:37,807 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 213 out of 340 [2025-03-14 22:04:37,811 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 378 places, 757 transitions, 4825 flow. Second operand has 15 states, 15 states have (on average 219.2) internal successors, (3288), 15 states have internal predecessors, (3288), 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-03-14 22:04:37,811 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:04:37,811 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 213 of 340 [2025-03-14 22:04:37,811 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:04:41,712 INFO L124 PetriNetUnfolderBase]: 4433/30701 cut-off events. [2025-03-14 22:04:41,713 INFO L125 PetriNetUnfolderBase]: For 11582/30038 co-relation queries the response was YES. [2025-03-14 22:04:41,892 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56377 conditions, 30701 events. 4433/30701 cut-off events. For 11582/30038 co-relation queries the response was YES. Maximal size of possible extension queue 714. Compared 444220 event pairs, 470 based on Foata normal form. 62/26739 useless extension candidates. Maximal degree in co-relation 8675. Up to 3508 conditions per place. [2025-03-14 22:04:41,983 INFO L140 encePairwiseOnDemand]: 308/340 looper letters, 863 selfloop transitions, 89 changer transitions 166/1336 dead transitions. [2025-03-14 22:04:41,983 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 404 places, 1336 transitions, 11954 flow [2025-03-14 22:04:41,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-03-14 22:04:41,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2025-03-14 22:04:41,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 5932 transitions. [2025-03-14 22:04:41,991 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6461873638344227 [2025-03-14 22:04:41,992 INFO L298 CegarLoopForPetriNet]: 328 programPoint places, 76 predicate places. [2025-03-14 22:04:41,992 INFO L471 AbstractCegarLoop]: Abstraction has has 404 places, 1336 transitions, 11954 flow [2025-03-14 22:04:41,993 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 219.2) internal successors, (3288), 15 states have internal predecessors, (3288), 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-03-14 22:04:41,993 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:04:41,993 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 22:04:41,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-14 22:04:41,994 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 22:04:41,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:04:41,994 INFO L85 PathProgramCache]: Analyzing trace with hash 1304683554, now seen corresponding path program 4 times [2025-03-14 22:04:41,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:04:41,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441090197] [2025-03-14 22:04:41,994 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-14 22:04:41,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:04:42,015 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2025-03-14 22:04:42,015 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 22:04:42,454 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 22:04:42,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:04:42,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441090197] [2025-03-14 22:04:42,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441090197] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 22:04:42,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [272524826] [2025-03-14 22:04:42,455 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-14 22:04:42,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 22:04:42,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 22:04:42,461 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-03-14 22:04:42,465 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-03-14 22:04:42,579 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2025-03-14 22:04:42,580 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 22:04:42,581 INFO L256 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-14 22:04:42,588 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 22:04:43,070 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 22:04:43,070 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 22:04:43,446 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 22:04:43,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [272524826] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-14 22:04:43,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-14 22:04:43,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [16, 14] total 35 [2025-03-14 22:04:43,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031288833] [2025-03-14 22:04:43,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 22:04:43,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-14 22:04:43,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:04:43,447 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-14 22:04:43,448 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=1021, Unknown=0, NotChecked=0, Total=1190 [2025-03-14 22:04:43,450 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 213 out of 340 [2025-03-14 22:04:43,452 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 404 places, 1336 transitions, 11954 flow. Second operand has 14 states, 14 states have (on average 219.64285714285714) internal successors, (3075), 14 states have internal predecessors, (3075), 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-03-14 22:04:43,452 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:04:43,452 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 213 of 340 [2025-03-14 22:04:43,452 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:04:47,652 INFO L124 PetriNetUnfolderBase]: 4390/30852 cut-off events. [2025-03-14 22:04:47,652 INFO L125 PetriNetUnfolderBase]: For 17507/51701 co-relation queries the response was YES. [2025-03-14 22:04:47,909 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62690 conditions, 30852 events. 4390/30852 cut-off events. For 17507/51701 co-relation queries the response was YES. Maximal size of possible extension queue 706. Compared 445668 event pairs, 297 based on Foata normal form. 102/26978 useless extension candidates. Maximal degree in co-relation 9534. Up to 3496 conditions per place. [2025-03-14 22:04:48,154 INFO L140 encePairwiseOnDemand]: 300/340 looper letters, 849 selfloop transitions, 71 changer transitions 179/1324 dead transitions. [2025-03-14 22:04:48,154 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 428 places, 1324 transitions, 14032 flow [2025-03-14 22:04:48,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-14 22:04:48,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2025-03-14 22:04:48,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 5612 transitions. [2025-03-14 22:04:48,162 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.660235294117647 [2025-03-14 22:04:48,164 INFO L298 CegarLoopForPetriNet]: 328 programPoint places, 100 predicate places. [2025-03-14 22:04:48,164 INFO L471 AbstractCegarLoop]: Abstraction has has 428 places, 1324 transitions, 14032 flow [2025-03-14 22:04:48,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 219.64285714285714) internal successors, (3075), 14 states have internal predecessors, (3075), 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-03-14 22:04:48,165 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:04:48,165 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 22:04:48,172 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-14 22:04:48,370 WARN L453 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-03-14 22:04:48,370 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 22:04:48,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:04:48,371 INFO L85 PathProgramCache]: Analyzing trace with hash -803743403, now seen corresponding path program 1 times [2025-03-14 22:04:48,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:04:48,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521784874] [2025-03-14 22:04:48,371 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 22:04:48,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:04:48,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 22:04:48,568 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 22:04:48,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:04:48,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521784874] [2025-03-14 22:04:48,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521784874] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 22:04:48,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [567230236] [2025-03-14 22:04:48,569 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 22:04:48,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 22:04:48,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 22:04:48,571 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-03-14 22:04:48,572 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-03-14 22:04:48,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 22:04:48,661 INFO L256 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-14 22:04:48,664 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 22:04:48,901 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 22:04:48,901 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 22:04:49,233 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 22:04:49,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [567230236] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-14 22:04:49,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-14 22:04:49,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [13, 11] total 23 [2025-03-14 22:04:49,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509401067] [2025-03-14 22:04:49,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 22:04:49,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-14 22:04:49,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:04:49,234 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-14 22:04:49,234 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=383, Unknown=0, NotChecked=0, Total=506 [2025-03-14 22:04:49,236 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 255 out of 340 [2025-03-14 22:04:49,238 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 428 places, 1324 transitions, 14032 flow. Second operand has 11 states, 11 states have (on average 260.27272727272725) internal successors, (2863), 11 states have internal predecessors, (2863), 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-03-14 22:04:49,238 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:04:49,238 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 255 of 340 [2025-03-14 22:04:49,238 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:04:57,052 INFO L124 PetriNetUnfolderBase]: 9396/56537 cut-off events. [2025-03-14 22:04:57,053 INFO L125 PetriNetUnfolderBase]: For 51541/114160 co-relation queries the response was YES. [2025-03-14 22:04:57,427 INFO L83 FinitePrefix]: Finished finitePrefix Result has 123216 conditions, 56537 events. 9396/56537 cut-off events. For 51541/114160 co-relation queries the response was YES. Maximal size of possible extension queue 1292. Compared 876011 event pairs, 1669 based on Foata normal form. 31/49304 useless extension candidates. Maximal degree in co-relation 21543. Up to 6167 conditions per place. [2025-03-14 22:04:57,608 INFO L140 encePairwiseOnDemand]: 318/340 looper letters, 843 selfloop transitions, 71 changer transitions 184/1572 dead transitions. [2025-03-14 22:04:57,608 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 443 places, 1572 transitions, 18923 flow [2025-03-14 22:04:57,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-14 22:04:57,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-03-14 22:04:57,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 4285 transitions. [2025-03-14 22:04:57,610 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7876838235294118 [2025-03-14 22:04:57,611 INFO L298 CegarLoopForPetriNet]: 328 programPoint places, 115 predicate places. [2025-03-14 22:04:57,611 INFO L471 AbstractCegarLoop]: Abstraction has has 443 places, 1572 transitions, 18923 flow [2025-03-14 22:04:57,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 260.27272727272725) internal successors, (2863), 11 states have internal predecessors, (2863), 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-03-14 22:04:57,612 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:04:57,612 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 22:04:57,618 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-14 22:04:57,812 WARN L453 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-03-14 22:04:57,812 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 22:04:57,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:04:57,813 INFO L85 PathProgramCache]: Analyzing trace with hash 1624012565, now seen corresponding path program 1 times [2025-03-14 22:04:57,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:04:57,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290991064] [2025-03-14 22:04:57,813 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 22:04:57,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:04:57,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 22:04:58,074 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 22:04:58,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:04:58,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290991064] [2025-03-14 22:04:58,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [290991064] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 22:04:58,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [165284359] [2025-03-14 22:04:58,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 22:04:58,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 22:04:58,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 22:04:58,078 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-03-14 22:04:58,079 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-03-14 22:04:58,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 22:04:58,161 INFO L256 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-14 22:04:58,163 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 22:04:58,537 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 22:04:58,537 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 22:04:58,889 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 22:04:58,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [165284359] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 22:04:58,889 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 22:04:58,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 35 [2025-03-14 22:04:58,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155549388] [2025-03-14 22:04:58,890 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 22:04:58,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-03-14 22:04:58,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:04:58,891 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-03-14 22:04:58,891 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=1063, Unknown=0, NotChecked=0, Total=1190 [2025-03-14 22:04:58,893 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 208 out of 340 [2025-03-14 22:04:58,897 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 443 places, 1572 transitions, 18923 flow. Second operand has 35 states, 35 states have (on average 215.54285714285714) internal successors, (7544), 35 states have internal predecessors, (7544), 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-03-14 22:04:58,897 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:04:58,897 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 208 of 340 [2025-03-14 22:04:58,897 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:05:17,993 INFO L124 PetriNetUnfolderBase]: 18652/111716 cut-off events. [2025-03-14 22:05:17,993 INFO L125 PetriNetUnfolderBase]: For 145772/397502 co-relation queries the response was YES. [2025-03-14 22:05:19,078 INFO L83 FinitePrefix]: Finished finitePrefix Result has 267802 conditions, 111716 events. 18652/111716 cut-off events. For 145772/397502 co-relation queries the response was YES. Maximal size of possible extension queue 2515. Compared 1913414 event pairs, 3134 based on Foata normal form. 438/97862 useless extension candidates. Maximal degree in co-relation 23803. Up to 12321 conditions per place. [2025-03-14 22:05:19,717 INFO L140 encePairwiseOnDemand]: 290/340 looper letters, 2186 selfloop transitions, 279 changer transitions 457/3137 dead transitions. [2025-03-14 22:05:19,718 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 578 places, 3137 transitions, 45666 flow [2025-03-14 22:05:19,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 136 states. [2025-03-14 22:05:19,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2025-03-14 22:05:19,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 29008 transitions. [2025-03-14 22:05:19,740 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6273356401384083 [2025-03-14 22:05:19,741 INFO L298 CegarLoopForPetriNet]: 328 programPoint places, 250 predicate places. [2025-03-14 22:05:19,741 INFO L471 AbstractCegarLoop]: Abstraction has has 578 places, 3137 transitions, 45666 flow [2025-03-14 22:05:19,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 215.54285714285714) internal successors, (7544), 35 states have internal predecessors, (7544), 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-03-14 22:05:19,743 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:05:19,743 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 22:05:19,749 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-14 22:05:19,943 WARN L453 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-03-14 22:05:19,944 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 22:05:19,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:05:19,945 INFO L85 PathProgramCache]: Analyzing trace with hash 918281626, now seen corresponding path program 1 times [2025-03-14 22:05:19,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:05:19,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437381926] [2025-03-14 22:05:19,945 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 22:05:19,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:05:19,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 22:05:20,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 22:05:20,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:05:20,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437381926] [2025-03-14 22:05:20,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437381926] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 22:05:20,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 22:05:20,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-14 22:05:20,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465055076] [2025-03-14 22:05:20,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 22:05:20,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-14 22:05:20,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:05:20,086 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-14 22:05:20,086 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-14 22:05:20,087 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 260 out of 340 [2025-03-14 22:05:20,090 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 578 places, 3137 transitions, 45666 flow. Second operand has 7 states, 7 states have (on average 267.14285714285717) internal successors, (1870), 7 states have internal predecessors, (1870), 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-03-14 22:05:20,090 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:05:20,090 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 260 of 340 [2025-03-14 22:05:20,090 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:05:34,943 INFO L124 PetriNetUnfolderBase]: 14660/87481 cut-off events. [2025-03-14 22:05:34,943 INFO L125 PetriNetUnfolderBase]: For 139104/318220 co-relation queries the response was YES. [2025-03-14 22:05:35,821 INFO L83 FinitePrefix]: Finished finitePrefix Result has 228439 conditions, 87481 events. 14660/87481 cut-off events. For 139104/318220 co-relation queries the response was YES. Maximal size of possible extension queue 1997. Compared 1444120 event pairs, 2213 based on Foata normal form. 181/76411 useless extension candidates. Maximal degree in co-relation 27739. Up to 12322 conditions per place. [2025-03-14 22:05:36,201 INFO L140 encePairwiseOnDemand]: 328/340 looper letters, 1089 selfloop transitions, 10 changer transitions 824/2890 dead transitions. [2025-03-14 22:05:36,201 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 582 places, 2890 transitions, 44848 flow [2025-03-14 22:05:36,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-14 22:05:36,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-14 22:05:36,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 2722 transitions. [2025-03-14 22:05:36,204 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8005882352941176 [2025-03-14 22:05:36,204 INFO L298 CegarLoopForPetriNet]: 328 programPoint places, 254 predicate places. [2025-03-14 22:05:36,204 INFO L471 AbstractCegarLoop]: Abstraction has has 582 places, 2890 transitions, 44848 flow [2025-03-14 22:05:36,205 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 267.14285714285717) internal successors, (1870), 7 states have internal predecessors, (1870), 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-03-14 22:05:36,205 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:05:36,205 INFO L221 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 22:05:36,205 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-14 22:05:36,206 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 22:05:36,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:05:36,206 INFO L85 PathProgramCache]: Analyzing trace with hash -1974614563, now seen corresponding path program 1 times [2025-03-14 22:05:36,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:05:36,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503211137] [2025-03-14 22:05:36,206 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 22:05:36,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:05:36,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 22:05:36,446 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 22:05:36,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:05:36,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503211137] [2025-03-14 22:05:36,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503211137] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 22:05:36,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [832843213] [2025-03-14 22:05:36,447 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 22:05:36,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 22:05:36,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 22:05:36,449 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-03-14 22:05:36,450 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-03-14 22:05:36,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 22:05:36,532 INFO L256 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-14 22:05:36,534 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 22:05:36,772 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 22:05:36,773 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 22:05:37,146 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 22:05:37,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [832843213] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-14 22:05:37,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-14 22:05:37,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [14, 13] total 30 [2025-03-14 22:05:37,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582644681] [2025-03-14 22:05:37,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 22:05:37,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-14 22:05:37,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:05:37,148 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-14 22:05:37,148 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=675, Unknown=0, NotChecked=0, Total=870 [2025-03-14 22:05:37,149 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 252 out of 340 [2025-03-14 22:05:37,150 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 582 places, 2890 transitions, 44848 flow. Second operand has 13 states, 13 states have (on average 257.46153846153845) internal successors, (3347), 13 states have internal predecessors, (3347), 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-03-14 22:05:37,150 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:05:37,150 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 252 of 340 [2025-03-14 22:05:37,150 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:06:05,781 INFO L124 PetriNetUnfolderBase]: 30130/151599 cut-off events. [2025-03-14 22:06:05,782 INFO L125 PetriNetUnfolderBase]: For 463385/714379 co-relation queries the response was YES. [2025-03-14 22:06:07,185 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445205 conditions, 151599 events. 30130/151599 cut-off events. For 463385/714379 co-relation queries the response was YES. Maximal size of possible extension queue 3384. Compared 2625670 event pairs, 5668 based on Foata normal form. 427/132129 useless extension candidates. Maximal degree in co-relation 50130. Up to 24084 conditions per place. [2025-03-14 22:06:07,862 INFO L140 encePairwiseOnDemand]: 315/340 looper letters, 1999 selfloop transitions, 189 changer transitions 954/3777 dead transitions. [2025-03-14 22:06:07,863 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 600 places, 3777 transitions, 66072 flow [2025-03-14 22:06:07,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-14 22:06:07,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-03-14 22:06:07,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 4983 transitions. [2025-03-14 22:06:07,865 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7713622291021672 [2025-03-14 22:06:07,866 INFO L298 CegarLoopForPetriNet]: 328 programPoint places, 272 predicate places. [2025-03-14 22:06:07,866 INFO L471 AbstractCegarLoop]: Abstraction has has 600 places, 3777 transitions, 66072 flow [2025-03-14 22:06:07,867 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 257.46153846153845) internal successors, (3347), 13 states have internal predecessors, (3347), 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-03-14 22:06:07,867 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:06:07,867 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 22:06:07,872 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-14 22:06:08,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 22:06:08,071 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 22:06:08,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:06:08,072 INFO L85 PathProgramCache]: Analyzing trace with hash -403990994, now seen corresponding path program 1 times [2025-03-14 22:06:08,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:06:08,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248606788] [2025-03-14 22:06:08,072 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 22:06:08,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:06:08,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 22:06:08,175 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 22:06:08,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:06:08,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248606788] [2025-03-14 22:06:08,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248606788] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 22:06:08,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 22:06:08,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-14 22:06:08,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313436924] [2025-03-14 22:06:08,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 22:06:08,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-14 22:06:08,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:06:08,177 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-14 22:06:08,177 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-14 22:06:08,177 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 260 out of 340 [2025-03-14 22:06:08,178 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 600 places, 3777 transitions, 66072 flow. Second operand has 7 states, 7 states have (on average 267.7142857142857) internal successors, (1874), 7 states have internal predecessors, (1874), 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-03-14 22:06:08,178 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:06:08,178 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 260 of 340 [2025-03-14 22:06:08,178 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:06:27,961 INFO L124 PetriNetUnfolderBase]: 18560/91014 cut-off events. [2025-03-14 22:06:27,961 INFO L125 PetriNetUnfolderBase]: For 350138/495260 co-relation queries the response was YES. [2025-03-14 22:06:28,680 INFO L83 FinitePrefix]: Finished finitePrefix Result has 305166 conditions, 91014 events. 18560/91014 cut-off events. For 350138/495260 co-relation queries the response was YES. Maximal size of possible extension queue 1966. Compared 1448529 event pairs, 3374 based on Foata normal form. 318/79707 useless extension candidates. Maximal degree in co-relation 45958. Up to 15983 conditions per place. [2025-03-14 22:06:28,989 INFO L140 encePairwiseOnDemand]: 328/340 looper letters, 826 selfloop transitions, 28 changer transitions 1649/3087 dead transitions. [2025-03-14 22:06:28,989 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 603 places, 3087 transitions, 57416 flow [2025-03-14 22:06:28,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-14 22:06:28,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-14 22:06:28,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 2692 transitions. [2025-03-14 22:06:28,991 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7917647058823529 [2025-03-14 22:06:28,991 INFO L298 CegarLoopForPetriNet]: 328 programPoint places, 275 predicate places. [2025-03-14 22:06:28,992 INFO L471 AbstractCegarLoop]: Abstraction has has 603 places, 3087 transitions, 57416 flow [2025-03-14 22:06:28,992 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 267.7142857142857) internal successors, (1874), 7 states have internal predecessors, (1874), 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-03-14 22:06:28,992 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:06:28,992 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 22:06:28,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-14 22:06:28,992 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 22:06:28,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:06:28,993 INFO L85 PathProgramCache]: Analyzing trace with hash -1308104350, now seen corresponding path program 1 times [2025-03-14 22:06:28,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:06:28,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464738485] [2025-03-14 22:06:28,993 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 22:06:28,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:06:29,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 22:06:29,090 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-14 22:06:29,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:06:29,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464738485] [2025-03-14 22:06:29,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464738485] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 22:06:29,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 22:06:29,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-14 22:06:29,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381536709] [2025-03-14 22:06:29,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 22:06:29,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-14 22:06:29,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:06:29,092 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-14 22:06:29,092 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-14 22:06:29,092 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 260 out of 340 [2025-03-14 22:06:29,095 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 603 places, 3087 transitions, 57416 flow. Second operand has 7 states, 7 states have (on average 268.2857142857143) internal successors, (1878), 7 states have internal predecessors, (1878), 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-03-14 22:06:29,096 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:06:29,096 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 260 of 340 [2025-03-14 22:06:29,096 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:06:49,433 INFO L124 PetriNetUnfolderBase]: 22572/100491 cut-off events. [2025-03-14 22:06:49,434 INFO L125 PetriNetUnfolderBase]: For 682269/773794 co-relation queries the response was YES. [2025-03-14 22:06:50,151 INFO L83 FinitePrefix]: Finished finitePrefix Result has 382720 conditions, 100491 events. 22572/100491 cut-off events. For 682269/773794 co-relation queries the response was YES. Maximal size of possible extension queue 2196. Compared 1589948 event pairs, 5967 based on Foata normal form. 940/89374 useless extension candidates. Maximal degree in co-relation 75836. Up to 19741 conditions per place. [2025-03-14 22:06:50,504 INFO L140 encePairwiseOnDemand]: 328/340 looper letters, 749 selfloop transitions, 24 changer transitions 1542/2889 dead transitions. [2025-03-14 22:06:50,504 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 612 places, 2889 transitions, 57752 flow [2025-03-14 22:06:50,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-14 22:06:50,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-14 22:06:50,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 2707 transitions. [2025-03-14 22:06:50,506 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7961764705882353 [2025-03-14 22:06:50,506 INFO L298 CegarLoopForPetriNet]: 328 programPoint places, 284 predicate places. [2025-03-14 22:06:50,506 INFO L471 AbstractCegarLoop]: Abstraction has has 612 places, 2889 transitions, 57752 flow [2025-03-14 22:06:50,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 268.2857142857143) internal successors, (1878), 7 states have internal predecessors, (1878), 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-03-14 22:06:50,507 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:06:50,507 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 22:06:50,507 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-14 22:06:50,507 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 22:06:50,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:06:50,511 INFO L85 PathProgramCache]: Analyzing trace with hash -461519326, now seen corresponding path program 1 times [2025-03-14 22:06:50,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:06:50,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414069020] [2025-03-14 22:06:50,511 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 22:06:50,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:06:50,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 22:06:50,739 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 22:06:50,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:06:50,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414069020] [2025-03-14 22:06:50,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414069020] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 22:06:50,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2889060] [2025-03-14 22:06:50,739 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 22:06:50,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 22:06:50,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 22:06:50,741 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-03-14 22:06:50,743 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-03-14 22:06:50,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 22:06:50,826 INFO L256 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-14 22:06:50,828 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 22:06:51,038 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 22:06:51,039 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 22:06:51,276 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 22:06:51,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2889060] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-14 22:06:51,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-14 22:06:51,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [14, 13] total 28 [2025-03-14 22:06:51,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863523450] [2025-03-14 22:06:51,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 22:06:51,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-14 22:06:51,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:06:51,278 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-14 22:06:51,278 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=636, Unknown=0, NotChecked=0, Total=756 [2025-03-14 22:06:51,279 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 217 out of 340 [2025-03-14 22:06:51,280 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 612 places, 2889 transitions, 57752 flow. Second operand has 13 states, 13 states have (on average 224.23076923076923) internal successors, (2915), 13 states have internal predecessors, (2915), 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-03-14 22:06:51,280 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:06:51,280 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 217 of 340 [2025-03-14 22:06:51,280 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:07:11,334 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([927] thread2EXIT-->L104: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork0_thidvar0_4) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][2963], [18#L104true, 6468#true, thread3Thread1of1ForFork1InUse, thread2Thread1of1ForFork0NotInUse, 2647#(and (<= 1 ~n1~0) (<= 1 ~n2~0)), thread1Thread1of1ForFork2NotInUse, 2396#(< 0 (+ ~n1~0 1)), 6451#true, 3745#(<= 1 ~n1~0), 331#true, 1234#(< 0 (+ ~n1~0 1)), 6434#true, 61#L83-1true, 1472#true, 1498#(<= 0 ~n2~0), 6433#(and (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~n1~0) (<= 1 ~n1~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~n3~0) (<= 1 ~n3~0)), 5151#true]) [2025-03-14 22:07:11,335 INFO L294 olderBase$Statistics]: this new event has 232 ancestors and is cut-off event [2025-03-14 22:07:11,335 INFO L297 olderBase$Statistics]: existing Event has 232 ancestors and is cut-off event [2025-03-14 22:07:11,335 INFO L297 olderBase$Statistics]: existing Event has 232 ancestors and is cut-off event [2025-03-14 22:07:11,335 INFO L297 olderBase$Statistics]: existing Event has 232 ancestors and is cut-off event [2025-03-14 22:07:11,335 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([927] thread2EXIT-->L104: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork0_thidvar0_4) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][2963], [18#L104true, 6468#true, thread3Thread1of1ForFork1InUse, thread2Thread1of1ForFork0NotInUse, 2647#(and (<= 1 ~n1~0) (<= 1 ~n2~0)), thread1Thread1of1ForFork2NotInUse, 2396#(< 0 (+ ~n1~0 1)), 6451#true, 3745#(<= 1 ~n1~0), 331#true, 1234#(< 0 (+ ~n1~0 1)), 6434#true, 1472#true, 1498#(<= 0 ~n2~0), 318#L80-1true, 5151#true, 6433#(and (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~n1~0) (<= 1 ~n1~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~n3~0) (<= 1 ~n3~0))]) [2025-03-14 22:07:11,335 INFO L294 olderBase$Statistics]: this new event has 232 ancestors and is cut-off event [2025-03-14 22:07:11,335 INFO L297 olderBase$Statistics]: existing Event has 232 ancestors and is cut-off event [2025-03-14 22:07:11,335 INFO L297 olderBase$Statistics]: existing Event has 232 ancestors and is cut-off event [2025-03-14 22:07:11,335 INFO L297 olderBase$Statistics]: existing Event has 232 ancestors and is cut-off event [2025-03-14 22:07:11,357 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([927] thread2EXIT-->L104: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork0_thidvar0_4) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][2963], [18#L104true, 6468#true, thread3Thread1of1ForFork1InUse, thread2Thread1of1ForFork0NotInUse, 2647#(and (<= 1 ~n1~0) (<= 1 ~n2~0)), thread1Thread1of1ForFork2NotInUse, 2396#(< 0 (+ ~n1~0 1)), 6451#true, 3745#(<= 1 ~n1~0), 331#true, 112#L80-2true, 1234#(< 0 (+ ~n1~0 1)), 6434#true, 1472#true, 1498#(<= 0 ~n2~0), 5151#true, 6433#(and (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~n1~0) (<= 1 ~n1~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~n3~0) (<= 1 ~n3~0))]) [2025-03-14 22:07:11,357 INFO L294 olderBase$Statistics]: this new event has 233 ancestors and is cut-off event [2025-03-14 22:07:11,357 INFO L297 olderBase$Statistics]: existing Event has 233 ancestors and is cut-off event [2025-03-14 22:07:11,357 INFO L297 olderBase$Statistics]: existing Event has 233 ancestors and is cut-off event [2025-03-14 22:07:11,357 INFO L297 olderBase$Statistics]: existing Event has 233 ancestors and is cut-off event [2025-03-14 22:07:11,655 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([916] L80-8-->L80-9: Formula: (= v_~res3~0_2 |v_thread3Thread1of1ForFork1_#t~ret17#1_5|) InVars {thread3Thread1of1ForFork1_#t~ret17#1=|v_thread3Thread1of1ForFork1_#t~ret17#1_5|} OutVars{thread3Thread1of1ForFork1_#t~ret17#1=|v_thread3Thread1of1ForFork1_#t~ret17#1_5|, ~res3~0=v_~res3~0_2} AuxVars[] AssignedVars[~res3~0][2782], [6468#true, thread3Thread1of1ForFork1InUse, thread2Thread1of1ForFork0InUse, 2647#(and (<= 1 ~n1~0) (<= 1 ~n2~0)), 14#L80-9true, 2396#(< 0 (+ ~n1~0 1)), thread1Thread1of1ForFork2NotInUse, 6451#true, 53#L103-1true, 3745#(<= 1 ~n1~0), 173#L66-9true, 331#true, 1234#(< 0 (+ ~n1~0 1)), 6434#true, 1472#true, 1498#(<= 0 ~n2~0), 6433#(and (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~n1~0) (<= 1 ~n1~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~n3~0) (<= 1 ~n3~0)), 5151#true]) [2025-03-14 22:07:11,655 INFO L294 olderBase$Statistics]: this new event has 250 ancestors and is not cut-off event [2025-03-14 22:07:11,655 INFO L297 olderBase$Statistics]: existing Event has 250 ancestors and is not cut-off event [2025-03-14 22:07:11,655 INFO L297 olderBase$Statistics]: existing Event has 250 ancestors and is not cut-off event [2025-03-14 22:07:11,655 INFO L297 olderBase$Statistics]: existing Event has 250 ancestors and is not cut-off event [2025-03-14 22:07:11,717 INFO L124 PetriNetUnfolderBase]: 22544/100700 cut-off events. [2025-03-14 22:07:11,718 INFO L125 PetriNetUnfolderBase]: For 818102/960420 co-relation queries the response was YES. [2025-03-14 22:07:12,648 INFO L83 FinitePrefix]: Finished finitePrefix Result has 408040 conditions, 100700 events. 22544/100700 cut-off events. For 818102/960420 co-relation queries the response was YES. Maximal size of possible extension queue 2214. Compared 1596066 event pairs, 5955 based on Foata normal form. 581/89260 useless extension candidates. Maximal degree in co-relation 83097. Up to 19897 conditions per place. [2025-03-14 22:07:12,952 INFO L140 encePairwiseOnDemand]: 304/340 looper letters, 525 selfloop transitions, 72 changer transitions 2204/3041 dead transitions. [2025-03-14 22:07:12,952 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 634 places, 3041 transitions, 66899 flow [2025-03-14 22:07:12,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-14 22:07:12,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2025-03-14 22:07:12,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 5188 transitions. [2025-03-14 22:07:12,954 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6634271099744246 [2025-03-14 22:07:12,955 INFO L298 CegarLoopForPetriNet]: 328 programPoint places, 306 predicate places. [2025-03-14 22:07:12,955 INFO L471 AbstractCegarLoop]: Abstraction has has 634 places, 3041 transitions, 66899 flow [2025-03-14 22:07:12,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 224.23076923076923) internal successors, (2915), 13 states have internal predecessors, (2915), 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-03-14 22:07:12,956 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:07:12,956 INFO L221 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 22:07:12,962 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-14 22:07:13,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 22:07:13,157 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 22:07:13,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:07:13,157 INFO L85 PathProgramCache]: Analyzing trace with hash -1883423267, now seen corresponding path program 1 times [2025-03-14 22:07:13,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:07:13,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378272858] [2025-03-14 22:07:13,158 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 22:07:13,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:07:13,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 22:07:13,316 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-14 22:07:13,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:07:13,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378272858] [2025-03-14 22:07:13,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378272858] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 22:07:13,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [454284084] [2025-03-14 22:07:13,316 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 22:07:13,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 22:07:13,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 22:07:13,321 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-03-14 22:07:13,329 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-03-14 22:07:13,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 22:07:13,412 INFO L256 TraceCheckSpWp]: Trace formula consists of 447 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-14 22:07:13,414 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 22:07:13,632 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-14 22:07:13,632 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 22:07:13,892 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-14 22:07:13,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [454284084] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-14 22:07:13,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-14 22:07:13,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [11, 11] total 23 [2025-03-14 22:07:13,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183891359] [2025-03-14 22:07:13,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 22:07:13,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-14 22:07:13,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:07:13,893 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-14 22:07:13,893 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=388, Unknown=0, NotChecked=0, Total=506 [2025-03-14 22:07:13,894 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 255 out of 340 [2025-03-14 22:07:13,895 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 634 places, 3041 transitions, 66899 flow. Second operand has 11 states, 11 states have (on average 260.8181818181818) internal successors, (2869), 11 states have internal predecessors, (2869), 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-03-14 22:07:13,895 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:07:13,895 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 255 of 340 [2025-03-14 22:07:13,895 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:07:37,726 INFO L124 PetriNetUnfolderBase]: 25878/108054 cut-off events. [2025-03-14 22:07:37,726 INFO L125 PetriNetUnfolderBase]: For 1099858/1210884 co-relation queries the response was YES. [2025-03-14 22:07:38,468 INFO L83 FinitePrefix]: Finished finitePrefix Result has 474694 conditions, 108054 events. 25878/108054 cut-off events. For 1099858/1210884 co-relation queries the response was YES. Maximal size of possible extension queue 2283. Compared 1686837 event pairs, 6863 based on Foata normal form. 1026/96412 useless extension candidates. Maximal degree in co-relation 102894. Up to 21905 conditions per place. [2025-03-14 22:07:38,833 INFO L140 encePairwiseOnDemand]: 318/340 looper letters, 675 selfloop transitions, 62 changer transitions 2396/3455 dead transitions. [2025-03-14 22:07:38,833 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 648 places, 3455 transitions, 82610 flow [2025-03-14 22:07:38,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-14 22:07:38,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-14 22:07:38,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 3978 transitions. [2025-03-14 22:07:38,835 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.78 [2025-03-14 22:07:38,836 INFO L298 CegarLoopForPetriNet]: 328 programPoint places, 320 predicate places. [2025-03-14 22:07:38,836 INFO L471 AbstractCegarLoop]: Abstraction has has 648 places, 3455 transitions, 82610 flow [2025-03-14 22:07:38,836 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 260.8181818181818) internal successors, (2869), 11 states have internal predecessors, (2869), 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-03-14 22:07:38,836 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:07:38,836 INFO L221 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 22:07:38,843 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-03-14 22:07:39,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 22:07:39,037 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 22:07:39,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:07:39,038 INFO L85 PathProgramCache]: Analyzing trace with hash 940086307, now seen corresponding path program 1 times [2025-03-14 22:07:39,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:07:39,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483419536] [2025-03-14 22:07:39,038 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 22:07:39,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:07:39,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 22:07:39,289 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-14 22:07:39,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:07:39,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483419536] [2025-03-14 22:07:39,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483419536] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 22:07:39,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1155872367] [2025-03-14 22:07:39,290 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 22:07:39,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 22:07:39,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 22:07:39,292 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-03-14 22:07:39,293 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-03-14 22:07:39,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 22:07:39,381 INFO L256 TraceCheckSpWp]: Trace formula consists of 462 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-14 22:07:39,383 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 22:07:39,661 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-14 22:07:39,661 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 22:07:39,943 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-14 22:07:39,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1155872367] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 22:07:39,943 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 22:07:39,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15, 15] total 37 [2025-03-14 22:07:39,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119481641] [2025-03-14 22:07:39,943 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 22:07:39,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-03-14 22:07:39,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:07:39,944 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-03-14 22:07:39,945 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=1201, Unknown=0, NotChecked=0, Total=1332 [2025-03-14 22:07:39,947 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 210 out of 340 [2025-03-14 22:07:39,950 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 648 places, 3455 transitions, 82610 flow. Second operand has 37 states, 37 states have (on average 217.13513513513513) internal successors, (8034), 37 states have internal predecessors, (8034), 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-03-14 22:07:39,950 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:07:39,950 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 210 of 340 [2025-03-14 22:07:39,950 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand