/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/pthread-deagle/arithmetic_prog_ok.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.empire2-owicki-f61efc6-m [2025-03-14 23:42:35,444 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-14 23:42:35,541 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf [2025-03-14 23:42:35,568 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-14 23:42:35,569 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-14 23:42:35,569 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-14 23:42:35,569 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-14 23:42:35,569 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-14 23:42:35,570 INFO L153 SettingsManager]: * Use SBE=true [2025-03-14 23:42:35,570 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-14 23:42:35,570 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-14 23:42:35,570 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-14 23:42:35,570 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-14 23:42:35,570 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-14 23:42:35,570 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-14 23:42:35,570 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-14 23:42:35,571 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-14 23:42:35,571 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-14 23:42:35,571 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-14 23:42:35,571 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-14 23:42:35,571 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-14 23:42:35,571 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-03-14 23:42:35,571 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-14 23:42:35,571 INFO L153 SettingsManager]: * To the following directory=./dump/ [2025-03-14 23:42:35,571 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-14 23:42:35,571 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-14 23:42:35,571 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-14 23:42:35,571 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-14 23:42:35,571 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-14 23:42:35,571 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-14 23:42:35,571 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-14 23:42:35,572 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-14 23:42:35,572 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All [2025-03-14 23:42:35,804 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-14 23:42:35,810 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-14 23:42:35,812 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-14 23:42:35,812 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-14 23:42:35,814 INFO L274 PluginConnector]: CDTParser initialized [2025-03-14 23:42:35,815 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-deagle/arithmetic_prog_ok.i [2025-03-14 23:42:36,939 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f6402afe0/f326b293e5e44a06b2cb862f83db1ce5/FLAGbab20edb4 [2025-03-14 23:42:37,154 INFO L384 CDTParser]: Found 1 translation units. [2025-03-14 23:42:37,155 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-deagle/arithmetic_prog_ok.i [2025-03-14 23:42:37,171 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f6402afe0/f326b293e5e44a06b2cb862f83db1ce5/FLAGbab20edb4 [2025-03-14 23:42:37,181 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f6402afe0/f326b293e5e44a06b2cb862f83db1ce5 [2025-03-14 23:42:37,183 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-14 23:42:37,185 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-03-14 23:42:37,186 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-14 23:42:37,186 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-14 23:42:37,189 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-14 23:42:37,190 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 11:42:37" (1/1) ... [2025-03-14 23:42:37,191 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@622451c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 11:42:37, skipping insertion in model container [2025-03-14 23:42:37,191 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 11:42:37" (1/1) ... [2025-03-14 23:42:37,222 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-14 23:42:37,544 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-deagle/arithmetic_prog_ok.i[39757,39770] [2025-03-14 23:42:37,549 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 23:42:37,573 INFO L200 MainTranslator]: Completed pre-run [2025-03-14 23:42:37,617 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-deagle/arithmetic_prog_ok.i[39757,39770] [2025-03-14 23:42:37,617 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 23:42:37,676 INFO L204 MainTranslator]: Completed translation [2025-03-14 23:42:37,677 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 11:42:37 WrapperNode [2025-03-14 23:42:37,677 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-14 23:42:37,678 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-14 23:42:37,678 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-14 23:42:37,678 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-14 23:42:37,682 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 11:42:37" (1/1) ... [2025-03-14 23:42:37,691 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 11:42:37" (1/1) ... [2025-03-14 23:42:37,707 INFO L138 Inliner]: procedures = 243, calls = 26, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 260 [2025-03-14 23:42:37,707 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-14 23:42:37,708 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-14 23:42:37,708 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-14 23:42:37,708 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-14 23:42:37,712 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 11:42:37" (1/1) ... [2025-03-14 23:42:37,713 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 11:42:37" (1/1) ... [2025-03-14 23:42:37,716 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 11:42:37" (1/1) ... [2025-03-14 23:42:37,716 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 11:42:37" (1/1) ... [2025-03-14 23:42:37,721 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 11:42:37" (1/1) ... [2025-03-14 23:42:37,722 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 11:42:37" (1/1) ... [2025-03-14 23:42:37,724 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 11:42:37" (1/1) ... [2025-03-14 23:42:37,725 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 11:42:37" (1/1) ... [2025-03-14 23:42:37,726 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 11:42:37" (1/1) ... [2025-03-14 23:42:37,728 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-14 23:42:37,728 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-03-14 23:42:37,728 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-03-14 23:42:37,728 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-03-14 23:42:37,729 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 11:42:37" (1/1) ... [2025-03-14 23:42:37,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-14 23:42:37,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 23:42:37,752 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2025-03-14 23:42:37,754 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2025-03-14 23:42:37,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2025-03-14 23:42:37,769 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-14 23:42:37,769 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-14 23:42:37,769 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-14 23:42:37,769 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-14 23:42:37,770 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-14 23:42:37,770 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-14 23:42:37,770 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-14 23:42:37,770 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-14 23:42:37,770 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-14 23:42:37,770 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-14 23:42:37,771 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-14 23:42:37,879 INFO L234 CfgBuilder]: Building ICFG [2025-03-14 23:42:37,880 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-14 23:42:38,198 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-14 23:42:38,198 INFO L283 CfgBuilder]: Performing block encoding [2025-03-14 23:42:38,230 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-14 23:42:38,230 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-14 23:42:38,230 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.03 11:42:38 BoogieIcfgContainer [2025-03-14 23:42:38,230 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-03-14 23:42:38,233 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-14 23:42:38,233 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-14 23:42:38,237 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-14 23:42:38,237 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.03 11:42:37" (1/3) ... [2025-03-14 23:42:38,237 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d039600 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 11:42:38, skipping insertion in model container [2025-03-14 23:42:38,237 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 11:42:37" (2/3) ... [2025-03-14 23:42:38,238 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d039600 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 11:42:38, skipping insertion in model container [2025-03-14 23:42:38,238 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.03 11:42:38" (3/3) ... [2025-03-14 23:42:38,239 INFO L128 eAbstractionObserver]: Analyzing ICFG arithmetic_prog_ok.i [2025-03-14 23:42:38,249 INFO L303 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-14 23:42:38,250 INFO L169 ceAbstractionStarter]: Applying trace abstraction to ICFG arithmetic_prog_ok.i that has 3 procedures, 308 locations, 1 initial locations, 4 loop locations, and 1 error locations. [2025-03-14 23:42:38,250 INFO L581 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-14 23:42:38,319 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-14 23:42:38,362 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-14 23:42:38,375 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;@77aa18f4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-14 23:42:38,375 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-03-14 23:42:38,467 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-14 23:42:38,468 INFO L124 PetriNetUnfolderBase]: 5/306 cut-off events. [2025-03-14 23:42:38,472 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-14 23:42:38,473 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 23:42:38,474 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 23:42:38,474 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 23:42:38,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 23:42:38,480 INFO L85 PathProgramCache]: Analyzing trace with hash 483841662, now seen corresponding path program 1 times [2025-03-14 23:42:38,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 23:42:38,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992667743] [2025-03-14 23:42:38,491 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 23:42:38,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 23:42:38,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 23:42:38,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 23:42:38,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 23:42:38,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992667743] [2025-03-14 23:42:38,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1992667743] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 23:42:38,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 23:42:38,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-14 23:42:38,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772589005] [2025-03-14 23:42:38,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 23:42:38,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 23:42:38,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 23:42:38,969 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 23:42:38,969 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 23:42:38,971 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 293 out of 313 [2025-03-14 23:42:38,977 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 314 places, 313 transitions, 640 flow. Second operand has 3 states, 3 states have (on average 295.3333333333333) internal successors, (886), 3 states have internal predecessors, (886), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 23:42:38,978 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 23:42:38,978 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 293 of 313 [2025-03-14 23:42:38,979 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 23:42:39,172 INFO L124 PetriNetUnfolderBase]: 130/736 cut-off events. [2025-03-14 23:42:39,172 INFO L125 PetriNetUnfolderBase]: For 32/32 co-relation queries the response was YES. [2025-03-14 23:42:39,178 INFO L83 FinitePrefix]: Finished finitePrefix Result has 997 conditions, 736 events. 130/736 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 2696 event pairs, 52 based on Foata normal form. 1/672 useless extension candidates. Maximal degree in co-relation 691. Up to 135 conditions per place. [2025-03-14 23:42:39,192 INFO L140 encePairwiseOnDemand]: 309/313 looper letters, 28 selfloop transitions, 2 changer transitions 6/321 dead transitions. [2025-03-14 23:42:39,192 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 313 places, 321 transitions, 717 flow [2025-03-14 23:42:39,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 23:42:39,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 23:42:39,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 911 transitions. [2025-03-14 23:42:39,206 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9701810436634718 [2025-03-14 23:42:39,211 INFO L298 CegarLoopForPetriNet]: 314 programPoint places, -1 predicate places. [2025-03-14 23:42:39,211 INFO L471 AbstractCegarLoop]: Abstraction has has 313 places, 321 transitions, 717 flow [2025-03-14 23:42:39,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 295.3333333333333) internal successors, (886), 3 states have internal predecessors, (886), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 23:42:39,212 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 23:42:39,212 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 23:42:39,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-14 23:42:39,213 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 23:42:39,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 23:42:39,215 INFO L85 PathProgramCache]: Analyzing trace with hash -1668446876, now seen corresponding path program 1 times [2025-03-14 23:42:39,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 23:42:39,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947511266] [2025-03-14 23:42:39,215 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 23:42:39,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 23:42:39,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 23:42:39,463 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 23:42:39,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 23:42:39,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947511266] [2025-03-14 23:42:39,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947511266] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 23:42:39,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 23:42:39,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-14 23:42:39,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666889556] [2025-03-14 23:42:39,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 23:42:39,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 23:42:39,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 23:42:39,467 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 23:42:39,467 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 23:42:39,468 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 291 out of 313 [2025-03-14 23:42:39,469 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 313 places, 321 transitions, 717 flow. Second operand has 3 states, 3 states have (on average 294.3333333333333) internal successors, (883), 3 states have internal predecessors, (883), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 23:42:39,469 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 23:42:39,469 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 291 of 313 [2025-03-14 23:42:39,471 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 23:42:39,689 INFO L124 PetriNetUnfolderBase]: 375/1318 cut-off events. [2025-03-14 23:42:39,689 INFO L125 PetriNetUnfolderBase]: For 414/468 co-relation queries the response was YES. [2025-03-14 23:42:39,694 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2471 conditions, 1318 events. 375/1318 cut-off events. For 414/468 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 6673 event pairs, 138 based on Foata normal form. 3/1190 useless extension candidates. Maximal degree in co-relation 2065. Up to 342 conditions per place. [2025-03-14 23:42:39,699 INFO L140 encePairwiseOnDemand]: 310/313 looper letters, 48 selfloop transitions, 2 changer transitions 6/342 dead transitions. [2025-03-14 23:42:39,699 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 315 places, 342 transitions, 896 flow [2025-03-14 23:42:39,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 23:42:39,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 23:42:39,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 907 transitions. [2025-03-14 23:42:39,702 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9659211927582535 [2025-03-14 23:42:39,702 INFO L298 CegarLoopForPetriNet]: 314 programPoint places, 1 predicate places. [2025-03-14 23:42:39,702 INFO L471 AbstractCegarLoop]: Abstraction has has 315 places, 342 transitions, 896 flow [2025-03-14 23:42:39,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 294.3333333333333) internal successors, (883), 3 states have internal predecessors, (883), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 23:42:39,703 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 23:42:39,703 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 23:42:39,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-14 23:42:39,703 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 23:42:39,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 23:42:39,704 INFO L85 PathProgramCache]: Analyzing trace with hash -624299716, now seen corresponding path program 1 times [2025-03-14 23:42:39,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 23:42:39,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252647633] [2025-03-14 23:42:39,704 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 23:42:39,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 23:42:39,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 23:42:40,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 23:42:40,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 23:42:40,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252647633] [2025-03-14 23:42:40,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252647633] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 23:42:40,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 23:42:40,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 23:42:40,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627583337] [2025-03-14 23:42:40,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 23:42:40,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-14 23:42:40,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 23:42:40,006 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-14 23:42:40,006 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-14 23:42:40,009 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 292 out of 313 [2025-03-14 23:42:40,010 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 315 places, 342 transitions, 896 flow. Second operand has 5 states, 5 states have (on average 295.0) internal successors, (1475), 5 states have internal predecessors, (1475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 23:42:40,010 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 23:42:40,010 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 292 of 313 [2025-03-14 23:42:40,010 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 23:42:40,335 INFO L124 PetriNetUnfolderBase]: 544/1767 cut-off events. [2025-03-14 23:42:40,335 INFO L125 PetriNetUnfolderBase]: For 1443/1786 co-relation queries the response was YES. [2025-03-14 23:42:40,340 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4192 conditions, 1767 events. 544/1767 cut-off events. For 1443/1786 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 9731 event pairs, 148 based on Foata normal form. 17/1595 useless extension candidates. Maximal degree in co-relation 3738. Up to 551 conditions per place. [2025-03-14 23:42:40,348 INFO L140 encePairwiseOnDemand]: 308/313 looper letters, 82 selfloop transitions, 5 changer transitions 6/381 dead transitions. [2025-03-14 23:42:40,348 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 320 places, 381 transitions, 1303 flow [2025-03-14 23:42:40,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 23:42:40,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 23:42:40,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1807 transitions. [2025-03-14 23:42:40,351 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9621938232161874 [2025-03-14 23:42:40,351 INFO L298 CegarLoopForPetriNet]: 314 programPoint places, 6 predicate places. [2025-03-14 23:42:40,351 INFO L471 AbstractCegarLoop]: Abstraction has has 320 places, 381 transitions, 1303 flow [2025-03-14 23:42:40,352 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 295.0) internal successors, (1475), 5 states have internal predecessors, (1475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 23:42:40,352 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 23:42:40,355 INFO L221 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 23:42:40,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-14 23:42:40,356 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 23:42:40,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 23:42:40,357 INFO L85 PathProgramCache]: Analyzing trace with hash 578730820, now seen corresponding path program 2 times [2025-03-14 23:42:40,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 23:42:40,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316214128] [2025-03-14 23:42:40,357 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 23:42:40,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 23:42:40,418 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 23:42:40,418 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 23:42:40,617 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 23:42:40,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 23:42:40,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316214128] [2025-03-14 23:42:40,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316214128] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 23:42:40,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1721324496] [2025-03-14 23:42:40,618 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 23:42:40,618 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 23:42:40,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 23:42:40,621 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 23:42:40,622 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-14 23:42:40,851 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 23:42:40,851 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 23:42:40,854 INFO L256 TraceCheckSpWp]: Trace formula consists of 662 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-14 23:42:40,860 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 23:42:40,932 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 23:42:40,933 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-14 23:42:40,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1721324496] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 23:42:40,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-14 23:42:40,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-03-14 23:42:40,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28522550] [2025-03-14 23:42:40,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 23:42:40,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-14 23:42:40,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 23:42:40,934 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-14 23:42:40,934 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-14 23:42:40,936 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 288 out of 313 [2025-03-14 23:42:40,937 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 320 places, 381 transitions, 1303 flow. Second operand has 5 states, 5 states have (on average 292.6) internal successors, (1463), 5 states have internal predecessors, (1463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 23:42:40,937 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 23:42:40,937 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 288 of 313 [2025-03-14 23:42:40,937 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 23:42:41,463 INFO L124 PetriNetUnfolderBase]: 1316/3428 cut-off events. [2025-03-14 23:42:41,463 INFO L125 PetriNetUnfolderBase]: For 5466/6045 co-relation queries the response was YES. [2025-03-14 23:42:41,470 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9856 conditions, 3428 events. 1316/3428 cut-off events. For 5466/6045 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 20840 event pairs, 226 based on Foata normal form. 60/3147 useless extension candidates. Maximal degree in co-relation 9349. Up to 1212 conditions per place. [2025-03-14 23:42:41,483 INFO L140 encePairwiseOnDemand]: 304/313 looper letters, 203 selfloop transitions, 18 changer transitions 6/518 dead transitions. [2025-03-14 23:42:41,484 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 326 places, 518 transitions, 2685 flow [2025-03-14 23:42:41,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-14 23:42:41,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-14 23:42:41,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 2101 transitions. [2025-03-14 23:42:41,487 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9589228662711091 [2025-03-14 23:42:41,488 INFO L298 CegarLoopForPetriNet]: 314 programPoint places, 12 predicate places. [2025-03-14 23:42:41,488 INFO L471 AbstractCegarLoop]: Abstraction has has 326 places, 518 transitions, 2685 flow [2025-03-14 23:42:41,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 292.6) internal successors, (1463), 5 states have internal predecessors, (1463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 23:42:41,489 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 23:42:41,489 INFO L221 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 23:42:41,497 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-14 23:42:41,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 23:42:41,690 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 23:42:41,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 23:42:41,691 INFO L85 PathProgramCache]: Analyzing trace with hash 1866095476, now seen corresponding path program 3 times [2025-03-14 23:42:41,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 23:42:41,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687992706] [2025-03-14 23:42:41,691 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-14 23:42:41,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 23:42:41,731 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-14 23:42:41,731 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 23:42:41,885 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-14 23:42:41,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 23:42:41,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687992706] [2025-03-14 23:42:41,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687992706] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 23:42:41,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 23:42:41,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 23:42:41,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573686782] [2025-03-14 23:42:41,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 23:42:41,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-14 23:42:41,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 23:42:41,886 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-14 23:42:41,886 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-14 23:42:41,888 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 290 out of 313 [2025-03-14 23:42:41,889 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 326 places, 518 transitions, 2685 flow. Second operand has 5 states, 5 states have (on average 293.6) internal successors, (1468), 5 states have internal predecessors, (1468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 23:42:41,889 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 23:42:41,889 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 290 of 313 [2025-03-14 23:42:41,889 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 23:42:42,603 INFO L124 PetriNetUnfolderBase]: 2163/5361 cut-off events. [2025-03-14 23:42:42,603 INFO L125 PetriNetUnfolderBase]: For 13556/14797 co-relation queries the response was YES. [2025-03-14 23:42:42,614 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18318 conditions, 5361 events. 2163/5361 cut-off events. For 13556/14797 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 36810 event pairs, 337 based on Foata normal form. 111/4938 useless extension candidates. Maximal degree in co-relation 17375. Up to 2147 conditions per place. [2025-03-14 23:42:42,642 INFO L140 encePairwiseOnDemand]: 308/313 looper letters, 339 selfloop transitions, 5 changer transitions 6/668 dead transitions. [2025-03-14 23:42:42,642 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 331 places, 668 transitions, 4856 flow [2025-03-14 23:42:42,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 23:42:42,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 23:42:42,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1799 transitions. [2025-03-14 23:42:42,645 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9579339723109691 [2025-03-14 23:42:42,646 INFO L298 CegarLoopForPetriNet]: 314 programPoint places, 17 predicate places. [2025-03-14 23:42:42,646 INFO L471 AbstractCegarLoop]: Abstraction has has 331 places, 668 transitions, 4856 flow [2025-03-14 23:42:42,647 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 293.6) internal successors, (1468), 5 states have internal predecessors, (1468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 23:42:42,647 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 23:42:42,647 INFO L221 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 23:42:42,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-14 23:42:42,647 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 23:42:42,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 23:42:42,648 INFO L85 PathProgramCache]: Analyzing trace with hash 676842800, now seen corresponding path program 4 times [2025-03-14 23:42:42,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 23:42:42,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087975628] [2025-03-14 23:42:42,649 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-14 23:42:42,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 23:42:42,697 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2025-03-14 23:42:42,698 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 23:42:42,842 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-14 23:42:42,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 23:42:42,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087975628] [2025-03-14 23:42:42,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087975628] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 23:42:42,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 23:42:42,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-14 23:42:42,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124767071] [2025-03-14 23:42:42,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 23:42:42,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-14 23:42:42,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 23:42:42,844 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-14 23:42:42,844 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-14 23:42:42,845 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 285 out of 313 [2025-03-14 23:42:42,846 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 331 places, 668 transitions, 4856 flow. Second operand has 4 states, 4 states have (on average 291.0) internal successors, (1164), 4 states have internal predecessors, (1164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 23:42:42,846 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 23:42:42,846 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 285 of 313 [2025-03-14 23:42:42,846 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 23:42:43,195 INFO L124 PetriNetUnfolderBase]: 660/2171 cut-off events. [2025-03-14 23:42:43,195 INFO L125 PetriNetUnfolderBase]: For 15464/16683 co-relation queries the response was YES. [2025-03-14 23:42:43,199 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8045 conditions, 2171 events. 660/2171 cut-off events. For 15464/16683 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 12523 event pairs, 118 based on Foata normal form. 328/2277 useless extension candidates. Maximal degree in co-relation 7185. Up to 854 conditions per place. [2025-03-14 23:42:43,206 INFO L140 encePairwiseOnDemand]: 302/313 looper letters, 40 selfloop transitions, 183 changer transitions 12/540 dead transitions. [2025-03-14 23:42:43,206 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 334 places, 540 transitions, 3941 flow [2025-03-14 23:42:43,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-14 23:42:43,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-14 23:42:43,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1463 transitions. [2025-03-14 23:42:43,209 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9348242811501597 [2025-03-14 23:42:43,209 INFO L298 CegarLoopForPetriNet]: 314 programPoint places, 20 predicate places. [2025-03-14 23:42:43,209 INFO L471 AbstractCegarLoop]: Abstraction has has 334 places, 540 transitions, 3941 flow [2025-03-14 23:42:43,210 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 291.0) internal successors, (1164), 4 states have internal predecessors, (1164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 23:42:43,210 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 23:42:43,210 INFO L221 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 23:42:43,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-14 23:42:43,210 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 23:42:43,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 23:42:43,211 INFO L85 PathProgramCache]: Analyzing trace with hash 1102675578, now seen corresponding path program 5 times [2025-03-14 23:42:43,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 23:42:43,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453966600] [2025-03-14 23:42:43,211 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-14 23:42:43,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 23:42:43,253 INFO L229 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 23:42:43,254 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 23:42:43,407 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 23:42:43,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 23:42:43,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453966600] [2025-03-14 23:42:43,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453966600] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 23:42:43,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2127109670] [2025-03-14 23:42:43,407 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-14 23:42:43,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 23:42:43,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 23:42:43,409 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 23:42:43,411 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-14 23:42:43,590 INFO L229 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 23:42:43,591 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 23:42:43,593 INFO L256 TraceCheckSpWp]: Trace formula consists of 692 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-14 23:42:43,599 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 23:42:43,685 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 23:42:43,685 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 23:42:43,769 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 23:42:43,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2127109670] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 23:42:43,769 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 23:42:43,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2025-03-14 23:42:43,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836465028] [2025-03-14 23:42:43,770 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 23:42:43,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-14 23:42:43,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 23:42:43,772 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-14 23:42:43,772 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-03-14 23:42:43,773 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 290 out of 313 [2025-03-14 23:42:43,777 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 334 places, 540 transitions, 3941 flow. Second operand has 11 states, 11 states have (on average 294.09090909090907) internal successors, (3235), 11 states have internal predecessors, (3235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 23:42:43,777 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 23:42:43,777 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 290 of 313 [2025-03-14 23:42:43,777 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 23:42:44,295 INFO L124 PetriNetUnfolderBase]: 938/2947 cut-off events. [2025-03-14 23:42:44,295 INFO L125 PetriNetUnfolderBase]: For 17418/18847 co-relation queries the response was YES. [2025-03-14 23:42:44,302 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12734 conditions, 2947 events. 938/2947 cut-off events. For 17418/18847 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 18104 event pairs, 141 based on Foata normal form. 103/2759 useless extension candidates. Maximal degree in co-relation 12135. Up to 1268 conditions per place. [2025-03-14 23:42:44,318 INFO L140 encePairwiseOnDemand]: 307/313 looper letters, 365 selfloop transitions, 12 changer transitions 12/690 dead transitions. [2025-03-14 23:42:44,318 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 345 places, 690 transitions, 6780 flow [2025-03-14 23:42:44,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-14 23:42:44,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-14 23:42:44,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 3581 transitions. [2025-03-14 23:42:44,324 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9534078807241747 [2025-03-14 23:42:44,325 INFO L298 CegarLoopForPetriNet]: 314 programPoint places, 31 predicate places. [2025-03-14 23:42:44,325 INFO L471 AbstractCegarLoop]: Abstraction has has 345 places, 690 transitions, 6780 flow [2025-03-14 23:42:44,326 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 294.09090909090907) internal successors, (3235), 11 states have internal predecessors, (3235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 23:42:44,326 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 23:42:44,327 INFO L221 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 23:42:44,334 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-14 23:42:44,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2025-03-14 23:42:44,527 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 23:42:44,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 23:42:44,528 INFO L85 PathProgramCache]: Analyzing trace with hash 933579928, now seen corresponding path program 6 times [2025-03-14 23:42:44,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 23:42:44,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295182624] [2025-03-14 23:42:44,529 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-14 23:42:44,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 23:42:44,587 INFO L229 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-03-14 23:42:44,587 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 23:42:44,737 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2025-03-14 23:42:44,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 23:42:44,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295182624] [2025-03-14 23:42:44,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295182624] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 23:42:44,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1499573261] [2025-03-14 23:42:44,738 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-14 23:42:44,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 23:42:44,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 23:42:44,740 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 23:42:44,741 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-14 23:42:44,976 INFO L229 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-03-14 23:42:44,977 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 23:42:44,979 INFO L256 TraceCheckSpWp]: Trace formula consists of 722 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-14 23:42:44,982 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 23:42:45,045 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2025-03-14 23:42:45,046 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 23:42:45,119 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2025-03-14 23:42:45,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1499573261] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 23:42:45,119 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 23:42:45,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2025-03-14 23:42:45,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198602386] [2025-03-14 23:42:45,119 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 23:42:45,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-14 23:42:45,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 23:42:45,120 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-14 23:42:45,120 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-03-14 23:42:45,122 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 292 out of 313 [2025-03-14 23:42:45,124 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 345 places, 690 transitions, 6780 flow. Second operand has 11 states, 11 states have (on average 295.72727272727275) internal successors, (3253), 11 states have internal predecessors, (3253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 23:42:45,125 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 23:42:45,125 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 292 of 313 [2025-03-14 23:42:45,125 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 23:42:45,812 INFO L124 PetriNetUnfolderBase]: 1171/3556 cut-off events. [2025-03-14 23:42:45,812 INFO L125 PetriNetUnfolderBase]: For 27956/30539 co-relation queries the response was YES. [2025-03-14 23:42:45,820 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17411 conditions, 3556 events. 1171/3556 cut-off events. For 27956/30539 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 22568 event pairs, 118 based on Foata normal form. 225/3458 useless extension candidates. Maximal degree in co-relation 16083. Up to 1594 conditions per place. [2025-03-14 23:42:45,840 INFO L140 encePairwiseOnDemand]: 307/313 looper letters, 519 selfloop transitions, 12 changer transitions 14/857 dead transitions. [2025-03-14 23:42:45,840 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 356 places, 857 transitions, 10466 flow [2025-03-14 23:42:45,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-14 23:42:45,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-14 23:42:45,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 3594 transitions. [2025-03-14 23:42:45,846 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9568690095846646 [2025-03-14 23:42:45,846 INFO L298 CegarLoopForPetriNet]: 314 programPoint places, 42 predicate places. [2025-03-14 23:42:45,846 INFO L471 AbstractCegarLoop]: Abstraction has has 356 places, 857 transitions, 10466 flow [2025-03-14 23:42:45,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 295.72727272727275) internal successors, (3253), 11 states have internal predecessors, (3253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 23:42:45,848 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 23:42:45,848 INFO L221 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 23:42:45,856 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-14 23:42:46,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 23:42:46,049 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 23:42:46,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 23:42:46,051 INFO L85 PathProgramCache]: Analyzing trace with hash 9403738, now seen corresponding path program 7 times [2025-03-14 23:42:46,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 23:42:46,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916301180] [2025-03-14 23:42:46,051 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-14 23:42:46,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 23:42:46,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 23:42:46,288 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2025-03-14 23:42:46,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 23:42:46,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916301180] [2025-03-14 23:42:46,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916301180] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 23:42:46,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 23:42:46,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-14 23:42:46,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602620870] [2025-03-14 23:42:46,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 23:42:46,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-14 23:42:46,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 23:42:46,290 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-14 23:42:46,290 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-14 23:42:46,291 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 287 out of 313 [2025-03-14 23:42:46,293 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 356 places, 857 transitions, 10466 flow. Second operand has 8 states, 8 states have (on average 291.5) internal successors, (2332), 8 states have internal predecessors, (2332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 23:42:46,293 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 23:42:46,293 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 287 of 313 [2025-03-14 23:42:46,293 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 23:42:46,726 INFO L124 PetriNetUnfolderBase]: 742/2512 cut-off events. [2025-03-14 23:42:46,726 INFO L125 PetriNetUnfolderBase]: For 23327/25955 co-relation queries the response was YES. [2025-03-14 23:42:46,732 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13000 conditions, 2512 events. 742/2512 cut-off events. For 23327/25955 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 14258 event pairs, 60 based on Foata normal form. 334/2675 useless extension candidates. Maximal degree in co-relation 12361. Up to 1104 conditions per place. [2025-03-14 23:42:46,741 INFO L140 encePairwiseOnDemand]: 302/313 looper letters, 382 selfloop transitions, 16 changer transitions 18/725 dead transitions. [2025-03-14 23:42:46,742 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 364 places, 725 transitions, 8886 flow [2025-03-14 23:42:46,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-14 23:42:46,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-14 23:42:46,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2630 transitions. [2025-03-14 23:42:46,746 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9336173233936812 [2025-03-14 23:42:46,746 INFO L298 CegarLoopForPetriNet]: 314 programPoint places, 50 predicate places. [2025-03-14 23:42:46,746 INFO L471 AbstractCegarLoop]: Abstraction has has 364 places, 725 transitions, 8886 flow [2025-03-14 23:42:46,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 291.5) internal successors, (2332), 8 states have internal predecessors, (2332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 23:42:46,747 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 23:42:46,747 INFO L221 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 23:42:46,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-14 23:42:46,747 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 23:42:46,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 23:42:46,748 INFO L85 PathProgramCache]: Analyzing trace with hash -1588108368, now seen corresponding path program 8 times [2025-03-14 23:42:46,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 23:42:46,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509725709] [2025-03-14 23:42:46,749 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 23:42:46,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 23:42:46,790 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 23:42:46,791 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 23:42:46,981 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 52 proven. 8 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-14 23:42:46,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 23:42:46,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509725709] [2025-03-14 23:42:46,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1509725709] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 23:42:46,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1350151534] [2025-03-14 23:42:46,982 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 23:42:46,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 23:42:46,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 23:42:46,983 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 23:42:46,985 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-14 23:42:47,206 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 23:42:47,206 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 23:42:47,209 INFO L256 TraceCheckSpWp]: Trace formula consists of 808 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-14 23:42:47,212 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 23:42:47,286 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 52 proven. 8 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-14 23:42:47,286 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 23:42:47,360 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 52 proven. 8 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-14 23:42:47,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1350151534] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 23:42:47,361 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 23:42:47,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 6 [2025-03-14 23:42:47,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111089529] [2025-03-14 23:42:47,362 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 23:42:47,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 23:42:47,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 23:42:47,363 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 23:42:47,363 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-14 23:42:47,364 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 287 out of 313 [2025-03-14 23:42:47,366 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 364 places, 725 transitions, 8886 flow. Second operand has 6 states, 6 states have (on average 292.3333333333333) internal successors, (1754), 6 states have internal predecessors, (1754), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 23:42:47,366 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 23:42:47,366 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 287 of 313 [2025-03-14 23:42:47,366 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 23:42:47,628 INFO L124 PetriNetUnfolderBase]: 364/1497 cut-off events. [2025-03-14 23:42:47,628 INFO L125 PetriNetUnfolderBase]: For 13454/14283 co-relation queries the response was YES. [2025-03-14 23:42:47,631 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7727 conditions, 1497 events. 364/1497 cut-off events. For 13454/14283 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 6070 event pairs, 50 based on Foata normal form. 21/1446 useless extension candidates. Maximal degree in co-relation 6925. Up to 533 conditions per place. [2025-03-14 23:42:47,636 INFO L140 encePairwiseOnDemand]: 304/313 looper letters, 232 selfloop transitions, 12 changer transitions 8/561 dead transitions. [2025-03-14 23:42:47,636 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 371 places, 561 transitions, 6126 flow [2025-03-14 23:42:47,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-14 23:42:47,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-14 23:42:47,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 2333 transitions. [2025-03-14 23:42:47,639 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9317092651757188 [2025-03-14 23:42:47,639 INFO L298 CegarLoopForPetriNet]: 314 programPoint places, 57 predicate places. [2025-03-14 23:42:47,639 INFO L471 AbstractCegarLoop]: Abstraction has has 371 places, 561 transitions, 6126 flow [2025-03-14 23:42:47,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 292.3333333333333) internal successors, (1754), 6 states have internal predecessors, (1754), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 23:42:47,640 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 23:42:47,640 INFO L221 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 23:42:47,647 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-14 23:42:47,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 23:42:47,840 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 23:42:47,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 23:42:47,841 INFO L85 PathProgramCache]: Analyzing trace with hash -210669766, now seen corresponding path program 9 times [2025-03-14 23:42:47,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 23:42:47,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295432604] [2025-03-14 23:42:47,842 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-14 23:42:47,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 23:42:47,932 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-14 23:42:47,932 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 23:42:48,492 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-14 23:42:48,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 23:42:48,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295432604] [2025-03-14 23:42:48,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295432604] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 23:42:48,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2043592816] [2025-03-14 23:42:48,492 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-14 23:42:48,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 23:42:48,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 23:42:48,495 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 23:42:48,496 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-14 23:42:48,805 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-14 23:42:48,805 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 23:42:48,813 INFO L256 TraceCheckSpWp]: Trace formula consists of 808 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-03-14 23:42:48,818 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 23:42:49,203 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-14 23:42:49,203 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 23:42:49,782 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-14 23:42:49,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2043592816] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 23:42:49,782 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 23:42:49,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 17] total 43 [2025-03-14 23:42:49,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155623689] [2025-03-14 23:42:49,783 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 23:42:49,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2025-03-14 23:42:49,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 23:42:49,784 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2025-03-14 23:42:49,784 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=1661, Unknown=0, NotChecked=0, Total=1806 [2025-03-14 23:42:49,788 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 286 out of 313 [2025-03-14 23:42:49,794 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 371 places, 561 transitions, 6126 flow. Second operand has 43 states, 43 states have (on average 288.93023255813955) internal successors, (12424), 43 states have internal predecessors, (12424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 23:42:49,794 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 23:42:49,794 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 286 of 313 [2025-03-14 23:42:49,794 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 23:42:51,072 INFO L124 PetriNetUnfolderBase]: 346/1422 cut-off events. [2025-03-14 23:42:51,072 INFO L125 PetriNetUnfolderBase]: For 15127/16246 co-relation queries the response was YES. [2025-03-14 23:42:51,075 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8030 conditions, 1422 events. 346/1422 cut-off events. For 15127/16246 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 5578 event pairs, 35 based on Foata normal form. 109/1486 useless extension candidates. Maximal degree in co-relation 7192. Up to 499 conditions per place. [2025-03-14 23:42:51,078 INFO L140 encePairwiseOnDemand]: 304/313 looper letters, 0 selfloop transitions, 0 changer transitions 589/589 dead transitions. [2025-03-14 23:42:51,078 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 388 places, 589 transitions, 7383 flow [2025-03-14 23:42:51,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-14 23:42:51,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2025-03-14 23:42:51,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 5849 transitions. [2025-03-14 23:42:51,085 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9343450479233227 [2025-03-14 23:42:51,085 INFO L298 CegarLoopForPetriNet]: 314 programPoint places, 74 predicate places. [2025-03-14 23:42:51,085 INFO L471 AbstractCegarLoop]: Abstraction has has 388 places, 589 transitions, 7383 flow [2025-03-14 23:42:51,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 288.93023255813955) internal successors, (12424), 43 states have internal predecessors, (12424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 23:42:51,101 INFO L161 wickiGriesTestDumper]: Dumping Owicki-Gries test to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/arithmetic_prog_ok.i_petrified1_AllErrorsAtOnce [2025-03-14 23:42:51,145 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2025-03-14 23:42:51,146 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2025-03-14 23:42:51,146 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2025-03-14 23:42:51,154 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-14 23:42:51,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-14 23:42:51,350 INFO L422 BasicCegarLoop]: Path program histogram: [9, 1, 1] [2025-03-14 23:42:51,353 INFO L328 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-14 23:42:51,353 INFO L188 ceAbstractionStarter]: Computing trace abstraction results [2025-03-14 23:42:51,356 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.03 11:42:51 BasicIcfg [2025-03-14 23:42:51,356 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-14 23:42:51,356 INFO L158 Benchmark]: Toolchain (without parser) took 14172.70ms. Allocated memory was 71.3MB in the beginning and 809.5MB in the end (delta: 738.2MB). Free memory was 43.4MB in the beginning and 220.2MB in the end (delta: -176.8MB). Peak memory consumption was 553.7MB. Max. memory is 8.0GB. [2025-03-14 23:42:51,357 INFO L158 Benchmark]: CDTParser took 1.17ms. Allocated memory is still 71.3MB. Free memory was 32.9MB in the beginning and 32.8MB in the end (delta: 42.0kB). There was no memory consumed. Max. memory is 8.0GB. [2025-03-14 23:42:51,357 INFO L158 Benchmark]: CACSL2BoogieTranslator took 491.50ms. Allocated memory is still 71.3MB. Free memory was 43.2MB in the beginning and 40.2MB in the end (delta: 3.0MB). Peak memory consumption was 25.6MB. Max. memory is 8.0GB. [2025-03-14 23:42:51,357 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.36ms. Allocated memory is still 71.3MB. Free memory was 39.9MB in the beginning and 37.3MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-03-14 23:42:51,357 INFO L158 Benchmark]: Boogie Preprocessor took 19.94ms. Allocated memory is still 71.3MB. Free memory was 37.3MB in the beginning and 35.0MB in the end (delta: 2.3MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-03-14 23:42:51,357 INFO L158 Benchmark]: RCFGBuilder took 502.14ms. Allocated memory was 71.3MB in the beginning and 88.1MB in the end (delta: 16.8MB). Free memory was 35.0MB in the beginning and 49.6MB in the end (delta: -14.7MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2025-03-14 23:42:51,357 INFO L158 Benchmark]: TraceAbstraction took 13122.99ms. Allocated memory was 88.1MB in the beginning and 809.5MB in the end (delta: 721.4MB). Free memory was 48.6MB in the beginning and 220.2MB in the end (delta: -171.6MB). Peak memory consumption was 545.6MB. Max. memory is 8.0GB. [2025-03-14 23:42:51,360 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.17ms. Allocated memory is still 71.3MB. Free memory was 32.9MB in the beginning and 32.8MB in the end (delta: 42.0kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 491.50ms. Allocated memory is still 71.3MB. Free memory was 43.2MB in the beginning and 40.2MB in the end (delta: 3.0MB). Peak memory consumption was 25.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 29.36ms. Allocated memory is still 71.3MB. Free memory was 39.9MB in the beginning and 37.3MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 19.94ms. Allocated memory is still 71.3MB. Free memory was 37.3MB in the beginning and 35.0MB in the end (delta: 2.3MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 502.14ms. Allocated memory was 71.3MB in the beginning and 88.1MB in the end (delta: 16.8MB). Free memory was 35.0MB in the beginning and 49.6MB in the end (delta: -14.7MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * TraceAbstraction took 13122.99ms. Allocated memory was 88.1MB in the beginning and 809.5MB in the end (delta: 721.4MB). Free memory was 48.6MB in the beginning and 220.2MB in the end (delta: -171.6MB). Peak memory consumption was 545.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 919]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 353 locations, 3 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: 13.0s, OverallIterations: 11, TraceHistogramMax: 4, PathProgramHistogramMax: 9, EmptinessCheckTime: 0.0s, AutomataDifference: 5.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 650 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 650 mSDsluCounter, 212 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 149 mSDsCounter, 32 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3790 IncrementalHoareTripleChecker+Invalid, 3822 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 32 mSolverCounterUnsat, 63 mSDtfsCounter, 3790 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3256 GetRequests, 3131 SyntacticMatches, 6 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 747 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=10466occurred in iteration=8, InterpolantAutomatonStates: 91, 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.3s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 4.0s InterpolantComputationTime, 5302 NumberOfCodeBlocks, 5182 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 6696 ConstructedInterpolants, 0 QuantifiedInterpolants, 10496 SizeOfPredicates, 27 NumberOfNonLiveVariables, 3692 ConjunctsInSsa, 66 ConjunctsInUnsatCore, 20 InterpolantComputations, 7 PerfectInterpolantSequences, 475/626 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-14 23:42:51,374 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...