/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-more-sum-array-hom.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.empire2-owicki-f61efc6-m [2025-03-14 23:10:46,850 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-14 23:10:46,901 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:10:46,923 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-14 23:10:46,925 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-14 23:10:46,925 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-14 23:10:46,926 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-14 23:10:46,926 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-14 23:10:46,926 INFO L153 SettingsManager]: * Use SBE=true [2025-03-14 23:10:46,926 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-14 23:10:46,927 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-14 23:10:46,927 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-14 23:10:46,927 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-14 23:10:46,927 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-14 23:10:46,927 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-14 23:10:46,927 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-14 23:10:46,927 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-14 23:10:46,927 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-14 23:10:46,927 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-14 23:10:46,927 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-14 23:10:46,928 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-14 23:10:46,928 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-03-14 23:10:46,928 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-14 23:10:46,928 INFO L153 SettingsManager]: * To the following directory=./dump/ [2025-03-14 23:10:46,928 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-14 23:10:46,928 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-14 23:10:46,928 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-14 23:10:46,928 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-14 23:10:46,928 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-14 23:10:46,928 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-14 23:10:46,928 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-14 23:10:46,928 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-14 23:10:46,928 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:10:47,196 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-14 23:10:47,206 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-14 23:10:47,208 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-14 23:10:47,208 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-14 23:10:47,209 INFO L274 PluginConnector]: CDTParser initialized [2025-03-14 23:10:47,209 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-sum-array-hom.wvr.c [2025-03-14 23:10:48,355 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b1b21f777/60402accb93344098e525903cfa3ec6f/FLAG896c504c5 [2025-03-14 23:10:48,541 INFO L384 CDTParser]: Found 1 translation units. [2025-03-14 23:10:48,542 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-sum-array-hom.wvr.c [2025-03-14 23:10:48,550 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b1b21f777/60402accb93344098e525903cfa3ec6f/FLAG896c504c5 [2025-03-14 23:10:48,927 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b1b21f777/60402accb93344098e525903cfa3ec6f [2025-03-14 23:10:48,928 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-14 23:10:48,929 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-03-14 23:10:48,930 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-14 23:10:48,930 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-14 23:10:48,935 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-14 23:10:48,935 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 11:10:48" (1/1) ... [2025-03-14 23:10:48,936 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@659b8623 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 11:10:48, skipping insertion in model container [2025-03-14 23:10:48,936 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 11:10:48" (1/1) ... [2025-03-14 23:10:48,950 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-14 23:10:49,074 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-more-sum-array-hom.wvr.c[2435,2448] [2025-03-14 23:10:49,083 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 23:10:49,090 INFO L200 MainTranslator]: Completed pre-run [2025-03-14 23:10:49,107 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-more-sum-array-hom.wvr.c[2435,2448] [2025-03-14 23:10:49,110 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 23:10:49,125 INFO L204 MainTranslator]: Completed translation [2025-03-14 23:10:49,125 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 11:10:49 WrapperNode [2025-03-14 23:10:49,125 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-14 23:10:49,126 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-14 23:10:49,126 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-14 23:10:49,126 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-14 23:10:49,130 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:10:49" (1/1) ... [2025-03-14 23:10:49,137 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:10:49" (1/1) ... [2025-03-14 23:10:49,153 INFO L138 Inliner]: procedures = 24, calls = 19, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 84 [2025-03-14 23:10:49,153 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-14 23:10:49,154 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-14 23:10:49,154 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-14 23:10:49,154 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-14 23:10:49,160 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 11:10:49" (1/1) ... [2025-03-14 23:10:49,161 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 11:10:49" (1/1) ... [2025-03-14 23:10:49,167 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 11:10:49" (1/1) ... [2025-03-14 23:10:49,168 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 11:10:49" (1/1) ... [2025-03-14 23:10:49,171 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 11:10:49" (1/1) ... [2025-03-14 23:10:49,172 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 11:10:49" (1/1) ... [2025-03-14 23:10:49,174 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 11:10:49" (1/1) ... [2025-03-14 23:10:49,178 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 11:10:49" (1/1) ... [2025-03-14 23:10:49,179 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 11:10:49" (1/1) ... [2025-03-14 23:10:49,180 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-14 23:10:49,182 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-03-14 23:10:49,182 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-03-14 23:10:49,182 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-03-14 23:10:49,183 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 11:10:49" (1/1) ... [2025-03-14 23:10:49,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-14 23:10:49,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 23:10:49,208 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:10:49,212 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:10:49,227 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-14 23:10:49,227 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-14 23:10:49,227 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-14 23:10:49,227 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-14 23:10:49,227 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-14 23:10:49,227 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-14 23:10:49,227 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-14 23:10:49,227 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-14 23:10:49,227 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-14 23:10:49,227 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-14 23:10:49,227 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-14 23:10:49,227 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-14 23:10:49,227 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-14 23:10:49,228 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:10:49,294 INFO L234 CfgBuilder]: Building ICFG [2025-03-14 23:10:49,297 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-14 23:10:49,463 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-14 23:10:49,463 INFO L283 CfgBuilder]: Performing block encoding [2025-03-14 23:10:49,475 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-14 23:10:49,475 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-14 23:10:49,476 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.03 11:10:49 BoogieIcfgContainer [2025-03-14 23:10:49,476 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-03-14 23:10:49,480 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-14 23:10:49,480 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-14 23:10:49,483 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-14 23:10:49,484 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.03 11:10:48" (1/3) ... [2025-03-14 23:10:49,484 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38b28686 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 11:10:49, skipping insertion in model container [2025-03-14 23:10:49,484 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 11:10:49" (2/3) ... [2025-03-14 23:10:49,485 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38b28686 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 11:10:49, skipping insertion in model container [2025-03-14 23:10:49,485 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.03 11:10:49" (3/3) ... [2025-03-14 23:10:49,486 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-more-sum-array-hom.wvr.c [2025-03-14 23:10:49,497 INFO L303 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-14 23:10:49,499 INFO L169 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-more-sum-array-hom.wvr.c that has 4 procedures, 143 locations, 1 initial locations, 4 loop locations, and 1 error locations. [2025-03-14 23:10:49,499 INFO L581 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-14 23:10:49,548 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-14 23:10:49,581 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-14 23:10:49,593 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;@60c9f81f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-14 23:10:49,593 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-03-14 23:10:49,637 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-14 23:10:49,637 INFO L124 PetriNetUnfolderBase]: 8/141 cut-off events. [2025-03-14 23:10:49,639 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-14 23:10:49,639 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 23:10:49,639 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] [2025-03-14 23:10:49,640 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:10:49,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 23:10:49,643 INFO L85 PathProgramCache]: Analyzing trace with hash 1364602533, now seen corresponding path program 1 times [2025-03-14 23:10:49,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 23:10:49,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058762775] [2025-03-14 23:10:49,649 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 23:10:49,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 23:10:49,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 23:10:50,448 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:10:50,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 23:10:50,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058762775] [2025-03-14 23:10:50,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058762775] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 23:10:50,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 23:10:50,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-14 23:10:50,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883820486] [2025-03-14 23:10:50,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 23:10:50,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-14 23:10:50,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 23:10:50,477 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-14 23:10:50,477 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-14 23:10:50,482 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 150 [2025-03-14 23:10:50,488 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 150 transitions, 321 flow. Second operand has 7 states, 7 states have (on average 109.71428571428571) internal successors, (768), 7 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:10:50,488 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 23:10:50,488 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 150 [2025-03-14 23:10:50,490 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 23:10:50,756 INFO L124 PetriNetUnfolderBase]: 54/412 cut-off events. [2025-03-14 23:10:50,756 INFO L125 PetriNetUnfolderBase]: For 63/64 co-relation queries the response was YES. [2025-03-14 23:10:50,764 INFO L83 FinitePrefix]: Finished finitePrefix Result has 587 conditions, 412 events. 54/412 cut-off events. For 63/64 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1640 event pairs, 7 based on Foata normal form. 10/382 useless extension candidates. Maximal degree in co-relation 327. Up to 54 conditions per place. [2025-03-14 23:10:50,767 INFO L140 encePairwiseOnDemand]: 132/150 looper letters, 59 selfloop transitions, 9 changer transitions 11/177 dead transitions. [2025-03-14 23:10:50,767 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 177 transitions, 566 flow [2025-03-14 23:10:50,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-14 23:10:50,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-14 23:10:50,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1245 transitions. [2025-03-14 23:10:50,786 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7545454545454545 [2025-03-14 23:10:50,790 INFO L298 CegarLoopForPetriNet]: 152 programPoint places, 2 predicate places. [2025-03-14 23:10:50,790 INFO L471 AbstractCegarLoop]: Abstraction has has 154 places, 177 transitions, 566 flow [2025-03-14 23:10:50,790 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 109.71428571428571) internal successors, (768), 7 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:10:50,790 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 23:10:50,791 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] [2025-03-14 23:10:50,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-14 23:10:50,791 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:10:50,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 23:10:50,792 INFO L85 PathProgramCache]: Analyzing trace with hash 684125221, now seen corresponding path program 1 times [2025-03-14 23:10:50,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 23:10:50,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253561278] [2025-03-14 23:10:50,792 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 23:10:50,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 23:10:50,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 23:10:50,955 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:10:50,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 23:10:50,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253561278] [2025-03-14 23:10:50,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253561278] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 23:10:50,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 23:10:50,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-14 23:10:50,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130856643] [2025-03-14 23:10:50,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 23:10:50,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-14 23:10:50,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 23:10:50,957 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-14 23:10:50,957 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-14 23:10:50,958 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 150 [2025-03-14 23:10:50,959 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 177 transitions, 566 flow. Second operand has 7 states, 7 states have (on average 116.0) internal successors, (812), 7 states have internal predecessors, (812), 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:10:50,959 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 23:10:50,959 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 150 [2025-03-14 23:10:50,959 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 23:10:51,164 INFO L124 PetriNetUnfolderBase]: 314/1086 cut-off events. [2025-03-14 23:10:51,165 INFO L125 PetriNetUnfolderBase]: For 462/480 co-relation queries the response was YES. [2025-03-14 23:10:51,173 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2042 conditions, 1086 events. 314/1086 cut-off events. For 462/480 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 6823 event pairs, 115 based on Foata normal form. 1/928 useless extension candidates. Maximal degree in co-relation 1054. Up to 307 conditions per place. [2025-03-14 23:10:51,178 INFO L140 encePairwiseOnDemand]: 137/150 looper letters, 61 selfloop transitions, 14 changer transitions 12/209 dead transitions. [2025-03-14 23:10:51,178 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 209 transitions, 866 flow [2025-03-14 23:10:51,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-14 23:10:51,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-14 23:10:51,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1178 transitions. [2025-03-14 23:10:51,182 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7853333333333333 [2025-03-14 23:10:51,182 INFO L298 CegarLoopForPetriNet]: 152 programPoint places, 11 predicate places. [2025-03-14 23:10:51,182 INFO L471 AbstractCegarLoop]: Abstraction has has 163 places, 209 transitions, 866 flow [2025-03-14 23:10:51,183 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 116.0) internal successors, (812), 7 states have internal predecessors, (812), 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:10:51,183 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 23:10:51,183 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] [2025-03-14 23:10:51,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-14 23:10:51,183 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:10:51,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 23:10:51,185 INFO L85 PathProgramCache]: Analyzing trace with hash -1237421928, now seen corresponding path program 1 times [2025-03-14 23:10:51,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 23:10:51,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398820704] [2025-03-14 23:10:51,185 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 23:10:51,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 23:10:51,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 23:10:51,422 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:10:51,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 23:10:51,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398820704] [2025-03-14 23:10:51,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398820704] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 23:10:51,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 23:10:51,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-14 23:10:51,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542864960] [2025-03-14 23:10:51,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 23:10:51,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-14 23:10:51,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 23:10:51,423 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-14 23:10:51,423 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-03-14 23:10:51,426 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 150 [2025-03-14 23:10:51,427 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 209 transitions, 866 flow. Second operand has 10 states, 10 states have (on average 87.3) internal successors, (873), 10 states have internal predecessors, (873), 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:10:51,427 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 23:10:51,427 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 150 [2025-03-14 23:10:51,427 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 23:10:52,036 INFO L124 PetriNetUnfolderBase]: 1744/3769 cut-off events. [2025-03-14 23:10:52,037 INFO L125 PetriNetUnfolderBase]: For 3821/4124 co-relation queries the response was YES. [2025-03-14 23:10:52,045 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9217 conditions, 3769 events. 1744/3769 cut-off events. For 3821/4124 co-relation queries the response was YES. Maximal size of possible extension queue 265. Compared 29447 event pairs, 1189 based on Foata normal form. 0/2883 useless extension candidates. Maximal degree in co-relation 5979. Up to 2009 conditions per place. [2025-03-14 23:10:52,061 INFO L140 encePairwiseOnDemand]: 132/150 looper letters, 112 selfloop transitions, 19 changer transitions 18/235 dead transitions. [2025-03-14 23:10:52,061 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 235 transitions, 1253 flow [2025-03-14 23:10:52,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-14 23:10:52,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-14 23:10:52,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1253 transitions. [2025-03-14 23:10:52,064 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.5966666666666667 [2025-03-14 23:10:52,065 INFO L298 CegarLoopForPetriNet]: 152 programPoint places, 24 predicate places. [2025-03-14 23:10:52,065 INFO L471 AbstractCegarLoop]: Abstraction has has 176 places, 235 transitions, 1253 flow [2025-03-14 23:10:52,065 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 87.3) internal successors, (873), 10 states have internal predecessors, (873), 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:10:52,065 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 23:10:52,066 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] [2025-03-14 23:10:52,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-14 23:10:52,066 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:10:52,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 23:10:52,067 INFO L85 PathProgramCache]: Analyzing trace with hash -755446567, now seen corresponding path program 1 times [2025-03-14 23:10:52,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 23:10:52,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040491554] [2025-03-14 23:10:52,067 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 23:10:52,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 23:10:52,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 23:10:52,350 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:10:52,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 23:10:52,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040491554] [2025-03-14 23:10:52,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040491554] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 23:10:52,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 23:10:52,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-14 23:10:52,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148817152] [2025-03-14 23:10:52,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 23:10:52,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-14 23:10:52,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 23:10:52,352 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-14 23:10:52,352 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-03-14 23:10:52,353 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 150 [2025-03-14 23:10:52,356 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 235 transitions, 1253 flow. Second operand has 10 states, 10 states have (on average 88.2) internal successors, (882), 10 states have internal predecessors, (882), 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:10:52,356 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 23:10:52,356 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 150 [2025-03-14 23:10:52,356 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 23:10:53,071 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([374] thread1EXIT-->L85-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][194], [189#true, 172#true, 15#L56-4true, thread2Thread1of1ForFork1InUse, thread3Thread1of1ForFork2InUse, thread1Thread1of1ForFork0NotInUse, 46#L64-4true, 218#true, 155#true, 54#L85-1true]) [2025-03-14 23:10:53,071 INFO L294 olderBase$Statistics]: this new event has 115 ancestors and is cut-off event [2025-03-14 23:10:53,071 INFO L297 olderBase$Statistics]: existing Event has 115 ancestors and is cut-off event [2025-03-14 23:10:53,071 INFO L297 olderBase$Statistics]: existing Event has 115 ancestors and is cut-off event [2025-03-14 23:10:53,071 INFO L297 olderBase$Statistics]: existing Event has 115 ancestors and is cut-off event [2025-03-14 23:10:53,085 INFO L124 PetriNetUnfolderBase]: 2204/4526 cut-off events. [2025-03-14 23:10:53,085 INFO L125 PetriNetUnfolderBase]: For 8392/9438 co-relation queries the response was YES. [2025-03-14 23:10:53,098 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13502 conditions, 4526 events. 2204/4526 cut-off events. For 8392/9438 co-relation queries the response was YES. Maximal size of possible extension queue 309. Compared 36196 event pairs, 1382 based on Foata normal form. 2/3438 useless extension candidates. Maximal degree in co-relation 11853. Up to 2469 conditions per place. [2025-03-14 23:10:53,122 INFO L140 encePairwiseOnDemand]: 133/150 looper letters, 86 selfloop transitions, 10 changer transitions 58/239 dead transitions. [2025-03-14 23:10:53,123 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 239 transitions, 1602 flow [2025-03-14 23:10:53,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-14 23:10:53,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-14 23:10:53,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1265 transitions. [2025-03-14 23:10:53,126 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6023809523809524 [2025-03-14 23:10:53,128 INFO L298 CegarLoopForPetriNet]: 152 programPoint places, 37 predicate places. [2025-03-14 23:10:53,128 INFO L471 AbstractCegarLoop]: Abstraction has has 189 places, 239 transitions, 1602 flow [2025-03-14 23:10:53,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 88.2) internal successors, (882), 10 states have internal predecessors, (882), 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:10:53,129 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 23:10:53,129 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] [2025-03-14 23:10:53,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-14 23:10:53,130 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:10:53,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 23:10:53,131 INFO L85 PathProgramCache]: Analyzing trace with hash -307189646, now seen corresponding path program 1 times [2025-03-14 23:10:53,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 23:10:53,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107835643] [2025-03-14 23:10:53,131 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 23:10:53,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 23:10:53,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 23:10:53,332 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:10:53,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 23:10:53,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107835643] [2025-03-14 23:10:53,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107835643] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 23:10:53,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [64809829] [2025-03-14 23:10:53,332 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 23:10:53,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 23:10:53,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 23:10:53,335 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:10:53,337 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:10:53,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 23:10:53,430 INFO L256 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-14 23:10:53,436 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 23:10:53,620 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:10:53,620 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 23:10:53,823 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:10:53,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [64809829] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-14 23:10:53,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-14 23:10:53,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10, 9] total 19 [2025-03-14 23:10:53,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278458451] [2025-03-14 23:10:53,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 23:10:53,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-14 23:10:53,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 23:10:53,825 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-14 23:10:53,825 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2025-03-14 23:10:53,826 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 150 [2025-03-14 23:10:53,827 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 239 transitions, 1602 flow. Second operand has 9 states, 9 states have (on average 106.77777777777777) internal successors, (961), 9 states have internal predecessors, (961), 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:10:53,827 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 23:10:53,827 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 150 [2025-03-14 23:10:53,828 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 23:10:54,448 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([331] L48-5-->L48-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[][184], [189#true, 172#true, 2#L64-5true, thread2Thread1of1ForFork1InUse, thread3Thread1of1ForFork2InUse, thread1Thread1of1ForFork0InUse, 66#L84-4true, 43#L48-6true, 218#true, 155#true, 990#(and (or (< thread3Thread1of1ForFork2_~i~2 ~N~0) (< 0 ~M~0)) (<= 1 ~N~0) (or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (< thread3Thread1of1ForFork2_~i~2 ~N~0))), 55#L57true]) [2025-03-14 23:10:54,448 INFO L294 olderBase$Statistics]: this new event has 105 ancestors and is cut-off event [2025-03-14 23:10:54,448 INFO L297 olderBase$Statistics]: existing Event has 105 ancestors and is cut-off event [2025-03-14 23:10:54,448 INFO L297 olderBase$Statistics]: existing Event has 98 ancestors and is cut-off event [2025-03-14 23:10:54,448 INFO L297 olderBase$Statistics]: existing Event has 98 ancestors and is cut-off event [2025-03-14 23:10:54,449 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([332] L48-5-->L49: 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[][185], [60#L49true, 189#true, 172#true, 2#L64-5true, thread2Thread1of1ForFork1InUse, thread3Thread1of1ForFork2InUse, thread1Thread1of1ForFork0InUse, 66#L84-4true, 218#true, 155#true, 990#(and (or (< thread3Thread1of1ForFork2_~i~2 ~N~0) (< 0 ~M~0)) (<= 1 ~N~0) (or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (< thread3Thread1of1ForFork2_~i~2 ~N~0))), 55#L57true]) [2025-03-14 23:10:54,449 INFO L294 olderBase$Statistics]: this new event has 105 ancestors and is cut-off event [2025-03-14 23:10:54,449 INFO L297 olderBase$Statistics]: existing Event has 105 ancestors and is cut-off event [2025-03-14 23:10:54,449 INFO L297 olderBase$Statistics]: existing Event has 98 ancestors and is cut-off event [2025-03-14 23:10:54,449 INFO L297 olderBase$Statistics]: existing Event has 98 ancestors and is cut-off event [2025-03-14 23:10:54,449 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([357] L64-5-->L64-6: Formula: (<= v_~N~0_4 v_thread3Thread1of1ForFork2_~i~2_3) InVars {thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_3, ~N~0=v_~N~0_4} OutVars{thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_3, ~N~0=v_~N~0_4} AuxVars[] AssignedVars[][186], [34#L48-4true, 189#true, 227#(<= ~N~0 thread3Thread1of1ForFork2_~i~2), 172#true, 20#L64-6true, thread2Thread1of1ForFork1InUse, thread3Thread1of1ForFork2InUse, thread1Thread1of1ForFork0InUse, 66#L84-4true, 155#true, 990#(and (or (< thread3Thread1of1ForFork2_~i~2 ~N~0) (< 0 ~M~0)) (<= 1 ~N~0) (or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (< thread3Thread1of1ForFork2_~i~2 ~N~0))), 55#L57true]) [2025-03-14 23:10:54,449 INFO L294 olderBase$Statistics]: this new event has 104 ancestors and is cut-off event [2025-03-14 23:10:54,449 INFO L297 olderBase$Statistics]: existing Event has 97 ancestors and is cut-off event [2025-03-14 23:10:54,449 INFO L297 olderBase$Statistics]: existing Event has 104 ancestors and is cut-off event [2025-03-14 23:10:54,449 INFO L297 olderBase$Statistics]: existing Event has 97 ancestors and is cut-off event [2025-03-14 23:10:54,450 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([358] L64-5-->L65: Formula: (< v_thread3Thread1of1ForFork2_~i~2_5 v_~N~0_3) InVars {thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_5, ~N~0=v_~N~0_3} OutVars{thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_5, ~N~0=v_~N~0_3} AuxVars[] AssignedVars[][187], [34#L48-4true, 189#true, 172#true, 988#(and (<= 1 ~N~0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), thread2Thread1of1ForFork1InUse, thread3Thread1of1ForFork2InUse, 12#L65true, thread1Thread1of1ForFork0InUse, 66#L84-4true, 218#true, 155#true, 55#L57true]) [2025-03-14 23:10:54,450 INFO L294 olderBase$Statistics]: this new event has 104 ancestors and is cut-off event [2025-03-14 23:10:54,450 INFO L297 olderBase$Statistics]: existing Event has 97 ancestors and is cut-off event [2025-03-14 23:10:54,450 INFO L297 olderBase$Statistics]: existing Event has 104 ancestors and is cut-off event [2025-03-14 23:10:54,450 INFO L297 olderBase$Statistics]: existing Event has 97 ancestors and is cut-off event [2025-03-14 23:10:54,450 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([357] L64-5-->L64-6: Formula: (<= v_~N~0_4 v_thread3Thread1of1ForFork2_~i~2_3) InVars {thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_3, ~N~0=v_~N~0_4} OutVars{thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_3, ~N~0=v_~N~0_4} AuxVars[] AssignedVars[][186], [146#L48-3true, 189#true, 227#(<= ~N~0 thread3Thread1of1ForFork2_~i~2), 172#true, 20#L64-6true, thread2Thread1of1ForFork1InUse, thread3Thread1of1ForFork2InUse, thread1Thread1of1ForFork0InUse, 66#L84-4true, 155#true, 990#(and (or (< thread3Thread1of1ForFork2_~i~2 ~N~0) (< 0 ~M~0)) (<= 1 ~N~0) (or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (< thread3Thread1of1ForFork2_~i~2 ~N~0))), 55#L57true]) [2025-03-14 23:10:54,450 INFO L294 olderBase$Statistics]: this new event has 103 ancestors and is cut-off event [2025-03-14 23:10:54,450 INFO L297 olderBase$Statistics]: existing Event has 103 ancestors and is cut-off event [2025-03-14 23:10:54,450 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2025-03-14 23:10:54,450 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2025-03-14 23:10:54,450 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([358] L64-5-->L65: Formula: (< v_thread3Thread1of1ForFork2_~i~2_5 v_~N~0_3) InVars {thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_5, ~N~0=v_~N~0_3} OutVars{thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_5, ~N~0=v_~N~0_3} AuxVars[] AssignedVars[][187], [146#L48-3true, 189#true, 988#(and (<= 1 ~N~0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), 172#true, thread2Thread1of1ForFork1InUse, thread3Thread1of1ForFork2InUse, 12#L65true, thread1Thread1of1ForFork0InUse, 66#L84-4true, 218#true, 155#true, 55#L57true]) [2025-03-14 23:10:54,450 INFO L294 olderBase$Statistics]: this new event has 103 ancestors and is cut-off event [2025-03-14 23:10:54,451 INFO L297 olderBase$Statistics]: existing Event has 103 ancestors and is cut-off event [2025-03-14 23:10:54,451 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2025-03-14 23:10:54,451 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2025-03-14 23:10:54,535 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([331] L48-5-->L48-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[][184], [189#true, 172#true, 2#L64-5true, thread2Thread1of1ForFork1InUse, thread3Thread1of1ForFork2InUse, thread1Thread1of1ForFork0InUse, 66#L84-4true, 43#L48-6true, 218#true, 155#true, 990#(and (or (< thread3Thread1of1ForFork2_~i~2 ~N~0) (< 0 ~M~0)) (<= 1 ~N~0) (or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (< thread3Thread1of1ForFork2_~i~2 ~N~0))), 55#L57true]) [2025-03-14 23:10:54,535 INFO L294 olderBase$Statistics]: this new event has 105 ancestors and is cut-off event [2025-03-14 23:10:54,535 INFO L297 olderBase$Statistics]: existing Event has 105 ancestors and is cut-off event [2025-03-14 23:10:54,536 INFO L297 olderBase$Statistics]: existing Event has 105 ancestors and is cut-off event [2025-03-14 23:10:54,536 INFO L297 olderBase$Statistics]: existing Event has 98 ancestors and is cut-off event [2025-03-14 23:10:54,536 INFO L297 olderBase$Statistics]: existing Event has 98 ancestors and is cut-off event [2025-03-14 23:10:54,536 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([332] L48-5-->L49: 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[][185], [60#L49true, 189#true, 172#true, 2#L64-5true, thread2Thread1of1ForFork1InUse, thread3Thread1of1ForFork2InUse, thread1Thread1of1ForFork0InUse, 66#L84-4true, 218#true, 155#true, 990#(and (or (< thread3Thread1of1ForFork2_~i~2 ~N~0) (< 0 ~M~0)) (<= 1 ~N~0) (or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (< thread3Thread1of1ForFork2_~i~2 ~N~0))), 55#L57true]) [2025-03-14 23:10:54,536 INFO L294 olderBase$Statistics]: this new event has 105 ancestors and is cut-off event [2025-03-14 23:10:54,536 INFO L297 olderBase$Statistics]: existing Event has 105 ancestors and is cut-off event [2025-03-14 23:10:54,536 INFO L297 olderBase$Statistics]: existing Event has 105 ancestors and is cut-off event [2025-03-14 23:10:54,536 INFO L297 olderBase$Statistics]: existing Event has 98 ancestors and is cut-off event [2025-03-14 23:10:54,536 INFO L297 olderBase$Statistics]: existing Event has 98 ancestors and is cut-off event [2025-03-14 23:10:54,536 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([357] L64-5-->L64-6: Formula: (<= v_~N~0_4 v_thread3Thread1of1ForFork2_~i~2_3) InVars {thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_3, ~N~0=v_~N~0_4} OutVars{thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_3, ~N~0=v_~N~0_4} AuxVars[] AssignedVars[][186], [34#L48-4true, 189#true, 227#(<= ~N~0 thread3Thread1of1ForFork2_~i~2), 172#true, 20#L64-6true, thread2Thread1of1ForFork1InUse, thread3Thread1of1ForFork2InUse, thread1Thread1of1ForFork0InUse, 66#L84-4true, 155#true, 990#(and (or (< thread3Thread1of1ForFork2_~i~2 ~N~0) (< 0 ~M~0)) (<= 1 ~N~0) (or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (< thread3Thread1of1ForFork2_~i~2 ~N~0))), 55#L57true]) [2025-03-14 23:10:54,536 INFO L294 olderBase$Statistics]: this new event has 104 ancestors and is cut-off event [2025-03-14 23:10:54,536 INFO L297 olderBase$Statistics]: existing Event has 97 ancestors and is cut-off event [2025-03-14 23:10:54,536 INFO L297 olderBase$Statistics]: existing Event has 104 ancestors and is cut-off event [2025-03-14 23:10:54,536 INFO L297 olderBase$Statistics]: existing Event has 104 ancestors and is cut-off event [2025-03-14 23:10:54,537 INFO L297 olderBase$Statistics]: existing Event has 97 ancestors and is cut-off event [2025-03-14 23:10:54,537 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([358] L64-5-->L65: Formula: (< v_thread3Thread1of1ForFork2_~i~2_5 v_~N~0_3) InVars {thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_5, ~N~0=v_~N~0_3} OutVars{thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_5, ~N~0=v_~N~0_3} AuxVars[] AssignedVars[][187], [34#L48-4true, 189#true, 988#(and (<= 1 ~N~0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), 172#true, thread2Thread1of1ForFork1InUse, thread3Thread1of1ForFork2InUse, 12#L65true, thread1Thread1of1ForFork0InUse, 66#L84-4true, 218#true, 155#true, 55#L57true]) [2025-03-14 23:10:54,537 INFO L294 olderBase$Statistics]: this new event has 104 ancestors and is cut-off event [2025-03-14 23:10:54,537 INFO L297 olderBase$Statistics]: existing Event has 97 ancestors and is cut-off event [2025-03-14 23:10:54,537 INFO L297 olderBase$Statistics]: existing Event has 104 ancestors and is cut-off event [2025-03-14 23:10:54,537 INFO L297 olderBase$Statistics]: existing Event has 104 ancestors and is cut-off event [2025-03-14 23:10:54,538 INFO L297 olderBase$Statistics]: existing Event has 97 ancestors and is cut-off event [2025-03-14 23:10:54,539 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([331] L48-5-->L48-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[][184], [189#true, 172#true, 90#L57-1true, 2#L64-5true, thread2Thread1of1ForFork1InUse, thread3Thread1of1ForFork2InUse, thread1Thread1of1ForFork0InUse, 66#L84-4true, 43#L48-6true, 218#true, 155#true, 990#(and (or (< thread3Thread1of1ForFork2_~i~2 ~N~0) (< 0 ~M~0)) (<= 1 ~N~0) (or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (< thread3Thread1of1ForFork2_~i~2 ~N~0)))]) [2025-03-14 23:10:54,539 INFO L294 olderBase$Statistics]: this new event has 106 ancestors and is cut-off event [2025-03-14 23:10:54,539 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2025-03-14 23:10:54,539 INFO L297 olderBase$Statistics]: existing Event has 99 ancestors and is cut-off event [2025-03-14 23:10:54,539 INFO L297 olderBase$Statistics]: existing Event has 99 ancestors and is cut-off event [2025-03-14 23:10:54,539 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([332] L48-5-->L49: 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[][185], [60#L49true, 189#true, 172#true, 90#L57-1true, 2#L64-5true, thread2Thread1of1ForFork1InUse, thread3Thread1of1ForFork2InUse, thread1Thread1of1ForFork0InUse, 66#L84-4true, 218#true, 155#true, 990#(and (or (< thread3Thread1of1ForFork2_~i~2 ~N~0) (< 0 ~M~0)) (<= 1 ~N~0) (or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (< thread3Thread1of1ForFork2_~i~2 ~N~0)))]) [2025-03-14 23:10:54,539 INFO L294 olderBase$Statistics]: this new event has 106 ancestors and is cut-off event [2025-03-14 23:10:54,539 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2025-03-14 23:10:54,539 INFO L297 olderBase$Statistics]: existing Event has 99 ancestors and is cut-off event [2025-03-14 23:10:54,539 INFO L297 olderBase$Statistics]: existing Event has 99 ancestors and is cut-off event [2025-03-14 23:10:54,539 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([357] L64-5-->L64-6: Formula: (<= v_~N~0_4 v_thread3Thread1of1ForFork2_~i~2_3) InVars {thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_3, ~N~0=v_~N~0_4} OutVars{thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_3, ~N~0=v_~N~0_4} AuxVars[] AssignedVars[][186], [34#L48-4true, 227#(<= ~N~0 thread3Thread1of1ForFork2_~i~2), 189#true, 172#true, 20#L64-6true, 90#L57-1true, thread2Thread1of1ForFork1InUse, thread3Thread1of1ForFork2InUse, thread1Thread1of1ForFork0InUse, 66#L84-4true, 155#true, 990#(and (or (< thread3Thread1of1ForFork2_~i~2 ~N~0) (< 0 ~M~0)) (<= 1 ~N~0) (or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (< thread3Thread1of1ForFork2_~i~2 ~N~0)))]) [2025-03-14 23:10:54,539 INFO L294 olderBase$Statistics]: this new event has 105 ancestors and is cut-off event [2025-03-14 23:10:54,539 INFO L297 olderBase$Statistics]: existing Event has 98 ancestors and is cut-off event [2025-03-14 23:10:54,539 INFO L297 olderBase$Statistics]: existing Event has 105 ancestors and is cut-off event [2025-03-14 23:10:54,539 INFO L297 olderBase$Statistics]: existing Event has 98 ancestors and is cut-off event [2025-03-14 23:10:54,539 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([358] L64-5-->L65: Formula: (< v_thread3Thread1of1ForFork2_~i~2_5 v_~N~0_3) InVars {thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_5, ~N~0=v_~N~0_3} OutVars{thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_5, ~N~0=v_~N~0_3} AuxVars[] AssignedVars[][187], [34#L48-4true, 189#true, 988#(and (<= 1 ~N~0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), 172#true, 90#L57-1true, thread2Thread1of1ForFork1InUse, thread3Thread1of1ForFork2InUse, 12#L65true, thread1Thread1of1ForFork0InUse, 66#L84-4true, 218#true, 155#true]) [2025-03-14 23:10:54,539 INFO L294 olderBase$Statistics]: this new event has 105 ancestors and is cut-off event [2025-03-14 23:10:54,539 INFO L297 olderBase$Statistics]: existing Event has 98 ancestors and is cut-off event [2025-03-14 23:10:54,539 INFO L297 olderBase$Statistics]: existing Event has 105 ancestors and is cut-off event [2025-03-14 23:10:54,539 INFO L297 olderBase$Statistics]: existing Event has 98 ancestors and is cut-off event [2025-03-14 23:10:54,539 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([357] L64-5-->L64-6: Formula: (<= v_~N~0_4 v_thread3Thread1of1ForFork2_~i~2_3) InVars {thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_3, ~N~0=v_~N~0_4} OutVars{thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_3, ~N~0=v_~N~0_4} AuxVars[] AssignedVars[][186], [146#L48-3true, 227#(<= ~N~0 thread3Thread1of1ForFork2_~i~2), 189#true, 172#true, 20#L64-6true, 90#L57-1true, thread2Thread1of1ForFork1InUse, thread3Thread1of1ForFork2InUse, thread1Thread1of1ForFork0InUse, 66#L84-4true, 155#true, 990#(and (or (< thread3Thread1of1ForFork2_~i~2 ~N~0) (< 0 ~M~0)) (<= 1 ~N~0) (or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (< thread3Thread1of1ForFork2_~i~2 ~N~0)))]) [2025-03-14 23:10:54,540 INFO L294 olderBase$Statistics]: this new event has 104 ancestors and is cut-off event [2025-03-14 23:10:54,540 INFO L297 olderBase$Statistics]: existing Event has 104 ancestors and is cut-off event [2025-03-14 23:10:54,540 INFO L297 olderBase$Statistics]: existing Event has 97 ancestors and is cut-off event [2025-03-14 23:10:54,540 INFO L297 olderBase$Statistics]: existing Event has 97 ancestors and is cut-off event [2025-03-14 23:10:54,540 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([358] L64-5-->L65: Formula: (< v_thread3Thread1of1ForFork2_~i~2_5 v_~N~0_3) InVars {thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_5, ~N~0=v_~N~0_3} OutVars{thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_5, ~N~0=v_~N~0_3} AuxVars[] AssignedVars[][187], [146#L48-3true, 189#true, 988#(and (<= 1 ~N~0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), 172#true, 90#L57-1true, thread2Thread1of1ForFork1InUse, thread3Thread1of1ForFork2InUse, 12#L65true, thread1Thread1of1ForFork0InUse, 66#L84-4true, 218#true, 155#true]) [2025-03-14 23:10:54,540 INFO L294 olderBase$Statistics]: this new event has 104 ancestors and is cut-off event [2025-03-14 23:10:54,540 INFO L297 olderBase$Statistics]: existing Event has 97 ancestors and is cut-off event [2025-03-14 23:10:54,540 INFO L297 olderBase$Statistics]: existing Event has 104 ancestors and is cut-off event [2025-03-14 23:10:54,540 INFO L297 olderBase$Statistics]: existing Event has 97 ancestors and is cut-off event [2025-03-14 23:10:54,562 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([331] L48-5-->L48-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[][184], [189#true, 172#true, 2#L64-5true, 90#L57-1true, thread2Thread1of1ForFork1InUse, thread3Thread1of1ForFork2InUse, thread1Thread1of1ForFork0InUse, 66#L84-4true, 43#L48-6true, 218#true, 155#true, 990#(and (or (< thread3Thread1of1ForFork2_~i~2 ~N~0) (< 0 ~M~0)) (<= 1 ~N~0) (or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (< thread3Thread1of1ForFork2_~i~2 ~N~0)))]) [2025-03-14 23:10:54,562 INFO L294 olderBase$Statistics]: this new event has 106 ancestors and is cut-off event [2025-03-14 23:10:54,562 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2025-03-14 23:10:54,562 INFO L297 olderBase$Statistics]: existing Event has 99 ancestors and is cut-off event [2025-03-14 23:10:54,562 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2025-03-14 23:10:54,562 INFO L297 olderBase$Statistics]: existing Event has 99 ancestors and is cut-off event [2025-03-14 23:10:54,563 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([332] L48-5-->L49: 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[][185], [60#L49true, 189#true, 172#true, 2#L64-5true, 90#L57-1true, thread2Thread1of1ForFork1InUse, thread3Thread1of1ForFork2InUse, thread1Thread1of1ForFork0InUse, 66#L84-4true, 218#true, 155#true, 990#(and (or (< thread3Thread1of1ForFork2_~i~2 ~N~0) (< 0 ~M~0)) (<= 1 ~N~0) (or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (< thread3Thread1of1ForFork2_~i~2 ~N~0)))]) [2025-03-14 23:10:54,563 INFO L294 olderBase$Statistics]: this new event has 106 ancestors and is cut-off event [2025-03-14 23:10:54,563 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2025-03-14 23:10:54,563 INFO L297 olderBase$Statistics]: existing Event has 99 ancestors and is cut-off event [2025-03-14 23:10:54,563 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2025-03-14 23:10:54,563 INFO L297 olderBase$Statistics]: existing Event has 99 ancestors and is cut-off event [2025-03-14 23:10:54,563 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([357] L64-5-->L64-6: Formula: (<= v_~N~0_4 v_thread3Thread1of1ForFork2_~i~2_3) InVars {thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_3, ~N~0=v_~N~0_4} OutVars{thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_3, ~N~0=v_~N~0_4} AuxVars[] AssignedVars[][186], [34#L48-4true, 227#(<= ~N~0 thread3Thread1of1ForFork2_~i~2), 189#true, 172#true, 20#L64-6true, 90#L57-1true, thread2Thread1of1ForFork1InUse, thread3Thread1of1ForFork2InUse, thread1Thread1of1ForFork0InUse, 66#L84-4true, 155#true, 990#(and (or (< thread3Thread1of1ForFork2_~i~2 ~N~0) (< 0 ~M~0)) (<= 1 ~N~0) (or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (< thread3Thread1of1ForFork2_~i~2 ~N~0)))]) [2025-03-14 23:10:54,563 INFO L294 olderBase$Statistics]: this new event has 105 ancestors and is cut-off event [2025-03-14 23:10:54,563 INFO L297 olderBase$Statistics]: existing Event has 98 ancestors and is cut-off event [2025-03-14 23:10:54,563 INFO L297 olderBase$Statistics]: existing Event has 105 ancestors and is cut-off event [2025-03-14 23:10:54,563 INFO L297 olderBase$Statistics]: existing Event has 98 ancestors and is cut-off event [2025-03-14 23:10:54,563 INFO L297 olderBase$Statistics]: existing Event has 105 ancestors and is cut-off event [2025-03-14 23:10:54,563 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([358] L64-5-->L65: Formula: (< v_thread3Thread1of1ForFork2_~i~2_5 v_~N~0_3) InVars {thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_5, ~N~0=v_~N~0_3} OutVars{thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_5, ~N~0=v_~N~0_3} AuxVars[] AssignedVars[][187], [34#L48-4true, 189#true, 172#true, 988#(and (<= 1 ~N~0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), 90#L57-1true, thread2Thread1of1ForFork1InUse, thread3Thread1of1ForFork2InUse, 12#L65true, thread1Thread1of1ForFork0InUse, 66#L84-4true, 218#true, 155#true]) [2025-03-14 23:10:54,563 INFO L294 olderBase$Statistics]: this new event has 105 ancestors and is cut-off event [2025-03-14 23:10:54,563 INFO L297 olderBase$Statistics]: existing Event has 98 ancestors and is cut-off event [2025-03-14 23:10:54,563 INFO L297 olderBase$Statistics]: existing Event has 105 ancestors and is cut-off event [2025-03-14 23:10:54,563 INFO L297 olderBase$Statistics]: existing Event has 98 ancestors and is cut-off event [2025-03-14 23:10:54,563 INFO L297 olderBase$Statistics]: existing Event has 105 ancestors and is cut-off event [2025-03-14 23:10:54,660 INFO L124 PetriNetUnfolderBase]: 4044/7536 cut-off events. [2025-03-14 23:10:54,660 INFO L125 PetriNetUnfolderBase]: For 15625/18749 co-relation queries the response was YES. [2025-03-14 23:10:54,679 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27772 conditions, 7536 events. 4044/7536 cut-off events. For 15625/18749 co-relation queries the response was YES. Maximal size of possible extension queue 458. Compared 58500 event pairs, 813 based on Foata normal form. 30/5765 useless extension candidates. Maximal degree in co-relation 25741. Up to 4541 conditions per place. [2025-03-14 23:10:54,720 INFO L140 encePairwiseOnDemand]: 133/150 looper letters, 131 selfloop transitions, 27 changer transitions 60/331 dead transitions. [2025-03-14 23:10:54,720 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 331 transitions, 2818 flow [2025-03-14 23:10:54,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-14 23:10:54,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-14 23:10:54,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1141 transitions. [2025-03-14 23:10:54,724 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7606666666666667 [2025-03-14 23:10:54,725 INFO L298 CegarLoopForPetriNet]: 152 programPoint places, 46 predicate places. [2025-03-14 23:10:54,725 INFO L471 AbstractCegarLoop]: Abstraction has has 198 places, 331 transitions, 2818 flow [2025-03-14 23:10:54,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 106.77777777777777) internal successors, (961), 9 states have internal predecessors, (961), 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:10:54,726 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 23:10:54,726 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] [2025-03-14 23:10:54,734 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-14 23:10:54,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 23:10:54,930 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:10:54,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 23:10:54,931 INFO L85 PathProgramCache]: Analyzing trace with hash 415156730, now seen corresponding path program 2 times [2025-03-14 23:10:54,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 23:10:54,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753554482] [2025-03-14 23:10:54,931 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 23:10:54,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 23:10:54,948 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 23:10:54,949 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 23:10:55,060 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:10:55,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 23:10:55,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753554482] [2025-03-14 23:10:55,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753554482] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 23:10:55,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [63201710] [2025-03-14 23:10:55,061 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 23:10:55,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 23:10:55,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 23:10:55,063 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:10:55,064 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:10:55,132 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 23:10:55,132 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 23:10:55,133 INFO L256 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-14 23:10:55,135 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 23:10:55,318 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:10:55,319 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 23:10:55,499 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:10:55,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [63201710] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-14 23:10:55,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-14 23:10:55,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10, 9] total 18 [2025-03-14 23:10:55,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073287442] [2025-03-14 23:10:55,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 23:10:55,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-14 23:10:55,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 23:10:55,500 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-14 23:10:55,500 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2025-03-14 23:10:55,501 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 150 [2025-03-14 23:10:55,501 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 331 transitions, 2818 flow. Second operand has 9 states, 9 states have (on average 106.77777777777777) internal successors, (961), 9 states have internal predecessors, (961), 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:10:55,501 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 23:10:55,501 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 150 [2025-03-14 23:10:55,502 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 23:10:56,406 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([331] L48-5-->L48-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[][157], [189#true, 172#true, 66#L84-4true, 43#L48-6true, 218#true, 252#(<= 1 ~N~0), 155#true, 1732#(and (<= (+ ~M~0 1) ~N~0) (<= 1 ~N~0)), thread2Thread1of1ForFork1InUse, 85#L68true, thread3Thread1of1ForFork2InUse, 67#L60true, thread1Thread1of1ForFork0InUse]) [2025-03-14 23:10:56,406 INFO L294 olderBase$Statistics]: this new event has 108 ancestors and is cut-off event [2025-03-14 23:10:56,406 INFO L297 olderBase$Statistics]: existing Event has 101 ancestors and is cut-off event [2025-03-14 23:10:56,406 INFO L297 olderBase$Statistics]: existing Event has 101 ancestors and is cut-off event [2025-03-14 23:10:56,406 INFO L297 olderBase$Statistics]: existing Event has 101 ancestors and is cut-off event [2025-03-14 23:10:56,406 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([332] L48-5-->L49: 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[][158], [60#L49true, 189#true, 172#true, 66#L84-4true, 252#(<= 1 ~N~0), 218#true, 155#true, 1732#(and (<= (+ ~M~0 1) ~N~0) (<= 1 ~N~0)), thread2Thread1of1ForFork1InUse, 85#L68true, thread3Thread1of1ForFork2InUse, 67#L60true, thread1Thread1of1ForFork0InUse]) [2025-03-14 23:10:56,406 INFO L294 olderBase$Statistics]: this new event has 108 ancestors and is cut-off event [2025-03-14 23:10:56,406 INFO L297 olderBase$Statistics]: existing Event has 101 ancestors and is cut-off event [2025-03-14 23:10:56,406 INFO L297 olderBase$Statistics]: existing Event has 101 ancestors and is cut-off event [2025-03-14 23:10:56,406 INFO L297 olderBase$Statistics]: existing Event has 101 ancestors and is cut-off event [2025-03-14 23:10:56,660 INFO L124 PetriNetUnfolderBase]: 5252/9889 cut-off events. [2025-03-14 23:10:56,660 INFO L125 PetriNetUnfolderBase]: For 26740/30713 co-relation queries the response was YES. [2025-03-14 23:10:56,689 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43239 conditions, 9889 events. 5252/9889 cut-off events. For 26740/30713 co-relation queries the response was YES. Maximal size of possible extension queue 558. Compared 81645 event pairs, 804 based on Foata normal form. 184/7832 useless extension candidates. Maximal degree in co-relation 40622. Up to 5956 conditions per place. [2025-03-14 23:10:56,754 INFO L140 encePairwiseOnDemand]: 135/150 looper letters, 307 selfloop transitions, 44 changer transitions 63/527 dead transitions. [2025-03-14 23:10:56,754 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 210 places, 527 transitions, 5767 flow [2025-03-14 23:10:56,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-14 23:10:56,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-14 23:10:56,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1472 transitions. [2025-03-14 23:10:56,760 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7548717948717949 [2025-03-14 23:10:56,761 INFO L298 CegarLoopForPetriNet]: 152 programPoint places, 58 predicate places. [2025-03-14 23:10:56,761 INFO L471 AbstractCegarLoop]: Abstraction has has 210 places, 527 transitions, 5767 flow [2025-03-14 23:10:56,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 106.77777777777777) internal successors, (961), 9 states have internal predecessors, (961), 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:10:56,762 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 23:10:56,762 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] [2025-03-14 23:10:56,769 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-14 23:10:56,962 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,SelfDestructingSolverStorable5 [2025-03-14 23:10:56,962 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:10:56,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 23:10:56,963 INFO L85 PathProgramCache]: Analyzing trace with hash 2136789754, now seen corresponding path program 3 times [2025-03-14 23:10:56,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 23:10:56,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652315793] [2025-03-14 23:10:56,963 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-14 23:10:56,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 23:10:56,992 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-14 23:10:56,993 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 23:10:57,129 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:10:57,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 23:10:57,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652315793] [2025-03-14 23:10:57,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652315793] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 23:10:57,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [864188946] [2025-03-14 23:10:57,130 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-14 23:10:57,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 23:10:57,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 23:10:57,133 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:10:57,135 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:10:57,204 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-14 23:10:57,204 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 23:10:57,205 INFO L256 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-14 23:10:57,208 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 23:10:57,343 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:10:57,344 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 23:10:57,523 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:10:57,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [864188946] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-14 23:10:57,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-14 23:10:57,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10, 9] total 18 [2025-03-14 23:10:57,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461015356] [2025-03-14 23:10:57,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 23:10:57,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-14 23:10:57,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 23:10:57,524 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-14 23:10:57,525 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2025-03-14 23:10:57,525 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 150 [2025-03-14 23:10:57,526 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 527 transitions, 5767 flow. Second operand has 9 states, 9 states have (on average 106.77777777777777) internal successors, (961), 9 states have internal predecessors, (961), 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:10:57,526 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 23:10:57,526 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 150 [2025-03-14 23:10:57,526 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 23:10:58,830 INFO L124 PetriNetUnfolderBase]: 5531/11018 cut-off events. [2025-03-14 23:10:58,830 INFO L125 PetriNetUnfolderBase]: For 35519/40839 co-relation queries the response was YES. [2025-03-14 23:10:58,860 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54616 conditions, 11018 events. 5531/11018 cut-off events. For 35519/40839 co-relation queries the response was YES. Maximal size of possible extension queue 532. Compared 94673 event pairs, 663 based on Foata normal form. 373/9142 useless extension candidates. Maximal degree in co-relation 40338. Up to 6566 conditions per place. [2025-03-14 23:10:58,921 INFO L140 encePairwiseOnDemand]: 135/150 looper letters, 431 selfloop transitions, 69 changer transitions 66/679 dead transitions. [2025-03-14 23:10:58,921 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 679 transitions, 8755 flow [2025-03-14 23:10:58,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-14 23:10:58,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-14 23:10:58,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1242 transitions. [2025-03-14 23:10:58,924 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7527272727272727 [2025-03-14 23:10:58,924 INFO L298 CegarLoopForPetriNet]: 152 programPoint places, 68 predicate places. [2025-03-14 23:10:58,924 INFO L471 AbstractCegarLoop]: Abstraction has has 220 places, 679 transitions, 8755 flow [2025-03-14 23:10:58,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 106.77777777777777) internal successors, (961), 9 states have internal predecessors, (961), 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:10:58,925 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 23:10:58,925 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] [2025-03-14 23:10:58,931 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:10:59,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 23:10:59,129 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:10:59,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 23:10:59,130 INFO L85 PathProgramCache]: Analyzing trace with hash -1841311430, now seen corresponding path program 4 times [2025-03-14 23:10:59,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 23:10:59,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386926130] [2025-03-14 23:10:59,130 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-14 23:10:59,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 23:10:59,142 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2025-03-14 23:10:59,142 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 23:10:59,345 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 23:10:59,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 23:10:59,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386926130] [2025-03-14 23:10:59,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386926130] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 23:10:59,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [976541018] [2025-03-14 23:10:59,346 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-14 23:10:59,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 23:10:59,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 23:10:59,347 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:10:59,349 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:10:59,408 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2025-03-14 23:10:59,408 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 23:10:59,409 INFO L256 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-14 23:10:59,411 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 23:10:59,558 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 23:10:59,558 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 23:10:59,716 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:10:59,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [976541018] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-14 23:10:59,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-14 23:10:59,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [11, 9] total 22 [2025-03-14 23:10:59,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891515747] [2025-03-14 23:10:59,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 23:10:59,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-14 23:10:59,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 23:10:59,717 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-14 23:10:59,717 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=355, Unknown=0, NotChecked=0, Total=462 [2025-03-14 23:10:59,718 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 150 [2025-03-14 23:10:59,719 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 220 places, 679 transitions, 8755 flow. Second operand has 9 states, 9 states have (on average 106.77777777777777) internal successors, (961), 9 states have internal predecessors, (961), 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:10:59,719 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 23:10:59,719 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 150 [2025-03-14 23:10:59,719 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 23:11:01,024 INFO L124 PetriNetUnfolderBase]: 5649/10968 cut-off events. [2025-03-14 23:11:01,024 INFO L125 PetriNetUnfolderBase]: For 47161/61475 co-relation queries the response was YES. [2025-03-14 23:11:01,048 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63409 conditions, 10968 events. 5649/10968 cut-off events. For 47161/61475 co-relation queries the response was YES. Maximal size of possible extension queue 566. Compared 93854 event pairs, 638 based on Foata normal form. 814/9414 useless extension candidates. Maximal degree in co-relation 59955. Up to 6738 conditions per place. [2025-03-14 23:11:01,209 INFO L140 encePairwiseOnDemand]: 132/150 looper letters, 417 selfloop transitions, 86 changer transitions 66/682 dead transitions. [2025-03-14 23:11:01,209 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 230 places, 682 transitions, 9897 flow [2025-03-14 23:11:01,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-14 23:11:01,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-14 23:11:01,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1262 transitions. [2025-03-14 23:11:01,216 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7648484848484849 [2025-03-14 23:11:01,217 INFO L298 CegarLoopForPetriNet]: 152 programPoint places, 78 predicate places. [2025-03-14 23:11:01,219 INFO L471 AbstractCegarLoop]: Abstraction has has 230 places, 682 transitions, 9897 flow [2025-03-14 23:11:01,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 106.77777777777777) internal successors, (961), 9 states have internal predecessors, (961), 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:11:01,220 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 23:11:01,220 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] [2025-03-14 23:11:01,227 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:11:01,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 23:11:01,420 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:11:01,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 23:11:01,421 INFO L85 PathProgramCache]: Analyzing trace with hash 2039736980, now seen corresponding path program 5 times [2025-03-14 23:11:01,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 23:11:01,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506420630] [2025-03-14 23:11:01,421 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-14 23:11:01,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 23:11:01,436 INFO L229 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 23:11:01,436 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 23:11:01,512 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:11:01,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 23:11:01,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506420630] [2025-03-14 23:11:01,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506420630] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 23:11:01,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [292471257] [2025-03-14 23:11:01,513 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-14 23:11:01,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 23:11:01,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 23:11:01,514 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:11:01,516 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:11:01,574 INFO L229 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 23:11:01,574 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 23:11:01,575 INFO L256 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-14 23:11:01,579 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 23:11:01,636 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:11:01,637 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 23:11:01,695 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:11:01,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [292471257] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 23:11:01,695 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 23:11:01,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-03-14 23:11:01,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607365270] [2025-03-14 23:11:01,695 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 23:11:01,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-14 23:11:01,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 23:11:01,696 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-14 23:11:01,696 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2025-03-14 23:11:01,697 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 150 [2025-03-14 23:11:01,698 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 230 places, 682 transitions, 9897 flow. Second operand has 13 states, 13 states have (on average 114.84615384615384) internal successors, (1493), 13 states have internal predecessors, (1493), 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:11:01,698 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 23:11:01,698 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 150 [2025-03-14 23:11:01,698 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 23:11:04,276 INFO L124 PetriNetUnfolderBase]: 11167/21106 cut-off events. [2025-03-14 23:11:04,277 INFO L125 PetriNetUnfolderBase]: For 80701/87560 co-relation queries the response was YES. [2025-03-14 23:11:04,345 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120530 conditions, 21106 events. 11167/21106 cut-off events. For 80701/87560 co-relation queries the response was YES. Maximal size of possible extension queue 1050. Compared 189214 event pairs, 724 based on Foata normal form. 361/18938 useless extension candidates. Maximal degree in co-relation 99284. Up to 10119 conditions per place. [2025-03-14 23:11:04,464 INFO L140 encePairwiseOnDemand]: 135/150 looper letters, 1213 selfloop transitions, 522 changer transitions 79/1940 dead transitions. [2025-03-14 23:11:04,464 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 254 places, 1940 transitions, 30676 flow [2025-03-14 23:11:04,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-14 23:11:04,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2025-03-14 23:11:04,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 3152 transitions. [2025-03-14 23:11:04,470 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8405333333333334 [2025-03-14 23:11:04,471 INFO L298 CegarLoopForPetriNet]: 152 programPoint places, 102 predicate places. [2025-03-14 23:11:04,471 INFO L471 AbstractCegarLoop]: Abstraction has has 254 places, 1940 transitions, 30676 flow [2025-03-14 23:11:04,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 114.84615384615384) internal successors, (1493), 13 states have internal predecessors, (1493), 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:11:04,472 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 23:11:04,472 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] [2025-03-14 23:11:04,482 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-14 23:11:04,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 23:11:04,679 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:11:04,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 23:11:04,679 INFO L85 PathProgramCache]: Analyzing trace with hash 1874279880, now seen corresponding path program 1 times [2025-03-14 23:11:04,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 23:11:04,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170817860] [2025-03-14 23:11:04,679 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 23:11:04,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 23:11:04,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 23:11:04,760 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:11:04,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 23:11:04,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170817860] [2025-03-14 23:11:04,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170817860] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 23:11:04,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [681283127] [2025-03-14 23:11:04,760 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 23:11:04,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 23:11:04,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 23:11:04,762 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:11:04,763 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:11:04,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 23:11:04,817 INFO L256 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-14 23:11:04,818 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 23:11:04,882 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:11:04,882 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 23:11:04,993 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:11:04,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [681283127] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-14 23:11:04,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-14 23:11:04,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 7] total 14 [2025-03-14 23:11:04,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161996078] [2025-03-14 23:11:04,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 23:11:04,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-14 23:11:04,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 23:11:04,994 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-14 23:11:04,994 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2025-03-14 23:11:04,995 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 150 [2025-03-14 23:11:04,995 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 254 places, 1940 transitions, 30676 flow. Second operand has 7 states, 7 states have (on average 116.14285714285714) internal successors, (813), 7 states have internal predecessors, (813), 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:11:04,995 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 23:11:04,995 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 150 [2025-03-14 23:11:04,995 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 23:11:08,008 INFO L124 PetriNetUnfolderBase]: 9585/18070 cut-off events. [2025-03-14 23:11:08,009 INFO L125 PetriNetUnfolderBase]: For 78132/83761 co-relation queries the response was YES. [2025-03-14 23:11:08,078 INFO L83 FinitePrefix]: Finished finitePrefix Result has 107864 conditions, 18070 events. 9585/18070 cut-off events. For 78132/83761 co-relation queries the response was YES. Maximal size of possible extension queue 868. Compared 156887 event pairs, 592 based on Foata normal form. 99/16145 useless extension candidates. Maximal degree in co-relation 99488. Up to 8396 conditions per place. [2025-03-14 23:11:08,209 INFO L140 encePairwiseOnDemand]: 139/150 looper letters, 712 selfloop transitions, 123 changer transitions 57/1878 dead transitions. [2025-03-14 23:11:08,209 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 258 places, 1878 transitions, 31029 flow [2025-03-14 23:11:08,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-14 23:11:08,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-14 23:11:08,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 839 transitions. [2025-03-14 23:11:08,211 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.799047619047619 [2025-03-14 23:11:08,211 INFO L298 CegarLoopForPetriNet]: 152 programPoint places, 106 predicate places. [2025-03-14 23:11:08,211 INFO L471 AbstractCegarLoop]: Abstraction has has 258 places, 1878 transitions, 31029 flow [2025-03-14 23:11:08,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 116.14285714285714) internal successors, (813), 7 states have internal predecessors, (813), 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:11:08,212 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 23:11:08,212 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] [2025-03-14 23:11:08,220 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-14 23:11:08,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 23:11:08,413 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:11:08,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 23:11:08,413 INFO L85 PathProgramCache]: Analyzing trace with hash 1818605828, now seen corresponding path program 6 times [2025-03-14 23:11:08,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 23:11:08,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729205496] [2025-03-14 23:11:08,413 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-14 23:11:08,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 23:11:08,425 INFO L229 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-14 23:11:08,426 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 23:11:08,506 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 23:11:08,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 23:11:08,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729205496] [2025-03-14 23:11:08,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1729205496] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 23:11:08,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 23:11:08,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-14 23:11:08,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752361648] [2025-03-14 23:11:08,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 23:11:08,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-14 23:11:08,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 23:11:08,509 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-14 23:11:08,509 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-14 23:11:08,509 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 150 [2025-03-14 23:11:08,510 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 258 places, 1878 transitions, 31029 flow. Second operand has 8 states, 8 states have (on average 115.125) internal successors, (921), 8 states have internal predecessors, (921), 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:11:08,510 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 23:11:08,510 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 150 [2025-03-14 23:11:08,510 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 23:11:13,362 INFO L124 PetriNetUnfolderBase]: 13612/25091 cut-off events. [2025-03-14 23:11:13,362 INFO L125 PetriNetUnfolderBase]: For 117263/127960 co-relation queries the response was YES. [2025-03-14 23:11:13,458 INFO L83 FinitePrefix]: Finished finitePrefix Result has 170168 conditions, 25091 events. 13612/25091 cut-off events. For 117263/127960 co-relation queries the response was YES. Maximal size of possible extension queue 1277. Compared 226359 event pairs, 711 based on Foata normal form. 427/22692 useless extension candidates. Maximal degree in co-relation 160275. Up to 11469 conditions per place. [2025-03-14 23:11:13,621 INFO L140 encePairwiseOnDemand]: 136/150 looper letters, 2449 selfloop transitions, 270 changer transitions 57/2890 dead transitions. [2025-03-14 23:11:13,622 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 270 places, 2890 transitions, 52265 flow [2025-03-14 23:11:13,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-14 23:11:13,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-14 23:11:13,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1669 transitions. [2025-03-14 23:11:13,623 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8558974358974359 [2025-03-14 23:11:13,624 INFO L298 CegarLoopForPetriNet]: 152 programPoint places, 118 predicate places. [2025-03-14 23:11:13,624 INFO L471 AbstractCegarLoop]: Abstraction has has 270 places, 2890 transitions, 52265 flow [2025-03-14 23:11:13,624 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 115.125) internal successors, (921), 8 states have internal predecessors, (921), 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:11:13,624 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 23:11:13,624 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] [2025-03-14 23:11:13,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-14 23:11:13,624 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:11:13,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 23:11:13,625 INFO L85 PathProgramCache]: Analyzing trace with hash -630215552, now seen corresponding path program 7 times [2025-03-14 23:11:13,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 23:11:13,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476410697] [2025-03-14 23:11:13,625 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-14 23:11:13,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 23:11:13,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 23:11:13,716 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 23:11:13,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 23:11:13,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476410697] [2025-03-14 23:11:13,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476410697] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 23:11:13,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1155518167] [2025-03-14 23:11:13,716 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-14 23:11:13,716 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 23:11:13,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 23:11:13,718 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 23:11:13,719 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-14 23:11:13,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 23:11:13,771 INFO L256 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-14 23:11:13,772 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 23:11:13,877 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 23:11:13,878 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 23:11:14,015 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:11:14,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1155518167] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-14 23:11:14,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-14 23:11:14,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10, 9] total 20 [2025-03-14 23:11:14,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857355661] [2025-03-14 23:11:14,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 23:11:14,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-14 23:11:14,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 23:11:14,016 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-14 23:11:14,016 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=302, Unknown=0, NotChecked=0, Total=380 [2025-03-14 23:11:14,016 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 150 [2025-03-14 23:11:14,017 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 270 places, 2890 transitions, 52265 flow. Second operand has 9 states, 9 states have (on average 106.77777777777777) internal successors, (961), 9 states have internal predecessors, (961), 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:11:14,017 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 23:11:14,017 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 150 [2025-03-14 23:11:14,017 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 23:11:19,809 INFO L124 PetriNetUnfolderBase]: 13477/24828 cut-off events. [2025-03-14 23:11:19,809 INFO L125 PetriNetUnfolderBase]: For 146001/155816 co-relation queries the response was YES. [2025-03-14 23:11:19,918 INFO L83 FinitePrefix]: Finished finitePrefix Result has 184110 conditions, 24828 events. 13477/24828 cut-off events. For 146001/155816 co-relation queries the response was YES. Maximal size of possible extension queue 1269. Compared 223004 event pairs, 664 based on Foata normal form. 487/22527 useless extension candidates. Maximal degree in co-relation 179441. Up to 11438 conditions per place. [2025-03-14 23:11:20,097 INFO L140 encePairwiseOnDemand]: 134/150 looper letters, 1917 selfloop transitions, 645 changer transitions 57/2851 dead transitions. [2025-03-14 23:11:20,097 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 280 places, 2851 transitions, 56744 flow [2025-03-14 23:11:20,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-14 23:11:20,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-14 23:11:20,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1257 transitions. [2025-03-14 23:11:20,099 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7618181818181818 [2025-03-14 23:11:20,099 INFO L298 CegarLoopForPetriNet]: 152 programPoint places, 128 predicate places. [2025-03-14 23:11:20,099 INFO L471 AbstractCegarLoop]: Abstraction has has 280 places, 2851 transitions, 56744 flow [2025-03-14 23:11:20,099 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 106.77777777777777) internal successors, (961), 9 states have internal predecessors, (961), 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:11:20,099 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 23:11:20,100 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] [2025-03-14 23:11:20,105 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-14 23:11:20,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 23:11:20,300 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:11:20,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 23:11:20,301 INFO L85 PathProgramCache]: Analyzing trace with hash 1531189750, now seen corresponding path program 8 times [2025-03-14 23:11:20,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 23:11:20,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675374398] [2025-03-14 23:11:20,301 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 23:11:20,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 23:11:20,317 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 23:11:20,317 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 23:11:20,403 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:11:20,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 23:11:20,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675374398] [2025-03-14 23:11:20,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675374398] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 23:11:20,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1240194563] [2025-03-14 23:11:20,404 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 23:11:20,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 23:11:20,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 23:11:20,408 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 23:11:20,408 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-14 23:11:20,465 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 23:11:20,465 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 23:11:20,466 INFO L256 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-14 23:11:20,467 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 23:11:20,560 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:11:20,560 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 23:11:20,708 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:11:20,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1240194563] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-14 23:11:20,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-14 23:11:20,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10, 9] total 20 [2025-03-14 23:11:20,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667097994] [2025-03-14 23:11:20,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 23:11:20,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-14 23:11:20,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 23:11:20,709 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-14 23:11:20,709 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2025-03-14 23:11:20,710 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 150 [2025-03-14 23:11:20,711 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 280 places, 2851 transitions, 56744 flow. Second operand has 9 states, 9 states have (on average 106.77777777777777) internal successors, (961), 9 states have internal predecessors, (961), 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:11:20,711 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 23:11:20,711 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 150 [2025-03-14 23:11:20,711 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 23:11:26,677 INFO L124 PetriNetUnfolderBase]: 13351/24473 cut-off events. [2025-03-14 23:11:26,677 INFO L125 PetriNetUnfolderBase]: For 172698/183993 co-relation queries the response was YES. [2025-03-14 23:11:26,777 INFO L83 FinitePrefix]: Finished finitePrefix Result has 196544 conditions, 24473 events. 13351/24473 cut-off events. For 172698/183993 co-relation queries the response was YES. Maximal size of possible extension queue 1252. Compared 218772 event pairs, 633 based on Foata normal form. 530/22279 useless extension candidates. Maximal degree in co-relation 191617. Up to 11238 conditions per place. [2025-03-14 23:11:27,144 INFO L140 encePairwiseOnDemand]: 133/150 looper letters, 1674 selfloop transitions, 818 changer transitions 57/2781 dead transitions. [2025-03-14 23:11:27,145 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 289 places, 2781 transitions, 60323 flow [2025-03-14 23:11:27,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-14 23:11:27,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-14 23:11:27,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1140 transitions. [2025-03-14 23:11:27,146 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.76 [2025-03-14 23:11:27,146 INFO L298 CegarLoopForPetriNet]: 152 programPoint places, 137 predicate places. [2025-03-14 23:11:27,146 INFO L471 AbstractCegarLoop]: Abstraction has has 289 places, 2781 transitions, 60323 flow [2025-03-14 23:11:27,147 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 106.77777777777777) internal successors, (961), 9 states have internal predecessors, (961), 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:11:27,147 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 23:11:27,147 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] [2025-03-14 23:11:27,152 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-14 23:11:27,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-14 23:11:27,350 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 23:11:27,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 23:11:27,351 INFO L85 PathProgramCache]: Analyzing trace with hash -469174883, now seen corresponding path program 1 times [2025-03-14 23:11:27,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 23:11:27,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592858586] [2025-03-14 23:11:27,351 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 23:11:27,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 23:11:27,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 23:11:28,496 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 23:11:28,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 23:11:28,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592858586] [2025-03-14 23:11:28,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592858586] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 23:11:28,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [19970120] [2025-03-14 23:11:28,496 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 23:11:28,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 23:11:28,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 23:11:28,498 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 23:11:28,500 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-14 23:11:28,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 23:11:28,562 INFO L256 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-14 23:11:28,564 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 23:11:28,976 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-14 23:11:29,183 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:11:29,183 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 23:11:29,359 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 23:11:29,359 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 21 [2025-03-14 23:11:29,917 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:11:29,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [19970120] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 23:11:29,918 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 23:11:29,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 13, 12] total 34 [2025-03-14 23:11:29,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000521611] [2025-03-14 23:11:29,918 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 23:11:29,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-03-14 23:11:29,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 23:11:29,919 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-03-14 23:11:29,919 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=942, Unknown=0, NotChecked=0, Total=1122 [2025-03-14 23:11:29,920 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 150 [2025-03-14 23:11:29,921 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 289 places, 2781 transitions, 60323 flow. Second operand has 34 states, 34 states have (on average 71.05882352941177) internal successors, (2416), 34 states have internal predecessors, (2416), 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:11:29,922 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 23:11:29,922 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 150 [2025-03-14 23:11:29,922 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 23:11:44,841 INFO L124 PetriNetUnfolderBase]: 29733/51155 cut-off events. [2025-03-14 23:11:44,841 INFO L125 PetriNetUnfolderBase]: For 484674/504820 co-relation queries the response was YES. [2025-03-14 23:11:45,154 INFO L83 FinitePrefix]: Finished finitePrefix Result has 422928 conditions, 51155 events. 29733/51155 cut-off events. For 484674/504820 co-relation queries the response was YES. Maximal size of possible extension queue 2075. Compared 463364 event pairs, 1612 based on Foata normal form. 509/46232 useless extension candidates. Maximal degree in co-relation 371117. Up to 22008 conditions per place. [2025-03-14 23:11:45,844 INFO L140 encePairwiseOnDemand]: 118/150 looper letters, 3849 selfloop transitions, 478 changer transitions 74/5281 dead transitions. [2025-03-14 23:11:45,844 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 326 places, 5281 transitions, 122507 flow [2025-03-14 23:11:45,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2025-03-14 23:11:45,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2025-03-14 23:11:45,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 2820 transitions. [2025-03-14 23:11:45,846 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.49473684210526314 [2025-03-14 23:11:45,846 INFO L298 CegarLoopForPetriNet]: 152 programPoint places, 174 predicate places. [2025-03-14 23:11:45,847 INFO L471 AbstractCegarLoop]: Abstraction has has 326 places, 5281 transitions, 122507 flow [2025-03-14 23:11:45,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 71.05882352941177) internal successors, (2416), 34 states have internal predecessors, (2416), 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:11:45,847 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 23:11:45,848 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] [2025-03-14 23:11:45,853 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-14 23:11:46,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-14 23:11:46,052 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 23:11:46,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 23:11:46,053 INFO L85 PathProgramCache]: Analyzing trace with hash -1524054134, now seen corresponding path program 1 times [2025-03-14 23:11:46,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 23:11:46,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277716013] [2025-03-14 23:11:46,053 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 23:11:46,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 23:11:46,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 23:11:46,933 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 23:11:46,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 23:11:46,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277716013] [2025-03-14 23:11:46,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [277716013] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 23:11:46,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1381655027] [2025-03-14 23:11:46,933 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 23:11:46,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 23:11:46,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 23:11:46,935 INFO L229 MonitoredProcess]: Starting monitored process 11 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:11:46,937 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-14 23:11:46,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 23:11:46,997 INFO L256 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-03-14 23:11:47,000 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 23:11:47,644 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 23:11:47,644 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 15 [2025-03-14 23:11:47,790 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 23:11:47,790 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 23:11:48,372 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 23:11:48,372 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 21 [2025-03-14 23:11:49,193 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 23:11:49,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1381655027] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 23:11:49,193 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 23:11:49,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 22, 21] total 62 [2025-03-14 23:11:49,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723368057] [2025-03-14 23:11:49,193 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 23:11:49,194 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2025-03-14 23:11:49,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 23:11:49,194 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2025-03-14 23:11:49,195 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=578, Invalid=3204, Unknown=0, NotChecked=0, Total=3782 [2025-03-14 23:11:49,197 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 51 out of 150 [2025-03-14 23:11:49,200 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 326 places, 5281 transitions, 122507 flow. Second operand has 62 states, 62 states have (on average 54.67741935483871) internal successors, (3390), 62 states have internal predecessors, (3390), 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:11:49,200 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 23:11:49,200 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 150 [2025-03-14 23:11:49,200 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 23:12:40,777 INFO L124 PetriNetUnfolderBase]: 62843/102271 cut-off events. [2025-03-14 23:12:40,778 INFO L125 PetriNetUnfolderBase]: For 1158378/1171938 co-relation queries the response was YES. [2025-03-14 23:12:41,305 INFO L83 FinitePrefix]: Finished finitePrefix Result has 906316 conditions, 102271 events. 62843/102271 cut-off events. For 1158378/1171938 co-relation queries the response was YES. Maximal size of possible extension queue 3934. Compared 931859 event pairs, 2571 based on Foata normal form. 393/92664 useless extension candidates. Maximal degree in co-relation 667048. Up to 44360 conditions per place. [2025-03-14 23:12:42,276 INFO L140 encePairwiseOnDemand]: 105/150 looper letters, 11428 selfloop transitions, 2044 changer transitions 112/13633 dead transitions. [2025-03-14 23:12:42,277 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 416 places, 13633 transitions, 334873 flow [2025-03-14 23:12:42,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2025-03-14 23:12:42,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2025-03-14 23:12:42,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 5555 transitions. [2025-03-14 23:12:42,281 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.40695970695970696 [2025-03-14 23:12:42,281 INFO L298 CegarLoopForPetriNet]: 152 programPoint places, 264 predicate places. [2025-03-14 23:12:42,281 INFO L471 AbstractCegarLoop]: Abstraction has has 416 places, 13633 transitions, 334873 flow [2025-03-14 23:12:42,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 62 states have (on average 54.67741935483871) internal successors, (3390), 62 states have internal predecessors, (3390), 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:12:42,282 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 23:12:42,283 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] [2025-03-14 23:12:42,290 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-14 23:12:42,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-14 23:12:42,483 INFO L396 AbstractCegarLoop]: === Iteration 16 === 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:12:42,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 23:12:42,484 INFO L85 PathProgramCache]: Analyzing trace with hash -1665371784, now seen corresponding path program 2 times [2025-03-14 23:12:42,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 23:12:42,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870051780] [2025-03-14 23:12:42,484 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 23:12:42,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 23:12:42,499 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 23:12:42,499 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 23:12:43,221 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:12:43,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 23:12:43,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870051780] [2025-03-14 23:12:43,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870051780] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 23:12:43,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1405347542] [2025-03-14 23:12:43,222 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 23:12:43,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 23:12:43,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 23:12:43,224 INFO L229 MonitoredProcess]: Starting monitored process 12 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:12:43,224 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-14 23:12:43,276 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 23:12:43,277 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 23:12:43,278 INFO L256 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 50 conjuncts are in the unsatisfiable core [2025-03-14 23:12:43,280 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 23:12:43,410 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-14 23:12:43,752 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 23:12:43,752 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 15 [2025-03-14 23:12:43,930 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 23:12:43,931 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 23:12:44,552 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:12:44,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1405347542] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 23:12:44,552 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 23:12:44,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 25, 18] total 51 [2025-03-14 23:12:44,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376264551] [2025-03-14 23:12:44,553 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 23:12:44,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2025-03-14 23:12:44,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 23:12:44,554 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2025-03-14 23:12:44,554 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=407, Invalid=2143, Unknown=0, NotChecked=0, Total=2550 [2025-03-14 23:12:44,555 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 150 [2025-03-14 23:12:44,557 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 416 places, 13633 transitions, 334873 flow. Second operand has 51 states, 51 states have (on average 57.76470588235294) internal successors, (2946), 51 states have internal predecessors, (2946), 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:12:44,557 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 23:12:44,557 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 150 [2025-03-14 23:12:44,557 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 23:16:57,077 INFO L124 PetriNetUnfolderBase]: 75297/123490 cut-off events. [2025-03-14 23:16:57,077 INFO L125 PetriNetUnfolderBase]: For 1497401/1524675 co-relation queries the response was YES. [2025-03-14 23:16:57,734 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1192107 conditions, 123490 events. 75297/123490 cut-off events. For 1497401/1524675 co-relation queries the response was YES. Maximal size of possible extension queue 4704. Compared 1158484 event pairs, 2781 based on Foata normal form. 618/112590 useless extension candidates. Maximal degree in co-relation 863829. Up to 84370 conditions per place. [2025-03-14 23:16:59,094 INFO L140 encePairwiseOnDemand]: 107/150 looper letters, 15924 selfloop transitions, 2133 changer transitions 154/18265 dead transitions. [2025-03-14 23:16:59,094 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 479 places, 18265 transitions, 476962 flow [2025-03-14 23:16:59,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2025-03-14 23:16:59,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2025-03-14 23:16:59,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 3926 transitions. [2025-03-14 23:16:59,097 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.4089583333333333 [2025-03-14 23:16:59,098 INFO L298 CegarLoopForPetriNet]: 152 programPoint places, 327 predicate places. [2025-03-14 23:16:59,098 INFO L471 AbstractCegarLoop]: Abstraction has has 479 places, 18265 transitions, 476962 flow [2025-03-14 23:16:59,099 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 57.76470588235294) internal successors, (2946), 51 states have internal predecessors, (2946), 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:16:59,099 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 23:16:59,099 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] [2025-03-14 23:16:59,105 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-14 23:16:59,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-14 23:16:59,299 INFO L396 AbstractCegarLoop]: === Iteration 17 === 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:16:59,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 23:16:59,300 INFO L85 PathProgramCache]: Analyzing trace with hash -588249309, now seen corresponding path program 2 times [2025-03-14 23:16:59,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 23:16:59,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856854965] [2025-03-14 23:16:59,300 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 23:16:59,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 23:16:59,316 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 23:16:59,316 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 23:16:59,723 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:16:59,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 23:16:59,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856854965] [2025-03-14 23:16:59,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856854965] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 23:16:59,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [12316912] [2025-03-14 23:16:59,723 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 23:16:59,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 23:16:59,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 23:16:59,725 INFO L229 MonitoredProcess]: Starting monitored process 13 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:16:59,726 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-14 23:16:59,786 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 23:16:59,786 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 23:16:59,787 INFO L256 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-03-14 23:16:59,789 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 23:17:00,119 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-14 23:17:00,207 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:17:00,207 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 23:17:00,347 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 23:17:00,348 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 21 [2025-03-14 23:17:00,629 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:17:00,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [12316912] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 23:17:00,629 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 23:17:00,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18, 12] total 33 [2025-03-14 23:17:00,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289026167] [2025-03-14 23:17:00,629 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 23:17:00,630 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-03-14 23:17:00,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 23:17:00,630 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-03-14 23:17:00,630 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=221, Invalid=835, Unknown=0, NotChecked=0, Total=1056 [2025-03-14 23:17:00,631 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 150 [2025-03-14 23:17:00,632 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 479 places, 18265 transitions, 476962 flow. Second operand has 33 states, 33 states have (on average 76.39393939393939) internal successors, (2521), 33 states have internal predecessors, (2521), 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:17:00,632 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 23:17:00,632 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 150 [2025-03-14 23:17:00,632 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 23:23:45,141 INFO L124 PetriNetUnfolderBase]: 84447/139048 cut-off events. [2025-03-14 23:23:45,142 INFO L125 PetriNetUnfolderBase]: For 1820483/1861556 co-relation queries the response was YES. [2025-03-14 23:23:45,931 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1442092 conditions, 139048 events. 84447/139048 cut-off events. For 1820483/1861556 co-relation queries the response was YES. Maximal size of possible extension queue 5341. Compared 1331145 event pairs, 3360 based on Foata normal form. 430/126519 useless extension candidates. Maximal degree in co-relation 1063268. Up to 94818 conditions per place. [2025-03-14 23:23:47,515 INFO L140 encePairwiseOnDemand]: 121/150 looper letters, 15933 selfloop transitions, 581 changer transitions 169/19914 dead transitions. [2025-03-14 23:23:47,516 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 508 places, 19914 transitions, 552645 flow [2025-03-14 23:23:47,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-03-14 23:23:47,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2025-03-14 23:23:47,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 2396 transitions. [2025-03-14 23:23:47,526 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.5324444444444445 [2025-03-14 23:23:47,527 INFO L298 CegarLoopForPetriNet]: 152 programPoint places, 356 predicate places. [2025-03-14 23:23:47,527 INFO L471 AbstractCegarLoop]: Abstraction has has 508 places, 19914 transitions, 552645 flow [2025-03-14 23:23:47,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 76.39393939393939) internal successors, (2521), 33 states have internal predecessors, (2521), 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:47,528 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 23:23:47,528 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] [2025-03-14 23:23:47,537 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-03-14 23:23:47,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-14 23:23:47,733 INFO L396 AbstractCegarLoop]: === Iteration 18 === 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:47,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 23:23:47,734 INFO L85 PathProgramCache]: Analyzing trace with hash 850894507, now seen corresponding path program 3 times [2025-03-14 23:23:47,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 23:23:47,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484656994] [2025-03-14 23:23:47,735 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-14 23:23:47,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 23:23:47,840 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-14 23:23:47,840 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 23:23:48,784 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 23:23:48,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 23:23:48,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484656994] [2025-03-14 23:23:48,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484656994] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 23:23:48,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 23:23:48,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2025-03-14 23:23:48,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411097055] [2025-03-14 23:23:48,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 23:23:48,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-14 23:23:48,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 23:23:48,786 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-14 23:23:48,786 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=290, Unknown=0, NotChecked=0, Total=380 [2025-03-14 23:23:48,791 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 150 [2025-03-14 23:23:48,793 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 508 places, 19914 transitions, 552645 flow. Second operand has 20 states, 20 states have (on average 75.3) internal successors, (1506), 20 states have internal predecessors, (1506), 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:48,793 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 23:23:48,793 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 150 [2025-03-14 23:23:48,793 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand Received shutdown request... [2025-03-14 23:24:02,360 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-03-14 23:24:02,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-14 23:24:02,369 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2025-03-14 23:24:02,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-14 23:24:02,370 WARN L596 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (20states, 72/150 universal loopers) in iteration 18,while PetriNetUnfolder was constructing finite prefix that currently has 33787 conditions, 2858 events (1372/2857 cut-off events. For 68529/84349 co-relation queries the response was YES. Maximal size of possible extension queue 842. Compared 25140 event pairs, 24 based on Foata normal form. 333/3704 useless extension candidates. Maximal degree in co-relation 26465. Up to 1265 conditions per place.). [2025-03-14 23:24:02,377 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2025-03-14 23:24:02,377 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2025-03-14 23:24:02,377 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2025-03-14 23:24:02,379 INFO L422 BasicCegarLoop]: Path program histogram: [8, 3, 2, 1, 1, 1, 1, 1] [2025-03-14 23:24:02,388 INFO L328 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-14 23:24:02,388 INFO L188 ceAbstractionStarter]: Computing trace abstraction results [2025-03-14 23:24:02,397 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.03 11:24:02 BasicIcfg [2025-03-14 23:24:02,398 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-14 23:24:02,398 INFO L158 Benchmark]: Toolchain (without parser) took 793468.93ms. Allocated memory was 71.3MB in the beginning and 3.8GB in the end (delta: 3.7GB). Free memory was 44.9MB in the beginning and 371.2MB in the end (delta: -326.3MB). Peak memory consumption was 3.5GB. Max. memory is 8.0GB. [2025-03-14 23:24:02,399 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 71.3MB. Free memory was 36.9MB in the beginning and 36.8MB in the end (delta: 42.0kB). There was no memory consumed. Max. memory is 8.0GB. [2025-03-14 23:24:02,401 INFO L158 Benchmark]: CACSL2BoogieTranslator took 195.28ms. Allocated memory is still 71.3MB. Free memory was 44.7MB in the beginning and 32.8MB in the end (delta: 11.9MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-03-14 23:24:02,401 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.59ms. Allocated memory is still 71.3MB. Free memory was 32.8MB in the beginning and 31.5MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 8.0GB. [2025-03-14 23:24:02,401 INFO L158 Benchmark]: Boogie Preprocessor took 26.27ms. Allocated memory is still 71.3MB. Free memory was 31.4MB in the beginning and 30.3MB in the end (delta: 1.0MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-03-14 23:24:02,401 INFO L158 Benchmark]: RCFGBuilder took 293.76ms. Allocated memory is still 71.3MB. Free memory was 30.2MB in the beginning and 42.4MB in the end (delta: -12.2MB). Peak memory consumption was 15.3MB. Max. memory is 8.0GB. [2025-03-14 23:24:02,402 INFO L158 Benchmark]: TraceAbstraction took 792918.14ms. Allocated memory was 71.3MB in the beginning and 3.8GB in the end (delta: 3.7GB). Free memory was 41.2MB in the beginning and 371.2MB in the end (delta: -330.0MB). Peak memory consumption was 3.5GB. Max. memory is 8.0GB. [2025-03-14 23:24:02,403 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.22ms. Allocated memory is still 71.3MB. Free memory was 36.9MB in the beginning and 36.8MB in the end (delta: 42.0kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 195.28ms. Allocated memory is still 71.3MB. Free memory was 44.7MB in the beginning and 32.8MB in the end (delta: 11.9MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 27.59ms. Allocated memory is still 71.3MB. Free memory was 32.8MB in the beginning and 31.5MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 26.27ms. Allocated memory is still 71.3MB. Free memory was 31.4MB in the beginning and 30.3MB in the end (delta: 1.0MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 293.76ms. Allocated memory is still 71.3MB. Free memory was 30.2MB in the beginning and 42.4MB in the end (delta: -12.2MB). Peak memory consumption was 15.3MB. Max. memory is 8.0GB. * TraceAbstraction took 792918.14ms. Allocated memory was 71.3MB in the beginning and 3.8GB in the end (delta: 3.7GB). Free memory was 41.2MB in the beginning and 371.2MB in the end (delta: -330.0MB). Peak memory consumption was 3.5GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 90]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (20states, 72/150 universal loopers) in iteration 18,while PetriNetUnfolder was constructing finite prefix that currently has 33787 conditions, 2858 events (1372/2857 cut-off events. For 68529/84349 co-relation queries the response was YES. Maximal size of possible extension queue 842. Compared 25140 event pairs, 24 based on Foata normal form. 333/3704 useless extension candidates. Maximal degree in co-relation 26465. Up to 1265 conditions per place.). - TimeoutResultAtElement [Line: 83]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (20states, 72/150 universal loopers) in iteration 18,while PetriNetUnfolder was constructing finite prefix that currently has 33787 conditions, 2858 events (1372/2857 cut-off events. For 68529/84349 co-relation queries the response was YES. Maximal size of possible extension queue 842. Compared 25140 event pairs, 24 based on Foata normal form. 333/3704 useless extension candidates. Maximal degree in co-relation 26465. Up to 1265 conditions per place.). - TimeoutResultAtElement [Line: 84]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (20states, 72/150 universal loopers) in iteration 18,while PetriNetUnfolder was constructing finite prefix that currently has 33787 conditions, 2858 events (1372/2857 cut-off events. For 68529/84349 co-relation queries the response was YES. Maximal size of possible extension queue 842. Compared 25140 event pairs, 24 based on Foata normal form. 333/3704 useless extension candidates. Maximal degree in co-relation 26465. Up to 1265 conditions per place.). - TimeoutResultAtElement [Line: 82]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (20states, 72/150 universal loopers) in iteration 18,while PetriNetUnfolder was constructing finite prefix that currently has 33787 conditions, 2858 events (1372/2857 cut-off events. For 68529/84349 co-relation queries the response was YES. Maximal size of possible extension queue 842. Compared 25140 event pairs, 24 based on Foata normal form. 333/3704 useless extension candidates. Maximal degree in co-relation 26465. Up to 1265 conditions per place.). - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 185 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: 792.8s, OverallIterations: 18, TraceHistogramMax: 1, PathProgramHistogramMax: 8, EmptinessCheckTime: 0.0s, AutomataDifference: 774.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4228 SdHoareTripleChecker+Valid, 6.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4228 mSDsluCounter, 10700 SdHoareTripleChecker+Invalid, 5.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 9681 mSDsCounter, 134 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 14556 IncrementalHoareTripleChecker+Invalid, 14690 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 134 mSolverCounterUnsat, 1019 mSDtfsCounter, 14556 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3437 GetRequests, 2791 SyntacticMatches, 16 SemanticMatches, 630 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11774 ImplicationChecksByTransitivity, 8.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=552645occurred in iteration=17, InterpolantAutomatonStates: 383, 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.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 14.2s InterpolantComputationTime, 3624 NumberOfCodeBlocks, 3592 NumberOfCodeBlocksAsserted, 42 NumberOfCheckSat, 5050 ConstructedInterpolants, 42 QuantifiedInterpolants, 29898 SizeOfPredicates, 145 NumberOfNonLiveVariables, 3124 ConjunctsInSsa, 205 ConjunctsInUnsatCore, 42 InterpolantComputations, 13 PerfectInterpolantSequences, 37/70 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 RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown