/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/popl20-simple-array-sum.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.empire2-owicki-f61efc6-m [2025-03-14 23:23:07,811 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-14 23:23:07,879 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 23:23:07,921 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-14 23:23:07,922 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-14 23:23:07,922 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-14 23:23:07,922 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-14 23:23:07,922 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-14 23:23:07,922 INFO L153 SettingsManager]: * Use SBE=true [2025-03-14 23:23:07,923 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-14 23:23:07,924 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-14 23:23:07,924 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-14 23:23:07,924 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-14 23:23:07,924 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-14 23:23:07,924 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-14 23:23:07,924 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-14 23:23:07,925 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-14 23:23:07,925 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-14 23:23:07,925 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-14 23:23:07,925 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-14 23:23:07,925 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-14 23:23:07,925 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-03-14 23:23:07,925 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-14 23:23:07,925 INFO L153 SettingsManager]: * To the following directory=./dump/ [2025-03-14 23:23:07,925 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-14 23:23:07,925 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-14 23:23:07,925 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-14 23:23:07,925 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-14 23:23:07,925 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-14 23:23:07,925 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-14 23:23:07,925 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-14 23:23:07,925 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-14 23:23:07,925 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 23:23:08,162 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-14 23:23:08,167 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-14 23:23:08,168 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-14 23:23:08,169 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-14 23:23:08,169 INFO L274 PluginConnector]: CDTParser initialized [2025-03-14 23:23:08,171 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-simple-array-sum.wvr.c [2025-03-14 23:23:09,345 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f7d12239c/785f0b4e9b8b44c3bd3ac60006409ab3/FLAG8ff6f02cd [2025-03-14 23:23:09,499 INFO L384 CDTParser]: Found 1 translation units. [2025-03-14 23:23:09,499 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-simple-array-sum.wvr.c [2025-03-14 23:23:09,504 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f7d12239c/785f0b4e9b8b44c3bd3ac60006409ab3/FLAG8ff6f02cd [2025-03-14 23:23:09,519 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f7d12239c/785f0b4e9b8b44c3bd3ac60006409ab3 [2025-03-14 23:23:09,520 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-14 23:23:09,521 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-03-14 23:23:09,522 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-14 23:23:09,522 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-14 23:23:09,526 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-14 23:23:09,526 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 11:23:09" (1/1) ... [2025-03-14 23:23:09,527 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32623fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 11:23:09, skipping insertion in model container [2025-03-14 23:23:09,527 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 11:23:09" (1/1) ... [2025-03-14 23:23:09,539 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-14 23:23:09,659 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-simple-array-sum.wvr.c[2429,2442] [2025-03-14 23:23:09,665 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 23:23:09,671 INFO L200 MainTranslator]: Completed pre-run [2025-03-14 23:23:09,690 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-simple-array-sum.wvr.c[2429,2442] [2025-03-14 23:23:09,694 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 23:23:09,704 INFO L204 MainTranslator]: Completed translation [2025-03-14 23:23:09,705 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 11:23:09 WrapperNode [2025-03-14 23:23:09,705 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-14 23:23:09,706 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-14 23:23:09,706 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-14 23:23:09,706 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-14 23:23:09,710 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 11:23:09" (1/1) ... [2025-03-14 23:23:09,716 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 11:23:09" (1/1) ... [2025-03-14 23:23:09,733 INFO L138 Inliner]: procedures = 23, calls = 20, calls flagged for inlining = 7, calls inlined = 9, statements flattened = 103 [2025-03-14 23:23:09,733 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-14 23:23:09,733 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-14 23:23:09,733 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-14 23:23:09,733 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-14 23:23:09,739 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 11:23:09" (1/1) ... [2025-03-14 23:23:09,739 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 11:23:09" (1/1) ... [2025-03-14 23:23:09,745 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 11:23:09" (1/1) ... [2025-03-14 23:23:09,746 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 11:23:09" (1/1) ... [2025-03-14 23:23:09,753 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 11:23:09" (1/1) ... [2025-03-14 23:23:09,754 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 11:23:09" (1/1) ... [2025-03-14 23:23:09,756 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 11:23:09" (1/1) ... [2025-03-14 23:23:09,763 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 11:23:09" (1/1) ... [2025-03-14 23:23:09,764 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 11:23:09" (1/1) ... [2025-03-14 23:23:09,766 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-14 23:23:09,766 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-03-14 23:23:09,766 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-03-14 23:23:09,769 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-03-14 23:23:09,773 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 11:23:09" (1/1) ... [2025-03-14 23:23:09,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-14 23:23:09,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 23:23:09,798 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 23:23:09,804 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 23:23:09,820 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-14 23:23:09,821 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-14 23:23:09,821 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-14 23:23:09,821 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-14 23:23:09,821 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-14 23:23:09,821 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-14 23:23:09,821 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-14 23:23:09,821 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-14 23:23:09,821 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-14 23:23:09,821 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-14 23:23:09,821 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-14 23:23:09,822 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-14 23:23:09,822 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-14 23:23:09,822 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 23:23:09,910 INFO L234 CfgBuilder]: Building ICFG [2025-03-14 23:23:09,911 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-14 23:23:10,107 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-14 23:23:10,107 INFO L283 CfgBuilder]: Performing block encoding [2025-03-14 23:23:10,121 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-14 23:23:10,122 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-14 23:23:10,122 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.03 11:23:10 BoogieIcfgContainer [2025-03-14 23:23:10,122 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-03-14 23:23:10,124 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-14 23:23:10,124 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-14 23:23:10,127 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-14 23:23:10,127 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.03 11:23:09" (1/3) ... [2025-03-14 23:23:10,128 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e33717e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 11:23:10, skipping insertion in model container [2025-03-14 23:23:10,128 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 11:23:09" (2/3) ... [2025-03-14 23:23:10,128 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e33717e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 11:23:10, skipping insertion in model container [2025-03-14 23:23:10,128 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.03 11:23:10" (3/3) ... [2025-03-14 23:23:10,129 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-simple-array-sum.wvr.c [2025-03-14 23:23:10,138 INFO L303 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-14 23:23:10,139 INFO L169 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-simple-array-sum.wvr.c that has 4 procedures, 170 locations, 1 initial locations, 5 loop locations, and 1 error locations. [2025-03-14 23:23:10,139 INFO L581 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-14 23:23:10,215 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-14 23:23:10,240 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-14 23:23:10,248 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;@5eb7a11, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-14 23:23:10,248 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-03-14 23:23:10,296 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-14 23:23:10,297 INFO L124 PetriNetUnfolderBase]: 11/171 cut-off events. [2025-03-14 23:23:10,298 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-14 23:23:10,298 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 23:23:10,299 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] [2025-03-14 23:23:10,299 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 23:23:10,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 23:23:10,303 INFO L85 PathProgramCache]: Analyzing trace with hash -2101311814, now seen corresponding path program 1 times [2025-03-14 23:23:10,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 23:23:10,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555747362] [2025-03-14 23:23:10,310 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 23:23:10,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 23:23:10,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 23:23:11,805 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 23:23:11,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 23:23:11,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555747362] [2025-03-14 23:23:11,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555747362] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 23:23:11,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 23:23:11,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-14 23:23:11,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763658577] [2025-03-14 23:23:11,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 23:23:11,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-14 23:23:11,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 23:23:11,834 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-14 23:23:11,835 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2025-03-14 23:23:11,841 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 180 [2025-03-14 23:23:11,846 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 180 transitions, 381 flow. Second operand has 13 states, 13 states have (on average 95.6923076923077) internal successors, (1244), 13 states have internal predecessors, (1244), 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 23:23:11,846 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 23:23:11,846 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 180 [2025-03-14 23:23:11,847 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 23:23:12,910 INFO L124 PetriNetUnfolderBase]: 1157/2834 cut-off events. [2025-03-14 23:23:12,910 INFO L125 PetriNetUnfolderBase]: For 388/388 co-relation queries the response was YES. [2025-03-14 23:23:12,925 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4842 conditions, 2834 events. 1157/2834 cut-off events. For 388/388 co-relation queries the response was YES. Maximal size of possible extension queue 158. Compared 20577 event pairs, 560 based on Foata normal form. 13/2333 useless extension candidates. Maximal degree in co-relation 2714. Up to 576 conditions per place. [2025-03-14 23:23:12,939 INFO L140 encePairwiseOnDemand]: 140/180 looper letters, 143 selfloop transitions, 34 changer transitions 14/275 dead transitions. [2025-03-14 23:23:12,939 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 275 transitions, 992 flow [2025-03-14 23:23:12,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-14 23:23:12,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2025-03-14 23:23:12,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 2298 transitions. [2025-03-14 23:23:12,961 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.5550724637681159 [2025-03-14 23:23:12,966 INFO L298 CegarLoopForPetriNet]: 179 programPoint places, 14 predicate places. [2025-03-14 23:23:12,966 INFO L471 AbstractCegarLoop]: Abstraction has has 193 places, 275 transitions, 992 flow [2025-03-14 23:23:12,966 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 95.6923076923077) internal successors, (1244), 13 states have internal predecessors, (1244), 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 23:23:12,966 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 23:23:12,967 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] [2025-03-14 23:23:12,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-14 23:23:12,967 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 23:23:12,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 23:23:12,969 INFO L85 PathProgramCache]: Analyzing trace with hash 1498718999, now seen corresponding path program 1 times [2025-03-14 23:23:12,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 23:23:12,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567530139] [2025-03-14 23:23:12,970 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 23:23:12,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 23:23:12,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 23:23:13,106 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 23:23:13,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 23:23:13,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567530139] [2025-03-14 23:23:13,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567530139] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 23:23:13,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 23:23:13,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-14 23:23:13,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405850230] [2025-03-14 23:23:13,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 23:23:13,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-14 23:23:13,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 23:23:13,109 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-14 23:23:13,109 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-14 23:23:13,111 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 180 [2025-03-14 23:23:13,112 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 193 places, 275 transitions, 992 flow. Second operand has 7 states, 7 states have (on average 126.71428571428571) internal successors, (887), 7 states have internal predecessors, (887), 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 23:23:13,112 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 23:23:13,112 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 180 [2025-03-14 23:23:13,112 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 23:23:13,768 INFO L124 PetriNetUnfolderBase]: 1799/3986 cut-off events. [2025-03-14 23:23:13,768 INFO L125 PetriNetUnfolderBase]: For 1359/1652 co-relation queries the response was YES. [2025-03-14 23:23:13,776 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9133 conditions, 3986 events. 1799/3986 cut-off events. For 1359/1652 co-relation queries the response was YES. Maximal size of possible extension queue 158. Compared 28026 event pairs, 433 based on Foata normal form. 0/3190 useless extension candidates. Maximal degree in co-relation 6027. Up to 1683 conditions per place. [2025-03-14 23:23:13,790 INFO L140 encePairwiseOnDemand]: 159/180 looper letters, 130 selfloop transitions, 28 changer transitions 16/308 dead transitions. [2025-03-14 23:23:13,790 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 308 transitions, 1459 flow [2025-03-14 23:23:13,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-14 23:23:13,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-14 23:23:13,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1324 transitions. [2025-03-14 23:23:13,793 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7355555555555555 [2025-03-14 23:23:13,794 INFO L298 CegarLoopForPetriNet]: 179 programPoint places, 23 predicate places. [2025-03-14 23:23:13,794 INFO L471 AbstractCegarLoop]: Abstraction has has 202 places, 308 transitions, 1459 flow [2025-03-14 23:23:13,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 126.71428571428571) internal successors, (887), 7 states have internal predecessors, (887), 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 23:23:13,795 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 23:23:13,795 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] [2025-03-14 23:23:13,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-14 23:23:13,795 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 23:23:13,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 23:23:13,797 INFO L85 PathProgramCache]: Analyzing trace with hash 485515235, now seen corresponding path program 1 times [2025-03-14 23:23:13,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 23:23:13,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047120101] [2025-03-14 23:23:13,797 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 23:23:13,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 23:23:13,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 23:23:13,891 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 23:23:13,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 23:23:13,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047120101] [2025-03-14 23:23:13,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047120101] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 23:23:13,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 23:23:13,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-14 23:23:13,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80011993] [2025-03-14 23:23:13,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 23:23:13,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-14 23:23:13,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 23:23:13,892 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-14 23:23:13,892 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-14 23:23:13,894 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 180 [2025-03-14 23:23:13,895 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 308 transitions, 1459 flow. Second operand has 4 states, 4 states have (on average 158.5) internal successors, (634), 4 states have internal predecessors, (634), 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 23:23:13,895 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 23:23:13,895 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 180 [2025-03-14 23:23:13,895 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 23:23:14,610 INFO L124 PetriNetUnfolderBase]: 2983/6181 cut-off events. [2025-03-14 23:23:14,610 INFO L125 PetriNetUnfolderBase]: For 5297/5817 co-relation queries the response was YES. [2025-03-14 23:23:14,629 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17150 conditions, 6181 events. 2983/6181 cut-off events. For 5297/5817 co-relation queries the response was YES. Maximal size of possible extension queue 240. Compared 47124 event pairs, 732 based on Foata normal form. 28/5181 useless extension candidates. Maximal degree in co-relation 11708. Up to 2516 conditions per place. [2025-03-14 23:23:14,691 INFO L140 encePairwiseOnDemand]: 176/180 looper letters, 109 selfloop transitions, 4 changer transitions 21/359 dead transitions. [2025-03-14 23:23:14,691 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 359 transitions, 2048 flow [2025-03-14 23:23:14,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-14 23:23:14,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-14 23:23:14,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 658 transitions. [2025-03-14 23:23:14,693 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9138888888888889 [2025-03-14 23:23:14,694 INFO L298 CegarLoopForPetriNet]: 179 programPoint places, 26 predicate places. [2025-03-14 23:23:14,694 INFO L471 AbstractCegarLoop]: Abstraction has has 205 places, 359 transitions, 2048 flow [2025-03-14 23:23:14,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 158.5) internal successors, (634), 4 states have internal predecessors, (634), 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 23:23:14,694 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 23:23:14,694 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] [2025-03-14 23:23:14,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-14 23:23:14,695 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 23:23:14,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 23:23:14,695 INFO L85 PathProgramCache]: Analyzing trace with hash 1161270244, now seen corresponding path program 1 times [2025-03-14 23:23:14,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 23:23:14,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658322968] [2025-03-14 23:23:14,695 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 23:23:14,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 23:23:14,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 23:23:14,812 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 23:23:14,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 23:23:14,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658322968] [2025-03-14 23:23:14,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658322968] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 23:23:14,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2099080465] [2025-03-14 23:23:14,812 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 23:23:14,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 23:23:14,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 23:23:14,815 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 23:23:14,817 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 23:23:14,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 23:23:14,896 INFO L256 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-14 23:23:14,900 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 23:23:15,057 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 23:23:15,057 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 23:23:15,232 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 23:23:15,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2099080465] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-14 23:23:15,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-14 23:23:15,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 7] total 14 [2025-03-14 23:23:15,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283212766] [2025-03-14 23:23:15,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 23:23:15,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-14 23:23:15,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 23:23:15,234 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-14 23:23:15,234 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2025-03-14 23:23:15,236 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 180 [2025-03-14 23:23:15,237 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 359 transitions, 2048 flow. Second operand has 7 states, 7 states have (on average 126.14285714285714) internal successors, (883), 7 states have internal predecessors, (883), 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 23:23:15,237 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 23:23:15,237 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 180 [2025-03-14 23:23:15,237 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 23:23:16,163 INFO L124 PetriNetUnfolderBase]: 4022/7669 cut-off events. [2025-03-14 23:23:16,163 INFO L125 PetriNetUnfolderBase]: For 9834/11411 co-relation queries the response was YES. [2025-03-14 23:23:16,179 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26972 conditions, 7669 events. 4022/7669 cut-off events. For 9834/11411 co-relation queries the response was YES. Maximal size of possible extension queue 287. Compared 57142 event pairs, 585 based on Foata normal form. 23/6549 useless extension candidates. Maximal degree in co-relation 12008. Up to 3173 conditions per place. [2025-03-14 23:23:16,210 INFO L140 encePairwiseOnDemand]: 162/180 looper letters, 311 selfloop transitions, 28 changer transitions 27/498 dead transitions. [2025-03-14 23:23:16,210 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 211 places, 498 transitions, 3863 flow [2025-03-14 23:23:16,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-14 23:23:16,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-14 23:23:16,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1071 transitions. [2025-03-14 23:23:16,213 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.74375 [2025-03-14 23:23:16,213 INFO L298 CegarLoopForPetriNet]: 179 programPoint places, 32 predicate places. [2025-03-14 23:23:16,213 INFO L471 AbstractCegarLoop]: Abstraction has has 211 places, 498 transitions, 3863 flow [2025-03-14 23:23:16,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 126.14285714285714) internal successors, (883), 7 states have internal predecessors, (883), 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 23:23:16,214 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 23:23:16,214 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] [2025-03-14 23:23:16,221 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-14 23:23:16,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 23:23:16,415 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 23:23:16,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 23:23:16,416 INFO L85 PathProgramCache]: Analyzing trace with hash -1835836167, now seen corresponding path program 1 times [2025-03-14 23:23:16,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 23:23:16,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206652695] [2025-03-14 23:23:16,416 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 23:23:16,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 23:23:16,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 23:23:16,533 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 23:23:16,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 23:23:16,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206652695] [2025-03-14 23:23:16,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206652695] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 23:23:16,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 23:23:16,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 23:23:16,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290146655] [2025-03-14 23:23:16,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 23:23:16,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-14 23:23:16,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 23:23:16,534 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-14 23:23:16,534 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-14 23:23:16,535 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 180 [2025-03-14 23:23:16,535 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 211 places, 498 transitions, 3863 flow. Second operand has 5 states, 5 states have (on average 153.6) internal successors, (768), 5 states have internal predecessors, (768), 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 23:23:16,535 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 23:23:16,535 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 180 [2025-03-14 23:23:16,535 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 23:23:17,261 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([448] L69-2-->L69: Formula: (< v_thread3Thread1of1ForFork2_~i~2_5 v_~N~0_5) InVars {thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_5, ~N~0=v_~N~0_5} OutVars{thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_5, ~N~0=v_~N~0_5} AuxVars[] AssignedVars[][566], [thread2Thread1of1ForFork1InUse, 182#true, thread3Thread1of1ForFork2InUse, 227#true, 18#L69true, thread1Thread1of1ForFork0InUse, 1094#(and (= ~p~0 0) (= thread3Thread1of1ForFork2_~i~2 0)), 80#L50-4true, 1089#(and (<= 1 ~N~0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), 244#true, 168#L88-4true, 166#L58-3true]) [2025-03-14 23:23:17,261 INFO L294 olderBase$Statistics]: this new event has 127 ancestors and is cut-off event [2025-03-14 23:23:17,261 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2025-03-14 23:23:17,262 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2025-03-14 23:23:17,262 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2025-03-14 23:23:17,299 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([433] L58-4-->L58-5: Formula: (<= v_~N~0_3 v_thread2Thread1of1ForFork1_~i~1_3) InVars {thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_3, ~N~0=v_~N~0_3} OutVars{thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_3, ~N~0=v_~N~0_3} AuxVars[] AssignedVars[][564], [thread2Thread1of1ForFork1InUse, 182#true, 171#L69-2true, thread3Thread1of1ForFork2InUse, 227#true, thread1Thread1of1ForFork0InUse, 1094#(and (= ~p~0 0) (= thread3Thread1of1ForFork2_~i~2 0)), 80#L50-4true, 1089#(and (<= 1 ~N~0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), 128#L58-5true, 244#true, 168#L88-4true]) [2025-03-14 23:23:17,299 INFO L294 olderBase$Statistics]: this new event has 128 ancestors and is cut-off event [2025-03-14 23:23:17,299 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is cut-off event [2025-03-14 23:23:17,299 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is cut-off event [2025-03-14 23:23:17,299 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is cut-off event [2025-03-14 23:23:17,300 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([434] L58-4-->L59: Formula: (< v_thread2Thread1of1ForFork1_~i~1_5 v_~N~0_4) InVars {thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_5, ~N~0=v_~N~0_4} OutVars{thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_5, ~N~0=v_~N~0_4} AuxVars[] AssignedVars[][565], [thread2Thread1of1ForFork1InUse, 182#true, 171#L69-2true, thread3Thread1of1ForFork2InUse, 227#true, thread1Thread1of1ForFork0InUse, 1094#(and (= ~p~0 0) (= thread3Thread1of1ForFork2_~i~2 0)), 80#L50-4true, 1089#(and (<= 1 ~N~0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), 244#true, 168#L88-4true, 71#L59true]) [2025-03-14 23:23:17,300 INFO L294 olderBase$Statistics]: this new event has 128 ancestors and is cut-off event [2025-03-14 23:23:17,300 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is cut-off event [2025-03-14 23:23:17,300 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is cut-off event [2025-03-14 23:23:17,300 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is cut-off event [2025-03-14 23:23:17,909 INFO L124 PetriNetUnfolderBase]: 7498/13826 cut-off events. [2025-03-14 23:23:17,909 INFO L125 PetriNetUnfolderBase]: For 27076/29804 co-relation queries the response was YES. [2025-03-14 23:23:17,948 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55816 conditions, 13826 events. 7498/13826 cut-off events. For 27076/29804 co-relation queries the response was YES. Maximal size of possible extension queue 417. Compared 108277 event pairs, 1289 based on Foata normal form. 218/12118 useless extension candidates. Maximal degree in co-relation 30868. Up to 5922 conditions per place. [2025-03-14 23:23:18,009 INFO L140 encePairwiseOnDemand]: 173/180 looper letters, 395 selfloop transitions, 15 changer transitions 75/702 dead transitions. [2025-03-14 23:23:18,010 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 216 places, 702 transitions, 6770 flow [2025-03-14 23:23:18,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 23:23:18,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 23:23:18,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 971 transitions. [2025-03-14 23:23:18,012 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.899074074074074 [2025-03-14 23:23:18,012 INFO L298 CegarLoopForPetriNet]: 179 programPoint places, 37 predicate places. [2025-03-14 23:23:18,012 INFO L471 AbstractCegarLoop]: Abstraction has has 216 places, 702 transitions, 6770 flow [2025-03-14 23:23:18,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 153.6) internal successors, (768), 5 states have internal predecessors, (768), 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 23:23:18,013 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 23:23:18,013 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] [2025-03-14 23:23:18,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-14 23:23:18,013 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 23:23:18,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 23:23:18,014 INFO L85 PathProgramCache]: Analyzing trace with hash 1515547601, now seen corresponding path program 2 times [2025-03-14 23:23:18,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 23:23:18,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405201529] [2025-03-14 23:23:18,014 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 23:23:18,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 23:23:18,033 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 23:23:18,033 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 23:23:18,225 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-14 23:23:18,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 23:23:18,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405201529] [2025-03-14 23:23:18,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405201529] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 23:23:18,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 23:23:18,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-14 23:23:18,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924627663] [2025-03-14 23:23:18,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 23:23:18,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-14 23:23:18,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 23:23:18,227 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-14 23:23:18,227 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-14 23:23:18,227 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 180 [2025-03-14 23:23:18,228 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 216 places, 702 transitions, 6770 flow. Second operand has 7 states, 7 states have (on average 126.14285714285714) internal successors, (883), 7 states have internal predecessors, (883), 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 23:23:18,228 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 23:23:18,228 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 180 [2025-03-14 23:23:18,228 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 23:23:19,330 INFO L124 PetriNetUnfolderBase]: 5029/9676 cut-off events. [2025-03-14 23:23:19,330 INFO L125 PetriNetUnfolderBase]: For 21057/23429 co-relation queries the response was YES. [2025-03-14 23:23:19,360 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44313 conditions, 9676 events. 5029/9676 cut-off events. For 21057/23429 co-relation queries the response was YES. Maximal size of possible extension queue 272. Compared 72755 event pairs, 1182 based on Foata normal form. 143/8728 useless extension candidates. Maximal degree in co-relation 28578. Up to 4652 conditions per place. [2025-03-14 23:23:19,403 INFO L140 encePairwiseOnDemand]: 160/180 looper letters, 184 selfloop transitions, 14 changer transitions 254/578 dead transitions. [2025-03-14 23:23:19,404 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 578 transitions, 6176 flow [2025-03-14 23:23:19,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-14 23:23:19,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-14 23:23:19,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1310 transitions. [2025-03-14 23:23:19,406 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7277777777777777 [2025-03-14 23:23:19,407 INFO L298 CegarLoopForPetriNet]: 179 programPoint places, 45 predicate places. [2025-03-14 23:23:19,407 INFO L471 AbstractCegarLoop]: Abstraction has has 224 places, 578 transitions, 6176 flow [2025-03-14 23:23:19,408 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 126.14285714285714) internal successors, (883), 7 states have internal predecessors, (883), 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 23:23:19,408 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 23:23:19,408 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] [2025-03-14 23:23:19,408 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-14 23:23:19,408 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 23:23:19,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 23:23:19,409 INFO L85 PathProgramCache]: Analyzing trace with hash 528668903, now seen corresponding path program 1 times [2025-03-14 23:23:19,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 23:23:19,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678083077] [2025-03-14 23:23:19,409 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 23:23:19,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 23:23:19,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 23:23:19,554 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-14 23:23:19,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 23:23:19,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678083077] [2025-03-14 23:23:19,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678083077] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 23:23:19,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2009547224] [2025-03-14 23:23:19,555 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 23:23:19,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 23:23:19,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 23:23:19,557 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 23:23:19,558 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 23:23:19,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 23:23:19,642 INFO L256 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-14 23:23:19,645 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 23:23:19,753 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-14 23:23:19,753 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 23:23:19,931 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-14 23:23:19,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2009547224] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-14 23:23:19,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-14 23:23:19,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 7] total 14 [2025-03-14 23:23:19,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49238185] [2025-03-14 23:23:19,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 23:23:19,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-14 23:23:19,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 23:23:19,933 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-14 23:23:19,933 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2025-03-14 23:23:19,934 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 180 [2025-03-14 23:23:19,935 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 224 places, 578 transitions, 6176 flow. Second operand has 7 states, 7 states have (on average 128.0) internal successors, (896), 7 states have internal predecessors, (896), 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 23:23:19,935 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 23:23:19,935 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 180 [2025-03-14 23:23:19,935 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 23:23:20,930 INFO L124 PetriNetUnfolderBase]: 4191/8002 cut-off events. [2025-03-14 23:23:20,930 INFO L125 PetriNetUnfolderBase]: For 36627/41306 co-relation queries the response was YES. [2025-03-14 23:23:20,960 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41837 conditions, 8002 events. 4191/8002 cut-off events. For 36627/41306 co-relation queries the response was YES. Maximal size of possible extension queue 222. Compared 57577 event pairs, 439 based on Foata normal form. 187/7096 useless extension candidates. Maximal degree in co-relation 32199. Up to 3999 conditions per place. [2025-03-14 23:23:21,006 INFO L140 encePairwiseOnDemand]: 162/180 looper letters, 237 selfloop transitions, 8 changer transitions 240/615 dead transitions. [2025-03-14 23:23:21,006 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 229 places, 615 transitions, 7543 flow [2025-03-14 23:23:21,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-14 23:23:21,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-14 23:23:21,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 943 transitions. [2025-03-14 23:23:21,009 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7484126984126984 [2025-03-14 23:23:21,009 INFO L298 CegarLoopForPetriNet]: 179 programPoint places, 50 predicate places. [2025-03-14 23:23:21,009 INFO L471 AbstractCegarLoop]: Abstraction has has 229 places, 615 transitions, 7543 flow [2025-03-14 23:23:21,010 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 128.0) internal successors, (896), 7 states have internal predecessors, (896), 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 23:23:21,010 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 23:23:21,010 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] [2025-03-14 23:23:21,020 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-14 23:23:21,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2025-03-14 23:23:21,210 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 23:23:21,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 23:23:21,211 INFO L85 PathProgramCache]: Analyzing trace with hash -1991210216, now seen corresponding path program 1 times [2025-03-14 23:23:21,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 23:23:21,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423255901] [2025-03-14 23:23:21,211 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 23:23:21,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 23:23:21,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 23:23:21,435 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 23:23:21,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 23:23:21,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423255901] [2025-03-14 23:23:21,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423255901] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 23:23:21,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [938320302] [2025-03-14 23:23:21,436 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 23:23:21,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 23:23:21,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 23:23:21,438 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 23:23:21,439 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 23:23:21,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 23:23:21,518 INFO L256 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-14 23:23:21,520 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 23:23:21,701 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 23:23:21,701 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 23:23:21,901 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 23:23:21,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [938320302] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 23:23:21,901 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 23:23:21,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 24 [2025-03-14 23:23:21,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606167364] [2025-03-14 23:23:21,901 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 23:23:21,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-14 23:23:21,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 23:23:21,902 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-14 23:23:21,902 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=434, Unknown=0, NotChecked=0, Total=552 [2025-03-14 23:23:21,904 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 180 [2025-03-14 23:23:21,906 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 229 places, 615 transitions, 7543 flow. Second operand has 24 states, 24 states have (on average 121.16666666666667) internal successors, (2908), 24 states have internal predecessors, (2908), 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 23:23:21,906 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 23:23:21,906 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 180 [2025-03-14 23:23:21,906 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 23:23:22,691 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([448] L69-2-->L69: Formula: (< v_thread3Thread1of1ForFork2_~i~2_5 v_~N~0_5) InVars {thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_5, ~N~0=v_~N~0_5} OutVars{thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_5, ~N~0=v_~N~0_5} AuxVars[] AssignedVars[][592], [18#L69true, 1099#true, 1122#(<= 1 ~N~0), 80#L50-4true, 87#L58-4true, thread2Thread1of1ForFork1InUse, 182#true, thread3Thread1of1ForFork2InUse, 227#true, thread1Thread1of1ForFork0InUse, 1094#(and (= ~p~0 0) (= thread3Thread1of1ForFork2_~i~2 0)), 2478#(and (<= 1 thread2Thread1of1ForFork1_~i~1) (<= ~N~0 1)), 244#true, 1089#(and (<= 1 ~N~0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), 168#L88-4true]) [2025-03-14 23:23:22,692 INFO L294 olderBase$Statistics]: this new event has 128 ancestors and is not cut-off event [2025-03-14 23:23:22,692 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is not cut-off event [2025-03-14 23:23:22,692 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is not cut-off event [2025-03-14 23:23:22,692 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is not cut-off event [2025-03-14 23:23:22,692 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([433] L58-4-->L58-5: Formula: (<= v_~N~0_3 v_thread2Thread1of1ForFork1_~i~1_3) InVars {thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_3, ~N~0=v_~N~0_3} OutVars{thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_3, ~N~0=v_~N~0_3} AuxVars[] AssignedVars[][595], [1122#(<= 1 ~N~0), 1099#true, 80#L50-4true, thread2Thread1of1ForFork1InUse, 171#L69-2true, 182#true, thread3Thread1of1ForFork2InUse, 227#true, thread1Thread1of1ForFork0InUse, 2478#(and (<= 1 thread2Thread1of1ForFork1_~i~1) (<= ~N~0 1)), 1094#(and (= ~p~0 0) (= thread3Thread1of1ForFork2_~i~2 0)), 244#true, 128#L58-5true, 1089#(and (<= 1 ~N~0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), 168#L88-4true]) [2025-03-14 23:23:22,692 INFO L294 olderBase$Statistics]: this new event has 128 ancestors and is not cut-off event [2025-03-14 23:23:22,692 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is not cut-off event [2025-03-14 23:23:22,692 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is not cut-off event [2025-03-14 23:23:22,692 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is not cut-off event [2025-03-14 23:23:22,708 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([421] L50-5-->L51: Formula: (< v_thread1Thread1of1ForFork0_~i~0_5 v_~N~0_1) InVars {thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_5, ~N~0=v_~N~0_1} OutVars{thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_5, ~N~0=v_~N~0_1} AuxVars[] AssignedVars[][589], [1099#true, 14#L51true, 87#L58-4true, thread2Thread1of1ForFork1InUse, 171#L69-2true, 182#true, thread3Thread1of1ForFork2InUse, 227#true, thread1Thread1of1ForFork0InUse, 2101#(and (<= 1 ~N~0) (<= (+ thread1Thread1of1ForFork0_~i~0 1) ~N~0)), 2478#(and (<= 1 thread2Thread1of1ForFork1_~i~1) (<= ~N~0 1)), 1094#(and (= ~p~0 0) (= thread3Thread1of1ForFork2_~i~2 0)), 244#true, 1089#(and (<= 1 ~N~0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), 168#L88-4true]) [2025-03-14 23:23:22,709 INFO L294 olderBase$Statistics]: this new event has 129 ancestors and is not cut-off event [2025-03-14 23:23:22,709 INFO L297 olderBase$Statistics]: existing Event has 129 ancestors and is not cut-off event [2025-03-14 23:23:22,709 INFO L297 olderBase$Statistics]: existing Event has 129 ancestors and is not cut-off event [2025-03-14 23:23:22,709 INFO L297 olderBase$Statistics]: existing Event has 129 ancestors and is not cut-off event [2025-03-14 23:23:22,709 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([420] L50-5-->L50-6: Formula: (<= v_~N~0_2 v_thread1Thread1of1ForFork0_~i~0_3) InVars {thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_3, ~N~0=v_~N~0_2} OutVars{thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_3, ~N~0=v_~N~0_2} AuxVars[] AssignedVars[][590], [1099#true, 1122#(<= 1 ~N~0), 87#L58-4true, thread2Thread1of1ForFork1InUse, 182#true, 171#L69-2true, thread3Thread1of1ForFork2InUse, 227#true, thread1Thread1of1ForFork0InUse, 2478#(and (<= 1 thread2Thread1of1ForFork1_~i~1) (<= ~N~0 1)), 1094#(and (= ~p~0 0) (= thread3Thread1of1ForFork2_~i~2 0)), 244#true, 1089#(and (<= 1 ~N~0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), 168#L88-4true, 93#L50-6true]) [2025-03-14 23:23:22,709 INFO L294 olderBase$Statistics]: this new event has 129 ancestors and is not cut-off event [2025-03-14 23:23:22,709 INFO L297 olderBase$Statistics]: existing Event has 129 ancestors and is not cut-off event [2025-03-14 23:23:22,709 INFO L297 olderBase$Statistics]: existing Event has 129 ancestors and is not cut-off event [2025-03-14 23:23:22,709 INFO L297 olderBase$Statistics]: existing Event has 129 ancestors and is not cut-off event [2025-03-14 23:23:23,325 INFO L124 PetriNetUnfolderBase]: 5059/9627 cut-off events. [2025-03-14 23:23:23,325 INFO L125 PetriNetUnfolderBase]: For 52925/60563 co-relation queries the response was YES. [2025-03-14 23:23:23,362 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54382 conditions, 9627 events. 5059/9627 cut-off events. For 52925/60563 co-relation queries the response was YES. Maximal size of possible extension queue 189. Compared 67597 event pairs, 748 based on Foata normal form. 125/8656 useless extension candidates. Maximal degree in co-relation 33668. Up to 5235 conditions per place. [2025-03-14 23:23:23,403 INFO L140 encePairwiseOnDemand]: 149/180 looper letters, 271 selfloop transitions, 37 changer transitions 490/915 dead transitions. [2025-03-14 23:23:23,403 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 251 places, 915 transitions, 13553 flow [2025-03-14 23:23:23,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-14 23:23:23,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2025-03-14 23:23:23,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 2871 transitions. [2025-03-14 23:23:23,407 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6934782608695652 [2025-03-14 23:23:23,408 INFO L298 CegarLoopForPetriNet]: 179 programPoint places, 72 predicate places. [2025-03-14 23:23:23,408 INFO L471 AbstractCegarLoop]: Abstraction has has 251 places, 915 transitions, 13553 flow [2025-03-14 23:23:23,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 121.16666666666667) internal successors, (2908), 24 states have internal predecessors, (2908), 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 23:23:23,409 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 23:23:23,409 INFO L221 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-14 23:23:23,416 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 23:23:23,614 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 23:23:23,614 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 23:23:23,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 23:23:23,615 INFO L85 PathProgramCache]: Analyzing trace with hash -1394054842, now seen corresponding path program 2 times [2025-03-14 23:23:23,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 23:23:23,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034739902] [2025-03-14 23:23:23,615 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 23:23:23,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 23:23:23,630 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-14 23:23:23,630 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 23:23:23,754 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-03-14 23:23:23,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 23:23:23,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034739902] [2025-03-14 23:23:23,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034739902] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 23:23:23,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 23:23:23,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-14 23:23:23,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904009038] [2025-03-14 23:23:23,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 23:23:23,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-14 23:23:23,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 23:23:23,756 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-14 23:23:23,756 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-14 23:23:23,756 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 180 [2025-03-14 23:23:23,757 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 251 places, 915 transitions, 13553 flow. Second operand has 8 states, 8 states have (on average 145.75) internal successors, (1166), 8 states have internal predecessors, (1166), 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 23:23:23,757 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 23:23:23,757 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 180 [2025-03-14 23:23:23,757 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 23:23:27,279 INFO L124 PetriNetUnfolderBase]: 14127/24821 cut-off events. [2025-03-14 23:23:27,279 INFO L125 PetriNetUnfolderBase]: For 180901/195313 co-relation queries the response was YES. [2025-03-14 23:23:27,377 INFO L83 FinitePrefix]: Finished finitePrefix Result has 164131 conditions, 24821 events. 14127/24821 cut-off events. For 180901/195313 co-relation queries the response was YES. Maximal size of possible extension queue 583. Compared 188527 event pairs, 1093 based on Foata normal form. 281/22106 useless extension candidates. Maximal degree in co-relation 128404. Up to 15259 conditions per place. [2025-03-14 23:23:27,510 INFO L140 encePairwiseOnDemand]: 167/180 looper letters, 950 selfloop transitions, 186 changer transitions 920/2207 dead transitions. [2025-03-14 23:23:27,510 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 270 places, 2207 transitions, 38658 flow [2025-03-14 23:23:27,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-14 23:23:27,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2025-03-14 23:23:27,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 3094 transitions. [2025-03-14 23:23:27,515 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8594444444444445 [2025-03-14 23:23:27,516 INFO L298 CegarLoopForPetriNet]: 179 programPoint places, 91 predicate places. [2025-03-14 23:23:27,516 INFO L471 AbstractCegarLoop]: Abstraction has has 270 places, 2207 transitions, 38658 flow [2025-03-14 23:23:27,517 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 145.75) internal successors, (1166), 8 states have internal predecessors, (1166), 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 23:23:27,517 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 23:23:27,518 INFO L221 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-14 23:23:27,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-14 23:23:27,518 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 23:23:27,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 23:23:27,519 INFO L85 PathProgramCache]: Analyzing trace with hash 820470228, now seen corresponding path program 3 times [2025-03-14 23:23:27,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 23:23:27,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160700731] [2025-03-14 23:23:27,519 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-14 23:23:27,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 23:23:27,534 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-14 23:23:27,534 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 23:23:27,642 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-03-14 23:23:27,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 23:23:27,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160700731] [2025-03-14 23:23:27,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160700731] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 23:23:27,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 23:23:27,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-14 23:23:27,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534060988] [2025-03-14 23:23:27,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 23:23:27,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-14 23:23:27,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 23:23:27,643 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-14 23:23:27,644 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-03-14 23:23:27,644 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 180 [2025-03-14 23:23:27,645 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 270 places, 2207 transitions, 38658 flow. Second operand has 10 states, 10 states have (on average 141.2) internal successors, (1412), 10 states have internal predecessors, (1412), 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 23:23:27,645 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 23:23:27,645 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 180 [2025-03-14 23:23:27,645 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 23:23:38,405 INFO L124 PetriNetUnfolderBase]: 28193/47369 cut-off events. [2025-03-14 23:23:38,405 INFO L125 PetriNetUnfolderBase]: For 337453/348529 co-relation queries the response was YES. [2025-03-14 23:23:38,619 INFO L83 FinitePrefix]: Finished finitePrefix Result has 334223 conditions, 47369 events. 28193/47369 cut-off events. For 337453/348529 co-relation queries the response was YES. Maximal size of possible extension queue 984. Compared 368902 event pairs, 2501 based on Foata normal form. 150/43598 useless extension candidates. Maximal degree in co-relation 274157. Up to 26778 conditions per place. [2025-03-14 23:23:38,916 INFO L140 encePairwiseOnDemand]: 163/180 looper letters, 3084 selfloop transitions, 394 changer transitions 1599/5225 dead transitions. [2025-03-14 23:23:38,916 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 291 places, 5225 transitions, 96707 flow [2025-03-14 23:23:38,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-14 23:23:38,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2025-03-14 23:23:38,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 3337 transitions. [2025-03-14 23:23:38,919 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8426767676767677 [2025-03-14 23:23:38,920 INFO L298 CegarLoopForPetriNet]: 179 programPoint places, 112 predicate places. [2025-03-14 23:23:38,920 INFO L471 AbstractCegarLoop]: Abstraction has has 291 places, 5225 transitions, 96707 flow [2025-03-14 23:23:38,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 141.2) internal successors, (1412), 10 states have internal predecessors, (1412), 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 23:23:38,920 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 23:23:38,921 INFO L221 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-14 23:23:38,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-14 23:23:38,921 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 23:23:38,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 23:23:38,921 INFO L85 PathProgramCache]: Analyzing trace with hash 549433760, now seen corresponding path program 4 times [2025-03-14 23:23:38,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 23:23:38,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037622083] [2025-03-14 23:23:38,922 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-14 23:23:38,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 23:23:38,938 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2025-03-14 23:23:38,938 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 23:23:39,091 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-14 23:23:39,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 23:23:39,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037622083] [2025-03-14 23:23:39,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037622083] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 23:23:39,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1497519531] [2025-03-14 23:23:39,092 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-14 23:23:39,092 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 23:23:39,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 23:23:39,095 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 23:23:39,095 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 23:23:39,165 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2025-03-14 23:23:39,165 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 23:23:39,167 INFO L256 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-14 23:23:39,169 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 23:23:39,344 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-14 23:23:39,345 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 23:23:39,553 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-14 23:23:39,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1497519531] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-14 23:23:39,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-14 23:23:39,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [12, 11] total 27 [2025-03-14 23:23:39,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150339185] [2025-03-14 23:23:39,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 23:23:39,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-14 23:23:39,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 23:23:39,554 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-14 23:23:39,555 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=561, Unknown=0, NotChecked=0, Total=702 [2025-03-14 23:23:39,555 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 180 [2025-03-14 23:23:39,559 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 291 places, 5225 transitions, 96707 flow. Second operand has 11 states, 11 states have (on average 123.54545454545455) internal successors, (1359), 11 states have internal predecessors, (1359), 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 23:23:39,559 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 23:23:39,559 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 180 [2025-03-14 23:23:39,559 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 23:24:02,156 INFO L124 PetriNetUnfolderBase]: 34656/58033 cut-off events. [2025-03-14 23:24:02,157 INFO L125 PetriNetUnfolderBase]: For 518310/530097 co-relation queries the response was YES. [2025-03-14 23:24:02,427 INFO L83 FinitePrefix]: Finished finitePrefix Result has 444942 conditions, 58033 events. 34656/58033 cut-off events. For 518310/530097 co-relation queries the response was YES. Maximal size of possible extension queue 956. Compared 457723 event pairs, 2948 based on Foata normal form. 159/53701 useless extension candidates. Maximal degree in co-relation 307278. Up to 33123 conditions per place. [2025-03-14 23:24:02,773 INFO L140 encePairwiseOnDemand]: 152/180 looper letters, 3242 selfloop transitions, 65 changer transitions 2959/7343 dead transitions. [2025-03-14 23:24:02,774 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 304 places, 7343 transitions, 154085 flow [2025-03-14 23:24:02,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-14 23:24:02,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-14 23:24:02,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1808 transitions. [2025-03-14 23:24:02,776 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7174603174603175 [2025-03-14 23:24:02,776 INFO L298 CegarLoopForPetriNet]: 179 programPoint places, 125 predicate places. [2025-03-14 23:24:02,776 INFO L471 AbstractCegarLoop]: Abstraction has has 304 places, 7343 transitions, 154085 flow [2025-03-14 23:24:02,776 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 123.54545454545455) internal successors, (1359), 11 states have internal predecessors, (1359), 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 23:24:02,776 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 23:24:02,777 INFO L221 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-14 23:24:02,783 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-14 23:24:02,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 23:24:02,977 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 23:24:02,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 23:24:02,978 INFO L85 PathProgramCache]: Analyzing trace with hash -1466284413, now seen corresponding path program 5 times [2025-03-14 23:24:02,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 23:24:02,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23895589] [2025-03-14 23:24:02,978 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-14 23:24:02,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 23:24:02,996 INFO L229 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-03-14 23:24:02,996 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 23:24:03,093 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-14 23:24:03,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 23:24:03,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23895589] [2025-03-14 23:24:03,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23895589] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 23:24:03,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1188191433] [2025-03-14 23:24:03,094 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-14 23:24:03,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 23:24:03,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 23:24:03,096 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 23:24:03,097 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 23:24:03,183 INFO L229 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-03-14 23:24:03,184 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 23:24:03,185 INFO L256 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-14 23:24:03,187 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 23:24:03,306 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-14 23:24:03,306 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 23:24:03,387 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-14 23:24:03,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1188191433] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 23:24:03,387 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 23:24:03,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2025-03-14 23:24:03,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932977123] [2025-03-14 23:24:03,387 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 23:24:03,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-14 23:24:03,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 23:24:03,388 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-14 23:24:03,388 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2025-03-14 23:24:03,389 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 180 [2025-03-14 23:24:03,390 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 304 places, 7343 transitions, 154085 flow. Second operand has 17 states, 17 states have (on average 141.1764705882353) internal successors, (2400), 17 states have internal predecessors, (2400), 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 23:24:03,390 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 23:24:03,390 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 180 [2025-03-14 23:24:03,390 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 23:24:55,475 INFO L124 PetriNetUnfolderBase]: 49810/82409 cut-off events. [2025-03-14 23:24:55,475 INFO L125 PetriNetUnfolderBase]: For 744461/766182 co-relation queries the response was YES. [2025-03-14 23:24:55,888 INFO L83 FinitePrefix]: Finished finitePrefix Result has 693860 conditions, 82409 events. 49810/82409 cut-off events. For 744461/766182 co-relation queries the response was YES. Maximal size of possible extension queue 1392. Compared 667835 event pairs, 953 based on Foata normal form. 539/77293 useless extension candidates. Maximal degree in co-relation 470820. Up to 46311 conditions per place. [2025-03-14 23:24:56,476 INFO L140 encePairwiseOnDemand]: 161/180 looper letters, 9438 selfloop transitions, 2767 changer transitions 5896/18247 dead transitions. [2025-03-14 23:24:56,477 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 462 places, 18247 transitions, 395584 flow [2025-03-14 23:24:56,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 159 states. [2025-03-14 23:24:56,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2025-03-14 23:24:56,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 23074 transitions. [2025-03-14 23:24:56,487 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.806219426974144 [2025-03-14 23:24:56,488 INFO L298 CegarLoopForPetriNet]: 179 programPoint places, 283 predicate places. [2025-03-14 23:24:56,488 INFO L471 AbstractCegarLoop]: Abstraction has has 462 places, 18247 transitions, 395584 flow [2025-03-14 23:24:56,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 141.1764705882353) internal successors, (2400), 17 states have internal predecessors, (2400), 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 23:24:56,488 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 23:24:56,489 INFO L221 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-14 23:24:56,495 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 23:24:56,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-14 23:24:56,689 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 23:24:56,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 23:24:56,691 INFO L85 PathProgramCache]: Analyzing trace with hash -1701788462, now seen corresponding path program 6 times [2025-03-14 23:24:56,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 23:24:56,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315832884] [2025-03-14 23:24:56,691 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-14 23:24:56,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 23:24:56,703 INFO L229 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-14 23:24:56,704 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 23:24:56,751 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-14 23:24:56,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 23:24:56,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315832884] [2025-03-14 23:24:56,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315832884] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 23:24:56,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2042854451] [2025-03-14 23:24:56,752 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-14 23:24:56,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 23:24:56,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 23:24:56,754 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 23:24:56,755 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 23:24:56,824 INFO L229 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-14 23:24:56,824 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 23:24:56,826 INFO L256 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-14 23:24:56,827 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 23:24:56,871 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-14 23:24:56,871 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 23:24:56,929 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-14 23:24:56,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2042854451] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 23:24:56,930 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 23:24:56,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 7 [2025-03-14 23:24:56,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745104710] [2025-03-14 23:24:56,930 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 23:24:56,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-14 23:24:56,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 23:24:56,931 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-14 23:24:56,931 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-14 23:24:56,931 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 180 [2025-03-14 23:24:56,934 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 462 places, 18247 transitions, 395584 flow. Second operand has 7 states, 7 states have (on average 147.57142857142858) internal successors, (1033), 7 states have internal predecessors, (1033), 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 23:24:56,934 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 23:24:56,934 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 180 [2025-03-14 23:24:56,934 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 23:28:04,327 INFO L124 PetriNetUnfolderBase]: 49002/80675 cut-off events. [2025-03-14 23:28:04,327 INFO L125 PetriNetUnfolderBase]: For 824091/844600 co-relation queries the response was YES. [2025-03-14 23:28:04,738 INFO L83 FinitePrefix]: Finished finitePrefix Result has 741128 conditions, 80675 events. 49002/80675 cut-off events. For 824091/844600 co-relation queries the response was YES. Maximal size of possible extension queue 1347. Compared 647875 event pairs, 688 based on Foata normal form. 285/75758 useless extension candidates. Maximal degree in co-relation 500035. Up to 45655 conditions per place. [2025-03-14 23:28:04,951 INFO L140 encePairwiseOnDemand]: 170/180 looper letters, 0 selfloop transitions, 0 changer transitions 21486/21486 dead transitions. [2025-03-14 23:28:04,952 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 471 places, 21486 transitions, 507368 flow [2025-03-14 23:28:04,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-14 23:28:04,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-14 23:28:04,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 2278 transitions. [2025-03-14 23:28:04,953 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8437037037037037 [2025-03-14 23:28:04,954 INFO L298 CegarLoopForPetriNet]: 179 programPoint places, 292 predicate places. [2025-03-14 23:28:04,954 INFO L471 AbstractCegarLoop]: Abstraction has has 471 places, 21486 transitions, 507368 flow [2025-03-14 23:28:04,954 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 147.57142857142858) internal successors, (1033), 7 states have internal predecessors, (1033), 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 23:28:04,960 INFO L161 wickiGriesTestDumper]: Dumping Owicki-Gries test to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/popl20-simple-array-sum.wvr.c_petrified1_AllErrorsAtOnce [2025-03-14 23:28:05,037 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2025-03-14 23:28:05,038 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2025-03-14 23:28:05,038 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2025-03-14 23:28:05,038 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2025-03-14 23:28:05,044 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 23:28:05,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 23:28:05,239 INFO L422 BasicCegarLoop]: Path program histogram: [6, 2, 1, 1, 1, 1, 1] [2025-03-14 23:28:05,243 INFO L328 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-14 23:28:05,243 INFO L188 ceAbstractionStarter]: Computing trace abstraction results [2025-03-14 23:28:05,246 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.03 11:28:05 BasicIcfg [2025-03-14 23:28:05,246 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-14 23:28:05,246 INFO L158 Benchmark]: Toolchain (without parser) took 295725.36ms. Allocated memory was 71.3MB in the beginning and 3.5GB in the end (delta: 3.5GB). Free memory was 44.6MB in the beginning and 1.9GB in the end (delta: -1.8GB). Peak memory consumption was 3.6GB. Max. memory is 8.0GB. [2025-03-14 23:28:05,247 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 71.3MB. Free memory is still 34.5MB. There was no memory consumed. Max. memory is 8.0GB. [2025-03-14 23:28:05,247 INFO L158 Benchmark]: CACSL2BoogieTranslator took 183.49ms. Allocated memory is still 71.3MB. Free memory was 44.5MB in the beginning and 32.5MB in the end (delta: 12.0MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-03-14 23:28:05,247 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.04ms. Allocated memory is still 71.3MB. Free memory was 32.4MB in the beginning and 31.1MB in the end (delta: 1.3MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-03-14 23:28:05,247 INFO L158 Benchmark]: Boogie Preprocessor took 32.38ms. Allocated memory is still 71.3MB. Free memory was 30.9MB in the beginning and 29.8MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 8.0GB. [2025-03-14 23:28:05,247 INFO L158 Benchmark]: RCFGBuilder took 355.71ms. Allocated memory is still 71.3MB. Free memory was 29.8MB in the beginning and 39.4MB in the end (delta: -9.6MB). Peak memory consumption was 11.1MB. Max. memory is 8.0GB. [2025-03-14 23:28:05,248 INFO L158 Benchmark]: TraceAbstraction took 295122.36ms. Allocated memory was 71.3MB in the beginning and 3.5GB in the end (delta: 3.5GB). Free memory was 38.1MB in the beginning and 1.9GB in the end (delta: -1.8GB). Peak memory consumption was 3.6GB. Max. memory is 8.0GB. [2025-03-14 23:28:05,248 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23ms. Allocated memory is still 71.3MB. Free memory is still 34.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 183.49ms. Allocated memory is still 71.3MB. Free memory was 44.5MB in the beginning and 32.5MB in the end (delta: 12.0MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 27.04ms. Allocated memory is still 71.3MB. Free memory was 32.4MB in the beginning and 31.1MB in the end (delta: 1.3MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 32.38ms. Allocated memory is still 71.3MB. Free memory was 30.9MB in the beginning and 29.8MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 355.71ms. Allocated memory is still 71.3MB. Free memory was 29.8MB in the beginning and 39.4MB in the end (delta: -9.6MB). Peak memory consumption was 11.1MB. Max. memory is 8.0GB. * TraceAbstraction took 295122.36ms. Allocated memory was 71.3MB in the beginning and 3.5GB in the end (delta: 3.5GB). Free memory was 38.1MB in the beginning and 1.9GB in the end (delta: -1.8GB). Peak memory consumption was 3.6GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 94]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 213 locations, 4 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 295.0s, OverallIterations: 13, TraceHistogramMax: 2, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 288.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2309 SdHoareTripleChecker+Valid, 4.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2309 mSDsluCounter, 2500 SdHoareTripleChecker+Invalid, 3.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1892 mSDsCounter, 105 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7881 IncrementalHoareTripleChecker+Invalid, 7986 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 105 mSolverCounterUnsat, 608 mSDtfsCounter, 7881 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2599 GetRequests, 2207 SyntacticMatches, 16 SemanticMatches, 376 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11128 ImplicationChecksByTransitivity, 3.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=507368occurred in iteration=13, InterpolantAutomatonStates: 321, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.5s InterpolantComputationTime, 3121 NumberOfCodeBlocks, 2931 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 4136 ConstructedInterpolants, 0 QuantifiedInterpolants, 11056 SizeOfPredicates, 41 NumberOfNonLiveVariables, 2066 ConjunctsInSsa, 46 ConjunctsInUnsatCore, 25 InterpolantComputations, 10 PerfectInterpolantSequences, 329/389 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-14 23:28:05,261 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...