/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/parallel-misc-3.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.empire2-owicki-f61efc6-m [2025-03-14 22:39:07,866 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-14 22:39:07,916 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf [2025-03-14 22:39:07,962 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-14 22:39:07,963 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-14 22:39:07,963 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-14 22:39:07,963 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-14 22:39:07,963 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-14 22:39:07,963 INFO L153 SettingsManager]: * Use SBE=true [2025-03-14 22:39:07,963 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-14 22:39:07,964 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-14 22:39:07,964 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-14 22:39:07,964 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-14 22:39:07,964 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-14 22:39:07,965 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-14 22:39:07,965 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-14 22:39:07,965 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-14 22:39:07,965 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-14 22:39:07,965 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-14 22:39:07,965 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-14 22:39:07,965 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-14 22:39:07,965 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-03-14 22:39:07,965 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-14 22:39:07,965 INFO L153 SettingsManager]: * To the following directory=./dump/ [2025-03-14 22:39:07,965 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-14 22:39:07,966 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-14 22:39:07,966 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-14 22:39:07,966 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-14 22:39:07,966 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-14 22:39:07,966 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-14 22:39:07,966 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-14 22:39:07,966 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-14 22:39:07,966 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All [2025-03-14 22:39:08,238 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-14 22:39:08,244 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-14 22:39:08,245 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-14 22:39:08,246 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-14 22:39:08,246 INFO L274 PluginConnector]: CDTParser initialized [2025-03-14 22:39:08,247 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/parallel-misc-3.wvr.c [2025-03-14 22:39:09,460 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b40e6cf86/96b7646fbad24c18abd7743140aad502/FLAG06e7426cb [2025-03-14 22:39:09,634 INFO L384 CDTParser]: Found 1 translation units. [2025-03-14 22:39:09,634 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-misc-3.wvr.c [2025-03-14 22:39:09,640 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b40e6cf86/96b7646fbad24c18abd7743140aad502/FLAG06e7426cb [2025-03-14 22:39:10,031 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b40e6cf86/96b7646fbad24c18abd7743140aad502 [2025-03-14 22:39:10,033 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-14 22:39:10,034 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-03-14 22:39:10,035 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-14 22:39:10,035 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-14 22:39:10,038 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-14 22:39:10,038 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 10:39:10" (1/1) ... [2025-03-14 22:39:10,039 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5cf74986 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 10:39:10, skipping insertion in model container [2025-03-14 22:39:10,039 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 10:39:10" (1/1) ... [2025-03-14 22:39:10,050 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-14 22:39:10,172 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-misc-3.wvr.c[2092,2105] [2025-03-14 22:39:10,176 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 22:39:10,183 INFO L200 MainTranslator]: Completed pre-run [2025-03-14 22:39:10,200 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-misc-3.wvr.c[2092,2105] [2025-03-14 22:39:10,200 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 22:39:10,211 INFO L204 MainTranslator]: Completed translation [2025-03-14 22:39:10,212 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 10:39:10 WrapperNode [2025-03-14 22:39:10,212 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-14 22:39:10,213 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-14 22:39:10,213 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-14 22:39:10,213 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-14 22:39:10,217 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 10:39:10" (1/1) ... [2025-03-14 22:39:10,222 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 10:39:10" (1/1) ... [2025-03-14 22:39:10,233 INFO L138 Inliner]: procedures = 18, calls = 9, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 40 [2025-03-14 22:39:10,233 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-14 22:39:10,235 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-14 22:39:10,235 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-14 22:39:10,235 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-14 22:39:10,239 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 10:39:10" (1/1) ... [2025-03-14 22:39:10,239 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 10:39:10" (1/1) ... [2025-03-14 22:39:10,244 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 10:39:10" (1/1) ... [2025-03-14 22:39:10,244 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 10:39:10" (1/1) ... [2025-03-14 22:39:10,247 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 10:39:10" (1/1) ... [2025-03-14 22:39:10,247 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 10:39:10" (1/1) ... [2025-03-14 22:39:10,251 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 10:39:10" (1/1) ... [2025-03-14 22:39:10,252 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 10:39:10" (1/1) ... [2025-03-14 22:39:10,252 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 10:39:10" (1/1) ... [2025-03-14 22:39:10,257 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-14 22:39:10,258 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-03-14 22:39:10,258 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-03-14 22:39:10,258 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-03-14 22:39:10,259 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 10:39:10" (1/1) ... [2025-03-14 22:39:10,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-14 22:39:10,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 22:39:10,286 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2025-03-14 22:39:10,292 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2025-03-14 22:39:10,307 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-14 22:39:10,308 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-14 22:39:10,308 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-14 22:39:10,308 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-14 22:39:10,308 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-14 22:39:10,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-14 22:39:10,308 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-14 22:39:10,308 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-14 22:39:10,309 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-14 22:39:10,362 INFO L234 CfgBuilder]: Building ICFG [2025-03-14 22:39:10,363 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-14 22:39:10,483 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-14 22:39:10,483 INFO L283 CfgBuilder]: Performing block encoding [2025-03-14 22:39:10,493 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-14 22:39:10,494 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-14 22:39:10,494 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.03 10:39:10 BoogieIcfgContainer [2025-03-14 22:39:10,494 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-03-14 22:39:10,507 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-14 22:39:10,507 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-14 22:39:10,511 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-14 22:39:10,512 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.03 10:39:10" (1/3) ... [2025-03-14 22:39:10,512 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f8905be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 10:39:10, skipping insertion in model container [2025-03-14 22:39:10,512 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 10:39:10" (2/3) ... [2025-03-14 22:39:10,512 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f8905be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 10:39:10, skipping insertion in model container [2025-03-14 22:39:10,512 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.03 10:39:10" (3/3) ... [2025-03-14 22:39:10,513 INFO L128 eAbstractionObserver]: Analyzing ICFG parallel-misc-3.wvr.c [2025-03-14 22:39:10,525 INFO L303 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-14 22:39:10,527 INFO L169 ceAbstractionStarter]: Applying trace abstraction to ICFG parallel-misc-3.wvr.c that has 3 procedures, 81 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-03-14 22:39:10,527 INFO L581 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-14 22:39:10,578 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-14 22:39:10,612 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-14 22:39:10,624 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;@7f5de18e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-14 22:39:10,624 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-03-14 22:39:10,667 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-14 22:39:10,667 INFO L124 PetriNetUnfolderBase]: 9/81 cut-off events. [2025-03-14 22:39:10,668 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-14 22:39:10,668 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:39:10,669 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] [2025-03-14 22:39:10,669 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 22:39:10,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:39:10,673 INFO L85 PathProgramCache]: Analyzing trace with hash 1174318314, now seen corresponding path program 1 times [2025-03-14 22:39:10,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:39:10,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440437847] [2025-03-14 22:39:10,682 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 22:39:10,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:39:10,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 22:39:10,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 22:39:10,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:39:10,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440437847] [2025-03-14 22:39:10,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440437847] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 22:39:10,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 22:39:10,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-14 22:39:10,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929124020] [2025-03-14 22:39:10,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 22:39:10,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 22:39:10,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:39:10,960 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 22:39:10,960 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 22:39:10,963 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 89 [2025-03-14 22:39:10,968 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 89 transitions, 192 flow. Second operand has 3 states, 3 states have (on average 78.33333333333333) internal successors, (235), 3 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 22:39:10,968 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:39:10,969 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 89 [2025-03-14 22:39:10,970 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:39:11,047 INFO L124 PetriNetUnfolderBase]: 26/144 cut-off events. [2025-03-14 22:39:11,047 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2025-03-14 22:39:11,052 INFO L83 FinitePrefix]: Finished finitePrefix Result has 203 conditions, 144 events. 26/144 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 356 event pairs, 3 based on Foata normal form. 2/124 useless extension candidates. Maximal degree in co-relation 157. Up to 21 conditions per place. [2025-03-14 22:39:11,055 INFO L140 encePairwiseOnDemand]: 84/89 looper letters, 14 selfloop transitions, 2 changer transitions 1/86 dead transitions. [2025-03-14 22:39:11,055 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 86 transitions, 219 flow [2025-03-14 22:39:11,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 22:39:11,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 22:39:11,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 247 transitions. [2025-03-14 22:39:11,067 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9250936329588015 [2025-03-14 22:39:11,074 INFO L298 CegarLoopForPetriNet]: 87 programPoint places, -5 predicate places. [2025-03-14 22:39:11,074 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 86 transitions, 219 flow [2025-03-14 22:39:11,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 78.33333333333333) internal successors, (235), 3 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 22:39:11,075 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:39:11,075 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] [2025-03-14 22:39:11,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-14 22:39:11,076 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 22:39:11,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:39:11,076 INFO L85 PathProgramCache]: Analyzing trace with hash -207873920, now seen corresponding path program 1 times [2025-03-14 22:39:11,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:39:11,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859826695] [2025-03-14 22:39:11,077 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 22:39:11,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:39:11,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 22:39:11,191 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 22:39:11,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:39:11,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859826695] [2025-03-14 22:39:11,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859826695] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 22:39:11,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 22:39:11,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-14 22:39:11,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957775860] [2025-03-14 22:39:11,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 22:39:11,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 22:39:11,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:39:11,193 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 22:39:11,193 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 22:39:11,193 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 89 [2025-03-14 22:39:11,195 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 86 transitions, 219 flow. Second operand has 3 states, 3 states have (on average 78.66666666666667) internal successors, (236), 3 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 22:39:11,195 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:39:11,195 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 89 [2025-03-14 22:39:11,195 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:39:11,279 INFO L124 PetriNetUnfolderBase]: 84/349 cut-off events. [2025-03-14 22:39:11,279 INFO L125 PetriNetUnfolderBase]: For 86/124 co-relation queries the response was YES. [2025-03-14 22:39:11,282 INFO L83 FinitePrefix]: Finished finitePrefix Result has 510 conditions, 349 events. 84/349 cut-off events. For 86/124 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1530 event pairs, 8 based on Foata normal form. 6/290 useless extension candidates. Maximal degree in co-relation 402. Up to 42 conditions per place. [2025-03-14 22:39:11,285 INFO L140 encePairwiseOnDemand]: 86/89 looper letters, 19 selfloop transitions, 2 changer transitions 1/93 dead transitions. [2025-03-14 22:39:11,285 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 93 transitions, 288 flow [2025-03-14 22:39:11,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 22:39:11,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 22:39:11,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 245 transitions. [2025-03-14 22:39:11,286 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9176029962546817 [2025-03-14 22:39:11,287 INFO L298 CegarLoopForPetriNet]: 87 programPoint places, -3 predicate places. [2025-03-14 22:39:11,287 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 93 transitions, 288 flow [2025-03-14 22:39:11,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 78.66666666666667) internal successors, (236), 3 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 22:39:11,287 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:39:11,287 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] [2025-03-14 22:39:11,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-14 22:39:11,287 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 22:39:11,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:39:11,288 INFO L85 PathProgramCache]: Analyzing trace with hash 1434960059, now seen corresponding path program 1 times [2025-03-14 22:39:11,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:39:11,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561944988] [2025-03-14 22:39:11,288 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 22:39:11,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:39:11,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 22:39:11,465 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 22:39:11,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:39:11,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561944988] [2025-03-14 22:39:11,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561944988] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 22:39:11,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 22:39:11,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-14 22:39:11,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010836320] [2025-03-14 22:39:11,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 22:39:11,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-14 22:39:11,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:39:11,467 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-14 22:39:11,467 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-14 22:39:11,467 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 89 [2025-03-14 22:39:11,469 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 93 transitions, 288 flow. Second operand has 4 states, 4 states have (on average 76.5) internal successors, (306), 4 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 22:39:11,469 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:39:11,469 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 89 [2025-03-14 22:39:11,469 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:39:11,557 INFO L124 PetriNetUnfolderBase]: 102/426 cut-off events. [2025-03-14 22:39:11,557 INFO L125 PetriNetUnfolderBase]: For 384/555 co-relation queries the response was YES. [2025-03-14 22:39:11,558 INFO L83 FinitePrefix]: Finished finitePrefix Result has 765 conditions, 426 events. 102/426 cut-off events. For 384/555 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1969 event pairs, 13 based on Foata normal form. 20/378 useless extension candidates. Maximal degree in co-relation 569. Up to 55 conditions per place. [2025-03-14 22:39:11,560 INFO L140 encePairwiseOnDemand]: 82/89 looper letters, 23 selfloop transitions, 4 changer transitions 1/99 dead transitions. [2025-03-14 22:39:11,560 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 99 transitions, 389 flow [2025-03-14 22:39:11,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-14 22:39:11,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-14 22:39:11,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 317 transitions. [2025-03-14 22:39:11,561 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8904494382022472 [2025-03-14 22:39:11,562 INFO L298 CegarLoopForPetriNet]: 87 programPoint places, 0 predicate places. [2025-03-14 22:39:11,562 INFO L471 AbstractCegarLoop]: Abstraction has has 87 places, 99 transitions, 389 flow [2025-03-14 22:39:11,562 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 76.5) internal successors, (306), 4 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 22:39:11,562 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:39:11,563 INFO L221 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 22:39:11,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-14 22:39:11,563 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 22:39:11,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:39:11,563 INFO L85 PathProgramCache]: Analyzing trace with hash 438735102, now seen corresponding path program 1 times [2025-03-14 22:39:11,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:39:11,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907493780] [2025-03-14 22:39:11,564 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 22:39:11,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:39:11,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 22:39:11,710 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-14 22:39:11,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:39:11,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907493780] [2025-03-14 22:39:11,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907493780] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 22:39:11,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 22:39:11,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-14 22:39:11,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289341144] [2025-03-14 22:39:11,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 22:39:11,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-14 22:39:11,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:39:11,711 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-14 22:39:11,711 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-14 22:39:11,712 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 89 [2025-03-14 22:39:11,712 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 99 transitions, 389 flow. Second operand has 4 states, 4 states have (on average 76.75) internal successors, (307), 4 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 22:39:11,712 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:39:11,712 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 89 [2025-03-14 22:39:11,712 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:39:11,830 INFO L124 PetriNetUnfolderBase]: 164/583 cut-off events. [2025-03-14 22:39:11,830 INFO L125 PetriNetUnfolderBase]: For 2581/3331 co-relation queries the response was YES. [2025-03-14 22:39:11,832 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1491 conditions, 583 events. 164/583 cut-off events. For 2581/3331 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 3701 event pairs, 29 based on Foata normal form. 40/561 useless extension candidates. Maximal degree in co-relation 1138. Up to 140 conditions per place. [2025-03-14 22:39:11,835 INFO L140 encePairwiseOnDemand]: 82/89 looper letters, 37 selfloop transitions, 4 changer transitions 1/114 dead transitions. [2025-03-14 22:39:11,835 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 114 transitions, 603 flow [2025-03-14 22:39:11,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-14 22:39:11,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-14 22:39:11,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 318 transitions. [2025-03-14 22:39:11,836 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8932584269662921 [2025-03-14 22:39:11,837 INFO L298 CegarLoopForPetriNet]: 87 programPoint places, 3 predicate places. [2025-03-14 22:39:11,837 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 114 transitions, 603 flow [2025-03-14 22:39:11,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 76.75) internal successors, (307), 4 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 22:39:11,837 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:39:11,837 INFO L221 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 22:39:11,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-14 22:39:11,837 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 22:39:11,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:39:11,838 INFO L85 PathProgramCache]: Analyzing trace with hash 2058890654, now seen corresponding path program 1 times [2025-03-14 22:39:11,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:39:11,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234512172] [2025-03-14 22:39:11,838 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 22:39:11,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:39:11,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 22:39:12,077 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-14 22:39:12,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:39:12,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234512172] [2025-03-14 22:39:12,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234512172] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 22:39:12,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2115014729] [2025-03-14 22:39:12,078 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 22:39:12,078 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 22:39:12,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 22:39:12,080 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 22:39:12,081 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-14 22:39:12,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 22:39:12,143 INFO L256 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-14 22:39:12,148 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 22:39:12,279 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-14 22:39:12,279 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 22:39:12,375 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-14 22:39:12,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2115014729] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 22:39:12,375 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 22:39:12,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 7 [2025-03-14 22:39:12,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81967920] [2025-03-14 22:39:12,375 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 22:39:12,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-14 22:39:12,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:39:12,376 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-14 22:39:12,376 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-14 22:39:12,377 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 89 [2025-03-14 22:39:12,377 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 114 transitions, 603 flow. Second operand has 7 states, 7 states have (on average 73.14285714285714) internal successors, (512), 7 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 22:39:12,377 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:39:12,377 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 89 [2025-03-14 22:39:12,377 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:39:12,610 INFO L124 PetriNetUnfolderBase]: 335/1178 cut-off events. [2025-03-14 22:39:12,610 INFO L125 PetriNetUnfolderBase]: For 7614/8798 co-relation queries the response was YES. [2025-03-14 22:39:12,615 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3403 conditions, 1178 events. 335/1178 cut-off events. For 7614/8798 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 8698 event pairs, 61 based on Foata normal form. 47/1051 useless extension candidates. Maximal degree in co-relation 2928. Up to 273 conditions per place. [2025-03-14 22:39:12,633 INFO L140 encePairwiseOnDemand]: 80/89 looper letters, 71 selfloop transitions, 28 changer transitions 8/178 dead transitions. [2025-03-14 22:39:12,633 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 178 transitions, 1346 flow [2025-03-14 22:39:12,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-14 22:39:12,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-14 22:39:12,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 758 transitions. [2025-03-14 22:39:12,636 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.851685393258427 [2025-03-14 22:39:12,637 INFO L298 CegarLoopForPetriNet]: 87 programPoint places, 12 predicate places. [2025-03-14 22:39:12,637 INFO L471 AbstractCegarLoop]: Abstraction has has 99 places, 178 transitions, 1346 flow [2025-03-14 22:39:12,637 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 73.14285714285714) internal successors, (512), 7 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 22:39:12,637 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:39:12,637 INFO L221 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 22:39:12,644 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-14 22:39:12,838 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 22:39:12,838 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 22:39:12,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:39:12,839 INFO L85 PathProgramCache]: Analyzing trace with hash -1639468924, now seen corresponding path program 2 times [2025-03-14 22:39:12,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:39:12,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567728324] [2025-03-14 22:39:12,839 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 22:39:12,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:39:12,856 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 22:39:12,856 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 22:39:13,019 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 22:39:13,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:39:13,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567728324] [2025-03-14 22:39:13,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567728324] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 22:39:13,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1447007432] [2025-03-14 22:39:13,019 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 22:39:13,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 22:39:13,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 22:39:13,022 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 22:39:13,024 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-14 22:39:13,073 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 22:39:13,074 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 22:39:13,074 INFO L256 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-14 22:39:13,076 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 22:39:13,175 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 22:39:13,175 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 22:39:13,259 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 22:39:13,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1447007432] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 22:39:13,260 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 22:39:13,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 8 [2025-03-14 22:39:13,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440452728] [2025-03-14 22:39:13,260 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 22:39:13,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-14 22:39:13,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:39:13,261 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-14 22:39:13,261 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-14 22:39:13,262 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 89 [2025-03-14 22:39:13,262 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 178 transitions, 1346 flow. Second operand has 8 states, 8 states have (on average 72.875) internal successors, (583), 8 states have internal predecessors, (583), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 22:39:13,262 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:39:13,262 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 89 [2025-03-14 22:39:13,262 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:39:13,504 INFO L124 PetriNetUnfolderBase]: 353/1168 cut-off events. [2025-03-14 22:39:13,505 INFO L125 PetriNetUnfolderBase]: For 12727/14269 co-relation queries the response was YES. [2025-03-14 22:39:13,509 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3893 conditions, 1168 events. 353/1168 cut-off events. For 12727/14269 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 8379 event pairs, 43 based on Foata normal form. 55/1065 useless extension candidates. Maximal degree in co-relation 2957. Up to 287 conditions per place. [2025-03-14 22:39:13,515 INFO L140 encePairwiseOnDemand]: 80/89 looper letters, 72 selfloop transitions, 64 changer transitions 15/222 dead transitions. [2025-03-14 22:39:13,515 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 222 transitions, 2040 flow [2025-03-14 22:39:13,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-14 22:39:13,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-14 22:39:13,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 827 transitions. [2025-03-14 22:39:13,519 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8447395301327886 [2025-03-14 22:39:13,519 INFO L298 CegarLoopForPetriNet]: 87 programPoint places, 22 predicate places. [2025-03-14 22:39:13,519 INFO L471 AbstractCegarLoop]: Abstraction has has 109 places, 222 transitions, 2040 flow [2025-03-14 22:39:13,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 72.875) internal successors, (583), 8 states have internal predecessors, (583), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 22:39:13,520 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:39:13,520 INFO L221 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 22:39:13,526 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-14 22:39:13,721 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 22:39:13,722 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 22:39:13,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:39:13,722 INFO L85 PathProgramCache]: Analyzing trace with hash 336769538, now seen corresponding path program 3 times [2025-03-14 22:39:13,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:39:13,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28184748] [2025-03-14 22:39:13,723 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-14 22:39:13,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:39:13,734 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-14 22:39:13,734 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 22:39:13,753 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-14 22:39:13,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:39:13,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28184748] [2025-03-14 22:39:13,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28184748] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 22:39:13,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 22:39:13,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-14 22:39:13,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421829098] [2025-03-14 22:39:13,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 22:39:13,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 22:39:13,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:39:13,754 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 22:39:13,754 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 22:39:13,755 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 89 [2025-03-14 22:39:13,755 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 222 transitions, 2040 flow. Second operand has 3 states, 3 states have (on average 80.0) internal successors, (240), 3 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 22:39:13,755 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:39:13,755 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 89 [2025-03-14 22:39:13,755 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:39:13,851 INFO L124 PetriNetUnfolderBase]: 325/1086 cut-off events. [2025-03-14 22:39:13,851 INFO L125 PetriNetUnfolderBase]: For 12971/14307 co-relation queries the response was YES. [2025-03-14 22:39:13,854 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3927 conditions, 1086 events. 325/1086 cut-off events. For 12971/14307 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 7636 event pairs, 33 based on Foata normal form. 25/977 useless extension candidates. Maximal degree in co-relation 3432. Up to 325 conditions per place. [2025-03-14 22:39:13,859 INFO L140 encePairwiseOnDemand]: 85/89 looper letters, 93 selfloop transitions, 4 changer transitions 30/211 dead transitions. [2025-03-14 22:39:13,859 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 211 transitions, 2281 flow [2025-03-14 22:39:13,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 22:39:13,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 22:39:13,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 244 transitions. [2025-03-14 22:39:13,863 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9138576779026217 [2025-03-14 22:39:13,864 INFO L298 CegarLoopForPetriNet]: 87 programPoint places, 21 predicate places. [2025-03-14 22:39:13,864 INFO L471 AbstractCegarLoop]: Abstraction has has 108 places, 211 transitions, 2281 flow [2025-03-14 22:39:13,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 80.0) internal successors, (240), 3 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 22:39:13,864 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:39:13,864 INFO L221 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 22:39:13,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-14 22:39:13,865 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 22:39:13,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:39:13,865 INFO L85 PathProgramCache]: Analyzing trace with hash 1687396584, now seen corresponding path program 4 times [2025-03-14 22:39:13,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:39:13,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482892055] [2025-03-14 22:39:13,865 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-14 22:39:13,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:39:13,880 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2025-03-14 22:39:13,882 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 22:39:13,910 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-14 22:39:13,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:39:13,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482892055] [2025-03-14 22:39:13,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [482892055] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 22:39:13,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 22:39:13,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-14 22:39:13,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88565153] [2025-03-14 22:39:13,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 22:39:13,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 22:39:13,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:39:13,911 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 22:39:13,911 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 22:39:13,911 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 89 [2025-03-14 22:39:13,912 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 211 transitions, 2281 flow. Second operand has 3 states, 3 states have (on average 80.33333333333333) internal successors, (241), 3 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 22:39:13,912 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:39:13,912 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 89 [2025-03-14 22:39:13,912 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:39:14,012 INFO L124 PetriNetUnfolderBase]: 298/955 cut-off events. [2025-03-14 22:39:14,012 INFO L125 PetriNetUnfolderBase]: For 17658/20767 co-relation queries the response was YES. [2025-03-14 22:39:14,016 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3838 conditions, 955 events. 298/955 cut-off events. For 17658/20767 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 6163 event pairs, 23 based on Foata normal form. 100/948 useless extension candidates. Maximal degree in co-relation 2965. Up to 299 conditions per place. [2025-03-14 22:39:14,018 INFO L140 encePairwiseOnDemand]: 85/89 looper letters, 0 selfloop transitions, 0 changer transitions 182/182 dead transitions. [2025-03-14 22:39:14,018 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 182 transitions, 2118 flow [2025-03-14 22:39:14,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 22:39:14,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 22:39:14,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 242 transitions. [2025-03-14 22:39:14,019 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9063670411985019 [2025-03-14 22:39:14,019 INFO L298 CegarLoopForPetriNet]: 87 programPoint places, 17 predicate places. [2025-03-14 22:39:14,019 INFO L471 AbstractCegarLoop]: Abstraction has has 104 places, 182 transitions, 2118 flow [2025-03-14 22:39:14,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 80.33333333333333) internal successors, (241), 3 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 22:39:14,025 INFO L161 wickiGriesTestDumper]: Dumping Owicki-Gries test to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/parallel-misc-3.wvr.c_petrified1_AllErrorsAtOnce [2025-03-14 22:39:14,043 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2025-03-14 22:39:14,044 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2025-03-14 22:39:14,044 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2025-03-14 22:39:14,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-14 22:39:14,044 INFO L422 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1] [2025-03-14 22:39:14,047 INFO L328 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-14 22:39:14,047 INFO L188 ceAbstractionStarter]: Computing trace abstraction results [2025-03-14 22:39:14,052 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.03 10:39:14 BasicIcfg [2025-03-14 22:39:14,052 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-14 22:39:14,052 INFO L158 Benchmark]: Toolchain (without parser) took 4018.71ms. Allocated memory was 71.3MB in the beginning and 109.1MB in the end (delta: 37.7MB). Free memory was 44.2MB in the beginning and 30.9MB in the end (delta: 13.3MB). Peak memory consumption was 66.9MB. Max. memory is 8.0GB. [2025-03-14 22:39:14,053 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 71.3MB. Free memory is still 35.8MB. There was no memory consumed. Max. memory is 8.0GB. [2025-03-14 22:39:14,053 INFO L158 Benchmark]: CACSL2BoogieTranslator took 177.73ms. Allocated memory is still 71.3MB. Free memory was 44.0MB in the beginning and 32.5MB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-03-14 22:39:14,053 INFO L158 Benchmark]: Boogie Procedure Inliner took 20.25ms. Allocated memory is still 71.3MB. Free memory was 32.5MB in the beginning and 31.4MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 8.0GB. [2025-03-14 22:39:14,054 INFO L158 Benchmark]: Boogie Preprocessor took 22.30ms. Allocated memory is still 71.3MB. Free memory was 31.4MB in the beginning and 30.6MB in the end (delta: 889.5kB). There was no memory consumed. Max. memory is 8.0GB. [2025-03-14 22:39:14,055 INFO L158 Benchmark]: RCFGBuilder took 236.15ms. Allocated memory is still 71.3MB. Free memory was 30.6MB in the beginning and 18.8MB in the end (delta: 11.8MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-03-14 22:39:14,055 INFO L158 Benchmark]: TraceAbstraction took 3545.01ms. Allocated memory was 71.3MB in the beginning and 109.1MB in the end (delta: 37.7MB). Free memory was 44.3MB in the beginning and 30.9MB in the end (delta: 13.4MB). Peak memory consumption was 64.4MB. Max. memory is 8.0GB. [2025-03-14 22:39:14,056 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.18ms. Allocated memory is still 71.3MB. Free memory is still 35.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 177.73ms. Allocated memory is still 71.3MB. Free memory was 44.0MB in the beginning and 32.5MB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 20.25ms. Allocated memory is still 71.3MB. Free memory was 32.5MB in the beginning and 31.4MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 22.30ms. Allocated memory is still 71.3MB. Free memory was 31.4MB in the beginning and 30.6MB in the end (delta: 889.5kB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 236.15ms. Allocated memory is still 71.3MB. Free memory was 30.6MB in the beginning and 18.8MB in the end (delta: 11.8MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 3545.01ms. Allocated memory was 71.3MB in the beginning and 109.1MB in the end (delta: 37.7MB). Free memory was 44.3MB in the beginning and 30.9MB in the end (delta: 13.4MB). Peak memory consumption was 64.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 91]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 117 locations, 3 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 3.4s, OverallIterations: 8, TraceHistogramMax: 3, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 98 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 98 mSDsluCounter, 186 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 129 mSDsCounter, 22 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 413 IncrementalHoareTripleChecker+Invalid, 435 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 22 mSolverCounterUnsat, 57 mSDtfsCounter, 413 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 363 GetRequests, 335 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2281occurred in iteration=7, InterpolantAutomatonStates: 41, 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.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 742 NumberOfCodeBlocks, 737 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 890 ConstructedInterpolants, 0 QuantifiedInterpolants, 1917 SizeOfPredicates, 8 NumberOfNonLiveVariables, 328 ConjunctsInSsa, 38 ConjunctsInUnsatCore, 12 InterpolantComputations, 6 PerfectInterpolantSequences, 40/85 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-14 22:39:14,068 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...