/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 ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline_IcfgBuilder.xml -s ../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.automaton.type.used.in.concurrency.analysis FINITE_AUTOMATA --preprocessor.replace.while.statements.and.if-then-else.statements false -i ../../../trunk/examples/svcomp/pthread-theta/exponential-nondet.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 23:31:04,894 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 23:31:04,948 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2025-04-13 23:31:04,952 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 23:31:04,952 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 23:31:04,970 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 23:31:04,970 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 23:31:04,970 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 23:31:04,973 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 23:31:04,973 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 23:31:04,973 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 23:31:04,973 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 23:31:04,974 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 23:31:04,974 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 23:31:04,974 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 23:31:04,974 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 23:31:04,974 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 23:31:04,974 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 23:31:04,974 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 23:31:04,974 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 23:31:04,974 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 23:31:04,974 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 23:31:04,974 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 23:31:04,975 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 23:31:04,975 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 23:31:04,975 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 23:31:04,975 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 23:31:04,975 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 23:31:04,975 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 23:31:04,975 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 23:31:04,975 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 23:31:04,975 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 23:31:04,975 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 23:31:04,975 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 23:31:04,975 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 23:31:04,975 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 23:31:04,975 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 23:31:04,975 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 23:31:04,975 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 23:31:04,975 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 23:31:04,975 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 23:31:04,975 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 23:31:04,976 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 23:31:04,976 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 23:31:04,976 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 23:31:04,976 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 23:31:04,976 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 23:31:04,976 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Automaton type used in concurrency analysis -> FINITE_AUTOMATA Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Replace while statements and if-then-else statements -> false [2025-04-13 23:31:05,175 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 23:31:05,180 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 23:31:05,182 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 23:31:05,182 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 23:31:05,182 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 23:31:05,183 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-theta/exponential-nondet.i [2025-04-13 23:31:06,519 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d029611f7/cd824f7eab5f411fbeebcd4019ae09e7/FLAGf8846f4e7 [2025-04-13 23:31:06,778 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 23:31:06,778 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-theta/exponential-nondet.i [2025-04-13 23:31:06,791 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d029611f7/cd824f7eab5f411fbeebcd4019ae09e7/FLAGf8846f4e7 [2025-04-13 23:31:07,719 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d029611f7/cd824f7eab5f411fbeebcd4019ae09e7 [2025-04-13 23:31:07,721 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 23:31:07,722 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 23:31:07,723 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 23:31:07,723 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 23:31:07,726 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 23:31:07,726 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 11:31:07" (1/1) ... [2025-04-13 23:31:07,727 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28c905f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:31:07, skipping insertion in model container [2025-04-13 23:31:07,727 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 11:31:07" (1/1) ... [2025-04-13 23:31:07,746 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 23:31:08,026 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-theta/exponential-nondet.i[33030,33043] [2025-04-13 23:31:08,042 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 23:31:08,051 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 23:31:08,099 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-theta/exponential-nondet.i[33030,33043] [2025-04-13 23:31:08,103 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 23:31:08,122 INFO L204 MainTranslator]: Completed translation [2025-04-13 23:31:08,123 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:31:08 WrapperNode [2025-04-13 23:31:08,123 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 23:31:08,124 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 23:31:08,124 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 23:31:08,124 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 23:31:08,128 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:31:08" (1/1) ... [2025-04-13 23:31:08,139 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:31:08" (1/1) ... [2025-04-13 23:31:08,151 INFO L138 Inliner]: procedures = 169, calls = 10, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 58 [2025-04-13 23:31:08,151 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 23:31:08,152 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 23:31:08,152 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 23:31:08,152 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 23:31:08,157 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:31:08" (1/1) ... [2025-04-13 23:31:08,157 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:31:08" (1/1) ... [2025-04-13 23:31:08,159 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:31:08" (1/1) ... [2025-04-13 23:31:08,177 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-04-13 23:31:08,177 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:31:08" (1/1) ... [2025-04-13 23:31:08,177 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:31:08" (1/1) ... [2025-04-13 23:31:08,180 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:31:08" (1/1) ... [2025-04-13 23:31:08,180 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:31:08" (1/1) ... [2025-04-13 23:31:08,181 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:31:08" (1/1) ... [2025-04-13 23:31:08,181 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:31:08" (1/1) ... [2025-04-13 23:31:08,184 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 23:31:08,184 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-04-13 23:31:08,184 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-04-13 23:31:08,185 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-04-13 23:31:08,185 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:31:08" (1/1) ... [2025-04-13 23:31:08,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 23:31:08,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:31:08,209 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-13 23:31:08,212 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-13 23:31:08,227 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 23:31:08,227 INFO L130 BoogieDeclarations]: Found specification of procedure f1 [2025-04-13 23:31:08,227 INFO L138 BoogieDeclarations]: Found implementation of procedure f1 [2025-04-13 23:31:08,227 INFO L130 BoogieDeclarations]: Found specification of procedure f2 [2025-04-13 23:31:08,227 INFO L138 BoogieDeclarations]: Found implementation of procedure f2 [2025-04-13 23:31:08,227 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 23:31:08,228 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 23:31:08,228 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 23:31:08,228 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-13 23:31:08,320 INFO L256 CfgBuilder]: Building ICFG [2025-04-13 23:31:08,321 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 23:31:08,423 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 23:31:08,423 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 23:31:08,424 INFO L318 CfgBuilder]: Performing block encoding [2025-04-13 23:31:08,521 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 23:31:08,528 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 23:31:08,529 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.04 11:31:08 BoogieIcfgContainer [2025-04-13 23:31:08,529 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-04-13 23:31:08,531 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 23:31:08,531 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 23:31:08,534 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 23:31:08,534 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 11:31:07" (1/3) ... [2025-04-13 23:31:08,535 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63c6db80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 11:31:08, skipping insertion in model container [2025-04-13 23:31:08,535 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:31:08" (2/3) ... [2025-04-13 23:31:08,537 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63c6db80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 11:31:08, skipping insertion in model container [2025-04-13 23:31:08,537 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.04 11:31:08" (3/3) ... [2025-04-13 23:31:08,537 INFO L128 eAbstractionObserver]: Analyzing ICFG exponential-nondet.i [2025-04-13 23:31:08,547 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 23:31:08,549 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG exponential-nondet.i that has 3 procedures, 16 locations, 16 edges, 1 initial locations, 2 loop locations, and 1 error locations. [2025-04-13 23:31:08,549 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 23:31:08,587 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-13 23:31:08,606 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 22 places, 18 transitions, 44 flow [2025-04-13 23:31:08,625 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 92 states, 89 states have (on average 2.460674157303371) internal successors, (219), 91 states have internal predecessors, (219), 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-04-13 23:31:08,644 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 23:31:08,654 INFO L340 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=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@42b777b2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 23:31:08,654 INFO L341 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-04-13 23:31:08,655 INFO L278 IsEmpty]: Start isEmpty. Operand has 92 states, 89 states have (on average 2.460674157303371) internal successors, (219), 91 states have internal predecessors, (219), 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-04-13 23:31:08,659 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2025-04-13 23:31:08,659 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:31:08,659 INFO L218 NwaCegarLoop]: trace histogram [1, 1] [2025-04-13 23:31:08,660 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:31:08,663 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:31:08,664 INFO L85 PathProgramCache]: Analyzing trace with hash 5802, now seen corresponding path program 1 times [2025-04-13 23:31:08,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:31:08,670 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492526165] [2025-04-13 23:31:08,670 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:31:08,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:31:08,730 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-13 23:31:08,751 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-13 23:31:08,751 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:31:08,751 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-04-13 23:31:08,756 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1675574447] [2025-04-13 23:31:08,756 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:31:08,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:31:08,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:31:08,760 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-04-13 23:31:08,762 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-04-13 23:31:08,809 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-13 23:31:08,821 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-13 23:31:08,821 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:31:08,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:31:08,823 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-13 23:31:08,825 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:31:08,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:31:08,845 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-13 23:31:08,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:31:08,846 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492526165] [2025-04-13 23:31:08,846 WARN L301 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-04-13 23:31:08,846 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1675574447] [2025-04-13 23:31:08,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1675574447] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:31:08,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:31:08,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-13 23:31:08,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517673234] [2025-04-13 23:31:08,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:31:08,853 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 23:31:08,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:31:08,865 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 23:31:08,865 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 23:31:08,867 INFO L87 Difference]: Start difference. First operand has 92 states, 89 states have (on average 2.460674157303371) internal successors, (219), 91 states have internal predecessors, (219), 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) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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-04-13 23:31:08,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:31:08,912 INFO L93 Difference]: Finished difference Result 100 states and 229 transitions. [2025-04-13 23:31:08,913 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 23:31:08,913 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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) Word has length 2 [2025-04-13 23:31:08,913 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:31:08,921 INFO L225 Difference]: With dead ends: 100 [2025-04-13 23:31:08,921 INFO L226 Difference]: Without dead ends: 82 [2025-04-13 23:31:08,923 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 23:31:08,926 INFO L437 NwaCegarLoop]: 3 mSDtfsCounter, 10 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-13 23:31:08,926 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 5 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-13 23:31:08,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2025-04-13 23:31:08,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2025-04-13 23:31:08,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 80 states have (on average 2.425) internal successors, (194), 81 states have internal predecessors, (194), 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-04-13 23:31:08,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 194 transitions. [2025-04-13 23:31:08,948 INFO L79 Accepts]: Start accepts. Automaton has 82 states and 194 transitions. Word has length 2 [2025-04-13 23:31:08,948 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:31:08,948 INFO L485 AbstractCegarLoop]: Abstraction has 82 states and 194 transitions. [2025-04-13 23:31:08,949 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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-04-13 23:31:08,949 INFO L278 IsEmpty]: Start isEmpty. Operand 82 states and 194 transitions. [2025-04-13 23:31:08,949 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-04-13 23:31:08,949 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:31:08,949 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-04-13 23:31:08,956 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-04-13 23:31:09,154 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-04-13 23:31:09,154 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:31:09,155 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:31:09,155 INFO L85 PathProgramCache]: Analyzing trace with hash 1110870321, now seen corresponding path program 1 times [2025-04-13 23:31:09,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:31:09,157 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76622380] [2025-04-13 23:31:09,157 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:31:09,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:31:09,185 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-13 23:31:09,193 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-13 23:31:09,193 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:31:09,193 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 23:31:09,193 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-13 23:31:09,197 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-13 23:31:09,209 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-13 23:31:09,210 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:31:09,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 23:31:09,221 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-13 23:31:09,221 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-13 23:31:09,221 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2025-04-13 23:31:09,222 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2025-04-13 23:31:09,223 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2025-04-13 23:31:09,223 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 23:31:09,227 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-04-13 23:31:09,228 WARN L247 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-13 23:31:09,229 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-04-13 23:31:09,251 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-13 23:31:09,253 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 34 places, 26 transitions, 72 flow [2025-04-13 23:31:09,324 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 1484 states, 1480 states have (on average 3.872297297297297) internal successors, (5731), 1483 states have internal predecessors, (5731), 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-04-13 23:31:09,325 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 23:31:09,326 INFO L340 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=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@42b777b2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 23:31:09,326 INFO L341 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-04-13 23:31:09,329 INFO L278 IsEmpty]: Start isEmpty. Operand has 1484 states, 1480 states have (on average 3.872297297297297) internal successors, (5731), 1483 states have internal predecessors, (5731), 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-04-13 23:31:09,330 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2025-04-13 23:31:09,331 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:31:09,331 INFO L218 NwaCegarLoop]: trace histogram [1, 1] [2025-04-13 23:31:09,331 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:31:09,331 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:31:09,331 INFO L85 PathProgramCache]: Analyzing trace with hash 6634, now seen corresponding path program 1 times [2025-04-13 23:31:09,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:31:09,331 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286820463] [2025-04-13 23:31:09,331 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:31:09,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:31:09,341 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-13 23:31:09,351 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-13 23:31:09,351 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:31:09,351 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-04-13 23:31:09,352 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1129782282] [2025-04-13 23:31:09,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:31:09,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:31:09,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:31:09,356 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-04-13 23:31:09,357 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-04-13 23:31:09,392 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-13 23:31:09,397 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-13 23:31:09,398 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:31:09,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:31:09,398 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-13 23:31:09,399 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:31:09,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:31:09,403 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-13 23:31:09,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:31:09,403 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286820463] [2025-04-13 23:31:09,403 WARN L301 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-04-13 23:31:09,403 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1129782282] [2025-04-13 23:31:09,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1129782282] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:31:09,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:31:09,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-13 23:31:09,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253367246] [2025-04-13 23:31:09,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:31:09,403 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 23:31:09,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:31:09,404 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 23:31:09,404 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 23:31:09,407 INFO L87 Difference]: Start difference. First operand has 1484 states, 1480 states have (on average 3.872297297297297) internal successors, (5731), 1483 states have internal predecessors, (5731), 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) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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-04-13 23:31:09,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:31:09,484 INFO L93 Difference]: Finished difference Result 1684 states and 6285 transitions. [2025-04-13 23:31:09,485 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 23:31:09,486 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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) Word has length 2 [2025-04-13 23:31:09,486 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:31:09,508 INFO L225 Difference]: With dead ends: 1684 [2025-04-13 23:31:09,509 INFO L226 Difference]: Without dead ends: 1410 [2025-04-13 23:31:09,512 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 23:31:09,512 INFO L437 NwaCegarLoop]: 5 mSDtfsCounter, 15 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-13 23:31:09,513 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 10 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-13 23:31:09,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1410 states. [2025-04-13 23:31:09,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1410 to 1410. [2025-04-13 23:31:09,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1410 states, 1407 states have (on average 3.8507462686567164) internal successors, (5418), 1409 states have internal predecessors, (5418), 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-04-13 23:31:09,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1410 states to 1410 states and 5418 transitions. [2025-04-13 23:31:09,586 INFO L79 Accepts]: Start accepts. Automaton has 1410 states and 5418 transitions. Word has length 2 [2025-04-13 23:31:09,586 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:31:09,586 INFO L485 AbstractCegarLoop]: Abstraction has 1410 states and 5418 transitions. [2025-04-13 23:31:09,586 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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-04-13 23:31:09,586 INFO L278 IsEmpty]: Start isEmpty. Operand 1410 states and 5418 transitions. [2025-04-13 23:31:09,587 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-04-13 23:31:09,587 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:31:09,587 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:31:09,593 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-04-13 23:31:09,787 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2025-04-13 23:31:09,788 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:31:09,788 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:31:09,788 INFO L85 PathProgramCache]: Analyzing trace with hash 478273938, now seen corresponding path program 1 times [2025-04-13 23:31:09,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:31:09,788 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948046422] [2025-04-13 23:31:09,788 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:31:09,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:31:09,800 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-13 23:31:09,810 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-13 23:31:09,810 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:31:09,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:31:09,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:31:09,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:31:09,914 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948046422] [2025-04-13 23:31:09,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948046422] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:31:09,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:31:09,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 23:31:09,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40981152] [2025-04-13 23:31:09,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:31:09,915 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 23:31:09,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:31:09,915 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 23:31:09,915 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-13 23:31:09,916 INFO L87 Difference]: Start difference. First operand 1410 states and 5418 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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-04-13 23:31:10,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:31:10,030 INFO L93 Difference]: Finished difference Result 1882 states and 7236 transitions. [2025-04-13 23:31:10,030 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 23:31:10,030 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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) Word has length 8 [2025-04-13 23:31:10,030 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:31:10,041 INFO L225 Difference]: With dead ends: 1882 [2025-04-13 23:31:10,041 INFO L226 Difference]: Without dead ends: 1682 [2025-04-13 23:31:10,043 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-13 23:31:10,045 INFO L437 NwaCegarLoop]: 9 mSDtfsCounter, 29 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:31:10,045 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 14 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:31:10,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1682 states. [2025-04-13 23:31:10,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1682 to 1682. [2025-04-13 23:31:10,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1682 states, 1679 states have (on average 3.8606313281715305) internal successors, (6482), 1681 states have internal predecessors, (6482), 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-04-13 23:31:10,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1682 states to 1682 states and 6482 transitions. [2025-04-13 23:31:10,119 INFO L79 Accepts]: Start accepts. Automaton has 1682 states and 6482 transitions. Word has length 8 [2025-04-13 23:31:10,119 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:31:10,119 INFO L485 AbstractCegarLoop]: Abstraction has 1682 states and 6482 transitions. [2025-04-13 23:31:10,120 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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-04-13 23:31:10,120 INFO L278 IsEmpty]: Start isEmpty. Operand 1682 states and 6482 transitions. [2025-04-13 23:31:10,120 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-04-13 23:31:10,120 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:31:10,120 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:31:10,121 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 23:31:10,121 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:31:10,121 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:31:10,121 INFO L85 PathProgramCache]: Analyzing trace with hash 1941590345, now seen corresponding path program 1 times [2025-04-13 23:31:10,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:31:10,121 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502422534] [2025-04-13 23:31:10,121 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:31:10,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:31:10,130 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-13 23:31:10,157 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-13 23:31:10,157 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:31:10,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-04-13 23:31:10,158 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [954173549] [2025-04-13 23:31:10,158 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:31:10,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:31:10,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:31:10,161 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-04-13 23:31:10,163 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-04-13 23:31:10,202 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-13 23:31:10,216 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-13 23:31:10,216 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:31:10,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:31:10,217 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-13 23:31:10,218 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:31:10,236 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:31:10,236 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:31:10,329 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:31:10,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:31:10,329 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502422534] [2025-04-13 23:31:10,329 WARN L301 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-04-13 23:31:10,330 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [954173549] [2025-04-13 23:31:10,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [954173549] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:31:10,330 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-13 23:31:10,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2025-04-13 23:31:10,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315155872] [2025-04-13 23:31:10,330 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-13 23:31:10,330 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 23:31:10,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:31:10,330 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 23:31:10,330 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-04-13 23:31:10,331 INFO L87 Difference]: Start difference. First operand 1682 states and 6482 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 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-04-13 23:31:10,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:31:10,689 INFO L93 Difference]: Finished difference Result 2354 states and 9254 transitions. [2025-04-13 23:31:10,689 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 23:31:10,689 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 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) Word has length 9 [2025-04-13 23:31:10,689 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:31:10,701 INFO L225 Difference]: With dead ends: 2354 [2025-04-13 23:31:10,702 INFO L226 Difference]: Without dead ends: 1938 [2025-04-13 23:31:10,702 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2025-04-13 23:31:10,703 INFO L437 NwaCegarLoop]: 13 mSDtfsCounter, 73 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 23:31:10,703 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 40 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 23:31:10,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1938 states. [2025-04-13 23:31:10,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1938 to 1938. [2025-04-13 23:31:10,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1938 states, 1935 states have (on average 3.7695090439276484) internal successors, (7294), 1937 states have internal predecessors, (7294), 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-04-13 23:31:10,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1938 states to 1938 states and 7294 transitions. [2025-04-13 23:31:10,802 INFO L79 Accepts]: Start accepts. Automaton has 1938 states and 7294 transitions. Word has length 9 [2025-04-13 23:31:10,803 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:31:10,803 INFO L485 AbstractCegarLoop]: Abstraction has 1938 states and 7294 transitions. [2025-04-13 23:31:10,803 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 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-04-13 23:31:10,803 INFO L278 IsEmpty]: Start isEmpty. Operand 1938 states and 7294 transitions. [2025-04-13 23:31:10,804 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-04-13 23:31:10,804 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:31:10,804 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:31:10,811 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-04-13 23:31:11,009 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:31:11,009 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:31:11,009 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:31:11,009 INFO L85 PathProgramCache]: Analyzing trace with hash -1335591904, now seen corresponding path program 2 times [2025-04-13 23:31:11,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:31:11,009 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056825483] [2025-04-13 23:31:11,010 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:31:11,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:31:11,016 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 10 statements into 2 equivalence classes. [2025-04-13 23:31:11,030 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 10 of 10 statements. [2025-04-13 23:31:11,031 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:31:11,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:31:11,136 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:31:11,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:31:11,136 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056825483] [2025-04-13 23:31:11,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056825483] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:31:11,136 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1463612593] [2025-04-13 23:31:11,136 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:31:11,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:31:11,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:31:11,139 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-04-13 23:31:11,140 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-04-13 23:31:11,177 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 10 statements into 2 equivalence classes. [2025-04-13 23:31:11,190 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 10 of 10 statements. [2025-04-13 23:31:11,190 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:31:11,190 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:31:11,190 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-13 23:31:11,191 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:31:11,229 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:31:11,229 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-13 23:31:11,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1463612593] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:31:11,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-13 23:31:11,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-04-13 23:31:11,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548388738] [2025-04-13 23:31:11,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:31:11,230 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 23:31:11,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:31:11,230 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 23:31:11,230 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-04-13 23:31:11,230 INFO L87 Difference]: Start difference. First operand 1938 states and 7294 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 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-04-13 23:31:11,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:31:11,380 INFO L93 Difference]: Finished difference Result 1950 states and 7316 transitions. [2025-04-13 23:31:11,381 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 23:31:11,381 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 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) Word has length 10 [2025-04-13 23:31:11,381 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:31:11,395 INFO L225 Difference]: With dead ends: 1950 [2025-04-13 23:31:11,395 INFO L226 Difference]: Without dead ends: 1918 [2025-04-13 23:31:11,395 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-04-13 23:31:11,396 INFO L437 NwaCegarLoop]: 9 mSDtfsCounter, 19 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-13 23:31:11,396 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 23 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-13 23:31:11,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1918 states. [2025-04-13 23:31:11,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1918 to 1918. [2025-04-13 23:31:11,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1918 states, 1915 states have (on average 3.778590078328982) internal successors, (7236), 1917 states have internal predecessors, (7236), 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-04-13 23:31:11,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1918 states to 1918 states and 7236 transitions. [2025-04-13 23:31:11,521 INFO L79 Accepts]: Start accepts. Automaton has 1918 states and 7236 transitions. Word has length 10 [2025-04-13 23:31:11,521 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:31:11,521 INFO L485 AbstractCegarLoop]: Abstraction has 1918 states and 7236 transitions. [2025-04-13 23:31:11,521 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 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-04-13 23:31:11,521 INFO L278 IsEmpty]: Start isEmpty. Operand 1918 states and 7236 transitions. [2025-04-13 23:31:11,523 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-04-13 23:31:11,523 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:31:11,523 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2025-04-13 23:31:11,530 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-04-13 23:31:11,723 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:31:11,724 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:31:11,724 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:31:11,724 INFO L85 PathProgramCache]: Analyzing trace with hash 152007086, now seen corresponding path program 1 times [2025-04-13 23:31:11,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:31:11,724 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284394570] [2025-04-13 23:31:11,724 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:31:11,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:31:11,729 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-13 23:31:11,732 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-13 23:31:11,732 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:31:11,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 23:31:11,732 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-13 23:31:11,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-13 23:31:11,737 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-13 23:31:11,737 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:31:11,737 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 23:31:11,740 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-13 23:31:11,741 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-13 23:31:11,741 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2025-04-13 23:31:11,741 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2025-04-13 23:31:11,741 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2025-04-13 23:31:11,741 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-13 23:31:11,741 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1] [2025-04-13 23:31:11,744 WARN L247 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-13 23:31:11,744 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-04-13 23:31:11,760 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-13 23:31:11,761 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 46 places, 34 transitions, 104 flow [2025-04-13 23:31:12,578 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 23756 states, 23751 states have (on average 5.361079533493327) internal successors, (127331), 23755 states have internal predecessors, (127331), 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-04-13 23:31:12,579 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 23:31:12,580 INFO L340 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=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@42b777b2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 23:31:12,580 INFO L341 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-04-13 23:31:12,646 INFO L278 IsEmpty]: Start isEmpty. Operand has 23756 states, 23751 states have (on average 5.361079533493327) internal successors, (127331), 23755 states have internal predecessors, (127331), 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-04-13 23:31:12,647 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2025-04-13 23:31:12,648 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:31:12,649 INFO L218 NwaCegarLoop]: trace histogram [1, 1] [2025-04-13 23:31:12,649 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:31:12,649 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:31:12,649 INFO L85 PathProgramCache]: Analyzing trace with hash 7722, now seen corresponding path program 1 times [2025-04-13 23:31:12,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:31:12,649 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975985829] [2025-04-13 23:31:12,649 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:31:12,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:31:12,654 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-13 23:31:12,660 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-13 23:31:12,660 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:31:12,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-04-13 23:31:12,660 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [537400357] [2025-04-13 23:31:12,660 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:31:12,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:31:12,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:31:12,663 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-04-13 23:31:12,664 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-04-13 23:31:12,702 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-13 23:31:12,707 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-13 23:31:12,707 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:31:12,707 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:31:12,707 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-13 23:31:12,708 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:31:12,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:31:12,711 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-13 23:31:12,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:31:12,711 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975985829] [2025-04-13 23:31:12,711 WARN L301 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-04-13 23:31:12,711 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [537400357] [2025-04-13 23:31:12,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [537400357] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:31:12,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:31:12,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-13 23:31:12,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784507171] [2025-04-13 23:31:12,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:31:12,711 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 23:31:12,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:31:12,712 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 23:31:12,712 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 23:31:12,766 INFO L87 Difference]: Start difference. First operand has 23756 states, 23751 states have (on average 5.361079533493327) internal successors, (127331), 23755 states have internal predecessors, (127331), 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) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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-04-13 23:31:13,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:31:13,295 INFO L93 Difference]: Finished difference Result 27540 states and 143629 transitions. [2025-04-13 23:31:13,295 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 23:31:13,295 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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) Word has length 2 [2025-04-13 23:31:13,296 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:31:13,526 INFO L225 Difference]: With dead ends: 27540 [2025-04-13 23:31:13,527 INFO L226 Difference]: Without dead ends: 23170 [2025-04-13 23:31:13,547 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 23:31:13,548 INFO L437 NwaCegarLoop]: 7 mSDtfsCounter, 20 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-13 23:31:13,548 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 14 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-13 23:31:13,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23170 states. [2025-04-13 23:31:14,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23170 to 23170. [2025-04-13 23:31:14,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23170 states, 23166 states have (on average 5.344815678149011) internal successors, (123818), 23169 states have internal predecessors, (123818), 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-04-13 23:31:14,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23170 states to 23170 states and 123818 transitions. [2025-04-13 23:31:14,572 INFO L79 Accepts]: Start accepts. Automaton has 23170 states and 123818 transitions. Word has length 2 [2025-04-13 23:31:14,573 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:31:14,573 INFO L485 AbstractCegarLoop]: Abstraction has 23170 states and 123818 transitions. [2025-04-13 23:31:14,573 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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-04-13 23:31:14,573 INFO L278 IsEmpty]: Start isEmpty. Operand 23170 states and 123818 transitions. [2025-04-13 23:31:14,573 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-04-13 23:31:14,573 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:31:14,573 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:31:14,579 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-04-13 23:31:14,778 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:31:14,778 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:31:14,778 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:31:14,778 INFO L85 PathProgramCache]: Analyzing trace with hash -1668752867, now seen corresponding path program 1 times [2025-04-13 23:31:14,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:31:14,779 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185601532] [2025-04-13 23:31:14,779 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:31:14,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:31:14,783 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-13 23:31:14,786 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-13 23:31:14,787 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:31:14,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:31:14,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:31:14,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:31:14,848 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185601532] [2025-04-13 23:31:14,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185601532] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:31:14,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:31:14,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 23:31:14,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435930651] [2025-04-13 23:31:14,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:31:14,848 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 23:31:14,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:31:14,849 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 23:31:14,849 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-13 23:31:14,849 INFO L87 Difference]: Start difference. First operand 23170 states and 123818 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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-04-13 23:31:15,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:31:15,891 INFO L93 Difference]: Finished difference Result 31322 states and 167492 transitions. [2025-04-13 23:31:15,891 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 23:31:15,891 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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) Word has length 8 [2025-04-13 23:31:15,891 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:31:16,179 INFO L225 Difference]: With dead ends: 31322 [2025-04-13 23:31:16,179 INFO L226 Difference]: Without dead ends: 27538 [2025-04-13 23:31:16,193 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-13 23:31:16,193 INFO L437 NwaCegarLoop]: 13 mSDtfsCounter, 43 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:31:16,194 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 20 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:31:16,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27538 states. [2025-04-13 23:31:16,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27538 to 27538. [2025-04-13 23:31:16,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27538 states, 27534 states have (on average 5.353744461393187) internal successors, (147410), 27537 states have internal predecessors, (147410), 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-04-13 23:31:17,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27538 states to 27538 states and 147410 transitions. [2025-04-13 23:31:17,298 INFO L79 Accepts]: Start accepts. Automaton has 27538 states and 147410 transitions. Word has length 8 [2025-04-13 23:31:17,298 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:31:17,298 INFO L485 AbstractCegarLoop]: Abstraction has 27538 states and 147410 transitions. [2025-04-13 23:31:17,298 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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-04-13 23:31:17,298 INFO L278 IsEmpty]: Start isEmpty. Operand 27538 states and 147410 transitions. [2025-04-13 23:31:17,299 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-04-13 23:31:17,299 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:31:17,299 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:31:17,299 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-13 23:31:17,299 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:31:17,300 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:31:17,300 INFO L85 PathProgramCache]: Analyzing trace with hash -206030816, now seen corresponding path program 1 times [2025-04-13 23:31:17,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:31:17,300 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668240291] [2025-04-13 23:31:17,300 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:31:17,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:31:17,307 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-13 23:31:17,318 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-13 23:31:17,318 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:31:17,318 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-04-13 23:31:17,319 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [404153123] [2025-04-13 23:31:17,319 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:31:17,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:31:17,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:31:17,321 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:31:17,323 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-04-13 23:31:17,365 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-13 23:31:17,378 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-13 23:31:17,378 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:31:17,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:31:17,380 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-13 23:31:17,380 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:31:17,419 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:31:17,419 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:31:17,483 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:31:17,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:31:17,483 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668240291] [2025-04-13 23:31:17,483 WARN L301 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-04-13 23:31:17,483 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [404153123] [2025-04-13 23:31:17,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [404153123] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 23:31:17,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-13 23:31:17,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 7 [2025-04-13 23:31:17,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830903777] [2025-04-13 23:31:17,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:31:17,484 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 23:31:17,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:31:17,484 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 23:31:17,484 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-04-13 23:31:17,485 INFO L87 Difference]: Start difference. First operand 27538 states and 147410 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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-04-13 23:31:22,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:31:22,820 INFO L93 Difference]: Finished difference Result 27538 states and 147410 transitions. [2025-04-13 23:31:22,821 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 23:31:22,821 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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) Word has length 9 [2025-04-13 23:31:22,821 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:31:22,920 INFO L225 Difference]: With dead ends: 27538 [2025-04-13 23:31:22,922 INFO L226 Difference]: Without dead ends: 15018 [2025-04-13 23:31:22,970 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-04-13 23:31:22,971 INFO L437 NwaCegarLoop]: 13 mSDtfsCounter, 40 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:31:22,971 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 27 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:31:23,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15018 states. [2025-04-13 23:31:23,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15018 to 15018. [2025-04-13 23:31:23,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15018 states, 15017 states have (on average 5.046014516880868) internal successors, (75776), 15017 states have internal predecessors, (75776), 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-04-13 23:31:23,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15018 states to 15018 states and 75776 transitions. [2025-04-13 23:31:23,594 INFO L79 Accepts]: Start accepts. Automaton has 15018 states and 75776 transitions. Word has length 9 [2025-04-13 23:31:23,594 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:31:23,594 INFO L485 AbstractCegarLoop]: Abstraction has 15018 states and 75776 transitions. [2025-04-13 23:31:23,595 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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-04-13 23:31:23,595 INFO L278 IsEmpty]: Start isEmpty. Operand 15018 states and 75776 transitions. [2025-04-13 23:31:23,597 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-04-13 23:31:23,597 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:31:23,597 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:31:23,604 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-04-13 23:31:23,801 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:31:23,801 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:31:23,801 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:31:23,801 INFO L85 PathProgramCache]: Analyzing trace with hash 616200071, now seen corresponding path program 1 times [2025-04-13 23:31:23,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:31:23,802 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865642290] [2025-04-13 23:31:23,802 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:31:23,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:31:23,806 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-13 23:31:23,811 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 23:31:23,812 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:31:23,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 23:31:23,812 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-13 23:31:23,814 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-13 23:31:23,819 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 23:31:23,820 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:31:23,820 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 23:31:23,823 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-13 23:31:23,823 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-13 23:31:23,823 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2025-04-13 23:31:23,823 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2025-04-13 23:31:23,823 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2025-04-13 23:31:23,823 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-13 23:31:23,824 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-04-13 23:31:23,824 WARN L247 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-13 23:31:23,824 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-04-13 23:31:23,842 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-13 23:31:23,845 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 58 places, 42 transitions, 140 flow [2025-04-13 23:31:37,872 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 380108 states, 380102 states have (on average 6.859892870860979) internal successors, (2607459), 380107 states have internal predecessors, (2607459), 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-04-13 23:31:37,873 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 23:31:37,876 INFO L340 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=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@42b777b2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 23:31:37,876 INFO L341 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-04-13 23:31:38,571 INFO L278 IsEmpty]: Start isEmpty. Operand has 380108 states, 380102 states have (on average 6.859892870860979) internal successors, (2607459), 380107 states have internal predecessors, (2607459), 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-04-13 23:31:38,572 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2025-04-13 23:31:38,572 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:31:38,572 INFO L218 NwaCegarLoop]: trace histogram [1, 1] [2025-04-13 23:31:38,572 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:31:38,572 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:31:38,572 INFO L85 PathProgramCache]: Analyzing trace with hash 9066, now seen corresponding path program 1 times [2025-04-13 23:31:38,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:31:38,572 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004896200] [2025-04-13 23:31:38,572 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:31:38,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:31:38,576 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-13 23:31:38,579 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-13 23:31:38,579 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:31:38,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-04-13 23:31:38,579 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1770500739] [2025-04-13 23:31:38,579 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:31:38,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:31:38,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:31:38,581 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:31:38,582 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-04-13 23:31:38,629 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-13 23:31:38,633 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-13 23:31:38,633 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:31:38,633 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:31:38,634 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-13 23:31:38,634 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:31:38,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:31:38,638 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-13 23:31:38,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:31:38,639 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004896200] [2025-04-13 23:31:38,639 WARN L301 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-04-13 23:31:38,639 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1770500739] [2025-04-13 23:31:38,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1770500739] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:31:38,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:31:38,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-13 23:31:38,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322251442] [2025-04-13 23:31:38,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:31:38,639 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 23:31:38,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:31:38,639 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 23:31:38,639 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 23:31:39,276 INFO L87 Difference]: Start difference. First operand has 380108 states, 380102 states have (on average 6.859892870860979) internal successors, (2607459), 380107 states have internal predecessors, (2607459), 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) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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-04-13 23:31:47,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:31:47,587 INFO L93 Difference]: Finished difference Result 445332 states and 2988301 transitions. [2025-04-13 23:31:47,588 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 23:31:47,588 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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) Word has length 2 [2025-04-13 23:31:47,588 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:31:52,923 INFO L225 Difference]: With dead ends: 445332 [2025-04-13 23:31:52,923 INFO L226 Difference]: Without dead ends: 375426 [2025-04-13 23:31:53,185 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 23:31:53,185 INFO L437 NwaCegarLoop]: 9 mSDtfsCounter, 25 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:31:53,185 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 18 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:31:54,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375426 states. [2025-04-13 23:32:08,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375426 to 375426. [2025-04-13 23:32:09,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 375426 states, 375421 states have (on average 6.8487857631832) internal successors, (2571178), 375425 states have internal predecessors, (2571178), 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)