/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/weaver/parallel-ticket-5.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 22:37:34,271 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 22:37:34,325 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 22:37:34,328 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 22:37:34,329 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 22:37:34,351 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 22:37:34,352 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 22:37:34,352 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 22:37:34,352 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 22:37:34,353 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 22:37:34,353 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 22:37:34,353 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 22:37:34,353 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 22:37:34,353 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 22:37:34,354 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 22:37:34,354 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 22:37:34,354 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 22:37:34,354 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 22:37:34,354 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 22:37:34,354 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 22:37:34,354 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 22:37:34,354 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 22:37:34,355 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 22:37:34,355 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 22:37:34,355 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 22:37:34,355 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 22:37:34,355 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 22:37:34,355 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 22:37:34,355 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 22:37:34,355 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 22:37:34,355 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 22:37:34,355 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 22:37:34,355 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 22:37:34,355 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 22:37:34,355 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 22:37:34,355 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 22:37:34,355 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 22:37:34,355 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 22:37:34,356 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 22:37:34,356 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 22:37:34,356 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 22:37:34,356 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 22:37:34,356 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 22:37:34,356 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 22:37:34,356 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 22:37:34,356 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 22:37:34,356 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 22:37:34,356 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 22:37:34,549 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 22:37:34,555 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 22:37:34,556 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 22:37:34,557 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 22:37:34,559 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 22:37:34,560 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/parallel-ticket-5.wvr.c [2025-04-13 22:37:35,819 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/676d02c96/71d1b13db30f479192b2737fc23a7d93/FLAGd58e96874 [2025-04-13 22:37:36,023 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 22:37:36,024 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-ticket-5.wvr.c [2025-04-13 22:37:36,030 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/676d02c96/71d1b13db30f479192b2737fc23a7d93/FLAGd58e96874 [2025-04-13 22:37:36,820 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/676d02c96/71d1b13db30f479192b2737fc23a7d93 [2025-04-13 22:37:36,822 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 22:37:36,823 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 22:37:36,824 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 22:37:36,824 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 22:37:36,826 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 22:37:36,827 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 10:37:36" (1/1) ... [2025-04-13 22:37:36,827 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ca3e074 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:37:36, skipping insertion in model container [2025-04-13 22:37:36,827 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 10:37:36" (1/1) ... [2025-04-13 22:37:36,842 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 22:37:36,972 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-ticket-5.wvr.c[2777,2790] [2025-04-13 22:37:36,976 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 22:37:36,982 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 22:37:37,000 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-ticket-5.wvr.c[2777,2790] [2025-04-13 22:37:37,003 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 22:37:37,016 INFO L204 MainTranslator]: Completed translation [2025-04-13 22:37:37,017 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:37:37 WrapperNode [2025-04-13 22:37:37,017 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 22:37:37,017 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 22:37:37,017 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 22:37:37,017 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 22:37:37,021 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:37:37" (1/1) ... [2025-04-13 22:37:37,027 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:37:37" (1/1) ... [2025-04-13 22:37:37,043 INFO L138 Inliner]: procedures = 21, calls = 18, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 204 [2025-04-13 22:37:37,044 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 22:37:37,044 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 22:37:37,044 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 22:37:37,044 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 22:37:37,051 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:37:37" (1/1) ... [2025-04-13 22:37:37,051 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:37:37" (1/1) ... [2025-04-13 22:37:37,053 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:37:37" (1/1) ... [2025-04-13 22:37:37,068 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 22:37:37,068 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:37:37" (1/1) ... [2025-04-13 22:37:37,068 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:37:37" (1/1) ... [2025-04-13 22:37:37,071 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:37:37" (1/1) ... [2025-04-13 22:37:37,071 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:37:37" (1/1) ... [2025-04-13 22:37:37,072 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:37:37" (1/1) ... [2025-04-13 22:37:37,072 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:37:37" (1/1) ... [2025-04-13 22:37:37,075 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 22:37:37,075 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-04-13 22:37:37,075 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-04-13 22:37:37,075 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-04-13 22:37:37,076 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:37:37" (1/1) ... [2025-04-13 22:37:37,079 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 22:37:37,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:37:37,100 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 22:37:37,102 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 22:37:37,116 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 22:37:37,116 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-13 22:37:37,116 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-13 22:37:37,116 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-13 22:37:37,116 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-13 22:37:37,116 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-13 22:37:37,116 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-13 22:37:37,116 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-04-13 22:37:37,117 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-04-13 22:37:37,117 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 22:37:37,117 INFO L130 BoogieDeclarations]: Found specification of procedure thread5 [2025-04-13 22:37:37,117 INFO L138 BoogieDeclarations]: Found implementation of procedure thread5 [2025-04-13 22:37:37,117 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 22:37:37,117 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 22:37:37,118 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 22:37:37,191 INFO L256 CfgBuilder]: Building ICFG [2025-04-13 22:37:37,193 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 22:37:37,444 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 22:37:37,445 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 22:37:37,445 INFO L318 CfgBuilder]: Performing block encoding [2025-04-13 22:37:37,614 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 22:37:37,614 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.04 10:37:37 BoogieIcfgContainer [2025-04-13 22:37:37,614 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-04-13 22:37:37,617 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 22:37:37,617 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 22:37:37,620 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 22:37:37,620 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 10:37:36" (1/3) ... [2025-04-13 22:37:37,621 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46098298 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 10:37:37, skipping insertion in model container [2025-04-13 22:37:37,622 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:37:37" (2/3) ... [2025-04-13 22:37:37,622 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46098298 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 10:37:37, skipping insertion in model container [2025-04-13 22:37:37,622 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.04 10:37:37" (3/3) ... [2025-04-13 22:37:37,622 INFO L128 eAbstractionObserver]: Analyzing ICFG parallel-ticket-5.wvr.c [2025-04-13 22:37:37,632 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 22:37:37,633 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG parallel-ticket-5.wvr.c that has 6 procedures, 63 locations, 61 edges, 1 initial locations, 0 loop locations, and 1 error locations. [2025-04-13 22:37:37,633 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 22:37:37,713 INFO L143 ThreadInstanceAdder]: Constructed 5 joinOtherThreadTransitions. [2025-04-13 22:37:37,737 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 78 places, 66 transitions, 167 flow [2025-04-13 22:37:39,313 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 47628 states, 47627 states have (on average 5.252902765238205) internal successors, (250180), 47627 states have internal predecessors, (250180), 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 22:37:39,342 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 22:37:39,350 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;@6ca433b5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 22:37:39,350 INFO L341 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-04-13 22:37:39,443 INFO L278 IsEmpty]: Start isEmpty. Operand has 47628 states, 47627 states have (on average 5.252902765238205) internal successors, (250180), 47627 states have internal predecessors, (250180), 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 22:37:39,823 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-04-13 22:37:39,823 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:37:39,824 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:37:39,824 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 22:37:39,827 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:37:39,827 INFO L85 PathProgramCache]: Analyzing trace with hash 247303473, now seen corresponding path program 1 times [2025-04-13 22:37:39,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:37:39,896 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011939116] [2025-04-13 22:37:39,896 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:37:39,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:37:39,955 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-04-13 22:37:39,998 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-04-13 22:37:39,998 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:37:39,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:37:40,226 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 22:37:40,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:37:40,228 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011939116] [2025-04-13 22:37:40,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011939116] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:37:40,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:37:40,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 22:37:40,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975008809] [2025-04-13 22:37:40,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:37:40,233 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 22:37:40,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:37:40,245 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 22:37:40,246 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 22:37:40,336 INFO L87 Difference]: Start difference. First operand has 47628 states, 47627 states have (on average 5.252902765238205) internal successors, (250180), 47627 states have internal predecessors, (250180), 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 26.0) internal successors, (52), 3 states have internal predecessors, (52), 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 22:37:41,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:37:41,553 INFO L93 Difference]: Finished difference Result 89534 states and 465592 transitions. [2025-04-13 22:37:41,553 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 22:37:41,554 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 26.0) internal successors, (52), 3 states have internal predecessors, (52), 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 52 [2025-04-13 22:37:41,555 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:37:42,871 INFO L225 Difference]: With dead ends: 89534 [2025-04-13 22:37:42,875 INFO L226 Difference]: Without dead ends: 88116 [2025-04-13 22:37:42,960 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 22:37:42,965 INFO L437 NwaCegarLoop]: 5 mSDtfsCounter, 10 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:37:42,966 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 10 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:37:43,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88116 states. [2025-04-13 22:37:45,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88116 to 70629. [2025-04-13 22:37:45,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70629 states, 70628 states have (on average 5.215934190406071) internal successors, (368391), 70628 states have internal predecessors, (368391), 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 22:37:46,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70629 states to 70629 states and 368391 transitions. [2025-04-13 22:37:46,548 INFO L79 Accepts]: Start accepts. Automaton has 70629 states and 368391 transitions. Word has length 52 [2025-04-13 22:37:46,549 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:37:46,549 INFO L485 AbstractCegarLoop]: Abstraction has 70629 states and 368391 transitions. [2025-04-13 22:37:46,550 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 26.0) internal successors, (52), 3 states have internal predecessors, (52), 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 22:37:46,550 INFO L278 IsEmpty]: Start isEmpty. Operand 70629 states and 368391 transitions. [2025-04-13 22:37:46,954 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-04-13 22:37:46,954 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:37:46,954 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:37:46,954 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 22:37:46,955 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 22:37:46,955 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:37:46,955 INFO L85 PathProgramCache]: Analyzing trace with hash -1483918513, now seen corresponding path program 1 times [2025-04-13 22:37:46,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:37:46,955 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142736358] [2025-04-13 22:37:46,955 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:37:46,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:37:46,965 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-04-13 22:37:46,975 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-04-13 22:37:46,975 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:37:46,975 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:37:47,029 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 22:37:47,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:37:47,029 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142736358] [2025-04-13 22:37:47,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142736358] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:37:47,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:37:47,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 22:37:47,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140009267] [2025-04-13 22:37:47,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:37:47,030 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 22:37:47,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:37:47,031 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 22:37:47,031 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 22:37:47,031 INFO L87 Difference]: Start difference. First operand 70629 states and 368391 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 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 22:37:48,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:37:48,244 INFO L93 Difference]: Finished difference Result 94790 states and 491018 transitions. [2025-04-13 22:37:48,244 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 22:37:48,244 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 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 53 [2025-04-13 22:37:48,245 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:37:48,521 INFO L225 Difference]: With dead ends: 94790 [2025-04-13 22:37:48,521 INFO L226 Difference]: Without dead ends: 38911 [2025-04-13 22:37:48,601 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 22:37:48,601 INFO L437 NwaCegarLoop]: 5 mSDtfsCounter, 39 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:37:48,602 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 9 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:37:48,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38911 states. [2025-04-13 22:37:49,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38911 to 38911. [2025-04-13 22:37:49,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38911 states, 38910 states have (on average 4.659367771781033) internal successors, (181296), 38910 states have internal predecessors, (181296), 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 22:37:49,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38911 states to 38911 states and 181296 transitions. [2025-04-13 22:37:49,761 INFO L79 Accepts]: Start accepts. Automaton has 38911 states and 181296 transitions. Word has length 53 [2025-04-13 22:37:49,761 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:37:49,761 INFO L485 AbstractCegarLoop]: Abstraction has 38911 states and 181296 transitions. [2025-04-13 22:37:49,761 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 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 22:37:49,761 INFO L278 IsEmpty]: Start isEmpty. Operand 38911 states and 181296 transitions. [2025-04-13 22:37:49,860 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-04-13 22:37:49,861 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:37:49,861 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:37:49,861 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 22:37:49,861 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 22:37:49,861 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:37:49,861 INFO L85 PathProgramCache]: Analyzing trace with hash 438583039, now seen corresponding path program 2 times [2025-04-13 22:37:49,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:37:49,862 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243207375] [2025-04-13 22:37:49,862 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:37:49,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:37:49,875 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 53 statements into 1 equivalence classes. [2025-04-13 22:37:49,894 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-04-13 22:37:49,894 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 22:37:49,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:37:50,029 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 22:37:50,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:37:50,029 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243207375] [2025-04-13 22:37:50,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243207375] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:37:50,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:37:50,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 22:37:50,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699595658] [2025-04-13 22:37:50,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:37:50,030 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 22:37:50,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:37:50,030 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 22:37:50,030 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-04-13 22:37:50,030 INFO L87 Difference]: Start difference. First operand 38911 states and 181296 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 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 22:37:51,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:37:51,468 INFO L93 Difference]: Finished difference Result 104282 states and 473298 transitions. [2025-04-13 22:37:51,469 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 22:37:51,469 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 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 53 [2025-04-13 22:37:51,469 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:37:52,175 INFO L225 Difference]: With dead ends: 104282 [2025-04-13 22:37:52,176 INFO L226 Difference]: Without dead ends: 84674 [2025-04-13 22:37:52,221 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-04-13 22:37:52,222 INFO L437 NwaCegarLoop]: 19 mSDtfsCounter, 158 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 417 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 417 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 22:37:52,222 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 54 Invalid, 442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 417 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 22:37:52,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84674 states. [2025-04-13 22:37:53,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84674 to 47612. [2025-04-13 22:37:53,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47612 states, 47611 states have (on average 4.629980466698872) internal successors, (220438), 47611 states have internal predecessors, (220438), 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 22:37:54,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47612 states to 47612 states and 220438 transitions. [2025-04-13 22:37:54,500 INFO L79 Accepts]: Start accepts. Automaton has 47612 states and 220438 transitions. Word has length 53 [2025-04-13 22:37:54,501 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:37:54,501 INFO L485 AbstractCegarLoop]: Abstraction has 47612 states and 220438 transitions. [2025-04-13 22:37:54,501 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 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 22:37:54,501 INFO L278 IsEmpty]: Start isEmpty. Operand 47612 states and 220438 transitions. [2025-04-13 22:37:54,632 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-04-13 22:37:54,633 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:37:54,633 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:37:54,633 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 22:37:54,633 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 22:37:54,633 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:37:54,633 INFO L85 PathProgramCache]: Analyzing trace with hash 942482007, now seen corresponding path program 3 times [2025-04-13 22:37:54,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:37:54,634 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820066331] [2025-04-13 22:37:54,634 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:37:54,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:37:54,644 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 53 statements into 1 equivalence classes. [2025-04-13 22:37:54,659 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-04-13 22:37:54,660 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 22:37:54,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:37:54,744 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 22:37:54,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:37:54,744 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820066331] [2025-04-13 22:37:54,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820066331] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:37:54,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:37:54,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 22:37:54,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546045070] [2025-04-13 22:37:54,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:37:54,745 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 22:37:54,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:37:54,745 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 22:37:54,745 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 22:37:54,745 INFO L87 Difference]: Start difference. First operand 47612 states and 220438 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 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 22:37:55,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:37:55,968 INFO L93 Difference]: Finished difference Result 109542 states and 498600 transitions. [2025-04-13 22:37:55,969 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 22:37:55,969 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 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 53 [2025-04-13 22:37:55,969 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:37:56,409 INFO L225 Difference]: With dead ends: 109542 [2025-04-13 22:37:56,410 INFO L226 Difference]: Without dead ends: 88242 [2025-04-13 22:37:56,461 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-04-13 22:37:56,463 INFO L437 NwaCegarLoop]: 14 mSDtfsCounter, 109 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:37:56,463 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 34 Invalid, 304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:37:56,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88242 states. [2025-04-13 22:37:58,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88242 to 50208. [2025-04-13 22:37:58,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50208 states, 50207 states have (on average 4.606807815643237) internal successors, (231294), 50207 states have internal predecessors, (231294), 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 22:37:58,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50208 states to 50208 states and 231294 transitions. [2025-04-13 22:37:58,796 INFO L79 Accepts]: Start accepts. Automaton has 50208 states and 231294 transitions. Word has length 53 [2025-04-13 22:37:58,796 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:37:58,796 INFO L485 AbstractCegarLoop]: Abstraction has 50208 states and 231294 transitions. [2025-04-13 22:37:58,796 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 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 22:37:58,796 INFO L278 IsEmpty]: Start isEmpty. Operand 50208 states and 231294 transitions. [2025-04-13 22:37:58,916 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-04-13 22:37:58,916 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:37:58,916 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:37:58,916 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 22:37:58,916 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 22:37:58,917 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:37:58,917 INFO L85 PathProgramCache]: Analyzing trace with hash -899646812, now seen corresponding path program 1 times [2025-04-13 22:37:58,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:37:58,917 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30128855] [2025-04-13 22:37:58,917 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:37:58,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:37:58,923 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-04-13 22:37:58,932 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-04-13 22:37:58,933 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:37:58,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:37:59,076 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 22:37:59,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:37:59,076 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30128855] [2025-04-13 22:37:59,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30128855] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:37:59,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:37:59,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 22:37:59,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092211394] [2025-04-13 22:37:59,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:37:59,077 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 22:37:59,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:37:59,077 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 22:37:59,077 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-04-13 22:37:59,077 INFO L87 Difference]: Start difference. First operand 50208 states and 231294 transitions. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 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 22:38:00,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:38:00,265 INFO L93 Difference]: Finished difference Result 88976 states and 403798 transitions. [2025-04-13 22:38:00,266 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 22:38:00,266 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 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 53 [2025-04-13 22:38:00,266 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:38:00,692 INFO L225 Difference]: With dead ends: 88976 [2025-04-13 22:38:00,692 INFO L226 Difference]: Without dead ends: 74462 [2025-04-13 22:38:00,730 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2025-04-13 22:38:00,731 INFO L437 NwaCegarLoop]: 24 mSDtfsCounter, 176 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 527 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 561 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 527 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 22:38:00,731 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 68 Invalid, 561 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 527 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 22:38:00,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74462 states. [2025-04-13 22:38:02,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74462 to 52542. [2025-04-13 22:38:02,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52542 states, 52541 states have (on average 4.605146457052587) internal successors, (241959), 52541 states have internal predecessors, (241959), 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 22:38:02,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52542 states to 52542 states and 241959 transitions. [2025-04-13 22:38:02,925 INFO L79 Accepts]: Start accepts. Automaton has 52542 states and 241959 transitions. Word has length 53 [2025-04-13 22:38:02,925 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:38:02,925 INFO L485 AbstractCegarLoop]: Abstraction has 52542 states and 241959 transitions. [2025-04-13 22:38:02,925 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 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 22:38:02,925 INFO L278 IsEmpty]: Start isEmpty. Operand 52542 states and 241959 transitions. [2025-04-13 22:38:03,050 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-04-13 22:38:03,050 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:38:03,050 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:38:03,050 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-13 22:38:03,051 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 22:38:03,051 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:38:03,051 INFO L85 PathProgramCache]: Analyzing trace with hash -1895755148, now seen corresponding path program 2 times [2025-04-13 22:38:03,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:38:03,051 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873318079] [2025-04-13 22:38:03,051 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:38:03,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:38:03,059 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 53 statements into 1 equivalence classes. [2025-04-13 22:38:03,067 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-04-13 22:38:03,067 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 22:38:03,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:38:03,136 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 22:38:03,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:38:03,136 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873318079] [2025-04-13 22:38:03,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873318079] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:38:03,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:38:03,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 22:38:03,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99749293] [2025-04-13 22:38:03,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:38:03,137 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 22:38:03,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:38:03,137 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 22:38:03,137 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-04-13 22:38:03,137 INFO L87 Difference]: Start difference. First operand 52542 states and 241959 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 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 22:38:04,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:38:04,338 INFO L93 Difference]: Finished difference Result 113165 states and 510989 transitions. [2025-04-13 22:38:04,338 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 22:38:04,339 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 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 53 [2025-04-13 22:38:04,339 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:38:05,133 INFO L225 Difference]: With dead ends: 113165 [2025-04-13 22:38:05,134 INFO L226 Difference]: Without dead ends: 92062 [2025-04-13 22:38:05,177 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-04-13 22:38:05,178 INFO L437 NwaCegarLoop]: 19 mSDtfsCounter, 130 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 442 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 462 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 442 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:38:05,178 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 54 Invalid, 462 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 442 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:38:05,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92062 states. [2025-04-13 22:38:06,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92062 to 58588. [2025-04-13 22:38:06,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58588 states, 58587 states have (on average 4.5728403912130675) internal successors, (267909), 58587 states have internal predecessors, (267909), 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 22:38:07,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58588 states to 58588 states and 267909 transitions. [2025-04-13 22:38:07,542 INFO L79 Accepts]: Start accepts. Automaton has 58588 states and 267909 transitions. Word has length 53 [2025-04-13 22:38:07,542 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:38:07,542 INFO L485 AbstractCegarLoop]: Abstraction has 58588 states and 267909 transitions. [2025-04-13 22:38:07,542 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 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 22:38:07,542 INFO L278 IsEmpty]: Start isEmpty. Operand 58588 states and 267909 transitions. [2025-04-13 22:38:07,708 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-04-13 22:38:07,708 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:38:07,708 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:38:07,708 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-13 22:38:07,708 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 22:38:07,709 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:38:07,709 INFO L85 PathProgramCache]: Analyzing trace with hash -2103107600, now seen corresponding path program 1 times [2025-04-13 22:38:07,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:38:07,709 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321638227] [2025-04-13 22:38:07,709 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:38:07,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:38:07,716 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-04-13 22:38:07,722 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-04-13 22:38:07,722 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:38:07,722 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:38:07,789 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 22:38:07,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:38:07,789 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321638227] [2025-04-13 22:38:07,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321638227] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:38:07,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:38:07,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 22:38:07,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520486160] [2025-04-13 22:38:07,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:38:07,789 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 22:38:07,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:38:07,790 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 22:38:07,790 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 22:38:07,790 INFO L87 Difference]: Start difference. First operand 58588 states and 267909 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 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 22:38:09,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:38:09,117 INFO L93 Difference]: Finished difference Result 125663 states and 564346 transitions. [2025-04-13 22:38:09,118 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 22:38:09,118 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 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 53 [2025-04-13 22:38:09,118 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:38:09,622 INFO L225 Difference]: With dead ends: 125663 [2025-04-13 22:38:09,623 INFO L226 Difference]: Without dead ends: 93326 [2025-04-13 22:38:09,683 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-04-13 22:38:09,684 INFO L437 NwaCegarLoop]: 14 mSDtfsCounter, 105 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 290 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:38:09,684 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 34 Invalid, 305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 290 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:38:09,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93326 states. [2025-04-13 22:38:11,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93326 to 66080. [2025-04-13 22:38:11,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66080 states, 66079 states have (on average 4.49224413202379) internal successors, (296843), 66079 states have internal predecessors, (296843), 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 22:38:12,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66080 states to 66080 states and 296843 transitions. [2025-04-13 22:38:12,261 INFO L79 Accepts]: Start accepts. Automaton has 66080 states and 296843 transitions. Word has length 53 [2025-04-13 22:38:12,261 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:38:12,261 INFO L485 AbstractCegarLoop]: Abstraction has 66080 states and 296843 transitions. [2025-04-13 22:38:12,261 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 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 22:38:12,261 INFO L278 IsEmpty]: Start isEmpty. Operand 66080 states and 296843 transitions. [2025-04-13 22:38:12,421 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-04-13 22:38:12,421 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:38:12,421 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:38:12,421 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-13 22:38:12,421 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 22:38:12,421 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:38:12,422 INFO L85 PathProgramCache]: Analyzing trace with hash -2129040877, now seen corresponding path program 1 times [2025-04-13 22:38:12,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:38:12,422 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999654623] [2025-04-13 22:38:12,422 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:38:12,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:38:12,427 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-04-13 22:38:12,430 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-04-13 22:38:12,430 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:38:12,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:38:12,453 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 22:38:12,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:38:12,454 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999654623] [2025-04-13 22:38:12,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999654623] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:38:12,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:38:12,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 22:38:12,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316811292] [2025-04-13 22:38:12,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:38:12,454 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 22:38:12,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:38:12,454 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 22:38:12,454 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 22:38:12,454 INFO L87 Difference]: Start difference. First operand 66080 states and 296843 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 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 22:38:13,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:38:13,387 INFO L93 Difference]: Finished difference Result 97773 states and 436998 transitions. [2025-04-13 22:38:13,387 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 22:38:13,387 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 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 53 [2025-04-13 22:38:13,388 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:38:14,089 INFO L225 Difference]: With dead ends: 97773 [2025-04-13 22:38:14,089 INFO L226 Difference]: Without dead ends: 66080 [2025-04-13 22:38:14,136 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 22:38:14,137 INFO L437 NwaCegarLoop]: 9 mSDtfsCounter, 13 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:38:14,137 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 14 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:38:14,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66080 states. [2025-04-13 22:38:15,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66080 to 66080. [2025-04-13 22:38:15,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66080 states, 66079 states have (on average 4.389246205299717) internal successors, (290037), 66079 states have internal predecessors, (290037), 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 22:38:15,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66080 states to 66080 states and 290037 transitions. [2025-04-13 22:38:16,145 INFO L79 Accepts]: Start accepts. Automaton has 66080 states and 290037 transitions. Word has length 53 [2025-04-13 22:38:16,145 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:38:16,145 INFO L485 AbstractCegarLoop]: Abstraction has 66080 states and 290037 transitions. [2025-04-13 22:38:16,145 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 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 22:38:16,145 INFO L278 IsEmpty]: Start isEmpty. Operand 66080 states and 290037 transitions. [2025-04-13 22:38:16,294 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-04-13 22:38:16,295 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:38:16,295 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:38:16,295 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-13 22:38:16,295 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 22:38:16,295 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:38:16,295 INFO L85 PathProgramCache]: Analyzing trace with hash 1826680579, now seen corresponding path program 2 times [2025-04-13 22:38:16,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:38:16,295 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976719007] [2025-04-13 22:38:16,295 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:38:16,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:38:16,301 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 53 statements into 1 equivalence classes. [2025-04-13 22:38:16,305 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-04-13 22:38:16,305 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 22:38:16,305 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:38:16,640 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 22:38:16,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:38:16,641 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976719007] [2025-04-13 22:38:16,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976719007] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:38:16,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:38:16,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-13 22:38:16,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515129092] [2025-04-13 22:38:16,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:38:16,641 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 22:38:16,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:38:16,641 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 22:38:16,641 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2025-04-13 22:38:16,642 INFO L87 Difference]: Start difference. First operand 66080 states and 290037 transitions. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 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 22:38:17,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:38:17,518 INFO L93 Difference]: Finished difference Result 77944 states and 340027 transitions. [2025-04-13 22:38:17,518 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 22:38:17,518 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 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 53 [2025-04-13 22:38:17,519 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:38:17,949 INFO L225 Difference]: With dead ends: 77944 [2025-04-13 22:38:17,950 INFO L226 Difference]: Without dead ends: 72602 [2025-04-13 22:38:17,969 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2025-04-13 22:38:17,970 INFO L437 NwaCegarLoop]: 25 mSDtfsCounter, 174 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 566 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 604 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 566 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:38:17,970 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 70 Invalid, 604 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 566 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:38:18,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72602 states. [2025-04-13 22:38:19,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72602 to 66234. [2025-04-13 22:38:19,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66234 states, 66233 states have (on average 4.385442302175653) internal successors, (290461), 66233 states have internal predecessors, (290461), 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 22:38:20,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66234 states to 66234 states and 290461 transitions. [2025-04-13 22:38:20,307 INFO L79 Accepts]: Start accepts. Automaton has 66234 states and 290461 transitions. Word has length 53 [2025-04-13 22:38:20,307 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:38:20,307 INFO L485 AbstractCegarLoop]: Abstraction has 66234 states and 290461 transitions. [2025-04-13 22:38:20,307 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 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 22:38:20,307 INFO L278 IsEmpty]: Start isEmpty. Operand 66234 states and 290461 transitions. [2025-04-13 22:38:20,467 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-04-13 22:38:20,467 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:38:20,468 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:38:20,468 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-13 22:38:20,468 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 22:38:20,468 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:38:20,468 INFO L85 PathProgramCache]: Analyzing trace with hash -507646409, now seen corresponding path program 3 times [2025-04-13 22:38:20,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:38:20,468 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80728568] [2025-04-13 22:38:20,468 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:38:20,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:38:20,477 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 53 statements into 1 equivalence classes. [2025-04-13 22:38:20,481 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-04-13 22:38:20,481 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 22:38:20,481 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:38:20,555 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 22:38:20,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:38:20,555 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80728568] [2025-04-13 22:38:20,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80728568] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:38:20,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:38:20,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 22:38:20,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846249163] [2025-04-13 22:38:20,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:38:20,556 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 22:38:20,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:38:20,556 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 22:38:20,556 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-04-13 22:38:20,556 INFO L87 Difference]: Start difference. First operand 66234 states and 290461 transitions. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 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 22:38:21,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:38:21,640 INFO L93 Difference]: Finished difference Result 102685 states and 445190 transitions. [2025-04-13 22:38:21,641 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 22:38:21,641 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 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 53 [2025-04-13 22:38:21,641 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:38:22,167 INFO L225 Difference]: With dead ends: 102685 [2025-04-13 22:38:22,167 INFO L226 Difference]: Without dead ends: 88454 [2025-04-13 22:38:22,242 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2025-04-13 22:38:22,242 INFO L437 NwaCegarLoop]: 24 mSDtfsCounter, 170 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 516 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 550 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 516 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:38:22,243 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 68 Invalid, 550 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 516 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:38:22,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88454 states. [2025-04-13 22:38:24,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88454 to 68802. [2025-04-13 22:38:24,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68802 states, 68801 states have (on average 4.377465443816224) internal successors, (301174), 68801 states have internal predecessors, (301174), 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 22:38:24,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68802 states to 68802 states and 301174 transitions. [2025-04-13 22:38:24,907 INFO L79 Accepts]: Start accepts. Automaton has 68802 states and 301174 transitions. Word has length 53 [2025-04-13 22:38:24,907 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:38:24,907 INFO L485 AbstractCegarLoop]: Abstraction has 68802 states and 301174 transitions. [2025-04-13 22:38:24,907 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 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 22:38:24,907 INFO L278 IsEmpty]: Start isEmpty. Operand 68802 states and 301174 transitions. [2025-04-13 22:38:25,413 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-04-13 22:38:25,413 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:38:25,416 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:38:25,417 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-13 22:38:25,417 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 22:38:25,417 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:38:25,417 INFO L85 PathProgramCache]: Analyzing trace with hash -198967389, now seen corresponding path program 4 times [2025-04-13 22:38:25,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:38:25,421 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26889762] [2025-04-13 22:38:25,422 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:38:25,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:38:25,431 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 53 statements into 2 equivalence classes. [2025-04-13 22:38:25,458 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 53 of 53 statements. [2025-04-13 22:38:25,463 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:38:25,463 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:38:25,734 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 22:38:25,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:38:25,735 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26889762] [2025-04-13 22:38:25,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [26889762] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:38:25,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:38:25,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 22:38:25,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000909118] [2025-04-13 22:38:25,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:38:25,735 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 22:38:25,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:38:25,735 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 22:38:25,735 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-04-13 22:38:25,736 INFO L87 Difference]: Start difference. First operand 68802 states and 301174 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 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 22:38:27,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:38:27,390 INFO L93 Difference]: Finished difference Result 120597 states and 521194 transitions. [2025-04-13 22:38:27,391 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 22:38:27,391 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 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 53 [2025-04-13 22:38:27,391 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:38:28,228 INFO L225 Difference]: With dead ends: 120597 [2025-04-13 22:38:28,229 INFO L226 Difference]: Without dead ends: 98471 [2025-04-13 22:38:28,274 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-04-13 22:38:28,275 INFO L437 NwaCegarLoop]: 19 mSDtfsCounter, 133 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 404 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 424 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 404 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:38:28,275 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 49 Invalid, 424 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 404 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:38:28,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98471 states. [2025-04-13 22:38:30,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98471 to 71374. [2025-04-13 22:38:30,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71374 states, 71373 states have (on average 4.352766452299889) internal successors, (310670), 71373 states have internal predecessors, (310670), 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 22:38:30,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71374 states to 71374 states and 310670 transitions. [2025-04-13 22:38:30,809 INFO L79 Accepts]: Start accepts. Automaton has 71374 states and 310670 transitions. Word has length 53 [2025-04-13 22:38:30,809 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:38:30,809 INFO L485 AbstractCegarLoop]: Abstraction has 71374 states and 310670 transitions. [2025-04-13 22:38:30,809 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 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 22:38:30,809 INFO L278 IsEmpty]: Start isEmpty. Operand 71374 states and 310670 transitions. [2025-04-13 22:38:30,973 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-04-13 22:38:30,974 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:38:30,974 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:38:30,974 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-13 22:38:30,974 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 22:38:30,974 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:38:30,974 INFO L85 PathProgramCache]: Analyzing trace with hash -151980152, now seen corresponding path program 3 times [2025-04-13 22:38:30,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:38:30,975 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413228879] [2025-04-13 22:38:30,975 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:38:30,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:38:30,980 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 53 statements into 1 equivalence classes. [2025-04-13 22:38:30,985 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-04-13 22:38:30,985 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 22:38:30,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:38:31,031 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 22:38:31,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:38:31,031 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413228879] [2025-04-13 22:38:31,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413228879] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:38:31,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:38:31,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 22:38:31,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719678208] [2025-04-13 22:38:31,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:38:31,031 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 22:38:31,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:38:31,032 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 22:38:31,032 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 22:38:31,032 INFO L87 Difference]: Start difference. First operand 71374 states and 310670 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 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 22:38:32,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:38:32,443 INFO L93 Difference]: Finished difference Result 132281 states and 569793 transitions. [2025-04-13 22:38:32,443 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 22:38:32,444 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 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 53 [2025-04-13 22:38:32,444 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:38:33,095 INFO L225 Difference]: With dead ends: 132281 [2025-04-13 22:38:33,095 INFO L226 Difference]: Without dead ends: 96686 [2025-04-13 22:38:33,177 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-04-13 22:38:33,178 INFO L437 NwaCegarLoop]: 14 mSDtfsCounter, 104 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 287 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:38:33,178 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 34 Invalid, 302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 287 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:38:33,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96686 states. [2025-04-13 22:38:35,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96686 to 70302. [2025-04-13 22:38:35,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70302 states, 70301 states have (on average 4.335386409866147) internal successors, (304782), 70301 states have internal predecessors, (304782), 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 22:38:35,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70302 states to 70302 states and 304782 transitions. [2025-04-13 22:38:36,059 INFO L79 Accepts]: Start accepts. Automaton has 70302 states and 304782 transitions. Word has length 53 [2025-04-13 22:38:36,059 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:38:36,060 INFO L485 AbstractCegarLoop]: Abstraction has 70302 states and 304782 transitions. [2025-04-13 22:38:36,060 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 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 22:38:36,060 INFO L278 IsEmpty]: Start isEmpty. Operand 70302 states and 304782 transitions. [2025-04-13 22:38:36,227 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-04-13 22:38:36,227 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:38:36,227 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:38:36,227 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-13 22:38:36,227 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 22:38:36,228 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:38:36,228 INFO L85 PathProgramCache]: Analyzing trace with hash -2117708019, now seen corresponding path program 5 times [2025-04-13 22:38:36,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:38:36,228 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131979914] [2025-04-13 22:38:36,228 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:38:36,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:38:36,233 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 53 statements into 1 equivalence classes. [2025-04-13 22:38:36,238 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-04-13 22:38:36,238 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 22:38:36,238 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:38:36,303 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 22:38:36,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:38:36,304 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131979914] [2025-04-13 22:38:36,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131979914] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:38:36,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:38:36,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 22:38:36,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178202983] [2025-04-13 22:38:36,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:38:36,304 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 22:38:36,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:38:36,305 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 22:38:36,305 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 22:38:36,305 INFO L87 Difference]: Start difference. First operand 70302 states and 304782 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 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 22:38:37,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:38:37,327 INFO L93 Difference]: Finished difference Result 125114 states and 538443 transitions. [2025-04-13 22:38:37,327 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 22:38:37,327 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 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 53 [2025-04-13 22:38:37,327 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:38:38,205 INFO L225 Difference]: With dead ends: 125114 [2025-04-13 22:38:38,205 INFO L226 Difference]: Without dead ends: 93216 [2025-04-13 22:38:38,263 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-04-13 22:38:38,264 INFO L437 NwaCegarLoop]: 14 mSDtfsCounter, 99 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 285 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:38:38,264 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 34 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 285 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:38:38,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93216 states. [2025-04-13 22:38:39,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93216 to 67572. [2025-04-13 22:38:40,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67572 states, 67571 states have (on average 4.327921741575528) internal successors, (292442), 67571 states have internal predecessors, (292442), 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 22:38:40,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67572 states to 67572 states and 292442 transitions. [2025-04-13 22:38:40,874 INFO L79 Accepts]: Start accepts. Automaton has 67572 states and 292442 transitions. Word has length 53 [2025-04-13 22:38:40,874 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:38:40,874 INFO L485 AbstractCegarLoop]: Abstraction has 67572 states and 292442 transitions. [2025-04-13 22:38:40,875 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 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 22:38:40,875 INFO L278 IsEmpty]: Start isEmpty. Operand 67572 states and 292442 transitions. [2025-04-13 22:38:41,033 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-04-13 22:38:41,033 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:38:41,033 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:38:41,033 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-04-13 22:38:41,034 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 22:38:41,034 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:38:41,034 INFO L85 PathProgramCache]: Analyzing trace with hash 1239365294, now seen corresponding path program 4 times [2025-04-13 22:38:41,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:38:41,034 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063783616] [2025-04-13 22:38:41,034 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:38:41,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:38:41,038 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 53 statements into 2 equivalence classes. [2025-04-13 22:38:41,047 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 53 of 53 statements. [2025-04-13 22:38:41,047 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:38:41,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:38:41,214 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 22:38:41,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:38:41,214 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063783616] [2025-04-13 22:38:41,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063783616] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:38:41,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:38:41,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 22:38:41,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388912138] [2025-04-13 22:38:41,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:38:41,214 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 22:38:41,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:38:41,215 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 22:38:41,215 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 22:38:41,215 INFO L87 Difference]: Start difference. First operand 67572 states and 292442 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 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 22:38:42,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:38:42,253 INFO L93 Difference]: Finished difference Result 127866 states and 546214 transitions. [2025-04-13 22:38:42,253 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 22:38:42,253 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 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 53 [2025-04-13 22:38:42,253 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:38:43,066 INFO L225 Difference]: With dead ends: 127866 [2025-04-13 22:38:43,067 INFO L226 Difference]: Without dead ends: 77504 [2025-04-13 22:38:43,151 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-04-13 22:38:43,152 INFO L437 NwaCegarLoop]: 14 mSDtfsCounter, 87 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:38:43,152 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 34 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 303 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]