/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-4.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.empire2-owicki-f61efc6-m [2025-03-14 22:39:10,266 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-14 22:39:10,319 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:10,375 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-14 22:39:10,376 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-14 22:39:10,377 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-14 22:39:10,377 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-14 22:39:10,377 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-14 22:39:10,377 INFO L153 SettingsManager]: * Use SBE=true [2025-03-14 22:39:10,377 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-14 22:39:10,377 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-14 22:39:10,377 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-14 22:39:10,377 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-14 22:39:10,377 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-14 22:39:10,377 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-14 22:39:10,386 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-14 22:39:10,389 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-14 22:39:10,389 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-14 22:39:10,389 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-14 22:39:10,389 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-14 22:39:10,390 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-14 22:39:10,390 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-03-14 22:39:10,390 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-14 22:39:10,390 INFO L153 SettingsManager]: * To the following directory=./dump/ [2025-03-14 22:39:10,390 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-14 22:39:10,390 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-14 22:39:10,390 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-14 22:39:10,390 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-14 22:39:10,390 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-14 22:39:10,390 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-14 22:39:10,390 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-14 22:39:10,390 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-14 22:39:10,390 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:10,627 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-14 22:39:10,633 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-14 22:39:10,634 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-14 22:39:10,635 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-14 22:39:10,635 INFO L274 PluginConnector]: CDTParser initialized [2025-03-14 22:39:10,636 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/parallel-misc-4.wvr.c [2025-03-14 22:39:11,838 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7489af3dc/ec9fb6c8f17d452aab8359a824935175/FLAG42f66bd40 [2025-03-14 22:39:11,987 INFO L384 CDTParser]: Found 1 translation units. [2025-03-14 22:39:11,988 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-misc-4.wvr.c [2025-03-14 22:39:11,993 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7489af3dc/ec9fb6c8f17d452aab8359a824935175/FLAG42f66bd40 [2025-03-14 22:39:12,009 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7489af3dc/ec9fb6c8f17d452aab8359a824935175 [2025-03-14 22:39:12,011 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-14 22:39:12,012 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-03-14 22:39:12,014 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-14 22:39:12,015 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-14 22:39:12,018 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-14 22:39:12,018 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 10:39:12" (1/1) ... [2025-03-14 22:39:12,019 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b21ac0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 10:39:12, skipping insertion in model container [2025-03-14 22:39:12,019 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 10:39:12" (1/1) ... [2025-03-14 22:39:12,032 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-14 22:39:12,156 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-4.wvr.c[2257,2270] [2025-03-14 22:39:12,163 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 22:39:12,170 INFO L200 MainTranslator]: Completed pre-run [2025-03-14 22:39:12,186 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-4.wvr.c[2257,2270] [2025-03-14 22:39:12,186 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 22:39:12,199 INFO L204 MainTranslator]: Completed translation [2025-03-14 22:39:12,200 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 10:39:12 WrapperNode [2025-03-14 22:39:12,200 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-14 22:39:12,201 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-14 22:39:12,201 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-14 22:39:12,201 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-14 22:39:12,205 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:12" (1/1) ... [2025-03-14 22:39:12,214 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:12" (1/1) ... [2025-03-14 22:39:12,228 INFO L138 Inliner]: procedures = 19, calls = 10, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 61 [2025-03-14 22:39:12,228 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-14 22:39:12,229 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-14 22:39:12,229 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-14 22:39:12,229 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-14 22:39:12,234 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:12" (1/1) ... [2025-03-14 22:39:12,235 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:12" (1/1) ... [2025-03-14 22:39:12,238 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:12" (1/1) ... [2025-03-14 22:39:12,238 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:12" (1/1) ... [2025-03-14 22:39:12,242 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:12" (1/1) ... [2025-03-14 22:39:12,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:12" (1/1) ... [2025-03-14 22:39:12,249 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:12" (1/1) ... [2025-03-14 22:39:12,251 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:12" (1/1) ... [2025-03-14 22:39:12,251 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:12" (1/1) ... [2025-03-14 22:39:12,252 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-14 22:39:12,253 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-03-14 22:39:12,253 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-03-14 22:39:12,253 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-03-14 22:39:12,257 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 10:39:12" (1/1) ... [2025-03-14 22:39:12,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-14 22:39:12,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 22:39:12,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:12,290 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:12,309 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-14 22:39:12,309 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-14 22:39:12,309 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-14 22:39:12,309 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-14 22:39:12,309 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-14 22:39:12,309 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-14 22:39:12,309 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-14 22:39:12,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-14 22:39:12,309 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-14 22:39:12,309 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-14 22:39:12,310 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:12,376 INFO L234 CfgBuilder]: Building ICFG [2025-03-14 22:39:12,377 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-14 22:39:12,527 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-14 22:39:12,527 INFO L283 CfgBuilder]: Performing block encoding [2025-03-14 22:39:12,561 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-14 22:39:12,561 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-14 22:39:12,561 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.03 10:39:12 BoogieIcfgContainer [2025-03-14 22:39:12,561 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-03-14 22:39:12,563 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-14 22:39:12,563 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-14 22:39:12,567 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-14 22:39:12,567 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.03 10:39:12" (1/3) ... [2025-03-14 22:39:12,567 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@364aec1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 10:39:12, skipping insertion in model container [2025-03-14 22:39:12,568 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 10:39:12" (2/3) ... [2025-03-14 22:39:12,568 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@364aec1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 10:39:12, skipping insertion in model container [2025-03-14 22:39:12,568 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.03 10:39:12" (3/3) ... [2025-03-14 22:39:12,568 INFO L128 eAbstractionObserver]: Analyzing ICFG parallel-misc-4.wvr.c [2025-03-14 22:39:12,580 INFO L303 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-14 22:39:12,581 INFO L169 ceAbstractionStarter]: Applying trace abstraction to ICFG parallel-misc-4.wvr.c that has 4 procedures, 91 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-03-14 22:39:12,582 INFO L581 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-14 22:39:12,649 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-14 22:39:12,691 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-14 22:39:12,705 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;@55d220f5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-14 22:39:12,705 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-03-14 22:39:12,756 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-14 22:39:12,756 INFO L124 PetriNetUnfolderBase]: 5/86 cut-off events. [2025-03-14 22:39:12,757 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-14 22:39:12,758 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:39:12,758 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] [2025-03-14 22:39:12,758 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 22:39:12,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:39:12,765 INFO L85 PathProgramCache]: Analyzing trace with hash -259868717, now seen corresponding path program 1 times [2025-03-14 22:39:12,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:39:12,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373893900] [2025-03-14 22:39:12,771 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 22:39:12,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:39:12,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 22:39:13,199 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:13,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:39:13,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373893900] [2025-03-14 22:39:13,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373893900] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 22:39:13,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 22:39:13,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 22:39:13,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068123687] [2025-03-14 22:39:13,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 22:39:13,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-14 22:39:13,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:39:13,226 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-14 22:39:13,226 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-14 22:39:13,229 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 95 [2025-03-14 22:39:13,233 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 95 transitions, 211 flow. Second operand has 5 states, 5 states have (on average 74.4) internal successors, (372), 5 states have internal predecessors, (372), 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,233 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:39:13,233 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 95 [2025-03-14 22:39:13,234 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:39:13,388 INFO L124 PetriNetUnfolderBase]: 83/278 cut-off events. [2025-03-14 22:39:13,388 INFO L125 PetriNetUnfolderBase]: For 29/29 co-relation queries the response was YES. [2025-03-14 22:39:13,395 INFO L83 FinitePrefix]: Finished finitePrefix Result has 443 conditions, 278 events. 83/278 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1086 event pairs, 21 based on Foata normal form. 2/237 useless extension candidates. Maximal degree in co-relation 353. Up to 85 conditions per place. [2025-03-14 22:39:13,398 INFO L140 encePairwiseOnDemand]: 85/95 looper letters, 19 selfloop transitions, 6 changer transitions 2/91 dead transitions. [2025-03-14 22:39:13,398 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 91 transitions, 257 flow [2025-03-14 22:39:13,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-14 22:39:13,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-14 22:39:13,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 386 transitions. [2025-03-14 22:39:13,407 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8126315789473684 [2025-03-14 22:39:13,410 INFO L298 CegarLoopForPetriNet]: 100 programPoint places, -4 predicate places. [2025-03-14 22:39:13,410 INFO L471 AbstractCegarLoop]: Abstraction has has 96 places, 91 transitions, 257 flow [2025-03-14 22:39:13,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 74.4) internal successors, (372), 5 states have internal predecessors, (372), 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,410 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:39:13,410 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] [2025-03-14 22:39:13,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-14 22:39:13,411 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 22:39:13,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:39:13,411 INFO L85 PathProgramCache]: Analyzing trace with hash 1638477451, now seen corresponding path program 2 times [2025-03-14 22:39:13,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:39:13,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111327850] [2025-03-14 22:39:13,411 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 22:39:13,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:39:13,445 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-14 22:39:13,445 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 22:39:13,689 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:13,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:39:13,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111327850] [2025-03-14 22:39:13,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111327850] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 22:39:13,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 22:39:13,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-14 22:39:13,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711479238] [2025-03-14 22:39:13,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 22:39:13,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 22:39:13,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:39:13,693 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 22:39:13,693 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-14 22:39:13,694 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 67 out of 95 [2025-03-14 22:39:13,695 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 91 transitions, 257 flow. Second operand has 6 states, 6 states have (on average 70.16666666666667) internal successors, (421), 6 states have internal predecessors, (421), 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,695 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:39:13,695 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 95 [2025-03-14 22:39:13,695 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:39:13,882 INFO L124 PetriNetUnfolderBase]: 233/606 cut-off events. [2025-03-14 22:39:13,882 INFO L125 PetriNetUnfolderBase]: For 208/266 co-relation queries the response was YES. [2025-03-14 22:39:13,886 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1316 conditions, 606 events. 233/606 cut-off events. For 208/266 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 3113 event pairs, 20 based on Foata normal form. 0/540 useless extension candidates. Maximal degree in co-relation 1183. Up to 214 conditions per place. [2025-03-14 22:39:13,890 INFO L140 encePairwiseOnDemand]: 85/95 looper letters, 29 selfloop transitions, 7 changer transitions 24/120 dead transitions. [2025-03-14 22:39:13,891 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 120 transitions, 487 flow [2025-03-14 22:39:13,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-14 22:39:13,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-14 22:39:13,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 520 transitions. [2025-03-14 22:39:13,894 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7819548872180451 [2025-03-14 22:39:13,894 INFO L298 CegarLoopForPetriNet]: 100 programPoint places, 2 predicate places. [2025-03-14 22:39:13,894 INFO L471 AbstractCegarLoop]: Abstraction has has 102 places, 120 transitions, 487 flow [2025-03-14 22:39:13,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 70.16666666666667) internal successors, (421), 6 states have internal predecessors, (421), 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,895 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:39:13,895 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] [2025-03-14 22:39:13,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-14 22:39:13,895 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 22:39:13,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:39:13,898 INFO L85 PathProgramCache]: Analyzing trace with hash 339058957, now seen corresponding path program 1 times [2025-03-14 22:39:13,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:39:13,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189468039] [2025-03-14 22:39:13,898 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 22:39:13,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:39:13,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 22:39:14,043 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:14,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:39:14,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189468039] [2025-03-14 22:39:14,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189468039] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 22:39:14,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 22:39:14,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 22:39:14,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160267752] [2025-03-14 22:39:14,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 22:39:14,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-14 22:39:14,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:39:14,045 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-14 22:39:14,045 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-14 22:39:14,045 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 95 [2025-03-14 22:39:14,046 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 120 transitions, 487 flow. Second operand has 5 states, 5 states have (on average 76.2) internal successors, (381), 5 states have internal predecessors, (381), 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,046 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:39:14,046 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 95 [2025-03-14 22:39:14,046 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:39:14,230 INFO L124 PetriNetUnfolderBase]: 419/987 cut-off events. [2025-03-14 22:39:14,230 INFO L125 PetriNetUnfolderBase]: For 1040/1138 co-relation queries the response was YES. [2025-03-14 22:39:14,234 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2591 conditions, 987 events. 419/987 cut-off events. For 1040/1138 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 5939 event pairs, 78 based on Foata normal form. 0/868 useless extension candidates. Maximal degree in co-relation 2334. Up to 370 conditions per place. [2025-03-14 22:39:14,240 INFO L140 encePairwiseOnDemand]: 89/95 looper letters, 34 selfloop transitions, 5 changer transitions 27/140 dead transitions. [2025-03-14 22:39:14,240 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 140 transitions, 727 flow [2025-03-14 22:39:14,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-14 22:39:14,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-14 22:39:14,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 394 transitions. [2025-03-14 22:39:14,242 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8294736842105264 [2025-03-14 22:39:14,243 INFO L298 CegarLoopForPetriNet]: 100 programPoint places, 6 predicate places. [2025-03-14 22:39:14,243 INFO L471 AbstractCegarLoop]: Abstraction has has 106 places, 140 transitions, 727 flow [2025-03-14 22:39:14,244 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 76.2) internal successors, (381), 5 states have internal predecessors, (381), 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,244 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:39:14,244 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] [2025-03-14 22:39:14,244 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-14 22:39:14,244 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 22:39:14,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:39:14,245 INFO L85 PathProgramCache]: Analyzing trace with hash -1459092201, now seen corresponding path program 1 times [2025-03-14 22:39:14,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:39:14,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432210869] [2025-03-14 22:39:14,246 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 22:39:14,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:39:14,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 22:39:14,380 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:14,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:39:14,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432210869] [2025-03-14 22:39:14,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432210869] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 22:39:14,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 22:39:14,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 22:39:14,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186511452] [2025-03-14 22:39:14,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 22:39:14,381 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-14 22:39:14,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:39:14,381 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-14 22:39:14,382 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-14 22:39:14,382 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 95 [2025-03-14 22:39:14,382 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 140 transitions, 727 flow. Second operand has 5 states, 5 states have (on average 76.4) internal successors, (382), 5 states have internal predecessors, (382), 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,383 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:39:14,383 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 95 [2025-03-14 22:39:14,383 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:39:14,590 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([218] L46-->L46-2: Formula: (and (= |v_thread1Thread1of1ForFork2_#t~post2_1| (+ v_~pos~0_13 1)) (= |v_thread1Thread1of1ForFork2_#t~post2_1| v_~pos~0_14)) InVars {~pos~0=v_~pos~0_14} OutVars{thread1Thread1of1ForFork2_#t~post2=|v_thread1Thread1of1ForFork2_#t~post2_1|, ~pos~0=v_~pos~0_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post2, ~pos~0][143], [120#true, thread3Thread1of1ForFork1InUse, thread1Thread1of1ForFork2InUse, thread2Thread1of1ForFork0InUse, 110#true, 85#L46-2true, 47#L69-1true, 103#true, 45#L55-1true, 127#true, 92#L88-4true]) [2025-03-14 22:39:14,590 INFO L294 olderBase$Statistics]: this new event has 73 ancestors and is not cut-off event [2025-03-14 22:39:14,590 INFO L297 olderBase$Statistics]: existing Event has 73 ancestors and is not cut-off event [2025-03-14 22:39:14,590 INFO L297 olderBase$Statistics]: existing Event has 74 ancestors and is not cut-off event [2025-03-14 22:39:14,591 INFO L297 olderBase$Statistics]: existing Event has 74 ancestors and is not cut-off event [2025-03-14 22:39:14,612 INFO L124 PetriNetUnfolderBase]: 703/1557 cut-off events. [2025-03-14 22:39:14,612 INFO L125 PetriNetUnfolderBase]: For 3273/3509 co-relation queries the response was YES. [2025-03-14 22:39:14,620 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4814 conditions, 1557 events. 703/1557 cut-off events. For 3273/3509 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 10665 event pairs, 80 based on Foata normal form. 6/1364 useless extension candidates. Maximal degree in co-relation 4537. Up to 581 conditions per place. [2025-03-14 22:39:14,630 INFO L140 encePairwiseOnDemand]: 89/95 looper letters, 57 selfloop transitions, 5 changer transitions 5/154 dead transitions. [2025-03-14 22:39:14,630 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 154 transitions, 997 flow [2025-03-14 22:39:14,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-14 22:39:14,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-14 22:39:14,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 393 transitions. [2025-03-14 22:39:14,632 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8273684210526315 [2025-03-14 22:39:14,633 INFO L298 CegarLoopForPetriNet]: 100 programPoint places, 10 predicate places. [2025-03-14 22:39:14,634 INFO L471 AbstractCegarLoop]: Abstraction has has 110 places, 154 transitions, 997 flow [2025-03-14 22:39:14,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 76.4) internal successors, (382), 5 states have internal predecessors, (382), 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,634 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:39:14,635 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, 1, 1, 1, 1] [2025-03-14 22:39:14,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-14 22:39:14,635 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 22:39:14,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:39:14,636 INFO L85 PathProgramCache]: Analyzing trace with hash 281583255, now seen corresponding path program 1 times [2025-03-14 22:39:14,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:39:14,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195715527] [2025-03-14 22:39:14,636 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 22:39:14,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:39:14,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 22:39:14,831 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 22:39:14,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:39:14,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195715527] [2025-03-14 22:39:14,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195715527] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 22:39:14,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [328357175] [2025-03-14 22:39:14,832 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 22:39:14,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 22:39:14,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 22:39:14,836 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:14,838 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:14,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 22:39:14,903 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-14 22:39:14,906 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 22:39:15,079 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 22:39:15,079 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 22:39:15,164 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 22:39:15,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [328357175] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 22:39:15,165 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 22:39:15,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 7] total 12 [2025-03-14 22:39:15,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246119934] [2025-03-14 22:39:15,165 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 22:39:15,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-14 22:39:15,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:39:15,168 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-14 22:39:15,168 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2025-03-14 22:39:15,169 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 67 out of 95 [2025-03-14 22:39:15,169 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 154 transitions, 997 flow. Second operand has 12 states, 12 states have (on average 70.16666666666667) internal successors, (842), 12 states have internal predecessors, (842), 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:15,169 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:39:15,169 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 95 [2025-03-14 22:39:15,170 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:39:15,518 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([217] L43-->L43-2: Formula: (and (= (+ |v_thread1Thread1of1ForFork2_#t~post1_1| 1) v_~pos~0_17) (= |v_thread1Thread1of1ForFork2_#t~post1_1| v_~pos~0_18)) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1, ~pos~0][116], [120#true, thread3Thread1of1ForFork1InUse, 623#(and (<= 1 (mod ~v_assert~0 256)) (<= 0 ~pos~0)), thread1Thread1of1ForFork2InUse, thread2Thread1of1ForFork0InUse, 110#true, 88#$Ultimate##0true, 107#(<= 1 (mod ~v_assert~0 256)), 131#(<= 1 (mod ~d1~0 256)), 11#L43-2true, 45#L55-1true, 92#L88-4true]) [2025-03-14 22:39:15,519 INFO L294 olderBase$Statistics]: this new event has 72 ancestors and is cut-off event [2025-03-14 22:39:15,519 INFO L297 olderBase$Statistics]: existing Event has 66 ancestors and is cut-off event [2025-03-14 22:39:15,519 INFO L297 olderBase$Statistics]: existing Event has 66 ancestors and is cut-off event [2025-03-14 22:39:15,519 INFO L297 olderBase$Statistics]: existing Event has 71 ancestors and is cut-off event [2025-03-14 22:39:15,539 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([217] L43-->L43-2: Formula: (and (= (+ |v_thread1Thread1of1ForFork2_#t~post1_1| 1) v_~pos~0_17) (= |v_thread1Thread1of1ForFork2_#t~post1_1| v_~pos~0_18)) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1, ~pos~0][182], [120#true, thread3Thread1of1ForFork1InUse, thread1Thread1of1ForFork2InUse, thread2Thread1of1ForFork0InUse, 629#(and (= ~v_assert~0 1) (<= 0 ~pos~0)), 110#true, 131#(<= 1 (mod ~d1~0 256)), 47#L69-1true, 11#L43-2true, 103#true, 45#L55-1true, 92#L88-4true]) [2025-03-14 22:39:15,539 INFO L294 olderBase$Statistics]: this new event has 74 ancestors and is cut-off event [2025-03-14 22:39:15,539 INFO L297 olderBase$Statistics]: existing Event has 73 ancestors and is cut-off event [2025-03-14 22:39:15,539 INFO L297 olderBase$Statistics]: existing Event has 68 ancestors and is cut-off event [2025-03-14 22:39:15,539 INFO L297 olderBase$Statistics]: existing Event has 68 ancestors and is cut-off event [2025-03-14 22:39:15,568 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([217] L43-->L43-2: Formula: (and (= (+ |v_thread1Thread1of1ForFork2_#t~post1_1| 1) v_~pos~0_17) (= |v_thread1Thread1of1ForFork2_#t~post1_1| v_~pos~0_18)) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1, ~pos~0][184], [120#true, thread3Thread1of1ForFork1InUse, 115#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), thread1Thread1of1ForFork2InUse, thread2Thread1of1ForFork0InUse, 629#(and (= ~v_assert~0 1) (<= 0 ~pos~0)), 107#(<= 1 (mod ~v_assert~0 256)), 131#(<= 1 (mod ~d1~0 256)), 47#L69-1true, 11#L43-2true, 45#L55-1true, 92#L88-4true]) [2025-03-14 22:39:15,569 INFO L294 olderBase$Statistics]: this new event has 74 ancestors and is cut-off event [2025-03-14 22:39:15,569 INFO L297 olderBase$Statistics]: existing Event has 68 ancestors and is cut-off event [2025-03-14 22:39:15,569 INFO L297 olderBase$Statistics]: existing Event has 68 ancestors and is cut-off event [2025-03-14 22:39:15,569 INFO L297 olderBase$Statistics]: existing Event has 73 ancestors and is cut-off event [2025-03-14 22:39:15,628 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([217] L43-->L43-2: Formula: (and (= (+ |v_thread1Thread1of1ForFork2_#t~post1_1| 1) v_~pos~0_17) (= |v_thread1Thread1of1ForFork2_#t~post1_1| v_~pos~0_18)) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1, ~pos~0][151], [120#true, thread3Thread1of1ForFork1InUse, 424#(< 0 (mod ~v_assert~0 256)), thread1Thread1of1ForFork2InUse, thread2Thread1of1ForFork0InUse, 110#true, 107#(<= 1 (mod ~v_assert~0 256)), 131#(<= 1 (mod ~d1~0 256)), 47#L69-1true, 11#L43-2true, 45#L55-1true, 92#L88-4true]) [2025-03-14 22:39:15,629 INFO L294 olderBase$Statistics]: this new event has 77 ancestors and is cut-off event [2025-03-14 22:39:15,629 INFO L297 olderBase$Statistics]: existing Event has 74 ancestors and is cut-off event [2025-03-14 22:39:15,629 INFO L297 olderBase$Statistics]: existing Event has 76 ancestors and is cut-off event [2025-03-14 22:39:15,629 INFO L297 olderBase$Statistics]: existing Event has 72 ancestors and is cut-off event [2025-03-14 22:39:15,644 INFO L124 PetriNetUnfolderBase]: 1387/2812 cut-off events. [2025-03-14 22:39:15,644 INFO L125 PetriNetUnfolderBase]: For 9498/9972 co-relation queries the response was YES. [2025-03-14 22:39:15,649 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10902 conditions, 2812 events. 1387/2812 cut-off events. For 9498/9972 co-relation queries the response was YES. Maximal size of possible extension queue 205. Compared 20600 event pairs, 52 based on Foata normal form. 9/2497 useless extension candidates. Maximal degree in co-relation 10572. Up to 1233 conditions per place. [2025-03-14 22:39:15,662 INFO L140 encePairwiseOnDemand]: 79/95 looper letters, 92 selfloop transitions, 37 changer transitions 85/278 dead transitions. [2025-03-14 22:39:15,662 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 278 transitions, 2415 flow [2025-03-14 22:39:15,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-14 22:39:15,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-14 22:39:15,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1095 transitions. [2025-03-14 22:39:15,667 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7684210526315789 [2025-03-14 22:39:15,668 INFO L298 CegarLoopForPetriNet]: 100 programPoint places, 24 predicate places. [2025-03-14 22:39:15,668 INFO L471 AbstractCegarLoop]: Abstraction has has 124 places, 278 transitions, 2415 flow [2025-03-14 22:39:15,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 70.16666666666667) internal successors, (842), 12 states have internal predecessors, (842), 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:15,669 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:39:15,669 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, 1, 1, 1, 1, 1, 1] [2025-03-14 22:39:15,676 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:15,874 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:15,874 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 22:39:15,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:39:15,875 INFO L85 PathProgramCache]: Analyzing trace with hash 330602504, now seen corresponding path program 1 times [2025-03-14 22:39:15,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:39:15,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348607794] [2025-03-14 22:39:15,875 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 22:39:15,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:39:15,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 22:39:16,119 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 22:39:16,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:39:16,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348607794] [2025-03-14 22:39:16,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348607794] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 22:39:16,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 22:39:16,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-14 22:39:16,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026042044] [2025-03-14 22:39:16,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 22:39:16,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-14 22:39:16,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:39:16,122 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-14 22:39:16,122 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-03-14 22:39:16,123 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 67 out of 95 [2025-03-14 22:39:16,123 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 278 transitions, 2415 flow. Second operand has 7 states, 7 states have (on average 70.28571428571429) internal successors, (492), 7 states have internal predecessors, (492), 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:16,124 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:39:16,124 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 95 [2025-03-14 22:39:16,124 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:39:16,637 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([217] L43-->L43-2: Formula: (and (= (+ |v_thread1Thread1of1ForFork2_#t~post1_1| 1) v_~pos~0_17) (= |v_thread1Thread1of1ForFork2_#t~post1_1| v_~pos~0_18)) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1, ~pos~0][393], [thread3Thread1of1ForFork1InUse, 336#(= ~v_assert~0 1), thread1Thread1of1ForFork2InUse, thread2Thread1of1ForFork0InUse, 73#L57true, 107#(<= 1 (mod ~v_assert~0 256)), 47#L69-1true, 131#(<= 1 (mod ~d1~0 256)), 115#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), 124#(<= 1 (mod ~d2~0 256)), 638#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), 11#L43-2true, 92#L88-4true]) [2025-03-14 22:39:16,637 INFO L294 olderBase$Statistics]: this new event has 79 ancestors and is cut-off event [2025-03-14 22:39:16,637 INFO L297 olderBase$Statistics]: existing Event has 74 ancestors and is cut-off event [2025-03-14 22:39:16,637 INFO L297 olderBase$Statistics]: existing Event has 74 ancestors and is cut-off event [2025-03-14 22:39:16,637 INFO L297 olderBase$Statistics]: existing Event has 77 ancestors and is cut-off event [2025-03-14 22:39:16,650 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([217] L43-->L43-2: Formula: (and (= (+ |v_thread1Thread1of1ForFork2_#t~post1_1| 1) v_~pos~0_17) (= |v_thread1Thread1of1ForFork2_#t~post1_1| v_~pos~0_18)) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1, ~pos~0][118], [120#true, 632#true, thread3Thread1of1ForFork1InUse, 623#(and (<= 1 (mod ~v_assert~0 256)) (<= 0 ~pos~0)), thread1Thread1of1ForFork2InUse, thread2Thread1of1ForFork0InUse, 110#true, 88#$Ultimate##0true, 107#(<= 1 (mod ~v_assert~0 256)), 131#(<= 1 (mod ~d1~0 256)), 11#L43-2true, 45#L55-1true, 92#L88-4true]) [2025-03-14 22:39:16,650 INFO L294 olderBase$Statistics]: this new event has 80 ancestors and is cut-off event [2025-03-14 22:39:16,650 INFO L297 olderBase$Statistics]: existing Event has 66 ancestors and is cut-off event [2025-03-14 22:39:16,650 INFO L297 olderBase$Statistics]: existing Event has 66 ancestors and is cut-off event [2025-03-14 22:39:16,650 INFO L297 olderBase$Statistics]: existing Event has 71 ancestors and is cut-off event [2025-03-14 22:39:16,669 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([217] L43-->L43-2: Formula: (and (= (+ |v_thread1Thread1of1ForFork2_#t~post1_1| 1) v_~pos~0_17) (= |v_thread1Thread1of1ForFork2_#t~post1_1| v_~pos~0_18)) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1, ~pos~0][219], [632#true, 120#true, thread3Thread1of1ForFork1InUse, thread1Thread1of1ForFork2InUse, thread2Thread1of1ForFork0InUse, 110#true, 131#(<= 1 (mod ~d1~0 256)), 47#L69-1true, 629#(and (= ~v_assert~0 1) (<= 0 ~pos~0)), 11#L43-2true, 103#true, 45#L55-1true, 92#L88-4true]) [2025-03-14 22:39:16,669 INFO L294 olderBase$Statistics]: this new event has 82 ancestors and is cut-off event [2025-03-14 22:39:16,669 INFO L297 olderBase$Statistics]: existing Event has 68 ancestors and is cut-off event [2025-03-14 22:39:16,669 INFO L297 olderBase$Statistics]: existing Event has 73 ancestors and is cut-off event [2025-03-14 22:39:16,669 INFO L297 olderBase$Statistics]: existing Event has 68 ancestors and is cut-off event [2025-03-14 22:39:16,680 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([217] L43-->L43-2: Formula: (and (= (+ |v_thread1Thread1of1ForFork2_#t~post1_1| 1) v_~pos~0_17) (= |v_thread1Thread1of1ForFork2_#t~post1_1| v_~pos~0_18)) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1, ~pos~0][221], [120#true, thread3Thread1of1ForFork1InUse, thread1Thread1of1ForFork2InUse, thread2Thread1of1ForFork0InUse, 107#(<= 1 (mod ~v_assert~0 256)), 47#L69-1true, 131#(<= 1 (mod ~d1~0 256)), 115#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), 638#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), 629#(and (= ~v_assert~0 1) (<= 0 ~pos~0)), 11#L43-2true, 45#L55-1true, 92#L88-4true]) [2025-03-14 22:39:16,680 INFO L294 olderBase$Statistics]: this new event has 82 ancestors and is cut-off event [2025-03-14 22:39:16,680 INFO L297 olderBase$Statistics]: existing Event has 68 ancestors and is cut-off event [2025-03-14 22:39:16,680 INFO L297 olderBase$Statistics]: existing Event has 68 ancestors and is cut-off event [2025-03-14 22:39:16,680 INFO L297 olderBase$Statistics]: existing Event has 73 ancestors and is cut-off event [2025-03-14 22:39:16,732 INFO L124 PetriNetUnfolderBase]: 2480/5061 cut-off events. [2025-03-14 22:39:16,732 INFO L125 PetriNetUnfolderBase]: For 23307/24042 co-relation queries the response was YES. [2025-03-14 22:39:16,739 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22754 conditions, 5061 events. 2480/5061 cut-off events. For 23307/24042 co-relation queries the response was YES. Maximal size of possible extension queue 353. Compared 40671 event pairs, 105 based on Foata normal form. 22/4519 useless extension candidates. Maximal degree in co-relation 22197. Up to 2513 conditions per place. [2025-03-14 22:39:16,763 INFO L140 encePairwiseOnDemand]: 83/95 looper letters, 192 selfloop transitions, 58 changer transitions 219/533 dead transitions. [2025-03-14 22:39:16,763 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 533 transitions, 5905 flow [2025-03-14 22:39:16,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-14 22:39:16,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-14 22:39:16,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 671 transitions. [2025-03-14 22:39:16,765 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7847953216374269 [2025-03-14 22:39:16,766 INFO L298 CegarLoopForPetriNet]: 100 programPoint places, 32 predicate places. [2025-03-14 22:39:16,766 INFO L471 AbstractCegarLoop]: Abstraction has has 132 places, 533 transitions, 5905 flow [2025-03-14 22:39:16,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 70.28571428571429) internal successors, (492), 7 states have internal predecessors, (492), 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:16,766 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:39:16,766 INFO L221 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 22:39:16,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-14 22:39:16,766 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 22:39:16,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:39:16,767 INFO L85 PathProgramCache]: Analyzing trace with hash 549742225, now seen corresponding path program 2 times [2025-03-14 22:39:16,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:39:16,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479194294] [2025-03-14 22:39:16,767 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 22:39:16,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:39:16,786 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 22:39:16,786 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 22:39:16,877 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-14 22:39:16,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:39:16,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479194294] [2025-03-14 22:39:16,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479194294] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 22:39:16,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 22:39:16,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-14 22:39:16,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868550528] [2025-03-14 22:39:16,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 22:39:16,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-14 22:39:16,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:39:16,879 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-14 22:39:16,879 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-14 22:39:16,879 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 95 [2025-03-14 22:39:16,880 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 533 transitions, 5905 flow. Second operand has 4 states, 4 states have (on average 82.75) internal successors, (331), 4 states have internal predecessors, (331), 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:16,880 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:39:16,880 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 95 [2025-03-14 22:39:16,880 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:39:17,572 INFO L124 PetriNetUnfolderBase]: 2581/5486 cut-off events. [2025-03-14 22:39:17,572 INFO L125 PetriNetUnfolderBase]: For 30984/32332 co-relation queries the response was YES. [2025-03-14 22:39:17,583 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26941 conditions, 5486 events. 2581/5486 cut-off events. For 30984/32332 co-relation queries the response was YES. Maximal size of possible extension queue 346. Compared 45723 event pairs, 111 based on Foata normal form. 70/5081 useless extension candidates. Maximal degree in co-relation 26365. Up to 2783 conditions per place. [2025-03-14 22:39:17,610 INFO L140 encePairwiseOnDemand]: 90/95 looper letters, 234 selfloop transitions, 5 changer transitions 227/658 dead transitions. [2025-03-14 22:39:17,611 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 658 transitions, 8491 flow [2025-03-14 22:39:17,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-14 22:39:17,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-14 22:39:17,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 348 transitions. [2025-03-14 22:39:17,612 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9157894736842105 [2025-03-14 22:39:17,612 INFO L298 CegarLoopForPetriNet]: 100 programPoint places, 35 predicate places. [2025-03-14 22:39:17,612 INFO L471 AbstractCegarLoop]: Abstraction has has 135 places, 658 transitions, 8491 flow [2025-03-14 22:39:17,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 82.75) internal successors, (331), 4 states have internal predecessors, (331), 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:17,613 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:39:17,613 INFO L221 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 22:39:17,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-14 22:39:17,613 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 22:39:17,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:39:17,613 INFO L85 PathProgramCache]: Analyzing trace with hash 1536624374, now seen corresponding path program 2 times [2025-03-14 22:39:17,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:39:17,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556836862] [2025-03-14 22:39:17,614 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 22:39:17,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:39:17,630 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 22:39:17,630 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 22:39:17,712 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 22:39:17,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:39:17,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556836862] [2025-03-14 22:39:17,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556836862] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 22:39:17,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 22:39:17,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-14 22:39:17,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972959639] [2025-03-14 22:39:17,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 22:39:17,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-14 22:39:17,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:39:17,713 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-14 22:39:17,713 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-14 22:39:17,714 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 95 [2025-03-14 22:39:17,714 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 658 transitions, 8491 flow. Second operand has 4 states, 4 states have (on average 83.5) internal successors, (334), 4 states have internal predecessors, (334), 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:17,714 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:39:17,714 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 95 [2025-03-14 22:39:17,714 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:39:18,451 INFO L124 PetriNetUnfolderBase]: 2360/5387 cut-off events. [2025-03-14 22:39:18,451 INFO L125 PetriNetUnfolderBase]: For 37683/40462 co-relation queries the response was YES. [2025-03-14 22:39:18,466 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27628 conditions, 5387 events. 2360/5387 cut-off events. For 37683/40462 co-relation queries the response was YES. Maximal size of possible extension queue 300. Compared 46648 event pairs, 132 based on Foata normal form. 150/5276 useless extension candidates. Maximal degree in co-relation 26826. Up to 2772 conditions per place. [2025-03-14 22:39:18,496 INFO L140 encePairwiseOnDemand]: 90/95 looper letters, 253 selfloop transitions, 5 changer transitions 203/652 dead transitions. [2025-03-14 22:39:18,496 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 652 transitions, 9227 flow [2025-03-14 22:39:18,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-14 22:39:18,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-14 22:39:18,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 344 transitions. [2025-03-14 22:39:18,498 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9052631578947369 [2025-03-14 22:39:18,498 INFO L298 CegarLoopForPetriNet]: 100 programPoint places, 38 predicate places. [2025-03-14 22:39:18,498 INFO L471 AbstractCegarLoop]: Abstraction has has 138 places, 652 transitions, 9227 flow [2025-03-14 22:39:18,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 83.5) internal successors, (334), 4 states have internal predecessors, (334), 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:18,499 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:39:18,499 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 22:39:18,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-14 22:39:18,499 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 22:39:18,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:39:18,500 INFO L85 PathProgramCache]: Analyzing trace with hash 1001782088, now seen corresponding path program 1 times [2025-03-14 22:39:18,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:39:18,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265525834] [2025-03-14 22:39:18,500 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 22:39:18,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:39:18,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 22:39:18,753 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 22:39:18,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:39:18,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265525834] [2025-03-14 22:39:18,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265525834] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 22:39:18,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1048842799] [2025-03-14 22:39:18,753 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 22:39:18,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 22:39:18,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 22:39:18,756 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:18,757 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:18,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 22:39:18,813 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-14 22:39:18,815 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 22:39:18,949 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 22:39:18,950 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 22:39:19,096 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 22:39:19,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1048842799] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 22:39:19,096 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 22:39:19,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 8] total 13 [2025-03-14 22:39:19,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996065747] [2025-03-14 22:39:19,097 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 22:39:19,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-14 22:39:19,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:39:19,097 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-14 22:39:19,097 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2025-03-14 22:39:19,100 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 67 out of 95 [2025-03-14 22:39:19,100 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 652 transitions, 9227 flow. Second operand has 13 states, 13 states have (on average 70.07692307692308) internal successors, (911), 13 states have internal predecessors, (911), 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:19,100 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:39:19,101 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 95 [2025-03-14 22:39:19,101 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:39:20,221 INFO L124 PetriNetUnfolderBase]: 3519/8226 cut-off events. [2025-03-14 22:39:20,221 INFO L125 PetriNetUnfolderBase]: For 69017/72423 co-relation queries the response was YES. [2025-03-14 22:39:20,240 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46955 conditions, 8226 events. 3519/8226 cut-off events. For 69017/72423 co-relation queries the response was YES. Maximal size of possible extension queue 466. Compared 77985 event pairs, 182 based on Foata normal form. 139/8052 useless extension candidates. Maximal degree in co-relation 46079. Up to 4230 conditions per place. [2025-03-14 22:39:20,274 INFO L140 encePairwiseOnDemand]: 79/95 looper letters, 336 selfloop transitions, 159 changer transitions 527/1092 dead transitions. [2025-03-14 22:39:20,275 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 1092 transitions, 17910 flow [2025-03-14 22:39:20,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-14 22:39:20,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-03-14 22:39:20,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1244 transitions. [2025-03-14 22:39:20,278 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7702786377708978 [2025-03-14 22:39:20,279 INFO L298 CegarLoopForPetriNet]: 100 programPoint places, 54 predicate places. [2025-03-14 22:39:20,279 INFO L471 AbstractCegarLoop]: Abstraction has has 154 places, 1092 transitions, 17910 flow [2025-03-14 22:39:20,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 70.07692307692308) internal successors, (911), 13 states have internal predecessors, (911), 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:20,280 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:39:20,280 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 22:39:20,286 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:20,480 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,SelfDestructingSolverStorable8 [2025-03-14 22:39:20,481 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 22:39:20,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:39:20,482 INFO L85 PathProgramCache]: Analyzing trace with hash -488772788, now seen corresponding path program 2 times [2025-03-14 22:39:20,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:39:20,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801783725] [2025-03-14 22:39:20,482 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 22:39:20,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:39:20,508 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 22:39:20,509 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 22:39:20,752 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 22:39:20,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:39:20,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801783725] [2025-03-14 22:39:20,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801783725] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 22:39:20,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [187477065] [2025-03-14 22:39:20,752 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 22:39:20,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 22:39:20,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 22:39:20,754 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 22:39:20,757 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-14 22:39:20,809 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 22:39:20,809 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 22:39:20,811 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-14 22:39:20,813 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 22:39:20,934 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 22:39:20,934 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 22:39:21,054 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 22:39:21,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [187477065] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 22:39:21,054 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 22:39:21,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 16 [2025-03-14 22:39:21,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714716742] [2025-03-14 22:39:21,055 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 22:39:21,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-14 22:39:21,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:39:21,055 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-14 22:39:21,056 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2025-03-14 22:39:21,056 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 57 out of 95 [2025-03-14 22:39:21,057 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 1092 transitions, 17910 flow. Second operand has 16 states, 16 states have (on average 61.4375) internal successors, (983), 16 states have internal predecessors, (983), 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:21,057 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:39:21,057 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 57 of 95 [2025-03-14 22:39:21,057 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:39:24,981 INFO L124 PetriNetUnfolderBase]: 12121/24481 cut-off events. [2025-03-14 22:39:24,981 INFO L125 PetriNetUnfolderBase]: For 156375/156865 co-relation queries the response was YES. [2025-03-14 22:39:25,062 INFO L83 FinitePrefix]: Finished finitePrefix Result has 138207 conditions, 24481 events. 12121/24481 cut-off events. For 156375/156865 co-relation queries the response was YES. Maximal size of possible extension queue 1017. Compared 235985 event pairs, 1305 based on Foata normal form. 23/23874 useless extension candidates. Maximal degree in co-relation 137351. Up to 9904 conditions per place. [2025-03-14 22:39:25,141 INFO L140 encePairwiseOnDemand]: 79/95 looper letters, 624 selfloop transitions, 120 changer transitions 1605/2399 dead transitions. [2025-03-14 22:39:25,142 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 2399 transitions, 43601 flow [2025-03-14 22:39:25,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-14 22:39:25,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-03-14 22:39:25,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1128 transitions. [2025-03-14 22:39:25,144 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.698452012383901 [2025-03-14 22:39:25,144 INFO L298 CegarLoopForPetriNet]: 100 programPoint places, 70 predicate places. [2025-03-14 22:39:25,144 INFO L471 AbstractCegarLoop]: Abstraction has has 170 places, 2399 transitions, 43601 flow [2025-03-14 22:39:25,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 61.4375) internal successors, (983), 16 states have internal predecessors, (983), 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:25,145 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:39:25,145 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 22:39:25,151 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-14 22:39:25,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 22:39:25,346 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 22:39:25,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:39:25,347 INFO L85 PathProgramCache]: Analyzing trace with hash -1959122008, now seen corresponding path program 3 times [2025-03-14 22:39:25,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:39:25,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208766124] [2025-03-14 22:39:25,347 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-14 22:39:25,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:39:25,362 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-14 22:39:25,362 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 22:39:25,664 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 22:39:25,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:39:25,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208766124] [2025-03-14 22:39:25,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208766124] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 22:39:25,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1328410274] [2025-03-14 22:39:25,665 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-14 22:39:25,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 22:39:25,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 22:39:25,667 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 22:39:25,668 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-14 22:39:25,721 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-14 22:39:25,721 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 22:39:25,724 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-14 22:39:25,726 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 22:39:25,837 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 22:39:25,837 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 22:39:25,959 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 22:39:25,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1328410274] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 22:39:25,960 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 22:39:25,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 17 [2025-03-14 22:39:25,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276759534] [2025-03-14 22:39:25,960 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 22:39:25,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-14 22:39:25,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:39:25,961 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-14 22:39:25,961 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2025-03-14 22:39:25,962 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 57 out of 95 [2025-03-14 22:39:25,962 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 2399 transitions, 43601 flow. Second operand has 17 states, 17 states have (on average 61.05882352941177) internal successors, (1038), 17 states have internal predecessors, (1038), 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:25,962 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:39:25,962 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 57 of 95 [2025-03-14 22:39:25,962 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:39:33,853 INFO L124 PetriNetUnfolderBase]: 13639/27739 cut-off events. [2025-03-14 22:39:33,854 INFO L125 PetriNetUnfolderBase]: For 177608/181717 co-relation queries the response was YES. [2025-03-14 22:39:33,941 INFO L83 FinitePrefix]: Finished finitePrefix Result has 179340 conditions, 27739 events. 13639/27739 cut-off events. For 177608/181717 co-relation queries the response was YES. Maximal size of possible extension queue 1172. Compared 272645 event pairs, 556 based on Foata normal form. 78/27138 useless extension candidates. Maximal degree in co-relation 179163. Up to 11037 conditions per place. [2025-03-14 22:39:33,990 INFO L140 encePairwiseOnDemand]: 81/95 looper letters, 0 selfloop transitions, 0 changer transitions 3284/3284 dead transitions. [2025-03-14 22:39:33,990 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 3284 transitions, 64314 flow [2025-03-14 22:39:33,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-14 22:39:33,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-03-14 22:39:33,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1104 transitions. [2025-03-14 22:39:33,993 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6835913312693499 [2025-03-14 22:39:33,993 INFO L298 CegarLoopForPetriNet]: 100 programPoint places, 76 predicate places. [2025-03-14 22:39:33,993 INFO L471 AbstractCegarLoop]: Abstraction has has 176 places, 3284 transitions, 64314 flow [2025-03-14 22:39:33,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 61.05882352941177) internal successors, (1038), 17 states have internal predecessors, (1038), 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:33,999 INFO L161 wickiGriesTestDumper]: Dumping Owicki-Gries test to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/parallel-misc-4.wvr.c_petrified1_AllErrorsAtOnce [2025-03-14 22:39:34,025 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2025-03-14 22:39:34,025 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2025-03-14 22:39:34,025 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2025-03-14 22:39:34,025 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2025-03-14 22:39:34,034 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 22:39:34,230 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 22:39:34,230 INFO L422 BasicCegarLoop]: Path program histogram: [3, 2, 2, 2, 1, 1] [2025-03-14 22:39:34,234 INFO L328 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-14 22:39:34,234 INFO L188 ceAbstractionStarter]: Computing trace abstraction results [2025-03-14 22:39:34,239 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.03 10:39:34 BasicIcfg [2025-03-14 22:39:34,239 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-14 22:39:34,239 INFO L158 Benchmark]: Toolchain (without parser) took 22227.15ms. Allocated memory was 71.3MB in the beginning and 1.8GB in the end (delta: 1.7GB). Free memory was 43.0MB in the beginning and 597.8MB in the end (delta: -554.8MB). Peak memory consumption was 1.6GB. Max. memory is 8.0GB. [2025-03-14 22:39:34,239 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 71.3MB. Free memory is still 34.9MB. There was no memory consumed. Max. memory is 8.0GB. [2025-03-14 22:39:34,240 INFO L158 Benchmark]: CACSL2BoogieTranslator took 186.05ms. Allocated memory is still 71.3MB. Free memory was 42.9MB in the beginning and 31.2MB in the end (delta: 11.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-03-14 22:39:34,240 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.74ms. Allocated memory is still 71.3MB. Free memory was 31.2MB in the beginning and 30.0MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 8.0GB. [2025-03-14 22:39:34,240 INFO L158 Benchmark]: Boogie Preprocessor took 23.67ms. Allocated memory is still 71.3MB. Free memory was 30.0MB in the beginning and 29.0MB in the end (delta: 924.2kB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-03-14 22:39:34,240 INFO L158 Benchmark]: RCFGBuilder took 308.39ms. Allocated memory is still 71.3MB. Free memory was 28.9MB in the beginning and 43.8MB in the end (delta: -14.9MB). Peak memory consumption was 14.6MB. Max. memory is 8.0GB. [2025-03-14 22:39:34,240 INFO L158 Benchmark]: TraceAbstraction took 21675.37ms. Allocated memory was 71.3MB in the beginning and 1.8GB in the end (delta: 1.7GB). Free memory was 42.5MB in the beginning and 597.8MB in the end (delta: -555.2MB). Peak memory consumption was 1.6GB. Max. memory is 8.0GB. [2025-03-14 22:39:34,241 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.17ms. Allocated memory is still 71.3MB. Free memory is still 34.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 186.05ms. Allocated memory is still 71.3MB. Free memory was 42.9MB in the beginning and 31.2MB in the end (delta: 11.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 27.74ms. Allocated memory is still 71.3MB. Free memory was 31.2MB in the beginning and 30.0MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 23.67ms. Allocated memory is still 71.3MB. Free memory was 30.0MB in the beginning and 29.0MB in the end (delta: 924.2kB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 308.39ms. Allocated memory is still 71.3MB. Free memory was 28.9MB in the beginning and 43.8MB in the end (delta: -14.9MB). Peak memory consumption was 14.6MB. Max. memory is 8.0GB. * TraceAbstraction took 21675.37ms. Allocated memory was 71.3MB in the beginning and 1.8GB in the end (delta: 1.7GB). Free memory was 42.5MB in the beginning and 597.8MB in the end (delta: -555.2MB). Peak memory consumption was 1.6GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 93]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 119 locations, 4 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.1s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 21.6s, OverallIterations: 11, TraceHistogramMax: 3, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 16.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 501 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 501 mSDsluCounter, 657 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 493 mSDsCounter, 88 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1986 IncrementalHoareTripleChecker+Invalid, 2074 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 88 mSolverCounterUnsat, 164 mSDtfsCounter, 1986 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 819 GetRequests, 677 SyntacticMatches, 18 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 496 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=64314occurred in iteration=11, InterpolantAutomatonStates: 105, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 1235 NumberOfCodeBlocks, 1235 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 1562 ConstructedInterpolants, 0 QuantifiedInterpolants, 4150 SizeOfPredicates, 30 NumberOfNonLiveVariables, 769 ConjunctsInSsa, 52 ConjunctsInUnsatCore, 19 InterpolantComputations, 7 PerfectInterpolantSequences, 27/44 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:34,255 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...