/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-bakery-3.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 22:29:36,367 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 22:29:36,426 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:29:36,430 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 22:29:36,430 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 22:29:36,451 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 22:29:36,451 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 22:29:36,451 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 22:29:36,452 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 22:29:36,452 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 22:29:36,452 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 22:29:36,452 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 22:29:36,452 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 22:29:36,452 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 22:29:36,452 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 22:29:36,452 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 22:29:36,452 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 22:29:36,454 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 22:29:36,454 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 22:29:36,454 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 22:29:36,455 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 22:29:36,455 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 22:29:36,455 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 22:29:36,455 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 22:29:36,455 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 22:29:36,455 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 22:29:36,455 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 22:29:36,455 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 22:29:36,455 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 22:29:36,455 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 22:29:36,456 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 22:29:36,456 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 22:29:36,456 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 22:29:36,456 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 22:29:36,456 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 22:29:36,456 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 22:29:36,456 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 22:29:36,456 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 22:29:36,456 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 22:29:36,456 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 22:29:36,456 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 22:29:36,456 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 22:29:36,456 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 22:29:36,456 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 22:29:36,457 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 22:29:36,457 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 22:29:36,457 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 22:29:36,457 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:29:36,701 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 22:29:36,710 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 22:29:36,711 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 22:29:36,712 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 22:29:36,714 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 22:29:36,716 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/parallel-bakery-3.wvr.c [2025-04-13 22:29:38,024 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5720fb1dc/43f2eb3ecbda46ba90654a4c10edf73a/FLAGbe8a9302e [2025-04-13 22:29:38,229 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 22:29:38,230 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-bakery-3.wvr.c [2025-04-13 22:29:38,238 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5720fb1dc/43f2eb3ecbda46ba90654a4c10edf73a/FLAGbe8a9302e [2025-04-13 22:29:39,025 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5720fb1dc/43f2eb3ecbda46ba90654a4c10edf73a [2025-04-13 22:29:39,027 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 22:29:39,028 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 22:29:39,029 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 22:29:39,030 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 22:29:39,034 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 22:29:39,036 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 10:29:39" (1/1) ... [2025-04-13 22:29:39,036 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5caf63f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:29:39, skipping insertion in model container [2025-04-13 22:29:39,036 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 10:29:39" (1/1) ... [2025-04-13 22:29:39,054 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 22:29:39,249 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-bakery-3.wvr.c[3633,3646] [2025-04-13 22:29:39,258 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 22:29:39,265 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 22:29:39,298 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-bakery-3.wvr.c[3633,3646] [2025-04-13 22:29:39,299 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 22:29:39,312 INFO L204 MainTranslator]: Completed translation [2025-04-13 22:29:39,313 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:29:39 WrapperNode [2025-04-13 22:29:39,313 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 22:29:39,314 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 22:29:39,314 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 22:29:39,314 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 22:29:39,320 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:29:39" (1/1) ... [2025-04-13 22:29:39,329 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:29:39" (1/1) ... [2025-04-13 22:29:39,352 INFO L138 Inliner]: procedures = 19, calls = 23, calls flagged for inlining = 16, calls inlined = 16, statements flattened = 238 [2025-04-13 22:29:39,352 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 22:29:39,353 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 22:29:39,353 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 22:29:39,353 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 22:29:39,359 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:29:39" (1/1) ... [2025-04-13 22:29:39,359 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:29:39" (1/1) ... [2025-04-13 22:29:39,361 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:29:39" (1/1) ... [2025-04-13 22:29:39,378 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:29:39,379 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:29:39" (1/1) ... [2025-04-13 22:29:39,379 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:29:39" (1/1) ... [2025-04-13 22:29:39,382 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:29:39" (1/1) ... [2025-04-13 22:29:39,383 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:29:39" (1/1) ... [2025-04-13 22:29:39,384 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:29:39" (1/1) ... [2025-04-13 22:29:39,384 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:29:39" (1/1) ... [2025-04-13 22:29:39,390 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 22:29:39,391 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-04-13 22:29:39,391 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-04-13 22:29:39,391 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-04-13 22:29:39,392 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:29:39" (1/1) ... [2025-04-13 22:29:39,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 22:29:39,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:29:39,415 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:29:39,418 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:29:39,433 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 22:29:39,433 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-13 22:29:39,433 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-13 22:29:39,433 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-13 22:29:39,433 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-13 22:29:39,434 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-13 22:29:39,434 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-13 22:29:39,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 22:29:39,434 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 22:29:39,434 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 22:29:39,435 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:29:39,502 INFO L256 CfgBuilder]: Building ICFG [2025-04-13 22:29:39,503 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 22:29:39,781 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 22:29:39,782 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 22:29:39,782 INFO L318 CfgBuilder]: Performing block encoding [2025-04-13 22:29:39,988 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 22:29:39,988 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.04 10:29:39 BoogieIcfgContainer [2025-04-13 22:29:39,989 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-04-13 22:29:39,990 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 22:29:39,990 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 22:29:39,994 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 22:29:39,994 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 10:29:39" (1/3) ... [2025-04-13 22:29:39,994 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1927fe85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 10:29:39, skipping insertion in model container [2025-04-13 22:29:39,994 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:29:39" (2/3) ... [2025-04-13 22:29:39,994 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1927fe85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 10:29:39, skipping insertion in model container [2025-04-13 22:29:39,994 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.04 10:29:39" (3/3) ... [2025-04-13 22:29:39,995 INFO L128 eAbstractionObserver]: Analyzing ICFG parallel-bakery-3.wvr.c [2025-04-13 22:29:40,006 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 22:29:40,007 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG parallel-bakery-3.wvr.c that has 4 procedures, 78 locations, 80 edges, 1 initial locations, 0 loop locations, and 1 error locations. [2025-04-13 22:29:40,007 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 22:29:40,054 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-13 22:29:40,082 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 87 places, 83 transitions, 187 flow [2025-04-13 22:29:40,316 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 7494 states, 7493 states have (on average 3.630988922994795) internal successors, (27207), 7493 states have internal predecessors, (27207), 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:29:40,333 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 22:29:40,342 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;@180d2188, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 22:29:40,342 INFO L341 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-04-13 22:29:40,369 INFO L278 IsEmpty]: Start isEmpty. Operand has 7494 states, 7493 states have (on average 3.630988922994795) internal successors, (27207), 7493 states have internal predecessors, (27207), 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:29:40,426 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-04-13 22:29:40,427 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:29:40,427 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:29:40,428 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 1 more)] === [2025-04-13 22:29:40,432 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:29:40,433 INFO L85 PathProgramCache]: Analyzing trace with hash 1299846409, now seen corresponding path program 1 times [2025-04-13 22:29:40,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:29:40,439 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324859551] [2025-04-13 22:29:40,439 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:29:40,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:29:40,504 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-04-13 22:29:40,572 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-04-13 22:29:40,573 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:29:40,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:29:40,953 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:29:40,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:29:40,953 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324859551] [2025-04-13 22:29:40,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324859551] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:29:40,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:29:40,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 22:29:40,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154962716] [2025-04-13 22:29:40,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:29:40,961 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 22:29:40,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:29:40,975 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 22:29:40,976 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-13 22:29:41,001 INFO L87 Difference]: Start difference. First operand has 7494 states, 7493 states have (on average 3.630988922994795) internal successors, (27207), 7493 states have internal predecessors, (27207), 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 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 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:29:41,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:29:41,437 INFO L93 Difference]: Finished difference Result 17748 states and 63829 transitions. [2025-04-13 22:29:41,437 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 22:29:41,439 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 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 67 [2025-04-13 22:29:41,439 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:29:41,567 INFO L225 Difference]: With dead ends: 17748 [2025-04-13 22:29:41,567 INFO L226 Difference]: Without dead ends: 12686 [2025-04-13 22:29:41,586 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-13 22:29:41,589 INFO L437 NwaCegarLoop]: 6 mSDtfsCounter, 82 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:29:41,590 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 12 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:29:41,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12686 states. [2025-04-13 22:29:41,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12686 to 8860. [2025-04-13 22:29:41,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8860 states, 8859 states have (on average 3.6351732701207813) internal successors, (32204), 8859 states have internal predecessors, (32204), 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:29:42,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8860 states to 8860 states and 32204 transitions. [2025-04-13 22:29:42,034 INFO L79 Accepts]: Start accepts. Automaton has 8860 states and 32204 transitions. Word has length 67 [2025-04-13 22:29:42,035 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:29:42,035 INFO L485 AbstractCegarLoop]: Abstraction has 8860 states and 32204 transitions. [2025-04-13 22:29:42,036 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 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:29:42,037 INFO L278 IsEmpty]: Start isEmpty. Operand 8860 states and 32204 transitions. [2025-04-13 22:29:42,063 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-04-13 22:29:42,063 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:29:42,063 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:29:42,064 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 22:29:42,064 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 1 more)] === [2025-04-13 22:29:42,065 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:29:42,065 INFO L85 PathProgramCache]: Analyzing trace with hash -810768005, now seen corresponding path program 2 times [2025-04-13 22:29:42,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:29:42,065 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156036814] [2025-04-13 22:29:42,065 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:29:42,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:29:42,085 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 67 statements into 1 equivalence classes. [2025-04-13 22:29:42,106 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-04-13 22:29:42,106 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 22:29:42,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:29:42,237 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:29:42,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:29:42,237 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156036814] [2025-04-13 22:29:42,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156036814] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:29:42,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:29:42,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 22:29:42,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319960851] [2025-04-13 22:29:42,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:29:42,238 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 22:29:42,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:29:42,239 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 22:29:42,239 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 22:29:42,239 INFO L87 Difference]: Start difference. First operand 8860 states and 32204 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 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:29:42,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:29:42,543 INFO L93 Difference]: Finished difference Result 12764 states and 45666 transitions. [2025-04-13 22:29:42,544 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 22:29:42,544 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 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 67 [2025-04-13 22:29:42,544 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:29:42,593 INFO L225 Difference]: With dead ends: 12764 [2025-04-13 22:29:42,593 INFO L226 Difference]: Without dead ends: 8860 [2025-04-13 22:29:42,604 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:29:42,604 INFO L437 NwaCegarLoop]: 5 mSDtfsCounter, 33 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:29:42,605 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 7 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:29:42,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8860 states. [2025-04-13 22:29:42,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8860 to 8860. [2025-04-13 22:29:42,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8860 states, 8859 states have (on average 3.5790721300372503) internal successors, (31707), 8859 states have internal predecessors, (31707), 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:29:42,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8860 states to 8860 states and 31707 transitions. [2025-04-13 22:29:42,929 INFO L79 Accepts]: Start accepts. Automaton has 8860 states and 31707 transitions. Word has length 67 [2025-04-13 22:29:42,929 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:29:42,929 INFO L485 AbstractCegarLoop]: Abstraction has 8860 states and 31707 transitions. [2025-04-13 22:29:42,930 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 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:29:42,930 INFO L278 IsEmpty]: Start isEmpty. Operand 8860 states and 31707 transitions. [2025-04-13 22:29:42,952 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-04-13 22:29:42,952 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:29:42,952 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:29:42,952 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 22:29:42,952 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 1 more)] === [2025-04-13 22:29:42,952 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:29:42,953 INFO L85 PathProgramCache]: Analyzing trace with hash 1470275141, now seen corresponding path program 3 times [2025-04-13 22:29:42,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:29:42,953 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193595273] [2025-04-13 22:29:42,953 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:29:42,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:29:42,961 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 67 statements into 1 equivalence classes. [2025-04-13 22:29:42,969 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-04-13 22:29:42,969 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 22:29:42,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:29:43,051 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:29:43,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:29:43,052 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193595273] [2025-04-13 22:29:43,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193595273] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:29:43,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:29:43,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 22:29:43,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447467327] [2025-04-13 22:29:43,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:29:43,053 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 22:29:43,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:29:43,054 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 22:29:43,054 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 22:29:43,054 INFO L87 Difference]: Start difference. First operand 8860 states and 31707 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 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:29:43,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:29:43,276 INFO L93 Difference]: Finished difference Result 12590 states and 44642 transitions. [2025-04-13 22:29:43,276 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 22:29:43,277 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 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 67 [2025-04-13 22:29:43,277 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:29:43,319 INFO L225 Difference]: With dead ends: 12590 [2025-04-13 22:29:43,319 INFO L226 Difference]: Without dead ends: 8860 [2025-04-13 22:29:43,328 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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:29:43,328 INFO L437 NwaCegarLoop]: 5 mSDtfsCounter, 39 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:29:43,328 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 7 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:29:43,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8860 states. [2025-04-13 22:29:43,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8860 to 8860. [2025-04-13 22:29:43,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8860 states, 8859 states have (on average 3.5353877412800543) internal successors, (31320), 8859 states have internal predecessors, (31320), 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:29:43,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8860 states to 8860 states and 31320 transitions. [2025-04-13 22:29:43,713 INFO L79 Accepts]: Start accepts. Automaton has 8860 states and 31320 transitions. Word has length 67 [2025-04-13 22:29:43,713 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:29:43,713 INFO L485 AbstractCegarLoop]: Abstraction has 8860 states and 31320 transitions. [2025-04-13 22:29:43,713 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 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:29:43,713 INFO L278 IsEmpty]: Start isEmpty. Operand 8860 states and 31320 transitions. [2025-04-13 22:29:43,750 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-04-13 22:29:43,754 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:29:43,755 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:29:43,755 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 22:29:43,755 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 1 more)] === [2025-04-13 22:29:43,756 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:29:43,756 INFO L85 PathProgramCache]: Analyzing trace with hash 804405505, now seen corresponding path program 4 times [2025-04-13 22:29:43,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:29:43,756 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090318467] [2025-04-13 22:29:43,756 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:29:43,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:29:43,770 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 67 statements into 2 equivalence classes. [2025-04-13 22:29:43,803 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 67 of 67 statements. [2025-04-13 22:29:43,804 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:29:43,804 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:29:43,998 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:29:43,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:29:43,998 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090318467] [2025-04-13 22:29:43,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090318467] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:29:43,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:29:43,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 22:29:43,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646342915] [2025-04-13 22:29:43,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:29:43,999 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 22:29:43,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:29:43,999 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 22:29:43,999 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-13 22:29:43,999 INFO L87 Difference]: Start difference. First operand 8860 states and 31320 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 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:29:44,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:29:44,377 INFO L93 Difference]: Finished difference Result 21286 states and 74295 transitions. [2025-04-13 22:29:44,377 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 22:29:44,377 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 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 67 [2025-04-13 22:29:44,377 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:29:44,450 INFO L225 Difference]: With dead ends: 21286 [2025-04-13 22:29:44,450 INFO L226 Difference]: Without dead ends: 14969 [2025-04-13 22:29:44,465 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-13 22:29:44,466 INFO L437 NwaCegarLoop]: 7 mSDtfsCounter, 92 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 435 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 440 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 435 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:29:44,466 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 20 Invalid, 440 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 435 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:29:44,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14969 states. [2025-04-13 22:29:44,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14969 to 10965. [2025-04-13 22:29:44,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10965 states, 10964 states have (on average 3.5045603794235682) internal successors, (38424), 10964 states have internal predecessors, (38424), 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:29:44,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10965 states to 10965 states and 38424 transitions. [2025-04-13 22:29:44,831 INFO L79 Accepts]: Start accepts. Automaton has 10965 states and 38424 transitions. Word has length 67 [2025-04-13 22:29:44,832 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:29:44,833 INFO L485 AbstractCegarLoop]: Abstraction has 10965 states and 38424 transitions. [2025-04-13 22:29:44,833 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 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:29:44,833 INFO L278 IsEmpty]: Start isEmpty. Operand 10965 states and 38424 transitions. [2025-04-13 22:29:44,857 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-04-13 22:29:44,858 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:29:44,858 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:29:44,858 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 22:29:44,858 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 1 more)] === [2025-04-13 22:29:44,858 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:29:44,859 INFO L85 PathProgramCache]: Analyzing trace with hash -1302998945, now seen corresponding path program 5 times [2025-04-13 22:29:44,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:29:44,859 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898881978] [2025-04-13 22:29:44,859 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:29:44,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:29:44,870 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 67 statements into 1 equivalence classes. [2025-04-13 22:29:44,882 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-04-13 22:29:44,882 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 22:29:44,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:29:44,964 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:29:44,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:29:44,964 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898881978] [2025-04-13 22:29:44,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898881978] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:29:44,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:29:44,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 22:29:44,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605080448] [2025-04-13 22:29:44,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:29:44,965 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 22:29:44,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:29:44,965 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 22:29:44,965 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 22:29:44,965 INFO L87 Difference]: Start difference. First operand 10965 states and 38424 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 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:29:45,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:29:45,207 INFO L93 Difference]: Finished difference Result 15552 states and 53978 transitions. [2025-04-13 22:29:45,208 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 22:29:45,208 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 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 67 [2025-04-13 22:29:45,208 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:29:45,258 INFO L225 Difference]: With dead ends: 15552 [2025-04-13 22:29:45,258 INFO L226 Difference]: Without dead ends: 10965 [2025-04-13 22:29:45,270 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:29:45,271 INFO L437 NwaCegarLoop]: 5 mSDtfsCounter, 30 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:29:45,271 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 7 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:29:45,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10965 states. [2025-04-13 22:29:45,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10965 to 10965. [2025-04-13 22:29:45,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10965 states, 10964 states have (on average 3.478475009120759) internal successors, (38138), 10964 states have internal predecessors, (38138), 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:29:45,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10965 states to 10965 states and 38138 transitions. [2025-04-13 22:29:45,507 INFO L79 Accepts]: Start accepts. Automaton has 10965 states and 38138 transitions. Word has length 67 [2025-04-13 22:29:45,507 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:29:45,508 INFO L485 AbstractCegarLoop]: Abstraction has 10965 states and 38138 transitions. [2025-04-13 22:29:45,508 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 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:29:45,508 INFO L278 IsEmpty]: Start isEmpty. Operand 10965 states and 38138 transitions. [2025-04-13 22:29:45,527 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-04-13 22:29:45,528 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:29:45,528 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:29:45,528 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-13 22:29:45,529 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 1 more)] === [2025-04-13 22:29:45,529 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:29:45,529 INFO L85 PathProgramCache]: Analyzing trace with hash 410137917, now seen corresponding path program 6 times [2025-04-13 22:29:45,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:29:45,529 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484401099] [2025-04-13 22:29:45,529 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:29:45,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:29:45,541 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 67 statements into 1 equivalence classes. [2025-04-13 22:29:45,551 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-04-13 22:29:45,551 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 22:29:45,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:29:45,790 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:29:45,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:29:45,790 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484401099] [2025-04-13 22:29:45,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484401099] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:29:45,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:29:45,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-13 22:29:45,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920992679] [2025-04-13 22:29:45,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:29:45,791 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 22:29:45,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:29:45,791 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 22:29:45,791 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-04-13 22:29:45,791 INFO L87 Difference]: Start difference. First operand 10965 states and 38138 transitions. Second operand has 9 states, 8 states have (on average 8.375) internal successors, (67), 9 states have internal predecessors, (67), 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:29:46,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:29:46,402 INFO L93 Difference]: Finished difference Result 13315 states and 44960 transitions. [2025-04-13 22:29:46,402 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 22:29:46,402 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 8.375) internal successors, (67), 9 states have internal predecessors, (67), 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 67 [2025-04-13 22:29:46,403 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:29:46,447 INFO L225 Difference]: With dead ends: 13315 [2025-04-13 22:29:46,447 INFO L226 Difference]: Without dead ends: 12941 [2025-04-13 22:29:46,452 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2025-04-13 22:29:46,452 INFO L437 NwaCegarLoop]: 9 mSDtfsCounter, 307 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 1309 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 307 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 1311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 22:29:46,452 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [307 Valid, 57 Invalid, 1311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1309 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 22:29:46,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12941 states. [2025-04-13 22:29:46,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12941 to 11056. [2025-04-13 22:29:46,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11056 states, 11055 states have (on average 3.4686567164179105) internal successors, (38346), 11055 states have internal predecessors, (38346), 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:29:46,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11056 states to 11056 states and 38346 transitions. [2025-04-13 22:29:46,808 INFO L79 Accepts]: Start accepts. Automaton has 11056 states and 38346 transitions. Word has length 67 [2025-04-13 22:29:46,808 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:29:46,809 INFO L485 AbstractCegarLoop]: Abstraction has 11056 states and 38346 transitions. [2025-04-13 22:29:46,809 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 8.375) internal successors, (67), 9 states have internal predecessors, (67), 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:29:46,809 INFO L278 IsEmpty]: Start isEmpty. Operand 11056 states and 38346 transitions. [2025-04-13 22:29:46,844 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-04-13 22:29:46,844 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:29:46,844 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:29:46,844 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-13 22:29:46,844 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 1 more)] === [2025-04-13 22:29:46,847 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:29:46,847 INFO L85 PathProgramCache]: Analyzing trace with hash 1316448037, now seen corresponding path program 7 times [2025-04-13 22:29:46,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:29:46,847 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860177551] [2025-04-13 22:29:46,847 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:29:46,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:29:46,860 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-04-13 22:29:46,874 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-04-13 22:29:46,874 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:29:46,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:29:46,990 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:29:46,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:29:46,990 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860177551] [2025-04-13 22:29:46,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860177551] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:29:46,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:29:46,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 22:29:46,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287083637] [2025-04-13 22:29:46,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:29:46,991 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 22:29:46,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:29:46,991 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 22:29:46,991 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 22:29:46,991 INFO L87 Difference]: Start difference. First operand 11056 states and 38346 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 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:29:47,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:29:47,305 INFO L93 Difference]: Finished difference Result 17936 states and 61088 transitions. [2025-04-13 22:29:47,305 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 22:29:47,305 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 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 67 [2025-04-13 22:29:47,305 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:29:47,350 INFO L225 Difference]: With dead ends: 17936 [2025-04-13 22:29:47,350 INFO L226 Difference]: Without dead ends: 11235 [2025-04-13 22:29:47,361 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 22:29:47,362 INFO L437 NwaCegarLoop]: 7 mSDtfsCounter, 76 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 364 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:29:47,362 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 18 Invalid, 367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 364 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:29:47,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11235 states. [2025-04-13 22:29:47,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11235 to 10495. [2025-04-13 22:29:47,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10495 states, 10494 states have (on average 3.3959405374499716) internal successors, (35637), 10494 states have internal predecessors, (35637), 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:29:47,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10495 states to 10495 states and 35637 transitions. [2025-04-13 22:29:47,559 INFO L79 Accepts]: Start accepts. Automaton has 10495 states and 35637 transitions. Word has length 67 [2025-04-13 22:29:47,560 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:29:47,560 INFO L485 AbstractCegarLoop]: Abstraction has 10495 states and 35637 transitions. [2025-04-13 22:29:47,560 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 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:29:47,561 INFO L278 IsEmpty]: Start isEmpty. Operand 10495 states and 35637 transitions. [2025-04-13 22:29:47,578 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-04-13 22:29:47,578 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:29:47,578 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:29:47,578 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-13 22:29:47,578 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 1 more)] === [2025-04-13 22:29:47,578 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:29:47,579 INFO L85 PathProgramCache]: Analyzing trace with hash 2093294881, now seen corresponding path program 8 times [2025-04-13 22:29:47,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:29:47,579 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885442979] [2025-04-13 22:29:47,579 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:29:47,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:29:47,584 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 67 statements into 1 equivalence classes. [2025-04-13 22:29:47,590 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-04-13 22:29:47,590 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 22:29:47,590 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:29:47,649 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:29:47,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:29:47,649 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885442979] [2025-04-13 22:29:47,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885442979] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:29:47,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:29:47,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 22:29:47,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418301868] [2025-04-13 22:29:47,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:29:47,650 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 22:29:47,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:29:47,650 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 22:29:47,650 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-13 22:29:47,650 INFO L87 Difference]: Start difference. First operand 10495 states and 35637 transitions. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 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:29:47,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:29:47,979 INFO L93 Difference]: Finished difference Result 19645 states and 64889 transitions. [2025-04-13 22:29:47,979 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 22:29:47,979 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 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 67 [2025-04-13 22:29:47,979 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:29:48,033 INFO L225 Difference]: With dead ends: 19645 [2025-04-13 22:29:48,034 INFO L226 Difference]: Without dead ends: 13975 [2025-04-13 22:29:48,048 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-13 22:29:48,049 INFO L437 NwaCegarLoop]: 6 mSDtfsCounter, 65 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:29:48,051 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 14 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:29:48,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13975 states. [2025-04-13 22:29:48,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13975 to 10636. [2025-04-13 22:29:48,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10636 states, 10635 states have (on average 3.3433004231311707) internal successors, (35556), 10635 states have internal predecessors, (35556), 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:29:48,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10636 states to 10636 states and 35556 transitions. [2025-04-13 22:29:48,325 INFO L79 Accepts]: Start accepts. Automaton has 10636 states and 35556 transitions. Word has length 67 [2025-04-13 22:29:48,325 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:29:48,325 INFO L485 AbstractCegarLoop]: Abstraction has 10636 states and 35556 transitions. [2025-04-13 22:29:48,325 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 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:29:48,325 INFO L278 IsEmpty]: Start isEmpty. Operand 10636 states and 35556 transitions. [2025-04-13 22:29:48,342 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-04-13 22:29:48,342 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:29:48,342 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:29:48,342 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-13 22:29:48,343 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 1 more)] === [2025-04-13 22:29:48,343 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:29:48,343 INFO L85 PathProgramCache]: Analyzing trace with hash -1655011833, now seen corresponding path program 9 times [2025-04-13 22:29:48,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:29:48,343 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046832081] [2025-04-13 22:29:48,343 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:29:48,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:29:48,350 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 67 statements into 1 equivalence classes. [2025-04-13 22:29:48,356 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-04-13 22:29:48,356 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 22:29:48,356 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:29:48,483 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:29:48,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:29:48,483 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046832081] [2025-04-13 22:29:48,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046832081] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:29:48,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:29:48,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 22:29:48,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873982648] [2025-04-13 22:29:48,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:29:48,484 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 22:29:48,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:29:48,484 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 22:29:48,484 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 22:29:48,484 INFO L87 Difference]: Start difference. First operand 10636 states and 35556 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 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:29:48,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:29:48,777 INFO L93 Difference]: Finished difference Result 17411 states and 57770 transitions. [2025-04-13 22:29:48,777 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 22:29:48,777 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 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 67 [2025-04-13 22:29:48,777 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:29:48,832 INFO L225 Difference]: With dead ends: 17411 [2025-04-13 22:29:48,832 INFO L226 Difference]: Without dead ends: 12270 [2025-04-13 22:29:48,843 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 22:29:48,844 INFO L437 NwaCegarLoop]: 7 mSDtfsCounter, 61 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 407 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 407 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:29:48,844 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 21 Invalid, 410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 407 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:29:48,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12270 states. [2025-04-13 22:29:49,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12270 to 11942. [2025-04-13 22:29:49,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11942 states, 11941 states have (on average 3.32417720458923) internal successors, (39694), 11941 states have internal predecessors, (39694), 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:29:49,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11942 states to 11942 states and 39694 transitions. [2025-04-13 22:29:49,144 INFO L79 Accepts]: Start accepts. Automaton has 11942 states and 39694 transitions. Word has length 67 [2025-04-13 22:29:49,145 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:29:49,145 INFO L485 AbstractCegarLoop]: Abstraction has 11942 states and 39694 transitions. [2025-04-13 22:29:49,145 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 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:29:49,145 INFO L278 IsEmpty]: Start isEmpty. Operand 11942 states and 39694 transitions. [2025-04-13 22:29:49,162 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-04-13 22:29:49,162 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:29:49,162 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:29:49,162 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-13 22:29:49,162 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 1 more)] === [2025-04-13 22:29:49,165 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:29:49,165 INFO L85 PathProgramCache]: Analyzing trace with hash -1274945119, now seen corresponding path program 10 times [2025-04-13 22:29:49,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:29:49,165 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658679388] [2025-04-13 22:29:49,165 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:29:49,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:29:49,172 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 67 statements into 2 equivalence classes. [2025-04-13 22:29:49,183 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 67 of 67 statements. [2025-04-13 22:29:49,183 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:29:49,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:29:49,273 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:29:49,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:29:49,273 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658679388] [2025-04-13 22:29:49,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658679388] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:29:49,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:29:49,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 22:29:49,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131298208] [2025-04-13 22:29:49,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:29:49,274 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 22:29:49,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:29:49,274 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 22:29:49,274 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-13 22:29:49,274 INFO L87 Difference]: Start difference. First operand 11942 states and 39694 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 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:29:49,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:29:49,530 INFO L93 Difference]: Finished difference Result 15444 states and 50173 transitions. [2025-04-13 22:29:49,530 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 22:29:49,530 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 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 67 [2025-04-13 22:29:49,531 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:29:49,577 INFO L225 Difference]: With dead ends: 15444 [2025-04-13 22:29:49,577 INFO L226 Difference]: Without dead ends: 13950 [2025-04-13 22:29:49,583 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-13 22:29:49,583 INFO L437 NwaCegarLoop]: 7 mSDtfsCounter, 79 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 395 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 395 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:29:49,583 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 20 Invalid, 399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 395 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:29:49,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13950 states. [2025-04-13 22:29:49,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13950 to 12337. [2025-04-13 22:29:49,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12337 states, 12336 states have (on average 3.3118514915693904) internal successors, (40855), 12336 states have internal predecessors, (40855), 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:29:49,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12337 states to 12337 states and 40855 transitions. [2025-04-13 22:29:49,824 INFO L79 Accepts]: Start accepts. Automaton has 12337 states and 40855 transitions. Word has length 67 [2025-04-13 22:29:49,824 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:29:49,824 INFO L485 AbstractCegarLoop]: Abstraction has 12337 states and 40855 transitions. [2025-04-13 22:29:49,824 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 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:29:49,824 INFO L278 IsEmpty]: Start isEmpty. Operand 12337 states and 40855 transitions. [2025-04-13 22:29:49,845 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-04-13 22:29:49,845 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:29:49,846 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:29:49,846 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-13 22:29:49,846 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 1 more)] === [2025-04-13 22:29:49,846 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:29:49,846 INFO L85 PathProgramCache]: Analyzing trace with hash 2142179101, now seen corresponding path program 11 times [2025-04-13 22:29:49,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:29:49,846 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417243378] [2025-04-13 22:29:49,846 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:29:49,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:29:49,853 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 67 statements into 1 equivalence classes. [2025-04-13 22:29:49,858 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-04-13 22:29:49,858 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 22:29:49,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:29:49,976 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:29:49,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:29:49,977 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417243378] [2025-04-13 22:29:49,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417243378] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:29:49,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:29:49,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 22:29:49,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163865317] [2025-04-13 22:29:49,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:29:49,977 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 22:29:49,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:29:49,977 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 22:29:49,977 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 22:29:49,977 INFO L87 Difference]: Start difference. First operand 12337 states and 40855 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 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:29:50,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:29:50,268 INFO L93 Difference]: Finished difference Result 17981 states and 58956 transitions. [2025-04-13 22:29:50,268 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 22:29:50,268 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 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 67 [2025-04-13 22:29:50,269 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:29:50,326 INFO L225 Difference]: With dead ends: 17981 [2025-04-13 22:29:50,326 INFO L226 Difference]: Without dead ends: 11579 [2025-04-13 22:29:50,351 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 22:29:50,351 INFO L437 NwaCegarLoop]: 7 mSDtfsCounter, 51 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 401 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 404 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:29:50,351 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 20 Invalid, 404 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 401 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:29:50,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11579 states. [2025-04-13 22:29:50,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11579 to 11385. [2025-04-13 22:29:50,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11385 states, 11384 states have (on average 3.2122276879831344) internal successors, (36568), 11384 states have internal predecessors, (36568), 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:29:50,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11385 states to 11385 states and 36568 transitions. [2025-04-13 22:29:50,608 INFO L79 Accepts]: Start accepts. Automaton has 11385 states and 36568 transitions. Word has length 67 [2025-04-13 22:29:50,608 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:29:50,608 INFO L485 AbstractCegarLoop]: Abstraction has 11385 states and 36568 transitions. [2025-04-13 22:29:50,608 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 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:29:50,608 INFO L278 IsEmpty]: Start isEmpty. Operand 11385 states and 36568 transitions. [2025-04-13 22:29:50,624 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-04-13 22:29:50,624 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:29:50,624 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:29:50,624 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-13 22:29:50,624 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 1 more)] === [2025-04-13 22:29:50,625 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:29:50,625 INFO L85 PathProgramCache]: Analyzing trace with hash -382975101, now seen corresponding path program 12 times [2025-04-13 22:29:50,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:29:50,625 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617428813] [2025-04-13 22:29:50,625 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:29:50,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:29:50,630 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 67 statements into 1 equivalence classes. [2025-04-13 22:29:50,634 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-04-13 22:29:50,634 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 22:29:50,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:29:50,755 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:29:50,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:29:50,755 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617428813] [2025-04-13 22:29:50,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617428813] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:29:50,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:29:50,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-13 22:29:50,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143029106] [2025-04-13 22:29:50,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:29:50,756 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 22:29:50,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:29:50,756 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 22:29:50,756 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-04-13 22:29:50,756 INFO L87 Difference]: Start difference. First operand 11385 states and 36568 transitions. Second operand has 9 states, 8 states have (on average 8.375) internal successors, (67), 9 states have internal predecessors, (67), 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:29:51,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:29:51,341 INFO L93 Difference]: Finished difference Result 14270 states and 45015 transitions. [2025-04-13 22:29:51,342 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 22:29:51,342 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 8.375) internal successors, (67), 9 states have internal predecessors, (67), 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 67 [2025-04-13 22:29:51,342 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:29:51,393 INFO L225 Difference]: With dead ends: 14270 [2025-04-13 22:29:51,393 INFO L226 Difference]: Without dead ends: 13827 [2025-04-13 22:29:51,398 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2025-04-13 22:29:51,398 INFO L437 NwaCegarLoop]: 9 mSDtfsCounter, 291 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 1316 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 291 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 1318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 22:29:51,398 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [291 Valid, 56 Invalid, 1318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1316 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 22:29:51,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13827 states. [2025-04-13 22:29:51,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13827 to 11519. [2025-04-13 22:29:51,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11519 states, 11518 states have (on average 3.201423858308734) internal successors, (36874), 11518 states have internal predecessors, (36874), 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:29:51,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11519 states to 11519 states and 36874 transitions. [2025-04-13 22:29:51,631 INFO L79 Accepts]: Start accepts. Automaton has 11519 states and 36874 transitions. Word has length 67 [2025-04-13 22:29:51,632 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:29:51,632 INFO L485 AbstractCegarLoop]: Abstraction has 11519 states and 36874 transitions. [2025-04-13 22:29:51,632 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 8.375) internal successors, (67), 9 states have internal predecessors, (67), 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:29:51,632 INFO L278 IsEmpty]: Start isEmpty. Operand 11519 states and 36874 transitions. [2025-04-13 22:29:51,646 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-04-13 22:29:51,646 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:29:51,646 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:29:51,646 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-13 22:29:51,647 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 1 more)] === [2025-04-13 22:29:51,647 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:29:51,647 INFO L85 PathProgramCache]: Analyzing trace with hash -1387170271, now seen corresponding path program 13 times [2025-04-13 22:29:51,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:29:51,647 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827718021] [2025-04-13 22:29:51,647 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:29:51,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:29:51,652 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-04-13 22:29:51,655 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-04-13 22:29:51,656 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:29:51,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:29:51,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:29:51,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:29:51,735 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827718021] [2025-04-13 22:29:51,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827718021] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:29:51,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:29:51,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-13 22:29:51,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295260146] [2025-04-13 22:29:51,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:29:51,735 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 22:29:51,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:29:51,735 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 22:29:51,735 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-04-13 22:29:51,736 INFO L87 Difference]: Start difference. First operand 11519 states and 36874 transitions. Second operand has 9 states, 8 states have (on average 8.375) internal successors, (67), 9 states have internal predecessors, (67), 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:29:52,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:29:52,298 INFO L93 Difference]: Finished difference Result 13625 states and 42938 transitions. [2025-04-13 22:29:52,298 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 22:29:52,298 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 8.375) internal successors, (67), 9 states have internal predecessors, (67), 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 67 [2025-04-13 22:29:52,298 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:29:52,354 INFO L225 Difference]: With dead ends: 13625 [2025-04-13 22:29:52,354 INFO L226 Difference]: Without dead ends: 13038 [2025-04-13 22:29:52,360 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2025-04-13 22:29:52,361 INFO L437 NwaCegarLoop]: 9 mSDtfsCounter, 300 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 1301 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 300 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 1303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:29:52,361 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [300 Valid, 57 Invalid, 1303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1301 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:29:52,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13038 states. [2025-04-13 22:29:52,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13038 to 11511. [2025-04-13 22:29:52,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11511 states, 11510 states have (on average 3.195829713292789) internal successors, (36784), 11510 states have internal predecessors, (36784), 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:29:52,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11511 states to 11511 states and 36784 transitions. [2025-04-13 22:29:52,544 INFO L79 Accepts]: Start accepts. Automaton has 11511 states and 36784 transitions. Word has length 67 [2025-04-13 22:29:52,545 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:29:52,545 INFO L485 AbstractCegarLoop]: Abstraction has 11511 states and 36784 transitions. [2025-04-13 22:29:52,545 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 8.375) internal successors, (67), 9 states have internal predecessors, (67), 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:29:52,545 INFO L278 IsEmpty]: Start isEmpty. Operand 11511 states and 36784 transitions. [2025-04-13 22:29:52,560 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-04-13 22:29:52,560 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:29:52,560 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:29:52,560 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-04-13 22:29:52,560 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 1 more)] === [2025-04-13 22:29:52,560 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:29:52,560 INFO L85 PathProgramCache]: Analyzing trace with hash 1547704819, now seen corresponding path program 14 times [2025-04-13 22:29:52,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:29:52,561 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340537655] [2025-04-13 22:29:52,561 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:29:52,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:29:52,565 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 67 statements into 1 equivalence classes. [2025-04-13 22:29:52,569 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-04-13 22:29:52,569 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 22:29:52,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:29:52,639 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:29:52,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:29:52,639 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340537655] [2025-04-13 22:29:52,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340537655] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:29:52,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:29:52,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 22:29:52,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354686890] [2025-04-13 22:29:52,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:29:52,639 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 22:29:52,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:29:52,640 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 22:29:52,640 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 22:29:52,640 INFO L87 Difference]: Start difference. First operand 11511 states and 36784 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 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:29:52,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:29:52,880 INFO L93 Difference]: Finished difference Result 13321 states and 42098 transitions. [2025-04-13 22:29:52,880 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 22:29:52,880 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 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 67 [2025-04-13 22:29:52,881 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:29:52,941 INFO L225 Difference]: With dead ends: 13321 [2025-04-13 22:29:52,941 INFO L226 Difference]: Without dead ends: 12041 [2025-04-13 22:29:52,949 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 22:29:52,950 INFO L437 NwaCegarLoop]: 7 mSDtfsCounter, 70 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:29:52,950 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 21 Invalid, 395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 394 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:29:52,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12041 states. [2025-04-13 22:29:53,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12041 to 11403. [2025-04-13 22:29:53,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11403 states, 11402 states have (on average 3.195842834590423) internal successors, (36439), 11402 states have internal predecessors, (36439), 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:29:53,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11403 states to 11403 states and 36439 transitions. [2025-04-13 22:29:53,128 INFO L79 Accepts]: Start accepts. Automaton has 11403 states and 36439 transitions. Word has length 67 [2025-04-13 22:29:53,128 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:29:53,129 INFO L485 AbstractCegarLoop]: Abstraction has 11403 states and 36439 transitions. [2025-04-13 22:29:53,129 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 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:29:53,129 INFO L278 IsEmpty]: Start isEmpty. Operand 11403 states and 36439 transitions. [2025-04-13 22:29:53,143 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-04-13 22:29:53,143 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:29:53,143 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:29:53,143 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-04-13 22:29:53,143 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:29:53,143 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:29:53,143 INFO L85 PathProgramCache]: Analyzing trace with hash 563300829, now seen corresponding path program 15 times [2025-04-13 22:29:53,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:29:53,143 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197696242] [2025-04-13 22:29:53,143 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:29:53,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:29:53,148 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 67 statements into 1 equivalence classes. [2025-04-13 22:29:53,151 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-04-13 22:29:53,151 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 22:29:53,152 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:29:53,241 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:29:53,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:29:53,242 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197696242] [2025-04-13 22:29:53,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197696242] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:29:53,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:29:53,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-13 22:29:53,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628589463] [2025-04-13 22:29:53,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:29:53,242 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 22:29:53,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:29:53,242 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 22:29:53,242 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-04-13 22:29:53,243 INFO L87 Difference]: Start difference. First operand 11403 states and 36439 transitions. Second operand has 9 states, 8 states have (on average 8.375) internal successors, (67), 9 states have internal predecessors, (67), 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:29:53,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:29:53,830 INFO L93 Difference]: Finished difference Result 13256 states and 41808 transitions. [2025-04-13 22:29:53,830 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 22:29:53,830 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 8.375) internal successors, (67), 9 states have internal predecessors, (67), 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 67 [2025-04-13 22:29:53,830 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:29:53,877 INFO L225 Difference]: With dead ends: 13256 [2025-04-13 22:29:53,878 INFO L226 Difference]: Without dead ends: 12936 [2025-04-13 22:29:53,881 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2025-04-13 22:29:53,882 INFO L437 NwaCegarLoop]: 9 mSDtfsCounter, 287 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 1302 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 1304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:29:53,882 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [287 Valid, 57 Invalid, 1304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1302 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:29:53,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12936 states. [2025-04-13 22:29:53,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12936 to 11493. [2025-04-13 22:29:54,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11493 states, 11492 states have (on average 3.18917507831535) internal successors, (36650), 11492 states have internal predecessors, (36650), 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:29:54,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11493 states to 11493 states and 36650 transitions. [2025-04-13 22:29:54,055 INFO L79 Accepts]: Start accepts. Automaton has 11493 states and 36650 transitions. Word has length 67 [2025-04-13 22:29:54,055 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:29:54,055 INFO L485 AbstractCegarLoop]: Abstraction has 11493 states and 36650 transitions. [2025-04-13 22:29:54,055 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 8.375) internal successors, (67), 9 states have internal predecessors, (67), 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:29:54,055 INFO L278 IsEmpty]: Start isEmpty. Operand 11493 states and 36650 transitions. [2025-04-13 22:29:54,069 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-04-13 22:29:54,069 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:29:54,069 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:29:54,069 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-04-13 22:29:54,069 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:29:54,070 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:29:54,070 INFO L85 PathProgramCache]: Analyzing trace with hash 1874687559, now seen corresponding path program 16 times [2025-04-13 22:29:54,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:29:54,070 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067486887] [2025-04-13 22:29:54,070 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:29:54,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:29:54,074 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 67 statements into 2 equivalence classes. [2025-04-13 22:29:54,078 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 67 of 67 statements. [2025-04-13 22:29:54,078 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:29:54,078 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:29:54,163 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:29:54,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:29:54,163 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067486887] [2025-04-13 22:29:54,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067486887] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:29:54,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:29:54,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-13 22:29:54,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175476544] [2025-04-13 22:29:54,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:29:54,164 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 22:29:54,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:29:54,164 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 22:29:54,164 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-04-13 22:29:54,164 INFO L87 Difference]: Start difference. First operand 11493 states and 36650 transitions. Second operand has 9 states, 8 states have (on average 8.375) internal successors, (67), 9 states have internal predecessors, (67), 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:29:54,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:29:54,680 INFO L93 Difference]: Finished difference Result 13042 states and 41107 transitions. [2025-04-13 22:29:54,680 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 22:29:54,681 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 8.375) internal successors, (67), 9 states have internal predecessors, (67), 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 67 [2025-04-13 22:29:54,681 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:29:54,732 INFO L225 Difference]: With dead ends: 13042 [2025-04-13 22:29:54,733 INFO L226 Difference]: Without dead ends: 12502 [2025-04-13 22:29:54,738 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2025-04-13 22:29:54,741 INFO L437 NwaCegarLoop]: 9 mSDtfsCounter, 284 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 1282 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 284 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 1284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:29:54,741 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [284 Valid, 58 Invalid, 1284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1282 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:29:54,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12502 states. [2025-04-13 22:29:54,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12502 to 11489. [2025-04-13 22:29:54,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11489 states, 11488 states have (on average 3.1822771587743732) internal successors, (36558), 11488 states have internal predecessors, (36558), 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:29:54,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11489 states to 11489 states and 36558 transitions. [2025-04-13 22:29:54,926 INFO L79 Accepts]: Start accepts. Automaton has 11489 states and 36558 transitions. Word has length 67 [2025-04-13 22:29:54,927 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:29:54,927 INFO L485 AbstractCegarLoop]: Abstraction has 11489 states and 36558 transitions. [2025-04-13 22:29:54,927 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 8.375) internal successors, (67), 9 states have internal predecessors, (67), 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:29:54,927 INFO L278 IsEmpty]: Start isEmpty. Operand 11489 states and 36558 transitions. [2025-04-13 22:29:54,943 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-04-13 22:29:54,943 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:29:54,943 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:29:54,943 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-04-13 22:29:54,943 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:29:54,944 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:29:54,944 INFO L85 PathProgramCache]: Analyzing trace with hash 235591939, now seen corresponding path program 17 times [2025-04-13 22:29:54,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:29:54,944 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578573462] [2025-04-13 22:29:54,944 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:29:54,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:29:54,948 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 67 statements into 1 equivalence classes. [2025-04-13 22:29:54,952 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-04-13 22:29:54,952 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 22:29:54,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:29:55,032 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:29:55,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:29:55,032 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578573462] [2025-04-13 22:29:55,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578573462] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:29:55,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:29:55,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-13 22:29:55,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416438109] [2025-04-13 22:29:55,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:29:55,033 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 22:29:55,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:29:55,033 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 22:29:55,033 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-04-13 22:29:55,033 INFO L87 Difference]: Start difference. First operand 11489 states and 36558 transitions. Second operand has 9 states, 8 states have (on average 8.375) internal successors, (67), 9 states have internal predecessors, (67), 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:29:55,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:29:55,574 INFO L93 Difference]: Finished difference Result 12911 states and 40636 transitions. [2025-04-13 22:29:55,574 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 22:29:55,575 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 8.375) internal successors, (67), 9 states have internal predecessors, (67), 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 67 [2025-04-13 22:29:55,575 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:29:55,633 INFO L225 Difference]: With dead ends: 12911 [2025-04-13 22:29:55,633 INFO L226 Difference]: Without dead ends: 12591 [2025-04-13 22:29:55,639 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2025-04-13 22:29:55,640 INFO L437 NwaCegarLoop]: 9 mSDtfsCounter, 285 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 1279 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 285 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 1281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:29:55,640 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [285 Valid, 58 Invalid, 1281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1279 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:29:55,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12591 states. [2025-04-13 22:29:55,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12591 to 11575. [2025-04-13 22:29:55,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11575 states, 11574 states have (on average 3.175825125280802) internal successors, (36757), 11574 states have internal predecessors, (36757), 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:29:55,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11575 states to 11575 states and 36757 transitions. [2025-04-13 22:29:55,835 INFO L79 Accepts]: Start accepts. Automaton has 11575 states and 36757 transitions. Word has length 67 [2025-04-13 22:29:55,836 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:29:55,836 INFO L485 AbstractCegarLoop]: Abstraction has 11575 states and 36757 transitions. [2025-04-13 22:29:55,836 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 8.375) internal successors, (67), 9 states have internal predecessors, (67), 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:29:55,836 INFO L278 IsEmpty]: Start isEmpty. Operand 11575 states and 36757 transitions. [2025-04-13 22:29:55,851 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-04-13 22:29:55,851 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:29:55,852 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:29:55,852 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-04-13 22:29:55,852 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:29:55,852 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:29:55,852 INFO L85 PathProgramCache]: Analyzing trace with hash 2113846653, now seen corresponding path program 1 times [2025-04-13 22:29:55,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:29:55,852 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543495942] [2025-04-13 22:29:55,852 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:29:55,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:29:55,856 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-04-13 22:29:55,859 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-04-13 22:29:55,859 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:29:55,859 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:29:55,894 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:29:55,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:29:55,894 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543495942] [2025-04-13 22:29:55,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543495942] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:29:55,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:29:55,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 22:29:55,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010153503] [2025-04-13 22:29:55,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:29:55,895 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 22:29:55,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:29:55,895 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 22:29:55,895 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-13 22:29:55,895 INFO L87 Difference]: Start difference. First operand 11575 states and 36757 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 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:29:56,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:29:56,064 INFO L93 Difference]: Finished difference Result 14816 states and 46244 transitions. [2025-04-13 22:29:56,064 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 22:29:56,064 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 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 68 [2025-04-13 22:29:56,065 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:29:56,162 INFO L225 Difference]: With dead ends: 14816 [2025-04-13 22:29:56,162 INFO L226 Difference]: Without dead ends: 14007 [2025-04-13 22:29:56,165 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-13 22:29:56,165 INFO L437 NwaCegarLoop]: 3 mSDtfsCounter, 80 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:29:56,165 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 9 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:29:56,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14007 states. [2025-04-13 22:29:56,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14007 to 11575. [2025-04-13 22:29:56,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11575 states, 11574 states have (on average 3.162692241230344) internal successors, (36605), 11574 states have internal predecessors, (36605), 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:29:56,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11575 states to 11575 states and 36605 transitions. [2025-04-13 22:29:56,329 INFO L79 Accepts]: Start accepts. Automaton has 11575 states and 36605 transitions. Word has length 68 [2025-04-13 22:29:56,329 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:29:56,329 INFO L485 AbstractCegarLoop]: Abstraction has 11575 states and 36605 transitions. [2025-04-13 22:29:56,329 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 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:29:56,330 INFO L278 IsEmpty]: Start isEmpty. Operand 11575 states and 36605 transitions. [2025-04-13 22:29:56,344 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-04-13 22:29:56,344 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:29:56,344 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:29:56,344 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-04-13 22:29:56,345 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:29:56,345 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:29:56,345 INFO L85 PathProgramCache]: Analyzing trace with hash 751553001, now seen corresponding path program 2 times [2025-04-13 22:29:56,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:29:56,345 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307976432] [2025-04-13 22:29:56,345 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:29:56,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:29:56,349 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 68 statements into 1 equivalence classes. [2025-04-13 22:29:56,352 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-04-13 22:29:56,352 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 22:29:56,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:29:56,441 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:29:56,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:29:56,441 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307976432] [2025-04-13 22:29:56,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307976432] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:29:56,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:29:56,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-13 22:29:56,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012896130] [2025-04-13 22:29:56,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:29:56,442 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 22:29:56,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:29:56,442 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 22:29:56,442 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-04-13 22:29:56,442 INFO L87 Difference]: Start difference. First operand 11575 states and 36605 transitions. Second operand has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 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:29:56,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:29:56,933 INFO L93 Difference]: Finished difference Result 15118 states and 46462 transitions. [2025-04-13 22:29:56,933 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 22:29:56,933 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 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 68 [2025-04-13 22:29:56,933 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:29:56,978 INFO L225 Difference]: With dead ends: 15118 [2025-04-13 22:29:56,978 INFO L226 Difference]: Without dead ends: 13366 [2025-04-13 22:29:56,984 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2025-04-13 22:29:56,984 INFO L437 NwaCegarLoop]: 16 mSDtfsCounter, 181 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 973 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 983 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 973 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:29:56,984 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 74 Invalid, 983 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 973 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:29:56,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13366 states. [2025-04-13 22:29:57,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13366 to 11689. [2025-04-13 22:29:57,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11689 states, 11688 states have (on average 3.144592744695414) internal successors, (36754), 11688 states have internal predecessors, (36754), 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:29:57,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11689 states to 11689 states and 36754 transitions. [2025-04-13 22:29:57,163 INFO L79 Accepts]: Start accepts. Automaton has 11689 states and 36754 transitions. Word has length 68 [2025-04-13 22:29:57,164 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:29:57,164 INFO L485 AbstractCegarLoop]: Abstraction has 11689 states and 36754 transitions. [2025-04-13 22:29:57,164 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 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:29:57,164 INFO L278 IsEmpty]: Start isEmpty. Operand 11689 states and 36754 transitions. [2025-04-13 22:29:57,179 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-04-13 22:29:57,179 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:29:57,179 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:29:57,179 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-04-13 22:29:57,179 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:29:57,179 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:29:57,179 INFO L85 PathProgramCache]: Analyzing trace with hash 1959549820, now seen corresponding path program 1 times [2025-04-13 22:29:57,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:29:57,179 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525372173] [2025-04-13 22:29:57,180 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:29:57,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:29:57,183 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-04-13 22:29:57,187 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-04-13 22:29:57,187 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:29:57,187 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:29:57,260 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:29:57,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:29:57,260 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525372173] [2025-04-13 22:29:57,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525372173] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:29:57,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:29:57,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 22:29:57,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518968237] [2025-04-13 22:29:57,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:29:57,261 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 22:29:57,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:29:57,261 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 22:29:57,261 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2025-04-13 22:29:57,261 INFO L87 Difference]: Start difference. First operand 11689 states and 36754 transitions. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 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:29:57,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:29:57,573 INFO L93 Difference]: Finished difference Result 14991 states and 46228 transitions. [2025-04-13 22:29:57,573 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 22:29:57,574 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 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 68 [2025-04-13 22:29:57,574 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:29:57,628 INFO L225 Difference]: With dead ends: 14991 [2025-04-13 22:29:57,628 INFO L226 Difference]: Without dead ends: 12878 [2025-04-13 22:29:57,635 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=39, Unknown=0, NotChecked=0, Total=72 [2025-04-13 22:29:57,636 INFO L437 NwaCegarLoop]: 12 mSDtfsCounter, 147 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 543 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 549 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 543 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:29:57,636 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 31 Invalid, 549 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 543 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:29:57,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12878 states. [2025-04-13 22:29:57,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12878 to 11398. [2025-04-13 22:29:57,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11398 states, 11397 states have (on average 3.134070369395455) internal successors, (35719), 11397 states have internal predecessors, (35719), 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:29:57,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11398 states to 11398 states and 35719 transitions. [2025-04-13 22:29:57,807 INFO L79 Accepts]: Start accepts. Automaton has 11398 states and 35719 transitions. Word has length 68 [2025-04-13 22:29:57,807 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:29:57,807 INFO L485 AbstractCegarLoop]: Abstraction has 11398 states and 35719 transitions. [2025-04-13 22:29:57,807 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 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:29:57,807 INFO L278 IsEmpty]: Start isEmpty. Operand 11398 states and 35719 transitions. [2025-04-13 22:29:57,821 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-04-13 22:29:57,821 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:29:57,821 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:29:57,821 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-04-13 22:29:57,821 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:29:57,821 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:29:57,821 INFO L85 PathProgramCache]: Analyzing trace with hash -763034519, now seen corresponding path program 3 times [2025-04-13 22:29:57,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:29:57,822 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838662870] [2025-04-13 22:29:57,822 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:29:57,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:29:57,825 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 68 statements into 1 equivalence classes. [2025-04-13 22:29:57,828 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-04-13 22:29:57,828 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 22:29:57,828 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:29:57,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:29:57,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:29:57,914 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838662870] [2025-04-13 22:29:57,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838662870] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:29:57,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:29:57,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-13 22:29:57,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182537959] [2025-04-13 22:29:57,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:29:57,914 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 22:29:57,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:29:57,914 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 22:29:57,915 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-04-13 22:29:57,915 INFO L87 Difference]: Start difference. First operand 11398 states and 35719 transitions. Second operand has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 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:29:58,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:29:58,514 INFO L93 Difference]: Finished difference Result 15334 states and 47377 transitions. [2025-04-13 22:29:58,514 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 22:29:58,514 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 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 68 [2025-04-13 22:29:58,515 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:29:58,557 INFO L225 Difference]: With dead ends: 15334 [2025-04-13 22:29:58,558 INFO L226 Difference]: Without dead ends: 12063 [2025-04-13 22:29:58,566 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=195, Unknown=0, NotChecked=0, Total=272 [2025-04-13 22:29:58,566 INFO L437 NwaCegarLoop]: 13 mSDtfsCounter, 196 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 1109 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 1126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 22:29:58,566 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 71 Invalid, 1126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1109 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 22:29:58,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12063 states. [2025-04-13 22:29:58,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12063 to 10928. [2025-04-13 22:29:58,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10928 states, 10927 states have (on average 3.0989292578017755) internal successors, (33862), 10927 states have internal predecessors, (33862), 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:29:58,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10928 states to 10928 states and 33862 transitions. [2025-04-13 22:29:58,735 INFO L79 Accepts]: Start accepts. Automaton has 10928 states and 33862 transitions. Word has length 68 [2025-04-13 22:29:58,735 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:29:58,735 INFO L485 AbstractCegarLoop]: Abstraction has 10928 states and 33862 transitions. [2025-04-13 22:29:58,735 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 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:29:58,735 INFO L278 IsEmpty]: Start isEmpty. Operand 10928 states and 33862 transitions. [2025-04-13 22:29:58,749 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-04-13 22:29:58,749 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:29:58,749 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:29:58,749 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-04-13 22:29:58,749 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:29:58,749 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:29:58,750 INFO L85 PathProgramCache]: Analyzing trace with hash -267167961, now seen corresponding path program 4 times [2025-04-13 22:29:58,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:29:58,750 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565644706] [2025-04-13 22:29:58,750 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:29:58,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:29:58,754 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 68 statements into 2 equivalence classes. [2025-04-13 22:29:58,758 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 68 of 68 statements. [2025-04-13 22:29:58,758 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:29:58,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:29:58,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:29:58,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:29:58,847 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565644706] [2025-04-13 22:29:58,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565644706] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:29:58,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:29:58,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 22:29:58,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149785057] [2025-04-13 22:29:58,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:29:58,847 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 22:29:58,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:29:58,848 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 22:29:58,848 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-04-13 22:29:58,848 INFO L87 Difference]: Start difference. First operand 10928 states and 33862 transitions. Second operand has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 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:29:59,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:29:59,423 INFO L93 Difference]: Finished difference Result 14145 states and 42578 transitions. [2025-04-13 22:29:59,423 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 22:29:59,424 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 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 68 [2025-04-13 22:29:59,424 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:29:59,470 INFO L225 Difference]: With dead ends: 14145 [2025-04-13 22:29:59,470 INFO L226 Difference]: Without dead ends: 13599 [2025-04-13 22:29:59,475 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2025-04-13 22:29:59,476 INFO L437 NwaCegarLoop]: 15 mSDtfsCounter, 282 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 1163 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 282 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 1187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 22:29:59,476 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [282 Valid, 80 Invalid, 1187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1163 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 22:29:59,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13599 states. [2025-04-13 22:29:59,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13599 to 10855. [2025-04-13 22:29:59,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10855 states, 10854 states have (on average 3.1018979178183157) internal successors, (33668), 10854 states have internal predecessors, (33668), 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:29:59,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10855 states to 10855 states and 33668 transitions. [2025-04-13 22:29:59,648 INFO L79 Accepts]: Start accepts. Automaton has 10855 states and 33668 transitions. Word has length 68 [2025-04-13 22:29:59,648 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:29:59,648 INFO L485 AbstractCegarLoop]: Abstraction has 10855 states and 33668 transitions. [2025-04-13 22:29:59,648 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 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:29:59,648 INFO L278 IsEmpty]: Start isEmpty. Operand 10855 states and 33668 transitions. [2025-04-13 22:29:59,661 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-04-13 22:29:59,661 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:29:59,661 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:29:59,662 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-04-13 22:29:59,662 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:29:59,662 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:29:59,662 INFO L85 PathProgramCache]: Analyzing trace with hash -1347719556, now seen corresponding path program 1 times [2025-04-13 22:29:59,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:29:59,662 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241064345] [2025-04-13 22:29:59,662 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:29:59,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:29:59,666 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-04-13 22:29:59,668 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-04-13 22:29:59,668 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:29:59,669 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:29:59,728 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:29:59,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:29:59,728 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241064345] [2025-04-13 22:29:59,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241064345] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:29:59,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:29:59,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 22:29:59,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304109118] [2025-04-13 22:29:59,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:29:59,729 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 22:29:59,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:29:59,729 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 22:29:59,729 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2025-04-13 22:29:59,729 INFO L87 Difference]: Start difference. First operand 10855 states and 33668 transitions. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 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:29:59,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:29:59,997 INFO L93 Difference]: Finished difference Result 13827 states and 42046 transitions. [2025-04-13 22:29:59,997 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 22:29:59,997 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 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 68 [2025-04-13 22:29:59,997 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:30:00,048 INFO L225 Difference]: With dead ends: 13827 [2025-04-13 22:30:00,049 INFO L226 Difference]: Without dead ends: 11806 [2025-04-13 22:30:00,054 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=39, Unknown=0, NotChecked=0, Total=72 [2025-04-13 22:30:00,055 INFO L437 NwaCegarLoop]: 12 mSDtfsCounter, 157 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 566 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 572 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 566 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:30:00,055 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 32 Invalid, 572 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 566 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:30:00,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11806 states. [2025-04-13 22:30:00,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11806 to 10326. [2025-04-13 22:30:00,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10326 states, 10325 states have (on average 3.0909443099273606) internal successors, (31914), 10325 states have internal predecessors, (31914), 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:30:00,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10326 states to 10326 states and 31914 transitions. [2025-04-13 22:30:00,243 INFO L79 Accepts]: Start accepts. Automaton has 10326 states and 31914 transitions. Word has length 68 [2025-04-13 22:30:00,243 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:30:00,243 INFO L485 AbstractCegarLoop]: Abstraction has 10326 states and 31914 transitions. [2025-04-13 22:30:00,243 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 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:30:00,243 INFO L278 IsEmpty]: Start isEmpty. Operand 10326 states and 31914 transitions. [2025-04-13 22:30:00,256 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-04-13 22:30:00,256 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:30:00,256 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:30:00,257 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-04-13 22:30:00,257 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:30:00,257 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:30:00,257 INFO L85 PathProgramCache]: Analyzing trace with hash -1495876150, now seen corresponding path program 1 times [2025-04-13 22:30:00,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:30:00,257 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268435322] [2025-04-13 22:30:00,257 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:30:00,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:30:00,262 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-04-13 22:30:00,265 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-04-13 22:30:00,265 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:30:00,265 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:30:00,329 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:30:00,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:30:00,329 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268435322] [2025-04-13 22:30:00,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268435322] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:30:00,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:30:00,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 22:30:00,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562223568] [2025-04-13 22:30:00,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:30:00,330 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 22:30:00,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:30:00,330 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 22:30:00,330 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2025-04-13 22:30:00,330 INFO L87 Difference]: Start difference. First operand 10326 states and 31914 transitions. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 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:30:00,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:30:00,577 INFO L93 Difference]: Finished difference Result 12309 states and 37386 transitions. [2025-04-13 22:30:00,577 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 22:30:00,577 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 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 68 [2025-04-13 22:30:00,577 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:30:00,611 INFO L225 Difference]: With dead ends: 12309 [2025-04-13 22:30:00,611 INFO L226 Difference]: Without dead ends: 10907 [2025-04-13 22:30:00,614 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=39, Unknown=0, NotChecked=0, Total=72 [2025-04-13 22:30:00,614 INFO L437 NwaCegarLoop]: 11 mSDtfsCounter, 157 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 401 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 407 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:30:00,614 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 27 Invalid, 407 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 401 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:30:00,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10907 states. [2025-04-13 22:30:00,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10907 to 9718. [2025-04-13 22:30:00,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9718 states, 9717 states have (on average 3.086858083770711) internal successors, (29995), 9717 states have internal predecessors, (29995), 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:30:00,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9718 states to 9718 states and 29995 transitions. [2025-04-13 22:30:00,751 INFO L79 Accepts]: Start accepts. Automaton has 9718 states and 29995 transitions. Word has length 68 [2025-04-13 22:30:00,751 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:30:00,751 INFO L485 AbstractCegarLoop]: Abstraction has 9718 states and 29995 transitions. [2025-04-13 22:30:00,751 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 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:30:00,751 INFO L278 IsEmpty]: Start isEmpty. Operand 9718 states and 29995 transitions. [2025-04-13 22:30:00,763 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-04-13 22:30:00,763 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:30:00,763 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:30:00,764 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-04-13 22:30:00,764 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:30:00,764 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:30:00,764 INFO L85 PathProgramCache]: Analyzing trace with hash 1524838549, now seen corresponding path program 1 times [2025-04-13 22:30:00,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:30:00,764 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139594192] [2025-04-13 22:30:00,764 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:30:00,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:30:00,768 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-04-13 22:30:00,770 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-04-13 22:30:00,770 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:30:00,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:30:00,825 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:30:00,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:30:00,825 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139594192] [2025-04-13 22:30:00,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139594192] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:30:00,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:30:00,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 22:30:00,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179403642] [2025-04-13 22:30:00,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:30:00,826 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 22:30:00,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:30:00,826 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 22:30:00,826 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2025-04-13 22:30:00,826 INFO L87 Difference]: Start difference. First operand 9718 states and 29995 transitions. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 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:30:01,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:30:01,040 INFO L93 Difference]: Finished difference Result 12724 states and 38551 transitions. [2025-04-13 22:30:01,040 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 22:30:01,040 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 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 68 [2025-04-13 22:30:01,040 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:30:01,081 INFO L225 Difference]: With dead ends: 12724 [2025-04-13 22:30:01,081 INFO L226 Difference]: Without dead ends: 11326 [2025-04-13 22:30:01,085 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=39, Unknown=0, NotChecked=0, Total=72 [2025-04-13 22:30:01,086 INFO L437 NwaCegarLoop]: 11 mSDtfsCounter, 174 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 414 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 420 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 414 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:30:01,086 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 27 Invalid, 420 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 414 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:30:01,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11326 states. [2025-04-13 22:30:01,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11326 to 10188. [2025-04-13 22:30:01,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10188 states, 10187 states have (on average 3.0748012172376558) internal successors, (31323), 10187 states have internal predecessors, (31323), 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:30:01,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10188 states to 10188 states and 31323 transitions. [2025-04-13 22:30:01,236 INFO L79 Accepts]: Start accepts. Automaton has 10188 states and 31323 transitions. Word has length 68 [2025-04-13 22:30:01,236 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:30:01,236 INFO L485 AbstractCegarLoop]: Abstraction has 10188 states and 31323 transitions. [2025-04-13 22:30:01,237 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 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:30:01,237 INFO L278 IsEmpty]: Start isEmpty. Operand 10188 states and 31323 transitions. [2025-04-13 22:30:01,249 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-04-13 22:30:01,249 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:30:01,249 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:30:01,249 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-04-13 22:30:01,249 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:30:01,250 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:30:01,250 INFO L85 PathProgramCache]: Analyzing trace with hash -1993377531, now seen corresponding path program 1 times [2025-04-13 22:30:01,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:30:01,250 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391274873] [2025-04-13 22:30:01,250 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:30:01,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:30:01,253 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-04-13 22:30:01,256 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-04-13 22:30:01,256 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:30:01,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:30:01,311 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:30:01,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:30:01,311 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391274873] [2025-04-13 22:30:01,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391274873] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:30:01,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:30:01,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 22:30:01,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272332494] [2025-04-13 22:30:01,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:30:01,311 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 22:30:01,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:30:01,311 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 22:30:01,311 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2025-04-13 22:30:01,312 INFO L87 Difference]: Start difference. First operand 10188 states and 31323 transitions. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 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:30:01,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:30:01,540 INFO L93 Difference]: Finished difference Result 12102 states and 36706 transitions. [2025-04-13 22:30:01,540 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 22:30:01,540 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 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 68 [2025-04-13 22:30:01,540 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:30:01,582 INFO L225 Difference]: With dead ends: 12102 [2025-04-13 22:30:01,582 INFO L226 Difference]: Without dead ends: 11192 [2025-04-13 22:30:01,586 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=39, Unknown=0, NotChecked=0, Total=72 [2025-04-13 22:30:01,586 INFO L437 NwaCegarLoop]: 11 mSDtfsCounter, 153 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 527 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 532 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 527 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:30:01,586 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 31 Invalid, 532 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 527 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:30:01,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11192 states. [2025-04-13 22:30:01,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11192 to 10480. [2025-04-13 22:30:01,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10480 states, 10479 states have (on average 3.0724305754365875) internal successors, (32196), 10479 states have internal predecessors, (32196), 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:30:01,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10480 states to 10480 states and 32196 transitions. [2025-04-13 22:30:01,737 INFO L79 Accepts]: Start accepts. Automaton has 10480 states and 32196 transitions. Word has length 68 [2025-04-13 22:30:01,737 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:30:01,737 INFO L485 AbstractCegarLoop]: Abstraction has 10480 states and 32196 transitions. [2025-04-13 22:30:01,738 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 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:30:01,738 INFO L278 IsEmpty]: Start isEmpty. Operand 10480 states and 32196 transitions. [2025-04-13 22:30:01,750 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-04-13 22:30:01,750 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:30:01,750 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:30:01,750 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-04-13 22:30:01,751 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:30:01,751 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:30:01,751 INFO L85 PathProgramCache]: Analyzing trace with hash -140153155, now seen corresponding path program 2 times [2025-04-13 22:30:01,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:30:01,751 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066296868] [2025-04-13 22:30:01,751 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:30:01,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:30:01,754 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 68 statements into 1 equivalence classes. [2025-04-13 22:30:01,757 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-04-13 22:30:01,757 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 22:30:01,757 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:30:01,832 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:30:01,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:30:01,833 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066296868] [2025-04-13 22:30:01,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2066296868] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:30:01,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:30:01,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-13 22:30:01,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459829251] [2025-04-13 22:30:01,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:30:01,833 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 22:30:01,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:30:01,833 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 22:30:01,833 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-04-13 22:30:01,833 INFO L87 Difference]: Start difference. First operand 10480 states and 32196 transitions. Second operand has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 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:30:02,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:30:02,257 INFO L93 Difference]: Finished difference Result 13573 states and 40870 transitions. [2025-04-13 22:30:02,258 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 22:30:02,258 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 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 68 [2025-04-13 22:30:02,258 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:30:02,302 INFO L225 Difference]: With dead ends: 13573 [2025-04-13 22:30:02,303 INFO L226 Difference]: Without dead ends: 10874 [2025-04-13 22:30:02,309 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2025-04-13 22:30:02,309 INFO L437 NwaCegarLoop]: 13 mSDtfsCounter, 238 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 932 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 960 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 932 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:30:02,309 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [238 Valid, 61 Invalid, 960 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 932 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:30:02,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10874 states. [2025-04-13 22:30:02,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10874 to 9437. [2025-04-13 22:30:02,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9437 states, 9436 states have (on average 3.061148791860958) internal successors, (28885), 9436 states have internal predecessors, (28885), 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:30:02,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9437 states to 9437 states and 28885 transitions. [2025-04-13 22:30:02,509 INFO L79 Accepts]: Start accepts. Automaton has 9437 states and 28885 transitions. Word has length 68 [2025-04-13 22:30:02,509 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:30:02,509 INFO L485 AbstractCegarLoop]: Abstraction has 9437 states and 28885 transitions. [2025-04-13 22:30:02,509 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 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:30:02,509 INFO L278 IsEmpty]: Start isEmpty. Operand 9437 states and 28885 transitions. [2025-04-13 22:30:02,521 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-04-13 22:30:02,521 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:30:02,521 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:30:02,521 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-04-13 22:30:02,522 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:30:02,522 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:30:02,522 INFO L85 PathProgramCache]: Analyzing trace with hash -1103449425, now seen corresponding path program 2 times [2025-04-13 22:30:02,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:30:02,522 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375043443] [2025-04-13 22:30:02,522 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:30:02,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:30:02,526 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 68 statements into 1 equivalence classes. [2025-04-13 22:30:02,528 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-04-13 22:30:02,528 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 22:30:02,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:30:02,602 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:30:02,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:30:02,603 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375043443] [2025-04-13 22:30:02,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [375043443] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:30:02,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:30:02,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-13 22:30:02,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411036709] [2025-04-13 22:30:02,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:30:02,603 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 22:30:02,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:30:02,603 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 22:30:02,603 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-04-13 22:30:02,604 INFO L87 Difference]: Start difference. First operand 9437 states and 28885 transitions. Second operand has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 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:30:02,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:30:02,981 INFO L93 Difference]: Finished difference Result 11317 states and 34270 transitions. [2025-04-13 22:30:02,981 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 22:30:02,982 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 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 68 [2025-04-13 22:30:02,982 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:30:03,019 INFO L225 Difference]: With dead ends: 11317 [2025-04-13 22:30:03,019 INFO L226 Difference]: Without dead ends: 9003 [2025-04-13 22:30:03,024 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=195, Unknown=0, NotChecked=0, Total=272 [2025-04-13 22:30:03,025 INFO L437 NwaCegarLoop]: 12 mSDtfsCounter, 193 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 858 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 874 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 858 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:30:03,025 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 55 Invalid, 874 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 858 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:30:03,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9003 states. [2025-04-13 22:30:03,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9003 to 8423. [2025-04-13 22:30:03,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8423 states, 8422 states have (on average 3.038114462123011) internal successors, (25587), 8422 states have internal predecessors, (25587), 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:30:03,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8423 states to 8423 states and 25587 transitions. [2025-04-13 22:30:03,143 INFO L79 Accepts]: Start accepts. Automaton has 8423 states and 25587 transitions. Word has length 68 [2025-04-13 22:30:03,144 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:30:03,144 INFO L485 AbstractCegarLoop]: Abstraction has 8423 states and 25587 transitions. [2025-04-13 22:30:03,144 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 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:30:03,144 INFO L278 IsEmpty]: Start isEmpty. Operand 8423 states and 25587 transitions. [2025-04-13 22:30:03,154 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-04-13 22:30:03,154 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:30:03,154 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:30:03,154 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-04-13 22:30:03,154 INFO L403 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:30:03,154 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:30:03,154 INFO L85 PathProgramCache]: Analyzing trace with hash -2144758627, now seen corresponding path program 3 times [2025-04-13 22:30:03,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:30:03,155 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109829201] [2025-04-13 22:30:03,155 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:30:03,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:30:03,158 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 68 statements into 1 equivalence classes. [2025-04-13 22:30:03,161 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-04-13 22:30:03,161 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 22:30:03,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:30:03,237 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:30:03,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:30:03,238 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109829201] [2025-04-13 22:30:03,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109829201] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:30:03,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:30:03,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-13 22:30:03,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443792732] [2025-04-13 22:30:03,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:30:03,238 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 22:30:03,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:30:03,238 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 22:30:03,238 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-04-13 22:30:03,238 INFO L87 Difference]: Start difference. First operand 8423 states and 25587 transitions. Second operand has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 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:30:03,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:30:03,593 INFO L93 Difference]: Finished difference Result 8912 states and 26876 transitions. [2025-04-13 22:30:03,594 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 22:30:03,594 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 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 68 [2025-04-13 22:30:03,594 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:30:03,633 INFO L225 Difference]: With dead ends: 8912 [2025-04-13 22:30:03,633 INFO L226 Difference]: Without dead ends: 8606 [2025-04-13 22:30:03,636 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=195, Unknown=0, NotChecked=0, Total=272 [2025-04-13 22:30:03,636 INFO L437 NwaCegarLoop]: 11 mSDtfsCounter, 184 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 811 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 820 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 811 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:30:03,636 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 48 Invalid, 820 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 811 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:30:03,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8606 states. [2025-04-13 22:30:03,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8606 to 8228. [2025-04-13 22:30:03,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8228 states, 8227 states have (on average 3.0482557432843076) internal successors, (25078), 8227 states have internal predecessors, (25078), 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:30:03,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8228 states to 8228 states and 25078 transitions. [2025-04-13 22:30:03,749 INFO L79 Accepts]: Start accepts. Automaton has 8228 states and 25078 transitions. Word has length 68 [2025-04-13 22:30:03,750 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:30:03,750 INFO L485 AbstractCegarLoop]: Abstraction has 8228 states and 25078 transitions. [2025-04-13 22:30:03,750 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 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:30:03,750 INFO L278 IsEmpty]: Start isEmpty. Operand 8228 states and 25078 transitions. [2025-04-13 22:30:03,759 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-04-13 22:30:03,760 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:30:03,760 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:30:03,760 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-04-13 22:30:03,760 INFO L403 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:30:03,760 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:30:03,760 INFO L85 PathProgramCache]: Analyzing trace with hash -1389205777, now seen corresponding path program 3 times [2025-04-13 22:30:03,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:30:03,760 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485739138] [2025-04-13 22:30:03,760 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:30:03,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:30:03,764 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 68 statements into 1 equivalence classes. [2025-04-13 22:30:03,766 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-04-13 22:30:03,767 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 22:30:03,767 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:30:03,842 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:30:03,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:30:03,842 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485739138] [2025-04-13 22:30:03,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485739138] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:30:03,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:30:03,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-13 22:30:03,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942669423] [2025-04-13 22:30:03,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:30:03,843 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 22:30:03,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:30:03,843 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 22:30:03,843 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-04-13 22:30:03,843 INFO L87 Difference]: Start difference. First operand 8228 states and 25078 transitions. Second operand has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 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:30:04,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:30:04,154 INFO L93 Difference]: Finished difference Result 8892 states and 26812 transitions. [2025-04-13 22:30:04,154 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 22:30:04,154 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 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 68 [2025-04-13 22:30:04,154 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:30:04,199 INFO L225 Difference]: With dead ends: 8892 [2025-04-13 22:30:04,200 INFO L226 Difference]: Without dead ends: 8594 [2025-04-13 22:30:04,203 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2025-04-13 22:30:04,203 INFO L437 NwaCegarLoop]: 12 mSDtfsCounter, 163 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 725 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 737 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 725 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:30:04,203 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 50 Invalid, 737 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 725 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:30:04,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8594 states. [2025-04-13 22:30:04,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8594 to 8162. [2025-04-13 22:30:04,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8162 states, 8161 states have (on average 3.0521994853571868) internal successors, (24909), 8161 states have internal predecessors, (24909), 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:30:04,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8162 states to 8162 states and 24909 transitions. [2025-04-13 22:30:04,324 INFO L79 Accepts]: Start accepts. Automaton has 8162 states and 24909 transitions. Word has length 68 [2025-04-13 22:30:04,324 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:30:04,324 INFO L485 AbstractCegarLoop]: Abstraction has 8162 states and 24909 transitions. [2025-04-13 22:30:04,324 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 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:30:04,324 INFO L278 IsEmpty]: Start isEmpty. Operand 8162 states and 24909 transitions. [2025-04-13 22:30:04,334 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-04-13 22:30:04,334 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:30:04,334 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:30:04,334 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-04-13 22:30:04,335 INFO L403 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:30:04,335 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:30:04,335 INFO L85 PathProgramCache]: Analyzing trace with hash 286858700, now seen corresponding path program 2 times [2025-04-13 22:30:04,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:30:04,335 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67030344] [2025-04-13 22:30:04,335 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:30:04,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:30:04,340 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 68 statements into 1 equivalence classes. [2025-04-13 22:30:04,345 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-04-13 22:30:04,345 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 22:30:04,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:30:04,411 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:30:04,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:30:04,411 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67030344] [2025-04-13 22:30:04,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67030344] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:30:04,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:30:04,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 22:30:04,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023029395] [2025-04-13 22:30:04,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:30:04,411 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 22:30:04,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:30:04,412 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 22:30:04,412 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-04-13 22:30:04,412 INFO L87 Difference]: Start difference. First operand 8162 states and 24909 transitions. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 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:30:04,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:30:04,873 INFO L93 Difference]: Finished difference Result 10849 states and 32200 transitions. [2025-04-13 22:30:04,874 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 22:30:04,874 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 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 68 [2025-04-13 22:30:04,874 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:30:04,910 INFO L225 Difference]: With dead ends: 10849 [2025-04-13 22:30:04,910 INFO L226 Difference]: Without dead ends: 10487 [2025-04-13 22:30:04,913 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2025-04-13 22:30:04,913 INFO L437 NwaCegarLoop]: 11 mSDtfsCounter, 198 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 919 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 935 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 919 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:30:04,913 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 55 Invalid, 935 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 919 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:30:04,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10487 states. [2025-04-13 22:30:05,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10487 to 8270. [2025-04-13 22:30:05,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8270 states, 8269 states have (on average 3.0510339823436934) internal successors, (25229), 8269 states have internal predecessors, (25229), 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:30:05,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8270 states to 8270 states and 25229 transitions. [2025-04-13 22:30:05,076 INFO L79 Accepts]: Start accepts. Automaton has 8270 states and 25229 transitions. Word has length 68 [2025-04-13 22:30:05,076 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:30:05,076 INFO L485 AbstractCegarLoop]: Abstraction has 8270 states and 25229 transitions. [2025-04-13 22:30:05,076 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 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:30:05,076 INFO L278 IsEmpty]: Start isEmpty. Operand 8270 states and 25229 transitions. [2025-04-13 22:30:05,087 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-04-13 22:30:05,088 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:30:05,088 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:30:05,088 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-04-13 22:30:05,088 INFO L403 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:30:05,088 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:30:05,088 INFO L85 PathProgramCache]: Analyzing trace with hash -1983656353, now seen corresponding path program 5 times [2025-04-13 22:30:05,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:30:05,088 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587407552] [2025-04-13 22:30:05,088 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:30:05,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:30:05,092 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 68 statements into 1 equivalence classes. [2025-04-13 22:30:05,095 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-04-13 22:30:05,096 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 22:30:05,096 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:30:05,154 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:30:05,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:30:05,154 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587407552] [2025-04-13 22:30:05,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587407552] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:30:05,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:30:05,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 22:30:05,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748828546] [2025-04-13 22:30:05,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:30:05,155 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 22:30:05,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:30:05,155 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 22:30:05,155 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2025-04-13 22:30:05,155 INFO L87 Difference]: Start difference. First operand 8270 states and 25229 transitions. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 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:30:05,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:30:05,398 INFO L93 Difference]: Finished difference Result 10472 states and 31424 transitions. [2025-04-13 22:30:05,398 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 22:30:05,398 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 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 68 [2025-04-13 22:30:05,398 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:30:05,447 INFO L225 Difference]: With dead ends: 10472 [2025-04-13 22:30:05,447 INFO L226 Difference]: Without dead ends: 8884 [2025-04-13 22:30:05,452 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=39, Unknown=0, NotChecked=0, Total=72 [2025-04-13 22:30:05,453 INFO L437 NwaCegarLoop]: 11 mSDtfsCounter, 157 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 583 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 587 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 583 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:30:05,453 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 38 Invalid, 587 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 583 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:30:05,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8884 states. [2025-04-13 22:30:05,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8884 to 7956. [2025-04-13 22:30:05,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7956 states, 7955 states have (on average 3.047894406033941) internal successors, (24246), 7955 states have internal predecessors, (24246), 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:30:05,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7956 states to 7956 states and 24246 transitions. [2025-04-13 22:30:05,592 INFO L79 Accepts]: Start accepts. Automaton has 7956 states and 24246 transitions. Word has length 68 [2025-04-13 22:30:05,592 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:30:05,592 INFO L485 AbstractCegarLoop]: Abstraction has 7956 states and 24246 transitions. [2025-04-13 22:30:05,592 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 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:30:05,592 INFO L278 IsEmpty]: Start isEmpty. Operand 7956 states and 24246 transitions. [2025-04-13 22:30:05,602 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-04-13 22:30:05,602 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:30:05,603 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:30:05,603 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-04-13 22:30:05,603 INFO L403 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:30:05,603 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:30:05,603 INFO L85 PathProgramCache]: Analyzing trace with hash -1699055778, now seen corresponding path program 3 times [2025-04-13 22:30:05,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:30:05,603 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914824246] [2025-04-13 22:30:05,603 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:30:05,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:30:05,607 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 68 statements into 1 equivalence classes. [2025-04-13 22:30:05,610 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-04-13 22:30:05,610 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 22:30:05,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:30:05,690 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:30:05,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:30:05,690 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914824246] [2025-04-13 22:30:05,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914824246] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:30:05,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:30:05,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-13 22:30:05,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806943392] [2025-04-13 22:30:05,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:30:05,691 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 22:30:05,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:30:05,691 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 22:30:05,691 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-04-13 22:30:05,691 INFO L87 Difference]: Start difference. First operand 7956 states and 24246 transitions. Second operand has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 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:30:06,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:30:06,021 INFO L93 Difference]: Finished difference Result 8484 states and 25668 transitions. [2025-04-13 22:30:06,021 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 22:30:06,021 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 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 68 [2025-04-13 22:30:06,021 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:30:06,065 INFO L225 Difference]: With dead ends: 8484 [2025-04-13 22:30:06,065 INFO L226 Difference]: Without dead ends: 8330 [2025-04-13 22:30:06,068 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2025-04-13 22:30:06,068 INFO L437 NwaCegarLoop]: 10 mSDtfsCounter, 143 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 680 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 687 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 680 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:30:06,068 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 42 Invalid, 687 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 680 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:30:06,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8330 states. [2025-04-13 22:30:06,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8330 to 7964. [2025-04-13 22:30:06,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7964 states, 7963 states have (on average 3.0473439658420194) internal successors, (24266), 7963 states have internal predecessors, (24266), 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:30:06,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7964 states to 7964 states and 24266 transitions. [2025-04-13 22:30:06,189 INFO L79 Accepts]: Start accepts. Automaton has 7964 states and 24266 transitions. Word has length 68 [2025-04-13 22:30:06,190 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:30:06,190 INFO L485 AbstractCegarLoop]: Abstraction has 7964 states and 24266 transitions. [2025-04-13 22:30:06,190 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 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:30:06,190 INFO L278 IsEmpty]: Start isEmpty. Operand 7964 states and 24266 transitions. [2025-04-13 22:30:06,200 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-04-13 22:30:06,200 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:30:06,200 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:30:06,200 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-04-13 22:30:06,200 INFO L403 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:30:06,200 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:30:06,200 INFO L85 PathProgramCache]: Analyzing trace with hash -1893620910, now seen corresponding path program 2 times [2025-04-13 22:30:06,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:30:06,200 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399799656] [2025-04-13 22:30:06,200 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:30:06,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:30:06,204 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 68 statements into 1 equivalence classes. [2025-04-13 22:30:06,206 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-04-13 22:30:06,206 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 22:30:06,206 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:30:06,253 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:30:06,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:30:06,254 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399799656] [2025-04-13 22:30:06,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399799656] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:30:06,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:30:06,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 22:30:06,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333937901] [2025-04-13 22:30:06,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:30:06,254 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 22:30:06,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:30:06,254 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 22:30:06,254 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-04-13 22:30:06,254 INFO L87 Difference]: Start difference. First operand 7964 states and 24266 transitions. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 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:30:06,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:30:06,583 INFO L93 Difference]: Finished difference Result 12262 states and 36339 transitions. [2025-04-13 22:30:06,583 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 22:30:06,583 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 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 68 [2025-04-13 22:30:06,583 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:30:06,624 INFO L225 Difference]: With dead ends: 12262 [2025-04-13 22:30:06,624 INFO L226 Difference]: Without dead ends: 10734 [2025-04-13 22:30:06,630 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2025-04-13 22:30:06,630 INFO L437 NwaCegarLoop]: 14 mSDtfsCounter, 219 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 751 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 773 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 751 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:30:06,630 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 46 Invalid, 773 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 751 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:30:06,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10734 states. [2025-04-13 22:30:06,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10734 to 7971. [2025-04-13 22:30:06,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7971 states, 7970 states have (on average 3.0385194479297364) internal successors, (24217), 7970 states have internal predecessors, (24217), 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:30:06,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7971 states to 7971 states and 24217 transitions. [2025-04-13 22:30:06,767 INFO L79 Accepts]: Start accepts. Automaton has 7971 states and 24217 transitions. Word has length 68 [2025-04-13 22:30:06,768 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:30:06,768 INFO L485 AbstractCegarLoop]: Abstraction has 7971 states and 24217 transitions. [2025-04-13 22:30:06,768 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 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:30:06,768 INFO L278 IsEmpty]: Start isEmpty. Operand 7971 states and 24217 transitions. [2025-04-13 22:30:06,778 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-04-13 22:30:06,778 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:30:06,778 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:30:06,778 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-04-13 22:30:06,778 INFO L403 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:30:06,778 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:30:06,778 INFO L85 PathProgramCache]: Analyzing trace with hash 1540088734, now seen corresponding path program 4 times [2025-04-13 22:30:06,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:30:06,779 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114066347] [2025-04-13 22:30:06,779 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:30:06,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:30:06,782 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 68 statements into 2 equivalence classes. [2025-04-13 22:30:06,787 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 68 of 68 statements. [2025-04-13 22:30:06,788 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:30:06,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:30:06,922 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:30:06,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:30:06,922 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114066347] [2025-04-13 22:30:06,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114066347] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:30:06,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:30:06,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 22:30:06,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015639797] [2025-04-13 22:30:06,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:30:06,922 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 22:30:06,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:30:06,923 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 22:30:06,923 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-04-13 22:30:06,923 INFO L87 Difference]: Start difference. First operand 7971 states and 24217 transitions. Second operand has 10 states, 10 states have (on average 6.8) internal successors, (68), 10 states have internal predecessors, (68), 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:30:07,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:30:07,224 INFO L93 Difference]: Finished difference Result 8341 states and 25180 transitions. [2025-04-13 22:30:07,225 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 22:30:07,225 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.8) internal successors, (68), 10 states have internal predecessors, (68), 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 68 [2025-04-13 22:30:07,225 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:30:07,256 INFO L225 Difference]: With dead ends: 8341 [2025-04-13 22:30:07,256 INFO L226 Difference]: Without dead ends: 8183 [2025-04-13 22:30:07,257 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2025-04-13 22:30:07,258 INFO L437 NwaCegarLoop]: 11 mSDtfsCounter, 122 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 909 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 916 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 909 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:30:07,258 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 66 Invalid, 916 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 909 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:30:07,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8183 states. [2025-04-13 22:30:07,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8183 to 7967. [2025-04-13 22:30:07,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7967 states, 7966 states have (on average 3.038538789856892) internal successors, (24205), 7966 states have internal predecessors, (24205), 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:30:07,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7967 states to 7967 states and 24205 transitions. [2025-04-13 22:30:07,366 INFO L79 Accepts]: Start accepts. Automaton has 7967 states and 24205 transitions. Word has length 68 [2025-04-13 22:30:07,366 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:30:07,366 INFO L485 AbstractCegarLoop]: Abstraction has 7967 states and 24205 transitions. [2025-04-13 22:30:07,366 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.8) internal successors, (68), 10 states have internal predecessors, (68), 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:30:07,366 INFO L278 IsEmpty]: Start isEmpty. Operand 7967 states and 24205 transitions. [2025-04-13 22:30:07,376 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-04-13 22:30:07,376 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:30:07,376 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:30:07,376 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-04-13 22:30:07,376 INFO L403 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:30:07,376 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:30:07,376 INFO L85 PathProgramCache]: Analyzing trace with hash -781966854, now seen corresponding path program 5 times [2025-04-13 22:30:07,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:30:07,376 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907666] [2025-04-13 22:30:07,376 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:30:07,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:30:07,380 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 68 statements into 1 equivalence classes. [2025-04-13 22:30:07,382 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-04-13 22:30:07,383 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 22:30:07,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:30:07,457 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:30:07,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:30:07,457 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907666] [2025-04-13 22:30:07,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907666] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:30:07,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:30:07,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-13 22:30:07,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895043007] [2025-04-13 22:30:07,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:30:07,457 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 22:30:07,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:30:07,457 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 22:30:07,458 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-04-13 22:30:07,458 INFO L87 Difference]: Start difference. First operand 7967 states and 24205 transitions. Second operand has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 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:30:07,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:30:07,712 INFO L93 Difference]: Finished difference Result 8213 states and 24842 transitions. [2025-04-13 22:30:07,712 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 22:30:07,712 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 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 68 [2025-04-13 22:30:07,712 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:30:07,752 INFO L225 Difference]: With dead ends: 8213 [2025-04-13 22:30:07,752 INFO L226 Difference]: Without dead ends: 8043 [2025-04-13 22:30:07,755 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-04-13 22:30:07,755 INFO L437 NwaCegarLoop]: 9 mSDtfsCounter, 76 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 744 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 745 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 744 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:30:07,755 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 50 Invalid, 745 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 744 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:30:07,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8043 states. [2025-04-13 22:30:07,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8043 to 7963. [2025-04-13 22:30:07,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7963 states, 7962 states have (on average 3.038558151218287) internal successors, (24193), 7962 states have internal predecessors, (24193), 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:30:07,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7963 states to 7963 states and 24193 transitions. [2025-04-13 22:30:07,867 INFO L79 Accepts]: Start accepts. Automaton has 7963 states and 24193 transitions. Word has length 68 [2025-04-13 22:30:07,867 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:30:07,867 INFO L485 AbstractCegarLoop]: Abstraction has 7963 states and 24193 transitions. [2025-04-13 22:30:07,867 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 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:30:07,867 INFO L278 IsEmpty]: Start isEmpty. Operand 7963 states and 24193 transitions. [2025-04-13 22:30:07,877 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-04-13 22:30:07,877 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:30:07,877 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:30:07,877 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-04-13 22:30:07,877 INFO L403 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:30:07,878 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:30:07,878 INFO L85 PathProgramCache]: Analyzing trace with hash -1174859872, now seen corresponding path program 2 times [2025-04-13 22:30:07,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:30:07,878 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044576887] [2025-04-13 22:30:07,878 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:30:07,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:30:07,881 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 68 statements into 1 equivalence classes. [2025-04-13 22:30:07,884 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-04-13 22:30:07,884 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 22:30:07,884 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:30:07,933 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:30:07,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:30:07,933 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044576887] [2025-04-13 22:30:07,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044576887] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:30:07,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:30:07,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 22:30:07,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935454292] [2025-04-13 22:30:07,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:30:07,934 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 22:30:07,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:30:07,934 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 22:30:07,934 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-04-13 22:30:07,934 INFO L87 Difference]: Start difference. First operand 7963 states and 24193 transitions. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 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:30:08,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:30:08,264 INFO L93 Difference]: Finished difference Result 9664 states and 28849 transitions. [2025-04-13 22:30:08,265 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 22:30:08,265 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 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 68 [2025-04-13 22:30:08,265 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:30:08,301 INFO L225 Difference]: With dead ends: 9664 [2025-04-13 22:30:08,301 INFO L226 Difference]: Without dead ends: 9136 [2025-04-13 22:30:08,304 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2025-04-13 22:30:08,304 INFO L437 NwaCegarLoop]: 9 mSDtfsCounter, 207 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 759 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 777 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 759 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:30:08,304 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 40 Invalid, 777 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 759 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:30:08,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9136 states. [2025-04-13 22:30:08,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9136 to 7963. [2025-04-13 22:30:08,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7963 states, 7962 states have (on average 3.0295151971866363) internal successors, (24121), 7962 states have internal predecessors, (24121), 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:30:08,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7963 states to 7963 states and 24121 transitions. [2025-04-13 22:30:08,420 INFO L79 Accepts]: Start accepts. Automaton has 7963 states and 24121 transitions. Word has length 68 [2025-04-13 22:30:08,420 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:30:08,420 INFO L485 AbstractCegarLoop]: Abstraction has 7963 states and 24121 transitions. [2025-04-13 22:30:08,420 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 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:30:08,420 INFO L278 IsEmpty]: Start isEmpty. Operand 7963 states and 24121 transitions. [2025-04-13 22:30:08,430 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-04-13 22:30:08,430 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:30:08,430 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:30:08,430 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-04-13 22:30:08,431 INFO L403 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:30:08,431 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:30:08,431 INFO L85 PathProgramCache]: Analyzing trace with hash 1560292606, now seen corresponding path program 3 times [2025-04-13 22:30:08,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:30:08,431 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371068212] [2025-04-13 22:30:08,431 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:30:08,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:30:08,434 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 68 statements into 1 equivalence classes. [2025-04-13 22:30:08,436 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-04-13 22:30:08,437 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 22:30:08,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:30:08,464 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:30:08,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:30:08,465 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371068212] [2025-04-13 22:30:08,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1371068212] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:30:08,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:30:08,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 22:30:08,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382928029] [2025-04-13 22:30:08,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:30:08,465 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 22:30:08,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:30:08,465 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 22:30:08,465 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-13 22:30:08,466 INFO L87 Difference]: Start difference. First operand 7963 states and 24121 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 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:30:08,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:30:08,595 INFO L93 Difference]: Finished difference Result 8811 states and 26403 transitions. [2025-04-13 22:30:08,596 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 22:30:08,596 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 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 68 [2025-04-13 22:30:08,596 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:30:08,633 INFO L225 Difference]: With dead ends: 8811 [2025-04-13 22:30:08,633 INFO L226 Difference]: Without dead ends: 8355 [2025-04-13 22:30:08,635 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-13 22:30:08,636 INFO L437 NwaCegarLoop]: 3 mSDtfsCounter, 78 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:30:08,636 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 11 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:30:08,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8355 states. [2025-04-13 22:30:08,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8355 to 7811. [2025-04-13 22:30:08,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7811 states, 7810 states have (on average 3.02291933418694) internal successors, (23609), 7810 states have internal predecessors, (23609), 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:30:08,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7811 states to 7811 states and 23609 transitions. [2025-04-13 22:30:08,745 INFO L79 Accepts]: Start accepts. Automaton has 7811 states and 23609 transitions. Word has length 68 [2025-04-13 22:30:08,745 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:30:08,745 INFO L485 AbstractCegarLoop]: Abstraction has 7811 states and 23609 transitions. [2025-04-13 22:30:08,745 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 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:30:08,746 INFO L278 IsEmpty]: Start isEmpty. Operand 7811 states and 23609 transitions. [2025-04-13 22:30:08,754 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-04-13 22:30:08,755 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:30:08,755 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:30:08,755 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-04-13 22:30:08,755 INFO L403 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:30:08,755 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:30:08,755 INFO L85 PathProgramCache]: Analyzing trace with hash 766147182, now seen corresponding path program 3 times [2025-04-13 22:30:08,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:30:08,755 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604272488] [2025-04-13 22:30:08,755 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:30:08,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:30:08,759 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 68 statements into 1 equivalence classes. [2025-04-13 22:30:08,761 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-04-13 22:30:08,761 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 22:30:08,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:30:08,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:30:08,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:30:08,789 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604272488] [2025-04-13 22:30:08,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604272488] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:30:08,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:30:08,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 22:30:08,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759870482] [2025-04-13 22:30:08,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:30:08,789 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 22:30:08,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:30:08,789 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 22:30:08,789 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-13 22:30:08,789 INFO L87 Difference]: Start difference. First operand 7811 states and 23609 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 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:30:08,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:30:08,932 INFO L93 Difference]: Finished difference Result 8643 states and 25869 transitions. [2025-04-13 22:30:08,932 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 22:30:08,932 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 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 68 [2025-04-13 22:30:08,932 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:30:08,962 INFO L225 Difference]: With dead ends: 8643 [2025-04-13 22:30:08,962 INFO L226 Difference]: Without dead ends: 8255 [2025-04-13 22:30:08,964 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-13 22:30:08,964 INFO L437 NwaCegarLoop]: 3 mSDtfsCounter, 109 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:30:08,964 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 9 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:30:08,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8255 states. [2025-04-13 22:30:09,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8255 to 7807. [2025-04-13 22:30:09,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7807 states, 7806 states have (on average 3.019600307455803) internal successors, (23571), 7806 states have internal predecessors, (23571), 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:30:09,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7807 states to 7807 states and 23571 transitions. [2025-04-13 22:30:09,068 INFO L79 Accepts]: Start accepts. Automaton has 7807 states and 23571 transitions. Word has length 68 [2025-04-13 22:30:09,068 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:30:09,068 INFO L485 AbstractCegarLoop]: Abstraction has 7807 states and 23571 transitions. [2025-04-13 22:30:09,068 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 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:30:09,068 INFO L278 IsEmpty]: Start isEmpty. Operand 7807 states and 23571 transitions. [2025-04-13 22:30:09,077 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-04-13 22:30:09,077 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:30:09,078 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:30:09,078 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-04-13 22:30:09,078 INFO L403 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:30:09,078 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:30:09,078 INFO L85 PathProgramCache]: Analyzing trace with hash 379513950, now seen corresponding path program 4 times [2025-04-13 22:30:09,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:30:09,078 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890413222] [2025-04-13 22:30:09,078 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:30:09,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:30:09,082 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 68 statements into 2 equivalence classes. [2025-04-13 22:30:09,088 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 68 of 68 statements. [2025-04-13 22:30:09,088 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:30:09,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:30:09,174 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:30:09,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:30:09,174 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890413222] [2025-04-13 22:30:09,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890413222] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:30:09,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:30:09,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 22:30:09,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121644080] [2025-04-13 22:30:09,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:30:09,175 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 22:30:09,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:30:09,175 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 22:30:09,175 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-04-13 22:30:09,175 INFO L87 Difference]: Start difference. First operand 7807 states and 23571 transitions. Second operand has 10 states, 10 states have (on average 6.8) internal successors, (68), 10 states have internal predecessors, (68), 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:30:09,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:30:09,575 INFO L93 Difference]: Finished difference Result 10569 states and 31086 transitions. [2025-04-13 22:30:09,575 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-13 22:30:09,575 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.8) internal successors, (68), 10 states have internal predecessors, (68), 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 68 [2025-04-13 22:30:09,575 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:30:09,615 INFO L225 Difference]: With dead ends: 10569 [2025-04-13 22:30:09,615 INFO L226 Difference]: Without dead ends: 10417 [2025-04-13 22:30:09,618 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=194, Unknown=0, NotChecked=0, Total=272 [2025-04-13 22:30:09,618 INFO L437 NwaCegarLoop]: 13 mSDtfsCounter, 226 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 1065 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 1085 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 1065 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:30:09,618 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 70 Invalid, 1085 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 1065 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:30:09,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10417 states. [2025-04-13 22:30:09,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10417 to 7815. [2025-04-13 22:30:09,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7815 states, 7814 states have (on average 3.0190683388789354) internal successors, (23591), 7814 states have internal predecessors, (23591), 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:30:09,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7815 states to 7815 states and 23591 transitions. [2025-04-13 22:30:09,744 INFO L79 Accepts]: Start accepts. Automaton has 7815 states and 23591 transitions. Word has length 68 [2025-04-13 22:30:09,744 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:30:09,744 INFO L485 AbstractCegarLoop]: Abstraction has 7815 states and 23591 transitions. [2025-04-13 22:30:09,744 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.8) internal successors, (68), 10 states have internal predecessors, (68), 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:30:09,744 INFO L278 IsEmpty]: Start isEmpty. Operand 7815 states and 23591 transitions. [2025-04-13 22:30:09,753 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-04-13 22:30:09,753 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:30:09,753 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:30:09,754 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-04-13 22:30:09,754 INFO L403 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:30:09,754 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:30:09,754 INFO L85 PathProgramCache]: Analyzing trace with hash 412240398, now seen corresponding path program 4 times [2025-04-13 22:30:09,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:30:09,754 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039746352] [2025-04-13 22:30:09,754 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:30:09,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:30:09,757 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 68 statements into 2 equivalence classes. [2025-04-13 22:30:09,762 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 68 of 68 statements. [2025-04-13 22:30:09,762 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:30:09,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:30:09,859 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:30:09,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:30:09,860 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039746352] [2025-04-13 22:30:09,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039746352] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:30:09,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:30:09,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 22:30:09,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446280709] [2025-04-13 22:30:09,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:30:09,860 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 22:30:09,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:30:09,860 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 22:30:09,860 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-04-13 22:30:09,860 INFO L87 Difference]: Start difference. First operand 7815 states and 23591 transitions. Second operand has 10 states, 10 states have (on average 6.8) internal successors, (68), 10 states have internal predecessors, (68), 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:30:10,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:30:10,204 INFO L93 Difference]: Finished difference Result 8867 states and 26522 transitions. [2025-04-13 22:30:10,205 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 22:30:10,205 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.8) internal successors, (68), 10 states have internal predecessors, (68), 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 68 [2025-04-13 22:30:10,205 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:30:10,241 INFO L225 Difference]: With dead ends: 8867 [2025-04-13 22:30:10,241 INFO L226 Difference]: Without dead ends: 8703 [2025-04-13 22:30:10,244 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=214, Unknown=0, NotChecked=0, Total=306 [2025-04-13 22:30:10,244 INFO L437 NwaCegarLoop]: 11 mSDtfsCounter, 210 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 833 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 849 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 833 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:30:10,244 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 53 Invalid, 849 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 833 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:30:10,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8703 states. [2025-04-13 22:30:10,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8703 to 7811. [2025-04-13 22:30:10,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7811 states, 7810 states have (on average 3.017797695262484) internal successors, (23569), 7810 states have internal predecessors, (23569), 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:30:10,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7811 states to 7811 states and 23569 transitions. [2025-04-13 22:30:10,372 INFO L79 Accepts]: Start accepts. Automaton has 7811 states and 23569 transitions. Word has length 68 [2025-04-13 22:30:10,373 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:30:10,373 INFO L485 AbstractCegarLoop]: Abstraction has 7811 states and 23569 transitions. [2025-04-13 22:30:10,373 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.8) internal successors, (68), 10 states have internal predecessors, (68), 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:30:10,373 INFO L278 IsEmpty]: Start isEmpty. Operand 7811 states and 23569 transitions. [2025-04-13 22:30:10,382 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-04-13 22:30:10,382 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:30:10,382 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:30:10,382 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2025-04-13 22:30:10,382 INFO L403 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:30:10,382 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:30:10,382 INFO L85 PathProgramCache]: Analyzing trace with hash -1240058306, now seen corresponding path program 5 times [2025-04-13 22:30:10,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:30:10,383 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669463646] [2025-04-13 22:30:10,383 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:30:10,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:30:10,390 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 68 statements into 1 equivalence classes. [2025-04-13 22:30:10,393 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-04-13 22:30:10,393 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 22:30:10,393 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:30:10,472 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:30:10,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:30:10,472 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669463646] [2025-04-13 22:30:10,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669463646] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:30:10,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:30:10,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-13 22:30:10,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928162361] [2025-04-13 22:30:10,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:30:10,472 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 22:30:10,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:30:10,473 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 22:30:10,473 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-04-13 22:30:10,473 INFO L87 Difference]: Start difference. First operand 7811 states and 23569 transitions. Second operand has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 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:30:10,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:30:10,795 INFO L93 Difference]: Finished difference Result 8453 states and 25268 transitions. [2025-04-13 22:30:10,795 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-13 22:30:10,795 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 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 68 [2025-04-13 22:30:10,795 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:30:10,831 INFO L225 Difference]: With dead ends: 8453 [2025-04-13 22:30:10,831 INFO L226 Difference]: Without dead ends: 8297 [2025-04-13 22:30:10,833 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2025-04-13 22:30:10,833 INFO L437 NwaCegarLoop]: 11 mSDtfsCounter, 131 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 884 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 897 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 884 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:30:10,833 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 54 Invalid, 897 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 884 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:30:10,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8297 states. [2025-04-13 22:30:10,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8297 to 7859. [2025-04-13 22:30:10,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7859 states, 7858 states have (on average 3.0141257317383556) internal successors, (23685), 7858 states have internal predecessors, (23685), 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:30:10,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7859 states to 7859 states and 23685 transitions. [2025-04-13 22:30:10,944 INFO L79 Accepts]: Start accepts. Automaton has 7859 states and 23685 transitions. Word has length 68 [2025-04-13 22:30:10,944 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:30:10,944 INFO L485 AbstractCegarLoop]: Abstraction has 7859 states and 23685 transitions. [2025-04-13 22:30:10,944 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 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:30:10,944 INFO L278 IsEmpty]: Start isEmpty. Operand 7859 states and 23685 transitions. [2025-04-13 22:30:10,954 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-04-13 22:30:10,954 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:30:10,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:30:10,954 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2025-04-13 22:30:10,954 INFO L403 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:30:10,955 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:30:10,955 INFO L85 PathProgramCache]: Analyzing trace with hash 2031812654, now seen corresponding path program 5 times [2025-04-13 22:30:10,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:30:10,955 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597967329] [2025-04-13 22:30:10,955 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:30:10,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:30:10,958 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 68 statements into 1 equivalence classes. [2025-04-13 22:30:10,961 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-04-13 22:30:10,961 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 22:30:10,961 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:30:11,057 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:30:11,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:30:11,057 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597967329] [2025-04-13 22:30:11,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [597967329] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:30:11,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:30:11,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-13 22:30:11,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578734801] [2025-04-13 22:30:11,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:30:11,057 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 22:30:11,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:30:11,058 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 22:30:11,058 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-04-13 22:30:11,058 INFO L87 Difference]: Start difference. First operand 7859 states and 23685 transitions. Second operand has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 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:30:11,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:30:11,359 INFO L93 Difference]: Finished difference Result 8187 states and 24538 transitions. [2025-04-13 22:30:11,359 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-13 22:30:11,359 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 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 68 [2025-04-13 22:30:11,359 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:30:11,393 INFO L225 Difference]: With dead ends: 8187 [2025-04-13 22:30:11,394 INFO L226 Difference]: Without dead ends: 8027 [2025-04-13 22:30:11,395 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2025-04-13 22:30:11,396 INFO L437 NwaCegarLoop]: 10 mSDtfsCounter, 109 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 802 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 811 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 802 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:30:11,396 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 51 Invalid, 811 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 802 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:30:11,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8027 states. [2025-04-13 22:30:11,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8027 to 7851. [2025-04-13 22:30:11,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7851 states, 7850 states have (on average 3.0138853503184713) internal successors, (23659), 7850 states have internal predecessors, (23659), 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:30:11,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7851 states to 7851 states and 23659 transitions. [2025-04-13 22:30:11,504 INFO L79 Accepts]: Start accepts. Automaton has 7851 states and 23659 transitions. Word has length 68 [2025-04-13 22:30:11,505 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:30:11,505 INFO L485 AbstractCegarLoop]: Abstraction has 7851 states and 23659 transitions. [2025-04-13 22:30:11,505 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 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:30:11,505 INFO L278 IsEmpty]: Start isEmpty. Operand 7851 states and 23659 transitions. [2025-04-13 22:30:11,514 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-04-13 22:30:11,514 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:30:11,514 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:30:11,514 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2025-04-13 22:30:11,514 INFO L403 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:30:11,515 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:30:11,515 INFO L85 PathProgramCache]: Analyzing trace with hash 712984448, now seen corresponding path program 6 times [2025-04-13 22:30:11,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:30:11,515 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502860049] [2025-04-13 22:30:11,515 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:30:11,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:30:11,518 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 68 statements into 1 equivalence classes. [2025-04-13 22:30:11,521 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-04-13 22:30:11,521 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 22:30:11,521 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:30:11,595 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:30:11,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:30:11,595 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502860049] [2025-04-13 22:30:11,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502860049] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:30:11,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:30:11,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-13 22:30:11,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257882721] [2025-04-13 22:30:11,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:30:11,596 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 22:30:11,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:30:11,596 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 22:30:11,596 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-04-13 22:30:11,596 INFO L87 Difference]: Start difference. First operand 7851 states and 23659 transitions. Second operand has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 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:30:11,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:30:11,845 INFO L93 Difference]: Finished difference Result 8079 states and 24258 transitions. [2025-04-13 22:30:11,845 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 22:30:11,845 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 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 68 [2025-04-13 22:30:11,846 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:30:11,880 INFO L225 Difference]: With dead ends: 8079 [2025-04-13 22:30:11,880 INFO L226 Difference]: Without dead ends: 7911 [2025-04-13 22:30:11,882 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-04-13 22:30:11,882 INFO L437 NwaCegarLoop]: 9 mSDtfsCounter, 84 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 563 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 564 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 563 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:30:11,882 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 38 Invalid, 564 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 563 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:30:11,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7911 states. [2025-04-13 22:30:11,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7911 to 7847. [2025-04-13 22:30:11,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7847 states, 7846 states have (on average 3.013892429263319) internal successors, (23647), 7846 states have internal predecessors, (23647), 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:30:11,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7847 states to 7847 states and 23647 transitions. [2025-04-13 22:30:11,989 INFO L79 Accepts]: Start accepts. Automaton has 7847 states and 23647 transitions. Word has length 68 [2025-04-13 22:30:11,989 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:30:11,989 INFO L485 AbstractCegarLoop]: Abstraction has 7847 states and 23647 transitions. [2025-04-13 22:30:11,989 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 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:30:11,989 INFO L278 IsEmpty]: Start isEmpty. Operand 7847 states and 23647 transitions. [2025-04-13 22:30:11,998 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-04-13 22:30:11,998 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:30:11,998 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:30:11,998 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2025-04-13 22:30:11,999 INFO L403 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:30:11,999 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:30:11,999 INFO L85 PathProgramCache]: Analyzing trace with hash 1319120176, now seen corresponding path program 6 times [2025-04-13 22:30:11,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:30:11,999 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980280799] [2025-04-13 22:30:11,999 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:30:11,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:30:12,002 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 68 statements into 1 equivalence classes. [2025-04-13 22:30:12,005 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-04-13 22:30:12,005 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 22:30:12,005 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:30:12,081 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:30:12,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:30:12,081 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980280799] [2025-04-13 22:30:12,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980280799] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:30:12,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:30:12,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-13 22:30:12,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619035589] [2025-04-13 22:30:12,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:30:12,081 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 22:30:12,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:30:12,082 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 22:30:12,082 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-04-13 22:30:12,082 INFO L87 Difference]: Start difference. First operand 7847 states and 23647 transitions. Second operand has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 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:30:12,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:30:12,372 INFO L93 Difference]: Finished difference Result 8075 states and 24246 transitions. [2025-04-13 22:30:12,372 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 22:30:12,372 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 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 68 [2025-04-13 22:30:12,372 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:30:12,413 INFO L225 Difference]: With dead ends: 8075 [2025-04-13 22:30:12,413 INFO L226 Difference]: Without dead ends: 7903 [2025-04-13 22:30:12,415 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-04-13 22:30:12,415 INFO L437 NwaCegarLoop]: 9 mSDtfsCounter, 77 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 663 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 664 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 663 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:30:12,415 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 43 Invalid, 664 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 663 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:30:12,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7903 states. [2025-04-13 22:30:12,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7903 to 7839. [2025-04-13 22:30:12,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7839 states, 7838 states have (on average 3.014161775963256) internal successors, (23625), 7838 states have internal predecessors, (23625), 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:30:12,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7839 states to 7839 states and 23625 transitions. [2025-04-13 22:30:12,534 INFO L79 Accepts]: Start accepts. Automaton has 7839 states and 23625 transitions. Word has length 68 [2025-04-13 22:30:12,534 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:30:12,534 INFO L485 AbstractCegarLoop]: Abstraction has 7839 states and 23625 transitions. [2025-04-13 22:30:12,534 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 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:30:12,534 INFO L278 IsEmpty]: Start isEmpty. Operand 7839 states and 23625 transitions. [2025-04-13 22:30:12,544 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-04-13 22:30:12,544 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:30:12,544 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:30:12,544 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2025-04-13 22:30:12,544 INFO L403 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:30:12,544 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:30:12,545 INFO L85 PathProgramCache]: Analyzing trace with hash -239116388, now seen corresponding path program 7 times [2025-04-13 22:30:12,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:30:12,545 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507450446] [2025-04-13 22:30:12,545 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:30:12,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:30:12,548 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-04-13 22:30:12,551 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-04-13 22:30:12,551 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:30:12,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:30:12,626 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:30:12,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:30:12,627 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507450446] [2025-04-13 22:30:12,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507450446] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:30:12,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:30:12,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-13 22:30:12,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694923669] [2025-04-13 22:30:12,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:30:12,627 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 22:30:12,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:30:12,627 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 22:30:12,627 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-04-13 22:30:12,627 INFO L87 Difference]: Start difference. First operand 7839 states and 23625 transitions. Second operand has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 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:30:12,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:30:12,925 INFO L93 Difference]: Finished difference Result 8321 states and 24908 transitions. [2025-04-13 22:30:12,925 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 22:30:12,925 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 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 68 [2025-04-13 22:30:12,925 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:30:12,961 INFO L225 Difference]: With dead ends: 8321 [2025-04-13 22:30:12,961 INFO L226 Difference]: Without dead ends: 8153 [2025-04-13 22:30:12,963 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2025-04-13 22:30:12,963 INFO L437 NwaCegarLoop]: 11 mSDtfsCounter, 141 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 733 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 741 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 733 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:30:12,963 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 47 Invalid, 741 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 733 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:30:12,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8153 states. [2025-04-13 22:30:13,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8153 to 7767. [2025-04-13 22:30:13,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7767 states, 7766 states have (on average 3.0171259335565286) internal successors, (23431), 7766 states have internal predecessors, (23431), 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:30:13,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7767 states to 7767 states and 23431 transitions. [2025-04-13 22:30:13,069 INFO L79 Accepts]: Start accepts. Automaton has 7767 states and 23431 transitions. Word has length 68 [2025-04-13 22:30:13,070 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:30:13,070 INFO L485 AbstractCegarLoop]: Abstraction has 7767 states and 23431 transitions. [2025-04-13 22:30:13,070 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 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:30:13,070 INFO L278 IsEmpty]: Start isEmpty. Operand 7767 states and 23431 transitions. [2025-04-13 22:30:13,079 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-04-13 22:30:13,079 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:30:13,079 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:30:13,079 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2025-04-13 22:30:13,079 INFO L403 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:30:13,079 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:30:13,079 INFO L85 PathProgramCache]: Analyzing trace with hash 12701238, now seen corresponding path program 1 times [2025-04-13 22:30:13,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:30:13,079 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514998900] [2025-04-13 22:30:13,080 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:30:13,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:30:13,083 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-04-13 22:30:13,085 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-04-13 22:30:13,085 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:30:13,085 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:30:13,174 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:30:13,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:30:13,174 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514998900] [2025-04-13 22:30:13,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514998900] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:30:13,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:30:13,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 22:30:13,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610155732] [2025-04-13 22:30:13,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:30:13,175 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 22:30:13,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:30:13,175 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 22:30:13,175 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-04-13 22:30:13,175 INFO L87 Difference]: Start difference. First operand 7767 states and 23431 transitions. Second operand has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 9 states have internal predecessors, (69), 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:30:13,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:30:13,490 INFO L93 Difference]: Finished difference Result 9722 states and 28951 transitions. [2025-04-13 22:30:13,490 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 22:30:13,490 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 9 states have internal predecessors, (69), 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 69 [2025-04-13 22:30:13,490 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:30:13,528 INFO L225 Difference]: With dead ends: 9722 [2025-04-13 22:30:13,528 INFO L226 Difference]: Without dead ends: 9135 [2025-04-13 22:30:13,531 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=148, Unknown=0, NotChecked=0, Total=240 [2025-04-13 22:30:13,531 INFO L437 NwaCegarLoop]: 17 mSDtfsCounter, 203 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 733 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 744 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 733 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:30:13,531 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 68 Invalid, 744 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 733 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:30:13,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9135 states. [2025-04-13 22:30:13,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9135 to 7365. [2025-04-13 22:30:13,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7365 states, 7364 states have (on average 3.017925040738729) internal successors, (22224), 7364 states have internal predecessors, (22224), 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:30:13,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7365 states to 7365 states and 22224 transitions. [2025-04-13 22:30:13,642 INFO L79 Accepts]: Start accepts. Automaton has 7365 states and 22224 transitions. Word has length 69 [2025-04-13 22:30:13,643 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:30:13,643 INFO L485 AbstractCegarLoop]: Abstraction has 7365 states and 22224 transitions. [2025-04-13 22:30:13,643 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 9 states have internal predecessors, (69), 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:30:13,643 INFO L278 IsEmpty]: Start isEmpty. Operand 7365 states and 22224 transitions. [2025-04-13 22:30:13,652 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-04-13 22:30:13,652 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:30:13,652 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:30:13,652 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2025-04-13 22:30:13,652 INFO L403 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:30:13,652 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:30:13,652 INFO L85 PathProgramCache]: Analyzing trace with hash -1532895769, now seen corresponding path program 1 times [2025-04-13 22:30:13,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:30:13,652 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745582277] [2025-04-13 22:30:13,652 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:30:13,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:30:13,656 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-04-13 22:30:13,658 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-04-13 22:30:13,658 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:30:13,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:30:13,733 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:30:13,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:30:13,733 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745582277] [2025-04-13 22:30:13,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745582277] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:30:13,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:30:13,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 22:30:13,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893978909] [2025-04-13 22:30:13,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:30:13,733 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 22:30:13,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:30:13,733 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 22:30:13,733 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-04-13 22:30:13,734 INFO L87 Difference]: Start difference. First operand 7365 states and 22224 transitions. Second operand has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 9 states have internal predecessors, (69), 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:30:13,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:30:13,975 INFO L93 Difference]: Finished difference Result 8273 states and 24722 transitions. [2025-04-13 22:30:13,976 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 22:30:13,976 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 9 states have internal predecessors, (69), 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 69 [2025-04-13 22:30:13,976 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:30:14,010 INFO L225 Difference]: With dead ends: 8273 [2025-04-13 22:30:14,011 INFO L226 Difference]: Without dead ends: 8105 [2025-04-13 22:30:14,012 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2025-04-13 22:30:14,012 INFO L437 NwaCegarLoop]: 15 mSDtfsCounter, 173 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 588 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 597 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 588 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:30:14,013 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 55 Invalid, 597 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 588 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:30:14,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8105 states. [2025-04-13 22:30:14,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8105 to 7413. [2025-04-13 22:30:14,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7413 states, 7412 states have (on average 3.018348623853211) internal successors, (22372), 7412 states have internal predecessors, (22372), 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:30:14,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7413 states to 7413 states and 22372 transitions. [2025-04-13 22:30:14,117 INFO L79 Accepts]: Start accepts. Automaton has 7413 states and 22372 transitions. Word has length 69 [2025-04-13 22:30:14,117 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:30:14,117 INFO L485 AbstractCegarLoop]: Abstraction has 7413 states and 22372 transitions. [2025-04-13 22:30:14,117 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 9 states have internal predecessors, (69), 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:30:14,117 INFO L278 IsEmpty]: Start isEmpty. Operand 7413 states and 22372 transitions. [2025-04-13 22:30:14,126 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-04-13 22:30:14,126 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:30:14,126 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:30:14,126 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2025-04-13 22:30:14,126 INFO L403 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:30:14,126 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:30:14,126 INFO L85 PathProgramCache]: Analyzing trace with hash 1882174834, now seen corresponding path program 2 times [2025-04-13 22:30:14,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:30:14,126 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892938468] [2025-04-13 22:30:14,126 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:30:14,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:30:14,130 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 69 statements into 1 equivalence classes. [2025-04-13 22:30:14,132 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-04-13 22:30:14,132 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 22:30:14,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:30:14,219 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:30:14,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:30:14,219 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892938468] [2025-04-13 22:30:14,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892938468] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:30:14,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:30:14,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 22:30:14,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485405647] [2025-04-13 22:30:14,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:30:14,220 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 22:30:14,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:30:14,220 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 22:30:14,220 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-04-13 22:30:14,220 INFO L87 Difference]: Start difference. First operand 7413 states and 22372 transitions. Second operand has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 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:30:14,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:30:14,801 INFO L93 Difference]: Finished difference Result 11062 states and 32483 transitions. [2025-04-13 22:30:14,801 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-04-13 22:30:14,801 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 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 69 [2025-04-13 22:30:14,801 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:30:14,841 INFO L225 Difference]: With dead ends: 11062 [2025-04-13 22:30:14,841 INFO L226 Difference]: Without dead ends: 10317 [2025-04-13 22:30:14,845 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=194, Invalid=508, Unknown=0, NotChecked=0, Total=702 [2025-04-13 22:30:14,845 INFO L437 NwaCegarLoop]: 22 mSDtfsCounter, 328 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 1328 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 328 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 1342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:30:14,845 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [328 Valid, 121 Invalid, 1342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1328 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:30:14,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10317 states. [2025-04-13 22:30:14,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10317 to 7469. [2025-04-13 22:30:14,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7469 states, 7468 states have (on average 3.0182110337439743) internal successors, (22540), 7468 states have internal predecessors, (22540), 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:30:14,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7469 states to 7469 states and 22540 transitions. [2025-04-13 22:30:14,974 INFO L79 Accepts]: Start accepts. Automaton has 7469 states and 22540 transitions. Word has length 69 [2025-04-13 22:30:14,974 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:30:14,974 INFO L485 AbstractCegarLoop]: Abstraction has 7469 states and 22540 transitions. [2025-04-13 22:30:14,974 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 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:30:14,974 INFO L278 IsEmpty]: Start isEmpty. Operand 7469 states and 22540 transitions. [2025-04-13 22:30:14,983 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-04-13 22:30:14,983 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:30:14,983 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:30:14,983 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2025-04-13 22:30:14,983 INFO L403 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:30:14,984 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:30:14,984 INFO L85 PathProgramCache]: Analyzing trace with hash 735660387, now seen corresponding path program 2 times [2025-04-13 22:30:14,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:30:14,984 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142427898] [2025-04-13 22:30:14,984 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:30:14,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:30:14,987 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 69 statements into 1 equivalence classes. [2025-04-13 22:30:14,990 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-04-13 22:30:14,990 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 22:30:14,990 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:30:15,070 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:30:15,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:30:15,071 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142427898] [2025-04-13 22:30:15,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142427898] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:30:15,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:30:15,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 22:30:15,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260008252] [2025-04-13 22:30:15,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:30:15,071 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 22:30:15,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:30:15,071 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 22:30:15,071 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-04-13 22:30:15,071 INFO L87 Difference]: Start difference. First operand 7469 states and 22540 transitions. Second operand has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 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:30:15,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:30:15,677 INFO L93 Difference]: Finished difference Result 10641 states and 31151 transitions. [2025-04-13 22:30:15,677 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-04-13 22:30:15,677 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 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 69 [2025-04-13 22:30:15,677 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:30:15,719 INFO L225 Difference]: With dead ends: 10641 [2025-04-13 22:30:15,719 INFO L226 Difference]: Without dead ends: 9957 [2025-04-13 22:30:15,723 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=219, Invalid=593, Unknown=0, NotChecked=0, Total=812 [2025-04-13 22:30:15,723 INFO L437 NwaCegarLoop]: 24 mSDtfsCounter, 346 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 1450 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 346 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 1468 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 1450 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:30:15,723 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [346 Valid, 135 Invalid, 1468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 1450 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:30:15,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9957 states. [2025-04-13 22:30:15,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9957 to 7379. [2025-04-13 22:30:15,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7379 states, 7378 states have (on average 3.012876118189211) internal successors, (22229), 7378 states have internal predecessors, (22229), 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:30:15,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7379 states to 7379 states and 22229 transitions. [2025-04-13 22:30:15,873 INFO L79 Accepts]: Start accepts. Automaton has 7379 states and 22229 transitions. Word has length 69 [2025-04-13 22:30:15,873 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:30:15,873 INFO L485 AbstractCegarLoop]: Abstraction has 7379 states and 22229 transitions. [2025-04-13 22:30:15,873 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 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:30:15,873 INFO L278 IsEmpty]: Start isEmpty. Operand 7379 states and 22229 transitions. [2025-04-13 22:30:15,882 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-04-13 22:30:15,882 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:30:15,882 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:30:15,882 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2025-04-13 22:30:15,882 INFO L403 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:30:15,883 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:30:15,883 INFO L85 PathProgramCache]: Analyzing trace with hash -314322094, now seen corresponding path program 3 times [2025-04-13 22:30:15,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:30:15,883 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903017504] [2025-04-13 22:30:15,883 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:30:15,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:30:15,886 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 69 statements into 1 equivalence classes. [2025-04-13 22:30:15,889 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-04-13 22:30:15,889 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 22:30:15,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:30:15,978 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:30:15,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:30:15,979 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903017504] [2025-04-13 22:30:15,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903017504] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:30:15,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:30:15,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 22:30:15,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706925509] [2025-04-13 22:30:15,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:30:15,979 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 22:30:15,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:30:15,979 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 22:30:15,979 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-04-13 22:30:15,979 INFO L87 Difference]: Start difference. First operand 7379 states and 22229 transitions. Second operand has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 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:30:16,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:30:16,595 INFO L93 Difference]: Finished difference Result 11076 states and 32375 transitions. [2025-04-13 22:30:16,595 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-04-13 22:30:16,596 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 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 69 [2025-04-13 22:30:16,596 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:30:16,639 INFO L225 Difference]: With dead ends: 11076 [2025-04-13 22:30:16,640 INFO L226 Difference]: Without dead ends: 10079 [2025-04-13 22:30:16,644 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=219, Invalid=593, Unknown=0, NotChecked=0, Total=812 [2025-04-13 22:30:16,644 INFO L437 NwaCegarLoop]: 23 mSDtfsCounter, 350 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 1438 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 350 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 1454 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 1438 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 22:30:16,644 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [350 Valid, 139 Invalid, 1454 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 1438 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 22:30:16,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10079 states. [2025-04-13 22:30:16,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10079 to 7201. [2025-04-13 22:30:16,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7201 states, 7200 states have (on average 3.0030555555555556) internal successors, (21622), 7200 states have internal predecessors, (21622), 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:30:16,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7201 states to 7201 states and 21622 transitions. [2025-04-13 22:30:16,775 INFO L79 Accepts]: Start accepts. Automaton has 7201 states and 21622 transitions. Word has length 69 [2025-04-13 22:30:16,775 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:30:16,775 INFO L485 AbstractCegarLoop]: Abstraction has 7201 states and 21622 transitions. [2025-04-13 22:30:16,775 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 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:30:16,775 INFO L278 IsEmpty]: Start isEmpty. Operand 7201 states and 21622 transitions. [2025-04-13 22:30:16,784 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-04-13 22:30:16,784 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:30:16,784 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:30:16,784 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2025-04-13 22:30:16,784 INFO L403 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:30:16,784 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:30:16,784 INFO L85 PathProgramCache]: Analyzing trace with hash -520483549, now seen corresponding path program 3 times [2025-04-13 22:30:16,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:30:16,785 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126725998] [2025-04-13 22:30:16,785 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:30:16,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:30:16,788 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 69 statements into 1 equivalence classes. [2025-04-13 22:30:16,791 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-04-13 22:30:16,791 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 22:30:16,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:30:16,872 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:30:16,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:30:16,872 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126725998] [2025-04-13 22:30:16,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126725998] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:30:16,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:30:16,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 22:30:16,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104167634] [2025-04-13 22:30:16,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:30:16,872 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 22:30:16,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:30:16,873 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 22:30:16,873 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-04-13 22:30:16,873 INFO L87 Difference]: Start difference. First operand 7201 states and 21622 transitions. Second operand has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 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:30:17,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:30:17,423 INFO L93 Difference]: Finished difference Result 9793 states and 28574 transitions. [2025-04-13 22:30:17,423 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-04-13 22:30:17,423 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 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 69 [2025-04-13 22:30:17,423 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:30:17,465 INFO L225 Difference]: With dead ends: 9793 [2025-04-13 22:30:17,465 INFO L226 Difference]: Without dead ends: 9479 [2025-04-13 22:30:17,467 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=194, Invalid=508, Unknown=0, NotChecked=0, Total=702 [2025-04-13 22:30:17,468 INFO L437 NwaCegarLoop]: 23 mSDtfsCounter, 321 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 1403 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 321 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 1418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 1403 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:30:17,468 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [321 Valid, 127 Invalid, 1418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 1403 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:30:17,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9479 states. [2025-04-13 22:30:17,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9479 to 7185. [2025-04-13 22:30:17,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7185 states, 7184 states have (on average 3.0025055679287305) internal successors, (21570), 7184 states have internal predecessors, (21570), 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:30:17,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7185 states to 7185 states and 21570 transitions. [2025-04-13 22:30:17,585 INFO L79 Accepts]: Start accepts. Automaton has 7185 states and 21570 transitions. Word has length 69 [2025-04-13 22:30:17,586 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:30:17,586 INFO L485 AbstractCegarLoop]: Abstraction has 7185 states and 21570 transitions. [2025-04-13 22:30:17,586 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 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:30:17,586 INFO L278 IsEmpty]: Start isEmpty. Operand 7185 states and 21570 transitions. [2025-04-13 22:30:17,595 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-04-13 22:30:17,595 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:30:17,595 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:30:17,595 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2025-04-13 22:30:17,595 INFO L403 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:30:17,595 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:30:17,595 INFO L85 PathProgramCache]: Analyzing trace with hash -932635280, now seen corresponding path program 4 times [2025-04-13 22:30:17,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:30:17,596 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129604099] [2025-04-13 22:30:17,596 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:30:17,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:30:17,599 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 69 statements into 2 equivalence classes. [2025-04-13 22:30:17,602 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 69 of 69 statements. [2025-04-13 22:30:17,602 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:30:17,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:30:17,692 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:30:17,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:30:17,692 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129604099] [2025-04-13 22:30:17,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129604099] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:30:17,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:30:17,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 22:30:17,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201523132] [2025-04-13 22:30:17,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:30:17,693 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 22:30:17,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:30:17,693 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 22:30:17,693 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-04-13 22:30:17,693 INFO L87 Difference]: Start difference. First operand 7185 states and 21570 transitions. Second operand has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 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:30:18,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:30:18,291 INFO L93 Difference]: Finished difference Result 10274 states and 29957 transitions. [2025-04-13 22:30:18,291 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-13 22:30:18,291 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 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 69 [2025-04-13 22:30:18,292 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:30:18,331 INFO L225 Difference]: With dead ends: 10274 [2025-04-13 22:30:18,331 INFO L226 Difference]: Without dead ends: 9855 [2025-04-13 22:30:18,333 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=183, Invalid=467, Unknown=0, NotChecked=0, Total=650 [2025-04-13 22:30:18,334 INFO L437 NwaCegarLoop]: 21 mSDtfsCounter, 339 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 1578 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 339 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 1589 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1578 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 22:30:18,334 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [339 Valid, 132 Invalid, 1589 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1578 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 22:30:18,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9855 states. [2025-04-13 22:30:18,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9855 to 7142. [2025-04-13 22:30:18,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7142 states, 7141 states have (on average 2.9962190169444054) internal successors, (21396), 7141 states have internal predecessors, (21396), 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:30:18,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7142 states to 7142 states and 21396 transitions. [2025-04-13 22:30:18,480 INFO L79 Accepts]: Start accepts. Automaton has 7142 states and 21396 transitions. Word has length 69 [2025-04-13 22:30:18,481 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:30:18,481 INFO L485 AbstractCegarLoop]: Abstraction has 7142 states and 21396 transitions. [2025-04-13 22:30:18,481 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 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:30:18,481 INFO L278 IsEmpty]: Start isEmpty. Operand 7142 states and 21396 transitions. [2025-04-13 22:30:18,489 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-04-13 22:30:18,489 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:30:18,490 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:30:18,490 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2025-04-13 22:30:18,490 INFO L403 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:30:18,490 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:30:18,490 INFO L85 PathProgramCache]: Analyzing trace with hash 124354309, now seen corresponding path program 4 times [2025-04-13 22:30:18,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:30:18,490 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645082613] [2025-04-13 22:30:18,490 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:30:18,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:30:18,494 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 69 statements into 2 equivalence classes. [2025-04-13 22:30:18,497 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 69 of 69 statements. [2025-04-13 22:30:18,497 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:30:18,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:30:18,590 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:30:18,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:30:18,590 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645082613] [2025-04-13 22:30:18,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645082613] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:30:18,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:30:18,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 22:30:18,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773123239] [2025-04-13 22:30:18,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:30:18,591 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 22:30:18,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:30:18,591 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 22:30:18,591 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-04-13 22:30:18,591 INFO L87 Difference]: Start difference. First operand 7142 states and 21396 transitions. Second operand has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 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:30:19,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:30:19,188 INFO L93 Difference]: Finished difference Result 9573 states and 27923 transitions. [2025-04-13 22:30:19,188 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-13 22:30:19,188 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 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 69 [2025-04-13 22:30:19,188 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:30:19,227 INFO L225 Difference]: With dead ends: 9573 [2025-04-13 22:30:19,227 INFO L226 Difference]: Without dead ends: 9127 [2025-04-13 22:30:19,229 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=183, Invalid=467, Unknown=0, NotChecked=0, Total=650 [2025-04-13 22:30:19,230 INFO L437 NwaCegarLoop]: 23 mSDtfsCounter, 330 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 1479 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 330 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 1498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 1479 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 22:30:19,230 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [330 Valid, 139 Invalid, 1498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 1479 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 22:30:19,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9127 states. [2025-04-13 22:30:19,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9127 to 7006. [2025-04-13 22:30:19,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7006 states, 7005 states have (on average 3.0004282655246253) internal successors, (21018), 7005 states have internal predecessors, (21018), 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:30:19,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7006 states to 7006 states and 21018 transitions. [2025-04-13 22:30:19,342 INFO L79 Accepts]: Start accepts. Automaton has 7006 states and 21018 transitions. Word has length 69 [2025-04-13 22:30:19,342 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:30:19,342 INFO L485 AbstractCegarLoop]: Abstraction has 7006 states and 21018 transitions. [2025-04-13 22:30:19,342 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 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:30:19,342 INFO L278 IsEmpty]: Start isEmpty. Operand 7006 states and 21018 transitions. [2025-04-13 22:30:19,351 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-04-13 22:30:19,351 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:30:19,351 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:30:19,351 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2025-04-13 22:30:19,351 INFO L403 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:30:19,351 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:30:19,351 INFO L85 PathProgramCache]: Analyzing trace with hash 1025209971, now seen corresponding path program 1 times [2025-04-13 22:30:19,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:30:19,351 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624439028] [2025-04-13 22:30:19,351 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:30:19,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:30:19,355 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-04-13 22:30:19,357 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-04-13 22:30:19,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:30:19,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:30:19,441 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:30:19,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:30:19,441 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624439028] [2025-04-13 22:30:19,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624439028] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:30:19,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:30:19,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 22:30:19,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026534422] [2025-04-13 22:30:19,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:30:19,441 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 22:30:19,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:30:19,442 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 22:30:19,442 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-04-13 22:30:19,442 INFO L87 Difference]: Start difference. First operand 7006 states and 21018 transitions. Second operand has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 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:30:19,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:30:19,787 INFO L93 Difference]: Finished difference Result 7944 states and 23660 transitions. [2025-04-13 22:30:19,787 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 22:30:19,788 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 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 69 [2025-04-13 22:30:19,788 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:30:19,825 INFO L225 Difference]: With dead ends: 7944 [2025-04-13 22:30:19,825 INFO L226 Difference]: Without dead ends: 7648 [2025-04-13 22:30:19,827 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=110, Invalid=310, Unknown=0, NotChecked=0, Total=420 [2025-04-13 22:30:19,827 INFO L437 NwaCegarLoop]: 18 mSDtfsCounter, 179 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 857 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 862 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 857 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:30:19,827 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 84 Invalid, 862 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 857 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:30:19,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7648 states. [2025-04-13 22:30:19,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7648 to 7054. [2025-04-13 22:30:19,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7054 states, 7053 states have (on average 2.9998582163618317) internal successors, (21158), 7053 states have internal predecessors, (21158), 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:30:19,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7054 states to 7054 states and 21158 transitions. [2025-04-13 22:30:19,932 INFO L79 Accepts]: Start accepts. Automaton has 7054 states and 21158 transitions. Word has length 69 [2025-04-13 22:30:19,932 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:30:19,932 INFO L485 AbstractCegarLoop]: Abstraction has 7054 states and 21158 transitions. [2025-04-13 22:30:19,932 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 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:30:19,932 INFO L278 IsEmpty]: Start isEmpty. Operand 7054 states and 21158 transitions. [2025-04-13 22:30:19,941 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-04-13 22:30:19,941 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:30:19,941 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:30:19,941 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2025-04-13 22:30:19,941 INFO L403 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:30:19,941 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:30:19,941 INFO L85 PathProgramCache]: Analyzing trace with hash 1164015217, now seen corresponding path program 2 times [2025-04-13 22:30:19,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:30:19,941 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872222188] [2025-04-13 22:30:19,942 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:30:19,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:30:19,945 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 69 statements into 1 equivalence classes. [2025-04-13 22:30:19,947 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-04-13 22:30:19,947 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 22:30:19,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:30:20,033 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:30:20,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:30:20,034 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872222188] [2025-04-13 22:30:20,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872222188] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:30:20,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:30:20,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 22:30:20,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852379817] [2025-04-13 22:30:20,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:30:20,034 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 22:30:20,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:30:20,034 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 22:30:20,034 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-04-13 22:30:20,035 INFO L87 Difference]: Start difference. First operand 7054 states and 21158 transitions. Second operand has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 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:30:20,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:30:20,399 INFO L93 Difference]: Finished difference Result 7976 states and 23748 transitions. [2025-04-13 22:30:20,399 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 22:30:20,399 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 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 69 [2025-04-13 22:30:20,400 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:30:20,441 INFO L225 Difference]: With dead ends: 7976 [2025-04-13 22:30:20,441 INFO L226 Difference]: Without dead ends: 7680 [2025-04-13 22:30:20,443 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=110, Invalid=310, Unknown=0, NotChecked=0, Total=420 [2025-04-13 22:30:20,443 INFO L437 NwaCegarLoop]: 18 mSDtfsCounter, 169 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 948 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 953 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 948 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:30:20,443 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 92 Invalid, 953 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 948 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:30:20,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7680 states. [2025-04-13 22:30:20,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7680 to 7086. [2025-04-13 22:30:20,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7086 states, 7085 states have (on average 2.998729710656316) internal successors, (21246), 7085 states have internal predecessors, (21246), 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:30:20,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7086 states to 7086 states and 21246 transitions. [2025-04-13 22:30:20,546 INFO L79 Accepts]: Start accepts. Automaton has 7086 states and 21246 transitions. Word has length 69 [2025-04-13 22:30:20,546 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:30:20,547 INFO L485 AbstractCegarLoop]: Abstraction has 7086 states and 21246 transitions. [2025-04-13 22:30:20,547 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 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:30:20,547 INFO L278 IsEmpty]: Start isEmpty. Operand 7086 states and 21246 transitions. [2025-04-13 22:30:20,555 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-04-13 22:30:20,555 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:30:20,555 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:30:20,555 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2025-04-13 22:30:20,555 INFO L403 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:30:20,556 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:30:20,556 INFO L85 PathProgramCache]: Analyzing trace with hash -979395501, now seen corresponding path program 3 times [2025-04-13 22:30:20,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:30:20,556 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268514733] [2025-04-13 22:30:20,556 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:30:20,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:30:20,559 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 69 statements into 1 equivalence classes. [2025-04-13 22:30:20,562 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-04-13 22:30:20,562 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 22:30:20,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:30:20,673 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:30:20,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:30:20,673 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268514733] [2025-04-13 22:30:20,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268514733] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:30:20,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:30:20,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 22:30:20,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681178028] [2025-04-13 22:30:20,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:30:20,673 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 22:30:20,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:30:20,674 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 22:30:20,674 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-04-13 22:30:20,674 INFO L87 Difference]: Start difference. First operand 7086 states and 21246 transitions. Second operand has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 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:30:21,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:30:21,030 INFO L93 Difference]: Finished difference Result 7976 states and 23732 transitions. [2025-04-13 22:30:21,030 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 22:30:21,030 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 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 69 [2025-04-13 22:30:21,030 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:30:21,071 INFO L225 Difference]: With dead ends: 7976 [2025-04-13 22:30:21,071 INFO L226 Difference]: Without dead ends: 7664 [2025-04-13 22:30:21,073 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=115, Invalid=305, Unknown=0, NotChecked=0, Total=420 [2025-04-13 22:30:21,073 INFO L437 NwaCegarLoop]: 17 mSDtfsCounter, 175 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 864 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 869 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 864 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:30:21,073 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 80 Invalid, 869 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 864 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:30:21,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7664 states. [2025-04-13 22:30:21,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7664 to 7070. [2025-04-13 22:30:21,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7070 states, 7069 states have (on average 2.9981609845805632) internal successors, (21194), 7069 states have internal predecessors, (21194), 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:30:21,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7070 states to 7070 states and 21194 transitions. [2025-04-13 22:30:21,190 INFO L79 Accepts]: Start accepts. Automaton has 7070 states and 21194 transitions. Word has length 69 [2025-04-13 22:30:21,190 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:30:21,190 INFO L485 AbstractCegarLoop]: Abstraction has 7070 states and 21194 transitions. [2025-04-13 22:30:21,190 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 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:30:21,191 INFO L278 IsEmpty]: Start isEmpty. Operand 7070 states and 21194 transitions. [2025-04-13 22:30:21,199 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-04-13 22:30:21,199 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:30:21,200 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:30:21,200 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2025-04-13 22:30:21,200 INFO L403 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:30:21,200 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:30:21,200 INFO L85 PathProgramCache]: Analyzing trace with hash -1126346607, now seen corresponding path program 4 times [2025-04-13 22:30:21,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:30:21,200 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117905891] [2025-04-13 22:30:21,200 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:30:21,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:30:21,203 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 69 statements into 2 equivalence classes. [2025-04-13 22:30:21,207 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 69 of 69 statements. [2025-04-13 22:30:21,207 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:30:21,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:30:21,318 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:30:21,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:30:21,318 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117905891] [2025-04-13 22:30:21,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117905891] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:30:21,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:30:21,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 22:30:21,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968277211] [2025-04-13 22:30:21,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:30:21,318 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 22:30:21,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:30:21,319 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 22:30:21,319 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-04-13 22:30:21,319 INFO L87 Difference]: Start difference. First operand 7070 states and 21194 transitions. Second operand has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 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:30:21,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:30:21,788 INFO L93 Difference]: Finished difference Result 8080 states and 23964 transitions. [2025-04-13 22:30:21,788 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-13 22:30:21,788 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 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 69 [2025-04-13 22:30:21,788 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:30:21,823 INFO L225 Difference]: With dead ends: 8080 [2025-04-13 22:30:21,823 INFO L226 Difference]: Without dead ends: 7702 [2025-04-13 22:30:21,825 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=164, Invalid=436, Unknown=0, NotChecked=0, Total=600 [2025-04-13 22:30:21,825 INFO L437 NwaCegarLoop]: 20 mSDtfsCounter, 190 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 1107 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 1130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:30:21,825 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 109 Invalid, 1130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1107 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:30:21,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7702 states. [2025-04-13 22:30:21,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7702 to 7054. [2025-04-13 22:30:21,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7054 states, 7053 states have (on average 2.9975896781511415) internal successors, (21142), 7053 states have internal predecessors, (21142), 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:30:21,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7054 states to 7054 states and 21142 transitions. [2025-04-13 22:30:21,927 INFO L79 Accepts]: Start accepts. Automaton has 7054 states and 21142 transitions. Word has length 69 [2025-04-13 22:30:21,927 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:30:21,927 INFO L485 AbstractCegarLoop]: Abstraction has 7054 states and 21142 transitions. [2025-04-13 22:30:21,927 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 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:30:21,927 INFO L278 IsEmpty]: Start isEmpty. Operand 7054 states and 21142 transitions. [2025-04-13 22:30:21,942 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-04-13 22:30:21,942 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:30:21,942 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:30:21,943 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2025-04-13 22:30:21,943 INFO L403 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:30:21,943 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:30:21,943 INFO L85 PathProgramCache]: Analyzing trace with hash 1822086897, now seen corresponding path program 5 times [2025-04-13 22:30:21,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:30:21,943 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731843292] [2025-04-13 22:30:21,943 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:30:21,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:30:21,946 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 69 statements into 1 equivalence classes. [2025-04-13 22:30:21,949 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-04-13 22:30:21,949 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 22:30:21,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:30:22,037 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:30:22,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:30:22,038 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731843292] [2025-04-13 22:30:22,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1731843292] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:30:22,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:30:22,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 22:30:22,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827646249] [2025-04-13 22:30:22,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:30:22,038 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 22:30:22,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:30:22,038 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 22:30:22,038 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-04-13 22:30:22,038 INFO L87 Difference]: Start difference. First operand 7054 states and 21142 transitions. Second operand has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 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:30:22,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:30:22,455 INFO L93 Difference]: Finished difference Result 8192 states and 24310 transitions. [2025-04-13 22:30:22,456 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-13 22:30:22,456 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 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 69 [2025-04-13 22:30:22,456 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:30:22,492 INFO L225 Difference]: With dead ends: 8192 [2025-04-13 22:30:22,492 INFO L226 Difference]: Without dead ends: 7832 [2025-04-13 22:30:22,494 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=121, Invalid=341, Unknown=0, NotChecked=0, Total=462 [2025-04-13 22:30:22,494 INFO L437 NwaCegarLoop]: 18 mSDtfsCounter, 189 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 1093 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 1098 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1093 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:30:22,494 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 106 Invalid, 1098 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1093 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:30:22,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7832 states. [2025-04-13 22:30:22,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7832 to 7038. [2025-04-13 22:30:22,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7038 states, 7037 states have (on average 2.9970157737672305) internal successors, (21090), 7037 states have internal predecessors, (21090), 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:30:22,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7038 states to 7038 states and 21090 transitions. [2025-04-13 22:30:22,597 INFO L79 Accepts]: Start accepts. Automaton has 7038 states and 21090 transitions. Word has length 69 [2025-04-13 22:30:22,597 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:30:22,597 INFO L485 AbstractCegarLoop]: Abstraction has 7038 states and 21090 transitions. [2025-04-13 22:30:22,597 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 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:30:22,597 INFO L278 IsEmpty]: Start isEmpty. Operand 7038 states and 21090 transitions. [2025-04-13 22:30:22,605 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-04-13 22:30:22,606 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:30:22,606 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:30:22,606 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2025-04-13 22:30:22,606 INFO L403 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:30:22,606 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:30:22,606 INFO L85 PathProgramCache]: Analyzing trace with hash -2065562833, now seen corresponding path program 6 times [2025-04-13 22:30:22,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:30:22,606 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057490525] [2025-04-13 22:30:22,606 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:30:22,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:30:22,610 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 69 statements into 1 equivalence classes. [2025-04-13 22:30:22,612 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-04-13 22:30:22,612 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 22:30:22,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:30:22,698 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:30:22,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:30:22,699 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057490525] [2025-04-13 22:30:22,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057490525] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:30:22,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:30:22,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 22:30:22,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984717692] [2025-04-13 22:30:22,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:30:22,699 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 22:30:22,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:30:22,699 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 22:30:22,699 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-04-13 22:30:22,699 INFO L87 Difference]: Start difference. First operand 7038 states and 21090 transitions. Second operand has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 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:30:23,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:30:23,122 INFO L93 Difference]: Finished difference Result 8176 states and 24258 transitions. [2025-04-13 22:30:23,122 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-13 22:30:23,122 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 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 69 [2025-04-13 22:30:23,122 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:30:23,158 INFO L225 Difference]: With dead ends: 8176 [2025-04-13 22:30:23,158 INFO L226 Difference]: Without dead ends: 7816 [2025-04-13 22:30:23,160 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=123, Invalid=339, Unknown=0, NotChecked=0, Total=462 [2025-04-13 22:30:23,161 INFO L437 NwaCegarLoop]: 18 mSDtfsCounter, 193 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 1077 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 1082 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1077 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:30:23,161 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 106 Invalid, 1082 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1077 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:30:23,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7816 states. [2025-04-13 22:30:23,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7816 to 7022. [2025-04-13 22:30:23,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7022 states, 7021 states have (on average 2.996439253667569) internal successors, (21038), 7021 states have internal predecessors, (21038), 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:30:23,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7022 states to 7022 states and 21038 transitions. [2025-04-13 22:30:23,293 INFO L79 Accepts]: Start accepts. Automaton has 7022 states and 21038 transitions. Word has length 69 [2025-04-13 22:30:23,293 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:30:23,293 INFO L485 AbstractCegarLoop]: Abstraction has 7022 states and 21038 transitions. [2025-04-13 22:30:23,293 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 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:30:23,293 INFO L278 IsEmpty]: Start isEmpty. Operand 7022 states and 21038 transitions. [2025-04-13 22:30:23,302 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-04-13 22:30:23,302 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:30:23,302 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:30:23,302 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2025-04-13 22:30:23,302 INFO L403 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:30:23,302 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:30:23,303 INFO L85 PathProgramCache]: Analyzing trace with hash -1255300013, now seen corresponding path program 7 times [2025-04-13 22:30:23,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:30:23,303 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132610276] [2025-04-13 22:30:23,303 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:30:23,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:30:23,306 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-04-13 22:30:23,308 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-04-13 22:30:23,308 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:30:23,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:30:23,386 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:30:23,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:30:23,386 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132610276] [2025-04-13 22:30:23,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [132610276] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:30:23,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:30:23,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 22:30:23,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416529450] [2025-04-13 22:30:23,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:30:23,387 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 22:30:23,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:30:23,387 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 22:30:23,387 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-04-13 22:30:23,387 INFO L87 Difference]: Start difference. First operand 7022 states and 21038 transitions. Second operand has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 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:30:23,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:30:23,761 INFO L93 Difference]: Finished difference Result 7928 states and 23576 transitions. [2025-04-13 22:30:23,761 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 22:30:23,761 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 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 69 [2025-04-13 22:30:23,761 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:30:23,797 INFO L225 Difference]: With dead ends: 7928 [2025-04-13 22:30:23,798 INFO L226 Difference]: Without dead ends: 7632 [2025-04-13 22:30:23,799 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=115, Invalid=305, Unknown=0, NotChecked=0, Total=420 [2025-04-13 22:30:23,800 INFO L437 NwaCegarLoop]: 17 mSDtfsCounter, 170 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 966 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 971 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 966 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:30:23,800 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 87 Invalid, 971 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 966 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:30:23,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7632 states. [2025-04-13 22:30:23,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7632 to 7054. [2025-04-13 22:30:23,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7054 states, 7053 states have (on average 2.995321139940451) internal successors, (21126), 7053 states have internal predecessors, (21126), 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:30:23,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7054 states to 7054 states and 21126 transitions. [2025-04-13 22:30:23,900 INFO L79 Accepts]: Start accepts. Automaton has 7054 states and 21126 transitions. Word has length 69 [2025-04-13 22:30:23,901 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:30:23,901 INFO L485 AbstractCegarLoop]: Abstraction has 7054 states and 21126 transitions. [2025-04-13 22:30:23,901 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 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:30:23,901 INFO L278 IsEmpty]: Start isEmpty. Operand 7054 states and 21126 transitions. [2025-04-13 22:30:23,909 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-04-13 22:30:23,909 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:30:23,909 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:30:23,909 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2025-04-13 22:30:23,909 INFO L403 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:30:23,909 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:30:23,909 INFO L85 PathProgramCache]: Analyzing trace with hash -850442095, now seen corresponding path program 8 times [2025-04-13 22:30:23,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:30:23,910 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423239388] [2025-04-13 22:30:23,910 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:30:23,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:30:23,913 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 69 statements into 1 equivalence classes. [2025-04-13 22:30:23,915 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-04-13 22:30:23,915 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 22:30:23,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:30:23,994 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:30:23,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:30:23,994 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423239388] [2025-04-13 22:30:23,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423239388] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:30:23,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:30:23,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 22:30:23,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293836490] [2025-04-13 22:30:23,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:30:23,994 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 22:30:23,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:30:23,994 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 22:30:23,995 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-04-13 22:30:23,995 INFO L87 Difference]: Start difference. First operand 7054 states and 21126 transitions. Second operand has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 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:30:24,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:30:24,340 INFO L93 Difference]: Finished difference Result 7948 states and 23624 transitions. [2025-04-13 22:30:24,340 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 22:30:24,340 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 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 69 [2025-04-13 22:30:24,340 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:30:24,378 INFO L225 Difference]: With dead ends: 7948 [2025-04-13 22:30:24,378 INFO L226 Difference]: Without dead ends: 7652 [2025-04-13 22:30:24,380 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=115, Invalid=305, Unknown=0, NotChecked=0, Total=420 [2025-04-13 22:30:24,380 INFO L437 NwaCegarLoop]: 17 mSDtfsCounter, 176 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 863 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 868 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 863 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:30:24,380 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 80 Invalid, 868 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 863 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:30:24,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7652 states. [2025-04-13 22:30:24,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7652 to 7086. [2025-04-13 22:30:24,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7086 states, 7085 states have (on average 2.994213126323218) internal successors, (21214), 7085 states have internal predecessors, (21214), 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:30:24,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7086 states to 7086 states and 21214 transitions. [2025-04-13 22:30:24,483 INFO L79 Accepts]: Start accepts. Automaton has 7086 states and 21214 transitions. Word has length 69 [2025-04-13 22:30:24,483 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:30:24,484 INFO L485 AbstractCegarLoop]: Abstraction has 7086 states and 21214 transitions. [2025-04-13 22:30:24,484 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 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:30:24,484 INFO L278 IsEmpty]: Start isEmpty. Operand 7086 states and 21214 transitions. [2025-04-13 22:30:24,492 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-04-13 22:30:24,492 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:30:24,492 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:30:24,492 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2025-04-13 22:30:24,492 INFO L403 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:30:24,492 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:30:24,492 INFO L85 PathProgramCache]: Analyzing trace with hash 1035061811, now seen corresponding path program 9 times [2025-04-13 22:30:24,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:30:24,492 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814125482] [2025-04-13 22:30:24,492 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:30:24,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:30:24,496 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 69 statements into 1 equivalence classes. [2025-04-13 22:30:24,498 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-04-13 22:30:24,498 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 22:30:24,498 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:30:24,581 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:30:24,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:30:24,582 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814125482] [2025-04-13 22:30:24,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814125482] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:30:24,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:30:24,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 22:30:24,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835320039] [2025-04-13 22:30:24,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:30:24,582 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 22:30:24,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:30:24,582 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 22:30:24,582 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-04-13 22:30:24,582 INFO L87 Difference]: Start difference. First operand 7086 states and 21214 transitions. Second operand has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 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:30:24,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:30:24,952 INFO L93 Difference]: Finished difference Result 7948 states and 23608 transitions. [2025-04-13 22:30:24,952 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 22:30:24,952 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 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 69 [2025-04-13 22:30:24,952 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:30:24,989 INFO L225 Difference]: With dead ends: 7948 [2025-04-13 22:30:24,989 INFO L226 Difference]: Without dead ends: 7636 [2025-04-13 22:30:24,991 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=110, Invalid=310, Unknown=0, NotChecked=0, Total=420 [2025-04-13 22:30:24,992 INFO L437 NwaCegarLoop]: 18 mSDtfsCounter, 171 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 955 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 960 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 955 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:30:24,992 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 92 Invalid, 960 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 955 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:30:24,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7636 states. [2025-04-13 22:30:25,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7636 to 7070. [2025-04-13 22:30:25,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7070 states, 7069 states have (on average 2.9936341773942567) internal successors, (21162), 7069 states have internal predecessors, (21162), 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:30:25,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7070 states to 7070 states and 21162 transitions. [2025-04-13 22:30:25,099 INFO L79 Accepts]: Start accepts. Automaton has 7070 states and 21162 transitions. Word has length 69 [2025-04-13 22:30:25,099 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:30:25,099 INFO L485 AbstractCegarLoop]: Abstraction has 7070 states and 21162 transitions. [2025-04-13 22:30:25,100 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 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:30:25,100 INFO L278 IsEmpty]: Start isEmpty. Operand 7070 states and 21162 transitions. [2025-04-13 22:30:25,108 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-04-13 22:30:25,108 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:30:25,108 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:30:25,108 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2025-04-13 22:30:25,109 INFO L403 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:30:25,109 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:30:25,109 INFO L85 PathProgramCache]: Analyzing trace with hash 1154163377, now seen corresponding path program 10 times [2025-04-13 22:30:25,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:30:25,109 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051367770] [2025-04-13 22:30:25,109 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:30:25,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:30:25,112 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 69 statements into 2 equivalence classes. [2025-04-13 22:30:25,116 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 69 of 69 statements. [2025-04-13 22:30:25,116 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:30:25,116 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:30:25,207 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:30:25,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:30:25,207 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051367770] [2025-04-13 22:30:25,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051367770] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:30:25,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:30:25,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 22:30:25,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559720171] [2025-04-13 22:30:25,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:30:25,207 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 22:30:25,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:30:25,208 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 22:30:25,208 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-04-13 22:30:25,208 INFO L87 Difference]: Start difference. First operand 7070 states and 21162 transitions. Second operand has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 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:30:25,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:30:25,598 INFO L93 Difference]: Finished difference Result 8016 states and 23732 transitions. [2025-04-13 22:30:25,599 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-13 22:30:25,599 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 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 69 [2025-04-13 22:30:25,599 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:30:25,634 INFO L225 Difference]: With dead ends: 8016 [2025-04-13 22:30:25,634 INFO L226 Difference]: Without dead ends: 7638 [2025-04-13 22:30:25,636 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=158, Invalid=394, Unknown=0, NotChecked=0, Total=552 [2025-04-13 22:30:25,637 INFO L437 NwaCegarLoop]: 21 mSDtfsCounter, 187 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 728 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 747 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 728 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:30:25,637 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 79 Invalid, 747 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 728 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:30:25,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7638 states. [2025-04-13 22:30:25,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7638 to 7054. [2025-04-13 22:30:25,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7054 states, 7053 states have (on average 2.9930526017297603) internal successors, (21110), 7053 states have internal predecessors, (21110), 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:30:25,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7054 states to 7054 states and 21110 transitions. [2025-04-13 22:30:25,750 INFO L79 Accepts]: Start accepts. Automaton has 7054 states and 21110 transitions. Word has length 69 [2025-04-13 22:30:25,750 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:30:25,750 INFO L485 AbstractCegarLoop]: Abstraction has 7054 states and 21110 transitions. [2025-04-13 22:30:25,750 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 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:30:25,750 INFO L278 IsEmpty]: Start isEmpty. Operand 7054 states and 21110 transitions. [2025-04-13 22:30:25,759 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-04-13 22:30:25,759 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:30:25,759 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:30:25,759 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2025-04-13 22:30:25,759 INFO L403 AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:30:25,760 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:30:25,760 INFO L85 PathProgramCache]: Analyzing trace with hash 2100451057, now seen corresponding path program 11 times [2025-04-13 22:30:25,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:30:25,760 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152308990] [2025-04-13 22:30:25,760 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:30:25,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:30:25,763 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 69 statements into 1 equivalence classes. [2025-04-13 22:30:25,766 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-04-13 22:30:25,766 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 22:30:25,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:30:25,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:30:25,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:30:25,846 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152308990] [2025-04-13 22:30:25,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152308990] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:30:25,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:30:25,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 22:30:25,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623942639] [2025-04-13 22:30:25,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:30:25,846 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 22:30:25,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:30:25,846 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 22:30:25,846 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-04-13 22:30:25,846 INFO L87 Difference]: Start difference. First operand 7054 states and 21110 transitions. Second operand has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 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:30:26,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:30:26,265 INFO L93 Difference]: Finished difference Result 8116 states and 24046 transitions. [2025-04-13 22:30:26,265 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-13 22:30:26,266 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 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 69 [2025-04-13 22:30:26,266 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:30:26,303 INFO L225 Difference]: With dead ends: 8116 [2025-04-13 22:30:26,303 INFO L226 Difference]: Without dead ends: 7740 [2025-04-13 22:30:26,305 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=123, Invalid=339, Unknown=0, NotChecked=0, Total=462 [2025-04-13 22:30:26,305 INFO L437 NwaCegarLoop]: 18 mSDtfsCounter, 186 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 1106 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 1111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:30:26,305 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 107 Invalid, 1111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1106 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:30:26,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7740 states. [2025-04-13 22:30:26,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7740 to 7022. [2025-04-13 22:30:26,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7022 states, 7021 states have (on average 2.9947300954280016) internal successors, (21026), 7021 states have internal predecessors, (21026), 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:30:26,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7022 states to 7022 states and 21026 transitions. [2025-04-13 22:30:26,408 INFO L79 Accepts]: Start accepts. Automaton has 7022 states and 21026 transitions. Word has length 69 [2025-04-13 22:30:26,408 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:30:26,408 INFO L485 AbstractCegarLoop]: Abstraction has 7022 states and 21026 transitions. [2025-04-13 22:30:26,408 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 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:30:26,409 INFO L278 IsEmpty]: Start isEmpty. Operand 7022 states and 21026 transitions. [2025-04-13 22:30:26,417 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-04-13 22:30:26,417 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:30:26,417 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:30:26,417 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2025-04-13 22:30:26,417 INFO L403 AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:30:26,418 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:30:26,418 INFO L85 PathProgramCache]: Analyzing trace with hash 1951040303, now seen corresponding path program 12 times [2025-04-13 22:30:26,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:30:26,418 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898940902] [2025-04-13 22:30:26,418 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:30:26,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:30:26,421 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 69 statements into 1 equivalence classes. [2025-04-13 22:30:26,424 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-04-13 22:30:26,424 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 22:30:26,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:30:26,504 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:30:26,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:30:26,504 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898940902] [2025-04-13 22:30:26,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898940902] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:30:26,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:30:26,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 22:30:26,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687548791] [2025-04-13 22:30:26,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:30:26,504 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 22:30:26,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:30:26,505 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 22:30:26,505 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-04-13 22:30:26,505 INFO L87 Difference]: Start difference. First operand 7022 states and 21026 transitions. Second operand has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 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:30:26,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:30:26,915 INFO L93 Difference]: Finished difference Result 8048 states and 23854 transitions. [2025-04-13 22:30:26,915 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-13 22:30:26,915 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 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 69 [2025-04-13 22:30:26,915 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:30:26,952 INFO L225 Difference]: With dead ends: 8048 [2025-04-13 22:30:26,952 INFO L226 Difference]: Without dead ends: 7672 [2025-04-13 22:30:26,954 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=121, Invalid=341, Unknown=0, NotChecked=0, Total=462 [2025-04-13 22:30:26,954 INFO L437 NwaCegarLoop]: 18 mSDtfsCounter, 180 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 1115 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 1120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:30:26,954 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 107 Invalid, 1120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1115 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:30:26,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7672 states. [2025-04-13 22:30:27,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7672 to 6990. [2025-04-13 22:30:27,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6990 states, 6989 states have (on average 2.996422950350551) internal successors, (20942), 6989 states have internal predecessors, (20942), 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:30:27,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6990 states to 6990 states and 20942 transitions. [2025-04-13 22:30:27,057 INFO L79 Accepts]: Start accepts. Automaton has 6990 states and 20942 transitions. Word has length 69 [2025-04-13 22:30:27,057 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:30:27,057 INFO L485 AbstractCegarLoop]: Abstraction has 6990 states and 20942 transitions. [2025-04-13 22:30:27,058 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 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:30:27,058 INFO L278 IsEmpty]: Start isEmpty. Operand 6990 states and 20942 transitions. [2025-04-13 22:30:27,066 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-04-13 22:30:27,066 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:30:27,066 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:30:27,066 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2025-04-13 22:30:27,066 INFO L403 AbstractCegarLoop]: === Iteration 67 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:30:27,066 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:30:27,066 INFO L85 PathProgramCache]: Analyzing trace with hash 1637971599, now seen corresponding path program 13 times [2025-04-13 22:30:27,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:30:27,066 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29193068] [2025-04-13 22:30:27,067 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:30:27,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:30:27,070 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-04-13 22:30:27,072 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-04-13 22:30:27,072 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:30:27,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:30:27,152 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:30:27,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:30:27,153 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29193068] [2025-04-13 22:30:27,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [29193068] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:30:27,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:30:27,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 22:30:27,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005527272] [2025-04-13 22:30:27,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:30:27,153 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 22:30:27,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:30:27,153 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 22:30:27,153 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-04-13 22:30:27,153 INFO L87 Difference]: Start difference. First operand 6990 states and 20942 transitions. Second operand has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 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:30:27,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:30:27,454 INFO L93 Difference]: Finished difference Result 7564 states and 22542 transitions. [2025-04-13 22:30:27,454 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-13 22:30:27,454 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 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 69 [2025-04-13 22:30:27,454 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:30:27,490 INFO L225 Difference]: With dead ends: 7564 [2025-04-13 22:30:27,490 INFO L226 Difference]: Without dead ends: 7268 [2025-04-13 22:30:27,492 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2025-04-13 22:30:27,492 INFO L437 NwaCegarLoop]: 17 mSDtfsCounter, 163 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 797 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 802 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 797 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:30:27,492 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 82 Invalid, 802 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 797 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:30:27,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7268 states. [2025-04-13 22:30:27,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7268 to 7010. [2025-04-13 22:30:27,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7010 states, 7009 states have (on average 2.9947210729062634) internal successors, (20990), 7009 states have internal predecessors, (20990), 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:30:27,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7010 states to 7010 states and 20990 transitions. [2025-04-13 22:30:27,593 INFO L79 Accepts]: Start accepts. Automaton has 7010 states and 20990 transitions. Word has length 69 [2025-04-13 22:30:27,593 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:30:27,593 INFO L485 AbstractCegarLoop]: Abstraction has 7010 states and 20990 transitions. [2025-04-13 22:30:27,593 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 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:30:27,593 INFO L278 IsEmpty]: Start isEmpty. Operand 7010 states and 20990 transitions. [2025-04-13 22:30:27,601 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-04-13 22:30:27,601 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:30:27,601 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:30:27,602 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2025-04-13 22:30:27,602 INFO L403 AbstractCegarLoop]: === Iteration 68 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:30:27,602 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:30:27,602 INFO L85 PathProgramCache]: Analyzing trace with hash 2119078605, now seen corresponding path program 14 times [2025-04-13 22:30:27,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:30:27,602 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530255066] [2025-04-13 22:30:27,602 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:30:27,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:30:27,605 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 69 statements into 1 equivalence classes. [2025-04-13 22:30:27,608 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-04-13 22:30:27,608 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 22:30:27,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:30:27,707 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:30:27,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:30:27,707 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530255066] [2025-04-13 22:30:27,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1530255066] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:30:27,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:30:27,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 22:30:27,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938494202] [2025-04-13 22:30:27,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:30:27,708 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 22:30:27,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:30:27,708 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 22:30:27,708 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-04-13 22:30:27,708 INFO L87 Difference]: Start difference. First operand 7010 states and 20990 transitions. Second operand has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 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:30:28,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:30:28,040 INFO L93 Difference]: Finished difference Result 7572 states and 22550 transitions. [2025-04-13 22:30:28,040 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-13 22:30:28,040 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 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 69 [2025-04-13 22:30:28,040 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:30:28,075 INFO L225 Difference]: With dead ends: 7572 [2025-04-13 22:30:28,075 INFO L226 Difference]: Without dead ends: 7276 [2025-04-13 22:30:28,077 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2025-04-13 22:30:28,077 INFO L437 NwaCegarLoop]: 17 mSDtfsCounter, 158 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 924 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 929 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 924 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:30:28,077 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 95 Invalid, 929 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 924 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:30:28,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7276 states. [2025-04-13 22:30:28,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7276 to 7030. [2025-04-13 22:30:28,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7030 states, 7029 states have (on average 2.993028880352824) internal successors, (21038), 7029 states have internal predecessors, (21038), 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:30:28,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7030 states to 7030 states and 21038 transitions. [2025-04-13 22:30:28,185 INFO L79 Accepts]: Start accepts. Automaton has 7030 states and 21038 transitions. Word has length 69 [2025-04-13 22:30:28,185 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:30:28,185 INFO L485 AbstractCegarLoop]: Abstraction has 7030 states and 21038 transitions. [2025-04-13 22:30:28,185 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 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:30:28,185 INFO L278 IsEmpty]: Start isEmpty. Operand 7030 states and 21038 transitions. [2025-04-13 22:30:28,194 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-04-13 22:30:28,194 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:30:28,194 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:30:28,194 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2025-04-13 22:30:28,194 INFO L403 AbstractCegarLoop]: === Iteration 69 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:30:28,195 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:30:28,195 INFO L85 PathProgramCache]: Analyzing trace with hash -366633873, now seen corresponding path program 15 times [2025-04-13 22:30:28,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:30:28,195 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696445497] [2025-04-13 22:30:28,195 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:30:28,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:30:28,198 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 69 statements into 1 equivalence classes. [2025-04-13 22:30:28,201 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-04-13 22:30:28,201 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 22:30:28,201 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:30:28,287 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:30:28,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:30:28,287 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696445497] [2025-04-13 22:30:28,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696445497] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:30:28,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:30:28,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 22:30:28,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020812960] [2025-04-13 22:30:28,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:30:28,287 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 22:30:28,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:30:28,287 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 22:30:28,287 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-04-13 22:30:28,288 INFO L87 Difference]: Start difference. First operand 7030 states and 21038 transitions. Second operand has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 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:30:28,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:30:28,633 INFO L93 Difference]: Finished difference Result 7572 states and 22534 transitions. [2025-04-13 22:30:28,633 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-13 22:30:28,633 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 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 69 [2025-04-13 22:30:28,633 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:30:28,670 INFO L225 Difference]: With dead ends: 7572 [2025-04-13 22:30:28,670 INFO L226 Difference]: Without dead ends: 7260 [2025-04-13 22:30:28,672 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=251, Unknown=0, NotChecked=0, Total=342 [2025-04-13 22:30:28,672 INFO L437 NwaCegarLoop]: 16 mSDtfsCounter, 159 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 976 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 981 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 976 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:30:28,672 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 91 Invalid, 981 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 976 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:30:28,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7260 states. [2025-04-13 22:30:28,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7260 to 7014. [2025-04-13 22:30:28,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7014 states, 7013 states have (on average 2.9924426065877654) internal successors, (20986), 7013 states have internal predecessors, (20986), 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:30:28,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7014 states to 7014 states and 20986 transitions. [2025-04-13 22:30:28,773 INFO L79 Accepts]: Start accepts. Automaton has 7014 states and 20986 transitions. Word has length 69 [2025-04-13 22:30:28,773 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:30:28,773 INFO L485 AbstractCegarLoop]: Abstraction has 7014 states and 20986 transitions. [2025-04-13 22:30:28,773 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 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:30:28,773 INFO L278 IsEmpty]: Start isEmpty. Operand 7014 states and 20986 transitions. [2025-04-13 22:30:28,782 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-04-13 22:30:28,782 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:30:28,782 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:30:28,782 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2025-04-13 22:30:28,782 INFO L403 AbstractCegarLoop]: === Iteration 70 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:30:28,782 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:30:28,782 INFO L85 PathProgramCache]: Analyzing trace with hash -171283219, now seen corresponding path program 16 times [2025-04-13 22:30:28,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:30:28,782 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180350449] [2025-04-13 22:30:28,782 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:30:28,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:30:28,786 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 69 statements into 2 equivalence classes. [2025-04-13 22:30:28,790 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 69 of 69 statements. [2025-04-13 22:30:28,790 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:30:28,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:30:28,884 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:30:28,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:30:28,884 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180350449] [2025-04-13 22:30:28,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180350449] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:30:28,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:30:28,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 22:30:28,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664569507] [2025-04-13 22:30:28,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:30:28,884 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 22:30:28,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:30:28,885 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 22:30:28,885 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-04-13 22:30:28,885 INFO L87 Difference]: Start difference. First operand 7014 states and 20986 transitions. Second operand has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 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:30:29,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:30:29,239 INFO L93 Difference]: Finished difference Result 7456 states and 22148 transitions. [2025-04-13 22:30:29,240 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 22:30:29,240 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 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 69 [2025-04-13 22:30:29,240 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:30:29,274 INFO L225 Difference]: With dead ends: 7456 [2025-04-13 22:30:29,274 INFO L226 Difference]: Without dead ends: 7078 [2025-04-13 22:30:29,276 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2025-04-13 22:30:29,276 INFO L437 NwaCegarLoop]: 17 mSDtfsCounter, 129 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 825 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 836 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 825 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:30:29,277 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 83 Invalid, 836 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 825 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:30:29,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7078 states. [2025-04-13 22:30:29,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7078 to 7030. [2025-04-13 22:30:29,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7030 states, 7029 states have (on average 2.990752596386399) internal successors, (21022), 7029 states have internal predecessors, (21022), 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:30:29,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7030 states to 7030 states and 21022 transitions. [2025-04-13 22:30:29,383 INFO L79 Accepts]: Start accepts. Automaton has 7030 states and 21022 transitions. Word has length 69 [2025-04-13 22:30:29,383 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:30:29,383 INFO L485 AbstractCegarLoop]: Abstraction has 7030 states and 21022 transitions. [2025-04-13 22:30:29,383 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 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:30:29,383 INFO L278 IsEmpty]: Start isEmpty. Operand 7030 states and 21022 transitions. [2025-04-13 22:30:29,391 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-04-13 22:30:29,392 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:30:29,392 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:30:29,392 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2025-04-13 22:30:29,392 INFO L403 AbstractCegarLoop]: === Iteration 71 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:30:29,392 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:30:29,392 INFO L85 PathProgramCache]: Analyzing trace with hash -1860118771, now seen corresponding path program 17 times [2025-04-13 22:30:29,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:30:29,392 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568353593] [2025-04-13 22:30:29,392 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:30:29,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:30:29,395 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 69 statements into 1 equivalence classes. [2025-04-13 22:30:29,398 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-04-13 22:30:29,398 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 22:30:29,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:30:29,486 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:30:29,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:30:29,486 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568353593] [2025-04-13 22:30:29,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568353593] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:30:29,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:30:29,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 22:30:29,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633558694] [2025-04-13 22:30:29,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:30:29,486 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 22:30:29,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:30:29,486 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 22:30:29,487 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-04-13 22:30:29,487 INFO L87 Difference]: Start difference. First operand 7030 states and 21022 transitions. Second operand has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 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:30:29,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:30:29,866 INFO L93 Difference]: Finished difference Result 7820 states and 23200 transitions. [2025-04-13 22:30:29,866 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 22:30:29,866 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 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 69 [2025-04-13 22:30:29,866 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:30:29,905 INFO L225 Difference]: With dead ends: 7820 [2025-04-13 22:30:29,905 INFO L226 Difference]: Without dead ends: 7460 [2025-04-13 22:30:29,908 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=290, Unknown=0, NotChecked=0, Total=380 [2025-04-13 22:30:29,908 INFO L437 NwaCegarLoop]: 18 mSDtfsCounter, 173 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 1008 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 1013 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1008 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:30:29,908 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 108 Invalid, 1013 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1008 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:30:29,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7460 states. [2025-04-13 22:30:30,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7460 to 7014. [2025-04-13 22:30:30,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7014 states, 7013 states have (on average 2.98902039070298) internal successors, (20962), 7013 states have internal predecessors, (20962), 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:30:30,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7014 states to 7014 states and 20962 transitions. [2025-04-13 22:30:30,046 INFO L79 Accepts]: Start accepts. Automaton has 7014 states and 20962 transitions. Word has length 69 [2025-04-13 22:30:30,046 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:30:30,046 INFO L485 AbstractCegarLoop]: Abstraction has 7014 states and 20962 transitions. [2025-04-13 22:30:30,046 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 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:30:30,046 INFO L278 IsEmpty]: Start isEmpty. Operand 7014 states and 20962 transitions. [2025-04-13 22:30:30,055 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-04-13 22:30:30,055 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:30:30,055 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:30:30,055 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2025-04-13 22:30:30,055 INFO L403 AbstractCegarLoop]: === Iteration 72 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:30:30,056 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:30:30,056 INFO L85 PathProgramCache]: Analyzing trace with hash -1110499445, now seen corresponding path program 18 times [2025-04-13 22:30:30,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:30:30,056 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742925579] [2025-04-13 22:30:30,056 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:30:30,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:30:30,059 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 69 statements into 1 equivalence classes. [2025-04-13 22:30:30,062 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-04-13 22:30:30,062 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 22:30:30,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:30:30,141 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:30:30,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:30:30,141 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742925579] [2025-04-13 22:30:30,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742925579] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:30:30,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:30:30,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 22:30:30,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179318572] [2025-04-13 22:30:30,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:30:30,142 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 22:30:30,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:30:30,142 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 22:30:30,142 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-04-13 22:30:30,142 INFO L87 Difference]: Start difference. First operand 7014 states and 20962 transitions. Second operand has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 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:30:30,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:30:30,485 INFO L93 Difference]: Finished difference Result 7804 states and 23140 transitions. [2025-04-13 22:30:30,485 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-13 22:30:30,485 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 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 69 [2025-04-13 22:30:30,485 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:30:30,521 INFO L225 Difference]: With dead ends: 7804 [2025-04-13 22:30:30,521 INFO L226 Difference]: Without dead ends: 7444 [2025-04-13 22:30:30,523 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2025-04-13 22:30:30,523 INFO L437 NwaCegarLoop]: 18 mSDtfsCounter, 186 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 921 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 926 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 921 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:30:30,523 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 101 Invalid, 926 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 921 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:30:30,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7444 states. [2025-04-13 22:30:30,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7444 to 6998. [2025-04-13 22:30:30,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6998 states, 6997 states have (on average 2.9867085893954552) internal successors, (20898), 6997 states have internal predecessors, (20898), 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:30:30,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6998 states to 6998 states and 20898 transitions. [2025-04-13 22:30:30,623 INFO L79 Accepts]: Start accepts. Automaton has 6998 states and 20898 transitions. Word has length 69 [2025-04-13 22:30:30,623 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:30:30,623 INFO L485 AbstractCegarLoop]: Abstraction has 6998 states and 20898 transitions. [2025-04-13 22:30:30,623 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 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:30:30,623 INFO L278 IsEmpty]: Start isEmpty. Operand 6998 states and 20898 transitions. [2025-04-13 22:30:30,632 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-04-13 22:30:30,632 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:30:30,632 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:30:30,632 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2025-04-13 22:30:30,632 INFO L403 AbstractCegarLoop]: === Iteration 73 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:30:30,632 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:30:30,632 INFO L85 PathProgramCache]: Analyzing trace with hash -1031061357, now seen corresponding path program 19 times [2025-04-13 22:30:30,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:30:30,632 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689638326] [2025-04-13 22:30:30,632 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:30:30,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:30:30,635 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-04-13 22:30:30,638 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-04-13 22:30:30,638 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:30:30,638 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:30:30,719 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:30:30,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:30:30,719 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689638326] [2025-04-13 22:30:30,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [689638326] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:30:30,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:30:30,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 22:30:30,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925926111] [2025-04-13 22:30:30,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:30:30,720 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 22:30:30,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:30:30,720 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 22:30:30,720 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-04-13 22:30:30,720 INFO L87 Difference]: Start difference. First operand 6998 states and 20898 transitions. Second operand has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 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:30:31,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:30:31,096 INFO L93 Difference]: Finished difference Result 7844 states and 23214 transitions. [2025-04-13 22:30:31,096 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-13 22:30:31,096 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 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 69 [2025-04-13 22:30:31,096 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:30:31,130 INFO L225 Difference]: With dead ends: 7844 [2025-04-13 22:30:31,130 INFO L226 Difference]: Without dead ends: 7440 [2025-04-13 22:30:31,132 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=251, Unknown=0, NotChecked=0, Total=342 [2025-04-13 22:30:31,132 INFO L437 NwaCegarLoop]: 18 mSDtfsCounter, 171 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 1033 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 1038 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1033 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:30:31,132 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 102 Invalid, 1038 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1033 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:30:31,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7440 states. [2025-04-13 22:30:31,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7440 to 6902. [2025-04-13 22:30:31,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6902 states, 6901 states have (on average 2.981596870018838) internal successors, (20576), 6901 states have internal predecessors, (20576), 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:30:31,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6902 states to 6902 states and 20576 transitions. [2025-04-13 22:30:31,226 INFO L79 Accepts]: Start accepts. Automaton has 6902 states and 20576 transitions. Word has length 69 [2025-04-13 22:30:31,226 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:30:31,226 INFO L485 AbstractCegarLoop]: Abstraction has 6902 states and 20576 transitions. [2025-04-13 22:30:31,226 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 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:30:31,226 INFO L278 IsEmpty]: Start isEmpty. Operand 6902 states and 20576 transitions. [2025-04-13 22:30:31,235 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-04-13 22:30:31,235 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:30:31,235 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:30:31,235 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2025-04-13 22:30:31,235 INFO L403 AbstractCegarLoop]: === Iteration 74 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:30:31,235 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:30:31,235 INFO L85 PathProgramCache]: Analyzing trace with hash -547494703, now seen corresponding path program 20 times [2025-04-13 22:30:31,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:30:31,235 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956368664] [2025-04-13 22:30:31,235 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:30:31,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:30:31,238 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 69 statements into 1 equivalence classes. [2025-04-13 22:30:31,241 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-04-13 22:30:31,241 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 22:30:31,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:30:31,320 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:30:31,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:30:31,321 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956368664] [2025-04-13 22:30:31,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956368664] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:30:31,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:30:31,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 22:30:31,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892060209] [2025-04-13 22:30:31,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:30:31,321 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 22:30:31,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:30:31,321 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 22:30:31,321 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-04-13 22:30:31,321 INFO L87 Difference]: Start difference. First operand 6902 states and 20576 transitions. Second operand has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 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:30:31,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:30:31,725 INFO L93 Difference]: Finished difference Result 7748 states and 22892 transitions. [2025-04-13 22:30:31,725 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-13 22:30:31,725 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 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 69 [2025-04-13 22:30:31,725 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:30:31,777 INFO L225 Difference]: With dead ends: 7748 [2025-04-13 22:30:31,777 INFO L226 Difference]: Without dead ends: 7328 [2025-04-13 22:30:31,781 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=221, Unknown=0, NotChecked=0, Total=306 [2025-04-13 22:30:31,781 INFO L437 NwaCegarLoop]: 17 mSDtfsCounter, 183 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 1086 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 1091 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1086 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:30:31,781 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 104 Invalid, 1091 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1086 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:30:31,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7328 states. [2025-04-13 22:30:31,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7328 to 6790. [2025-04-13 22:30:31,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6790 states, 6789 states have (on average 2.9754013845927236) internal successors, (20200), 6789 states have internal predecessors, (20200), 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:30:31,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6790 states to 6790 states and 20200 transitions. [2025-04-13 22:30:31,904 INFO L79 Accepts]: Start accepts. Automaton has 6790 states and 20200 transitions. Word has length 69 [2025-04-13 22:30:31,904 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:30:31,904 INFO L485 AbstractCegarLoop]: Abstraction has 6790 states and 20200 transitions. [2025-04-13 22:30:31,905 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 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:30:31,905 INFO L278 IsEmpty]: Start isEmpty. Operand 6790 states and 20200 transitions. [2025-04-13 22:30:31,913 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-04-13 22:30:31,913 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:30:31,913 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:30:31,913 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2025-04-13 22:30:31,913 INFO L403 AbstractCegarLoop]: === Iteration 75 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:30:31,914 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:30:31,914 INFO L85 PathProgramCache]: Analyzing trace with hash 2035624853, now seen corresponding path program 1 times [2025-04-13 22:30:31,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:30:31,914 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86823552] [2025-04-13 22:30:31,914 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:30:31,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:30:31,917 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-04-13 22:30:31,919 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-04-13 22:30:31,919 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:30:31,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:30:31,952 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:30:31,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:30:31,952 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86823552] [2025-04-13 22:30:31,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86823552] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:30:31,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:30:31,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 22:30:31,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835520568] [2025-04-13 22:30:31,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:30:31,952 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 22:30:31,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:30:31,953 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 22:30:31,953 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-04-13 22:30:31,953 INFO L87 Difference]: Start difference. First operand 6790 states and 20200 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 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:30:32,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:30:32,325 INFO L93 Difference]: Finished difference Result 10237 states and 29681 transitions. [2025-04-13 22:30:32,325 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-13 22:30:32,325 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 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 69 [2025-04-13 22:30:32,325 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:30:32,405 INFO L225 Difference]: With dead ends: 10237 [2025-04-13 22:30:32,405 INFO L226 Difference]: Without dead ends: 9912 [2025-04-13 22:30:32,407 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2025-04-13 22:30:32,408 INFO L437 NwaCegarLoop]: 12 mSDtfsCounter, 304 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 885 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 304 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 908 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 885 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:30:32,408 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [304 Valid, 63 Invalid, 908 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 885 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:30:32,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9912 states. [2025-04-13 22:30:32,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9912 to 6841. [2025-04-13 22:30:32,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6841 states, 6840 states have (on average 2.9748538011695906) internal successors, (20348), 6840 states have internal predecessors, (20348), 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:30:32,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6841 states to 6841 states and 20348 transitions. [2025-04-13 22:30:32,515 INFO L79 Accepts]: Start accepts. Automaton has 6841 states and 20348 transitions. Word has length 69 [2025-04-13 22:30:32,516 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:30:32,516 INFO L485 AbstractCegarLoop]: Abstraction has 6841 states and 20348 transitions. [2025-04-13 22:30:32,516 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 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:30:32,516 INFO L278 IsEmpty]: Start isEmpty. Operand 6841 states and 20348 transitions. [2025-04-13 22:30:32,524 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-04-13 22:30:32,524 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:30:32,525 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:30:32,525 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2025-04-13 22:30:32,525 INFO L403 AbstractCegarLoop]: === Iteration 76 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:30:32,525 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:30:32,525 INFO L85 PathProgramCache]: Analyzing trace with hash 1862848669, now seen corresponding path program 1 times [2025-04-13 22:30:32,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:30:32,525 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118702072] [2025-04-13 22:30:32,525 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:30:32,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:30:32,528 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-04-13 22:30:32,533 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-04-13 22:30:32,533 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:30:32,533 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:30:32,663 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:30:32,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:30:32,663 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118702072] [2025-04-13 22:30:32,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118702072] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:30:32,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:30:32,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 22:30:32,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581477349] [2025-04-13 22:30:32,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:30:32,664 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 22:30:32,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:30:32,664 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 22:30:32,664 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-04-13 22:30:32,664 INFO L87 Difference]: Start difference. First operand 6841 states and 20348 transitions. Second operand has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 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:30:33,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:30:33,183 INFO L93 Difference]: Finished difference Result 9549 states and 27523 transitions. [2025-04-13 22:30:33,184 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-04-13 22:30:33,184 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 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 69 [2025-04-13 22:30:33,184 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:30:33,227 INFO L225 Difference]: With dead ends: 9549 [2025-04-13 22:30:33,227 INFO L226 Difference]: Without dead ends: 9227 [2025-04-13 22:30:33,229 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=259, Invalid=553, Unknown=0, NotChecked=0, Total=812 [2025-04-13 22:30:33,229 INFO L437 NwaCegarLoop]: 20 mSDtfsCounter, 394 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 1189 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 394 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 1200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:30:33,229 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [394 Valid, 93 Invalid, 1200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1189 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:30:33,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9227 states. [2025-04-13 22:30:33,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9227 to 6919. [2025-04-13 22:30:33,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6919 states, 6918 states have (on average 2.973258167100318) internal successors, (20569), 6918 states have internal predecessors, (20569), 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:30:33,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6919 states to 6919 states and 20569 transitions. [2025-04-13 22:30:33,342 INFO L79 Accepts]: Start accepts. Automaton has 6919 states and 20569 transitions. Word has length 69 [2025-04-13 22:30:33,342 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:30:33,342 INFO L485 AbstractCegarLoop]: Abstraction has 6919 states and 20569 transitions. [2025-04-13 22:30:33,342 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 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:30:33,342 INFO L278 IsEmpty]: Start isEmpty. Operand 6919 states and 20569 transitions. [2025-04-13 22:30:33,350 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-04-13 22:30:33,350 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:30:33,350 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:30:33,350 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2025-04-13 22:30:33,350 INFO L403 AbstractCegarLoop]: === Iteration 77 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:30:33,351 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:30:33,351 INFO L85 PathProgramCache]: Analyzing trace with hash 1069236388, now seen corresponding path program 1 times [2025-04-13 22:30:33,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:30:33,351 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976332057] [2025-04-13 22:30:33,351 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:30:33,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:30:33,354 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-04-13 22:30:33,357 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-04-13 22:30:33,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:30:33,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:30:33,428 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:30:33,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:30:33,428 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976332057] [2025-04-13 22:30:33,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976332057] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:30:33,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:30:33,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 22:30:33,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137458298] [2025-04-13 22:30:33,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:30:33,428 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 22:30:33,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:30:33,429 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 22:30:33,429 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-04-13 22:30:33,429 INFO L87 Difference]: Start difference. First operand 6919 states and 20569 transitions. Second operand has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 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:30:33,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:30:33,879 INFO L93 Difference]: Finished difference Result 9891 states and 28491 transitions. [2025-04-13 22:30:33,880 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-13 22:30:33,880 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 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 69 [2025-04-13 22:30:33,880 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:30:33,924 INFO L225 Difference]: With dead ends: 9891 [2025-04-13 22:30:33,924 INFO L226 Difference]: Without dead ends: 8808 [2025-04-13 22:30:33,927 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=231, Invalid=471, Unknown=0, NotChecked=0, Total=702 [2025-04-13 22:30:33,927 INFO L437 NwaCegarLoop]: 21 mSDtfsCounter, 375 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 999 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 375 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 1015 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 999 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:30:33,927 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [375 Valid, 80 Invalid, 1015 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 999 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:30:33,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8808 states. [2025-04-13 22:30:33,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8808 to 6460. [2025-04-13 22:30:33,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6460 states, 6459 states have (on average 2.95618516798266) internal successors, (19094), 6459 states have internal predecessors, (19094), 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:30:34,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6460 states to 6460 states and 19094 transitions. [2025-04-13 22:30:34,030 INFO L79 Accepts]: Start accepts. Automaton has 6460 states and 19094 transitions. Word has length 69 [2025-04-13 22:30:34,031 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:30:34,031 INFO L485 AbstractCegarLoop]: Abstraction has 6460 states and 19094 transitions. [2025-04-13 22:30:34,031 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 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:30:34,031 INFO L278 IsEmpty]: Start isEmpty. Operand 6460 states and 19094 transitions. [2025-04-13 22:30:34,038 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-04-13 22:30:34,038 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:30:34,038 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:30:34,038 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2025-04-13 22:30:34,039 INFO L403 AbstractCegarLoop]: === Iteration 78 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:30:34,039 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:30:34,039 INFO L85 PathProgramCache]: Analyzing trace with hash -754561149, now seen corresponding path program 2 times [2025-04-13 22:30:34,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:30:34,039 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527758781] [2025-04-13 22:30:34,039 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:30:34,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:30:34,042 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 69 statements into 1 equivalence classes. [2025-04-13 22:30:34,045 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-04-13 22:30:34,045 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 22:30:34,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:30:34,120 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:30:34,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:30:34,120 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527758781] [2025-04-13 22:30:34,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527758781] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:30:34,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:30:34,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 22:30:34,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023390] [2025-04-13 22:30:34,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:30:34,121 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 22:30:34,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:30:34,121 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 22:30:34,121 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-04-13 22:30:34,121 INFO L87 Difference]: Start difference. First operand 6460 states and 19094 transitions. Second operand has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 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:30:34,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:30:34,656 INFO L93 Difference]: Finished difference Result 10492 states and 30230 transitions. [2025-04-13 22:30:34,656 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-04-13 22:30:34,656 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 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 69 [2025-04-13 22:30:34,656 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:30:34,699 INFO L225 Difference]: With dead ends: 10492 [2025-04-13 22:30:34,699 INFO L226 Difference]: Without dead ends: 9636 [2025-04-13 22:30:34,702 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=209, Invalid=603, Unknown=0, NotChecked=0, Total=812 [2025-04-13 22:30:34,702 INFO L437 NwaCegarLoop]: 24 mSDtfsCounter, 424 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 1283 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 424 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 1304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 1283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:30:34,702 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [424 Valid, 115 Invalid, 1304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 1283 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:30:34,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9636 states. [2025-04-13 22:30:34,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9636 to 6080. [2025-04-13 22:30:34,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6080 states, 6079 states have (on average 2.939792729067281) internal successors, (17871), 6079 states have internal predecessors, (17871), 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:30:34,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6080 states to 6080 states and 17871 transitions. [2025-04-13 22:30:34,804 INFO L79 Accepts]: Start accepts. Automaton has 6080 states and 17871 transitions. Word has length 69 [2025-04-13 22:30:34,804 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:30:34,805 INFO L485 AbstractCegarLoop]: Abstraction has 6080 states and 17871 transitions. [2025-04-13 22:30:34,805 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 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:30:34,805 INFO L278 IsEmpty]: Start isEmpty. Operand 6080 states and 17871 transitions. [2025-04-13 22:30:34,811 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-04-13 22:30:34,811 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:30:34,811 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:30:34,811 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2025-04-13 22:30:34,811 INFO L403 AbstractCegarLoop]: === Iteration 79 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:30:34,812 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:30:34,812 INFO L85 PathProgramCache]: Analyzing trace with hash -176820235, now seen corresponding path program 2 times [2025-04-13 22:30:34,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:30:34,812 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022465048] [2025-04-13 22:30:34,812 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:30:34,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:30:34,815 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 69 statements into 1 equivalence classes. [2025-04-13 22:30:34,817 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-04-13 22:30:34,817 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 22:30:34,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:30:34,922 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:30:34,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:30:34,922 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022465048] [2025-04-13 22:30:34,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022465048] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:30:34,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:30:34,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 22:30:34,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786134916] [2025-04-13 22:30:34,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:30:34,922 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 22:30:34,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:30:34,923 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 22:30:34,923 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-04-13 22:30:34,923 INFO L87 Difference]: Start difference. First operand 6080 states and 17871 transitions. Second operand has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 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:30:35,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:30:35,318 INFO L93 Difference]: Finished difference Result 7761 states and 22580 transitions. [2025-04-13 22:30:35,318 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-13 22:30:35,318 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 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 69 [2025-04-13 22:30:35,318 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:30:35,358 INFO L225 Difference]: With dead ends: 7761 [2025-04-13 22:30:35,358 INFO L226 Difference]: Without dead ends: 6586 [2025-04-13 22:30:35,361 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=251, Unknown=0, NotChecked=0, Total=342 [2025-04-13 22:30:35,361 INFO L437 NwaCegarLoop]: 17 mSDtfsCounter, 197 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 1139 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 1148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:30:35,361 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 95 Invalid, 1148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1139 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:30:35,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6586 states. [2025-04-13 22:30:35,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6586 to 6182. [2025-04-13 22:30:35,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6182 states, 6181 states have (on average 2.9336676913120856) internal successors, (18133), 6181 states have internal predecessors, (18133), 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:30:35,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6182 states to 6182 states and 18133 transitions. [2025-04-13 22:30:35,460 INFO L79 Accepts]: Start accepts. Automaton has 6182 states and 18133 transitions. Word has length 69 [2025-04-13 22:30:35,460 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:30:35,460 INFO L485 AbstractCegarLoop]: Abstraction has 6182 states and 18133 transitions. [2025-04-13 22:30:35,460 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 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:30:35,460 INFO L278 IsEmpty]: Start isEmpty. Operand 6182 states and 18133 transitions. [2025-04-13 22:30:35,468 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-04-13 22:30:35,468 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:30:35,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:30:35,468 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78 [2025-04-13 22:30:35,468 INFO L403 AbstractCegarLoop]: === Iteration 80 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:30:35,468 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:30:35,468 INFO L85 PathProgramCache]: Analyzing trace with hash -656534589, now seen corresponding path program 3 times [2025-04-13 22:30:35,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:30:35,468 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516048188] [2025-04-13 22:30:35,468 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:30:35,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:30:35,471 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 69 statements into 1 equivalence classes. [2025-04-13 22:30:35,474 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-04-13 22:30:35,474 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 22:30:35,474 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:30:35,564 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:30:35,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:30:35,564 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516048188] [2025-04-13 22:30:35,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1516048188] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:30:35,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:30:35,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 22:30:35,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045733292] [2025-04-13 22:30:35,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:30:35,564 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 22:30:35,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:30:35,564 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 22:30:35,564 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-04-13 22:30:35,565 INFO L87 Difference]: Start difference. First operand 6182 states and 18133 transitions. Second operand has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 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:30:36,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:30:36,230 INFO L93 Difference]: Finished difference Result 10402 states and 29689 transitions. [2025-04-13 22:30:36,230 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-04-13 22:30:36,230 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 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 69 [2025-04-13 22:30:36,230 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:30:36,271 INFO L225 Difference]: With dead ends: 10402 [2025-04-13 22:30:36,271 INFO L226 Difference]: Without dead ends: 9824 [2025-04-13 22:30:36,274 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 212 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=248, Invalid=744, Unknown=0, NotChecked=0, Total=992 [2025-04-13 22:30:36,274 INFO L437 NwaCegarLoop]: 25 mSDtfsCounter, 430 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 1791 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 430 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 1814 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1791 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 22:30:36,274 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [430 Valid, 153 Invalid, 1814 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1791 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 22:30:36,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9824 states. [2025-04-13 22:30:36,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9824 to 6150. [2025-04-13 22:30:36,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6150 states, 6149 states have (on average 2.928443649373882) internal successors, (18007), 6149 states have internal predecessors, (18007), 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:30:36,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6150 states to 6150 states and 18007 transitions. [2025-04-13 22:30:36,379 INFO L79 Accepts]: Start accepts. Automaton has 6150 states and 18007 transitions. Word has length 69 [2025-04-13 22:30:36,379 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:30:36,379 INFO L485 AbstractCegarLoop]: Abstraction has 6150 states and 18007 transitions. [2025-04-13 22:30:36,379 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 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:30:36,379 INFO L278 IsEmpty]: Start isEmpty. Operand 6150 states and 18007 transitions. [2025-04-13 22:30:36,386 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-04-13 22:30:36,386 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:30:36,386 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:30:36,387 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79 [2025-04-13 22:30:36,387 INFO L403 AbstractCegarLoop]: === Iteration 81 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:30:36,387 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:30:36,387 INFO L85 PathProgramCache]: Analyzing trace with hash 451251733, now seen corresponding path program 3 times [2025-04-13 22:30:36,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:30:36,387 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337844477] [2025-04-13 22:30:36,387 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:30:36,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:30:36,391 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 69 statements into 1 equivalence classes. [2025-04-13 22:30:36,394 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-04-13 22:30:36,394 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 22:30:36,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:30:36,483 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:30:36,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:30:36,483 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337844477] [2025-04-13 22:30:36,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337844477] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:30:36,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:30:36,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 22:30:36,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094042371] [2025-04-13 22:30:36,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:30:36,484 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 22:30:36,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:30:36,484 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 22:30:36,484 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-04-13 22:30:36,484 INFO L87 Difference]: Start difference. First operand 6150 states and 18007 transitions. Second operand has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 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:30:36,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:30:36,924 INFO L93 Difference]: Finished difference Result 6879 states and 19920 transitions. [2025-04-13 22:30:36,924 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-13 22:30:36,924 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 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 69 [2025-04-13 22:30:36,924 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:30:36,962 INFO L225 Difference]: With dead ends: 6879 [2025-04-13 22:30:36,962 INFO L226 Difference]: Without dead ends: 6404 [2025-04-13 22:30:36,964 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2025-04-13 22:30:36,964 INFO L437 NwaCegarLoop]: 17 mSDtfsCounter, 174 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 1264 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 1269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:30:36,964 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 104 Invalid, 1269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1264 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:30:36,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6404 states. [2025-04-13 22:30:37,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6404 to 6000. [2025-04-13 22:30:37,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6000 states, 5999 states have (on average 2.9316552758793133) internal successors, (17587), 5999 states have internal predecessors, (17587), 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:30:37,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6000 states to 6000 states and 17587 transitions. [2025-04-13 22:30:37,051 INFO L79 Accepts]: Start accepts. Automaton has 6000 states and 17587 transitions. Word has length 69 [2025-04-13 22:30:37,051 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:30:37,051 INFO L485 AbstractCegarLoop]: Abstraction has 6000 states and 17587 transitions. [2025-04-13 22:30:37,051 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 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:30:37,051 INFO L278 IsEmpty]: Start isEmpty. Operand 6000 states and 17587 transitions. [2025-04-13 22:30:37,058 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-04-13 22:30:37,058 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:30:37,058 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:30:37,058 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80 [2025-04-13 22:30:37,058 INFO L403 AbstractCegarLoop]: === Iteration 82 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:30:37,058 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:30:37,059 INFO L85 PathProgramCache]: Analyzing trace with hash 136239687, now seen corresponding path program 4 times [2025-04-13 22:30:37,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:30:37,059 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647473815] [2025-04-13 22:30:37,059 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:30:37,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:30:37,062 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 69 statements into 2 equivalence classes. [2025-04-13 22:30:37,065 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 69 of 69 statements. [2025-04-13 22:30:37,065 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:30:37,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:30:37,142 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:30:37,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:30:37,142 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647473815] [2025-04-13 22:30:37,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [647473815] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:30:37,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:30:37,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 22:30:37,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088848419] [2025-04-13 22:30:37,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:30:37,142 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 22:30:37,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:30:37,143 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 22:30:37,143 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-04-13 22:30:37,143 INFO L87 Difference]: Start difference. First operand 6000 states and 17587 transitions. Second operand has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 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:30:37,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:30:37,740 INFO L93 Difference]: Finished difference Result 9095 states and 26147 transitions. [2025-04-13 22:30:37,740 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-13 22:30:37,740 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 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 69 [2025-04-13 22:30:37,740 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:30:37,774 INFO L225 Difference]: With dead ends: 9095 [2025-04-13 22:30:37,775 INFO L226 Difference]: Without dead ends: 8797 [2025-04-13 22:30:37,776 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=181, Invalid=469, Unknown=0, NotChecked=0, Total=650 [2025-04-13 22:30:37,776 INFO L437 NwaCegarLoop]: 23 mSDtfsCounter, 358 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 1473 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 358 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 1487 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1473 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 22:30:37,776 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [358 Valid, 128 Invalid, 1487 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1473 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 22:30:37,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8797 states. [2025-04-13 22:30:37,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8797 to 5904. [2025-04-13 22:30:37,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5904 states, 5903 states have (on average 2.9237675758089106) internal successors, (17259), 5903 states have internal predecessors, (17259), 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:30:37,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5904 states to 5904 states and 17259 transitions. [2025-04-13 22:30:37,874 INFO L79 Accepts]: Start accepts. Automaton has 5904 states and 17259 transitions. Word has length 69 [2025-04-13 22:30:37,874 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:30:37,875 INFO L485 AbstractCegarLoop]: Abstraction has 5904 states and 17259 transitions. [2025-04-13 22:30:37,875 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 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:30:37,875 INFO L278 IsEmpty]: Start isEmpty. Operand 5904 states and 17259 transitions. [2025-04-13 22:30:37,881 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-04-13 22:30:37,881 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:30:37,881 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:30:37,881 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81 [2025-04-13 22:30:37,881 INFO L403 AbstractCegarLoop]: === Iteration 83 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:30:37,882 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:30:37,882 INFO L85 PathProgramCache]: Analyzing trace with hash -1353616555, now seen corresponding path program 4 times [2025-04-13 22:30:37,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:30:37,882 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882314603] [2025-04-13 22:30:37,882 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:30:37,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:30:37,885 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 69 statements into 2 equivalence classes. [2025-04-13 22:30:37,889 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 69 of 69 statements. [2025-04-13 22:30:37,890 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:30:37,890 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:30:37,990 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:30:37,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:30:37,990 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882314603] [2025-04-13 22:30:37,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882314603] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:30:37,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:30:37,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 22:30:37,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707487754] [2025-04-13 22:30:37,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:30:37,991 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 22:30:37,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:30:37,991 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 22:30:37,991 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-04-13 22:30:37,991 INFO L87 Difference]: Start difference. First operand 5904 states and 17259 transitions. Second operand has 11 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 11 states have internal predecessors, (69), 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:30:38,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:30:38,479 INFO L93 Difference]: Finished difference Result 9003 states and 26159 transitions. [2025-04-13 22:30:38,479 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-13 22:30:38,479 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 11 states have internal predecessors, (69), 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 69 [2025-04-13 22:30:38,480 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:30:38,518 INFO L225 Difference]: With dead ends: 9003 [2025-04-13 22:30:38,518 INFO L226 Difference]: Without dead ends: 7913 [2025-04-13 22:30:38,521 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=154, Invalid=398, Unknown=0, NotChecked=0, Total=552 [2025-04-13 22:30:38,521 INFO L437 NwaCegarLoop]: 19 mSDtfsCounter, 284 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 1237 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 284 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 1251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:30:38,521 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [284 Valid, 101 Invalid, 1251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1237 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:30:38,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7913 states. [2025-04-13 22:30:38,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7913 to 6074. [2025-04-13 22:30:38,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6074 states, 6073 states have (on average 2.926889510950107) internal successors, (17775), 6073 states have internal predecessors, (17775), 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:30:38,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6074 states to 6074 states and 17775 transitions. [2025-04-13 22:30:38,617 INFO L79 Accepts]: Start accepts. Automaton has 6074 states and 17775 transitions. Word has length 69 [2025-04-13 22:30:38,617 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:30:38,617 INFO L485 AbstractCegarLoop]: Abstraction has 6074 states and 17775 transitions. [2025-04-13 22:30:38,617 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 11 states have internal predecessors, (69), 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:30:38,617 INFO L278 IsEmpty]: Start isEmpty. Operand 6074 states and 17775 transitions. [2025-04-13 22:30:38,624 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-04-13 22:30:38,624 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:30:38,624 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:30:38,624 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82 [2025-04-13 22:30:38,624 INFO L403 AbstractCegarLoop]: === Iteration 84 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:30:38,625 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:30:38,625 INFO L85 PathProgramCache]: Analyzing trace with hash -301303324, now seen corresponding path program 1 times [2025-04-13 22:30:38,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:30:38,625 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652056035] [2025-04-13 22:30:38,625 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:30:38,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:30:38,628 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-04-13 22:30:38,630 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-04-13 22:30:38,630 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:30:38,630 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:30:38,716 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:30:38,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:30:38,716 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652056035] [2025-04-13 22:30:38,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652056035] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:30:38,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:30:38,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 22:30:38,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020156732] [2025-04-13 22:30:38,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:30:38,716 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 22:30:38,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:30:38,717 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 22:30:38,717 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-04-13 22:30:38,717 INFO L87 Difference]: Start difference. First operand 6074 states and 17775 transitions. Second operand has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 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:30:39,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:30:39,064 INFO L93 Difference]: Finished difference Result 6699 states and 19465 transitions. [2025-04-13 22:30:39,064 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-13 22:30:39,064 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 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 69 [2025-04-13 22:30:39,064 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:30:39,098 INFO L225 Difference]: With dead ends: 6699 [2025-04-13 22:30:39,099 INFO L226 Difference]: Without dead ends: 6401 [2025-04-13 22:30:39,100 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2025-04-13 22:30:39,100 INFO L437 NwaCegarLoop]: 16 mSDtfsCounter, 174 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 989 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 993 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 989 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:30:39,100 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 87 Invalid, 993 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 989 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:30:39,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6401 states. [2025-04-13 22:30:39,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6401 to 6138. [2025-04-13 22:30:39,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6138 states, 6137 states have (on average 2.927651947205475) internal successors, (17967), 6137 states have internal predecessors, (17967), 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:30:39,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6138 states to 6138 states and 17967 transitions. [2025-04-13 22:30:39,191 INFO L79 Accepts]: Start accepts. Automaton has 6138 states and 17967 transitions. Word has length 69 [2025-04-13 22:30:39,191 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:30:39,191 INFO L485 AbstractCegarLoop]: Abstraction has 6138 states and 17967 transitions. [2025-04-13 22:30:39,192 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 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:30:39,192 INFO L278 IsEmpty]: Start isEmpty. Operand 6138 states and 17967 transitions. [2025-04-13 22:30:39,198 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-04-13 22:30:39,199 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:30:39,199 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:30:39,199 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83 [2025-04-13 22:30:39,199 INFO L403 AbstractCegarLoop]: === Iteration 85 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:30:39,199 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:30:39,199 INFO L85 PathProgramCache]: Analyzing trace with hash -725544587, now seen corresponding path program 5 times [2025-04-13 22:30:39,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:30:39,199 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361884075] [2025-04-13 22:30:39,199 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:30:39,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:30:39,202 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 69 statements into 1 equivalence classes. [2025-04-13 22:30:39,205 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-04-13 22:30:39,205 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 22:30:39,205 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:30:39,308 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:30:39,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:30:39,308 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361884075] [2025-04-13 22:30:39,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361884075] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:30:39,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:30:39,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 22:30:39,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176149969] [2025-04-13 22:30:39,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:30:39,308 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 22:30:39,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:30:39,308 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 22:30:39,308 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-04-13 22:30:39,309 INFO L87 Difference]: Start difference. First operand 6138 states and 17967 transitions. Second operand has 11 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 11 states have internal predecessors, (69), 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:30:39,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:30:39,839 INFO L93 Difference]: Finished difference Result 8302 states and 24041 transitions. [2025-04-13 22:30:39,839 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-13 22:30:39,840 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 11 states have internal predecessors, (69), 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 69 [2025-04-13 22:30:39,840 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:30:39,878 INFO L225 Difference]: With dead ends: 8302 [2025-04-13 22:30:39,878 INFO L226 Difference]: Without dead ends: 7926 [2025-04-13 22:30:39,880 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=143, Invalid=409, Unknown=0, NotChecked=0, Total=552 [2025-04-13 22:30:39,880 INFO L437 NwaCegarLoop]: 20 mSDtfsCounter, 284 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 1256 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 284 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 1268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:30:39,880 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [284 Valid, 108 Invalid, 1268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1256 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:30:39,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7926 states. [2025-04-13 22:30:39,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7926 to 6076. [2025-04-13 22:30:39,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6076 states, 6075 states have (on average 2.9265843621399177) internal successors, (17779), 6075 states have internal predecessors, (17779), 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:30:39,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6076 states to 6076 states and 17779 transitions. [2025-04-13 22:30:39,970 INFO L79 Accepts]: Start accepts. Automaton has 6076 states and 17779 transitions. Word has length 69 [2025-04-13 22:30:39,970 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:30:39,970 INFO L485 AbstractCegarLoop]: Abstraction has 6076 states and 17779 transitions. [2025-04-13 22:30:39,970 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 11 states have internal predecessors, (69), 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:30:39,970 INFO L278 IsEmpty]: Start isEmpty. Operand 6076 states and 17779 transitions. [2025-04-13 22:30:39,977 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-04-13 22:30:39,977 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:30:39,977 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:30:39,977 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84 [2025-04-13 22:30:39,977 INFO L403 AbstractCegarLoop]: === Iteration 86 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:30:39,977 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:30:39,977 INFO L85 PathProgramCache]: Analyzing trace with hash -203276764, now seen corresponding path program 2 times [2025-04-13 22:30:39,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:30:39,977 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315588837] [2025-04-13 22:30:39,977 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:30:39,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:30:39,981 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 69 statements into 1 equivalence classes. [2025-04-13 22:30:39,983 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-04-13 22:30:39,983 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 22:30:39,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:30:40,085 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:30:40,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:30:40,086 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315588837] [2025-04-13 22:30:40,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315588837] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:30:40,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:30:40,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 22:30:40,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287755624] [2025-04-13 22:30:40,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:30:40,086 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 22:30:40,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:30:40,086 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 22:30:40,086 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-04-13 22:30:40,086 INFO L87 Difference]: Start difference. First operand 6076 states and 17779 transitions. Second operand has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 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:30:40,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:30:40,401 INFO L93 Difference]: Finished difference Result 6800 states and 19686 transitions. [2025-04-13 22:30:40,401 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-13 22:30:40,401 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 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 69 [2025-04-13 22:30:40,401 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:30:40,439 INFO L225 Difference]: With dead ends: 6800 [2025-04-13 22:30:40,439 INFO L226 Difference]: Without dead ends: 6222 [2025-04-13 22:30:40,440 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=251, Unknown=0, NotChecked=0, Total=342 [2025-04-13 22:30:40,441 INFO L437 NwaCegarLoop]: 15 mSDtfsCounter, 184 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 836 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 842 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 836 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:30:40,441 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 72 Invalid, 842 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 836 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:30:40,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6222 states. [2025-04-13 22:30:40,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6222 to 6044. [2025-04-13 22:30:40,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6044 states, 6043 states have (on average 2.9222240608969057) internal successors, (17659), 6043 states have internal predecessors, (17659), 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:30:40,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6044 states to 6044 states and 17659 transitions. [2025-04-13 22:30:40,532 INFO L79 Accepts]: Start accepts. Automaton has 6044 states and 17659 transitions. Word has length 69 [2025-04-13 22:30:40,532 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:30:40,532 INFO L485 AbstractCegarLoop]: Abstraction has 6044 states and 17659 transitions. [2025-04-13 22:30:40,532 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 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:30:40,532 INFO L278 IsEmpty]: Start isEmpty. Operand 6044 states and 17659 transitions. [2025-04-13 22:30:40,539 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-04-13 22:30:40,539 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:30:40,539 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:30:40,539 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable85 [2025-04-13 22:30:40,539 INFO L403 AbstractCegarLoop]: === Iteration 87 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:30:40,540 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:30:40,540 INFO L85 PathProgramCache]: Analyzing trace with hash -1738450055, now seen corresponding path program 6 times [2025-04-13 22:30:40,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:30:40,540 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659645756] [2025-04-13 22:30:40,540 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:30:40,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:30:40,543 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 69 statements into 1 equivalence classes. [2025-04-13 22:30:40,545 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-04-13 22:30:40,545 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 22:30:40,545 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:30:40,628 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:30:40,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:30:40,629 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659645756] [2025-04-13 22:30:40,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659645756] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:30:40,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:30:40,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 22:30:40,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110115338] [2025-04-13 22:30:40,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:30:40,629 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 22:30:40,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:30:40,629 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 22:30:40,629 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-04-13 22:30:40,629 INFO L87 Difference]: Start difference. First operand 6044 states and 17659 transitions. Second operand has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 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:30:41,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:30:41,055 INFO L93 Difference]: Finished difference Result 8400 states and 24169 transitions. [2025-04-13 22:30:41,056 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 22:30:41,056 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 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 69 [2025-04-13 22:30:41,056 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:30:41,101 INFO L225 Difference]: With dead ends: 8400 [2025-04-13 22:30:41,101 INFO L226 Difference]: Without dead ends: 7638 [2025-04-13 22:30:41,104 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=115, Invalid=305, Unknown=0, NotChecked=0, Total=420 [2025-04-13 22:30:41,104 INFO L437 NwaCegarLoop]: 18 mSDtfsCounter, 244 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 1163 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 1172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:30:41,104 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [244 Valid, 93 Invalid, 1172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1163 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:30:41,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7638 states. [2025-04-13 22:30:41,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7638 to 6055. [2025-04-13 22:30:41,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6055 states, 6054 states have (on average 2.9179055170135446) internal successors, (17665), 6054 states have internal predecessors, (17665), 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:30:41,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6055 states to 6055 states and 17665 transitions. [2025-04-13 22:30:41,205 INFO L79 Accepts]: Start accepts. Automaton has 6055 states and 17665 transitions. Word has length 69 [2025-04-13 22:30:41,205 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:30:41,205 INFO L485 AbstractCegarLoop]: Abstraction has 6055 states and 17665 transitions. [2025-04-13 22:30:41,205 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 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:30:41,205 INFO L278 IsEmpty]: Start isEmpty. Operand 6055 states and 17665 transitions. [2025-04-13 22:30:41,212 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-04-13 22:30:41,212 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:30:41,212 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:30:41,213 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86 [2025-04-13 22:30:41,213 INFO L403 AbstractCegarLoop]: === Iteration 88 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:30:41,213 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:30:41,213 INFO L85 PathProgramCache]: Analyzing trace with hash -1231897534, now seen corresponding path program 3 times [2025-04-13 22:30:41,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:30:41,213 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252929314] [2025-04-13 22:30:41,213 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:30:41,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:30:41,216 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 69 statements into 1 equivalence classes. [2025-04-13 22:30:41,219 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-04-13 22:30:41,219 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 22:30:41,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:30:41,301 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:30:41,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:30:41,302 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252929314] [2025-04-13 22:30:41,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252929314] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:30:41,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:30:41,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 22:30:41,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996342164] [2025-04-13 22:30:41,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:30:41,302 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 22:30:41,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:30:41,302 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 22:30:41,302 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-04-13 22:30:41,302 INFO L87 Difference]: Start difference. First operand 6055 states and 17665 transitions. Second operand has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 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:30:41,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:30:41,655 INFO L93 Difference]: Finished difference Result 6568 states and 19007 transitions. [2025-04-13 22:30:41,655 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-13 22:30:41,655 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 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 69 [2025-04-13 22:30:41,655 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:30:41,692 INFO L225 Difference]: With dead ends: 6568 [2025-04-13 22:30:41,692 INFO L226 Difference]: Without dead ends: 6190 [2025-04-13 22:30:41,693 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2025-04-13 22:30:41,694 INFO L437 NwaCegarLoop]: 17 mSDtfsCounter, 185 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 979 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 983 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 979 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:30:41,694 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 95 Invalid, 983 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 979 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:30:41,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6190 states. [2025-04-13 22:30:41,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6190 to 6023. [2025-04-13 22:30:41,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6023 states, 6022 states have (on average 2.9154765858518763) internal successors, (17557), 6022 states have internal predecessors, (17557), 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:30:41,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6023 states to 6023 states and 17557 transitions. [2025-04-13 22:30:41,781 INFO L79 Accepts]: Start accepts. Automaton has 6023 states and 17557 transitions. Word has length 69 [2025-04-13 22:30:41,782 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:30:41,782 INFO L485 AbstractCegarLoop]: Abstraction has 6023 states and 17557 transitions. [2025-04-13 22:30:41,782 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 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:30:41,782 INFO L278 IsEmpty]: Start isEmpty. Operand 6023 states and 17557 transitions. [2025-04-13 22:30:41,788 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-04-13 22:30:41,788 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:30:41,788 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:30:41,788 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable87 [2025-04-13 22:30:41,788 INFO L403 AbstractCegarLoop]: === Iteration 89 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:30:41,789 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:30:41,789 INFO L85 PathProgramCache]: Analyzing trace with hash -1110378087, now seen corresponding path program 7 times [2025-04-13 22:30:41,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:30:41,789 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647461926] [2025-04-13 22:30:41,789 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:30:41,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:30:41,792 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-04-13 22:30:41,794 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-04-13 22:30:41,794 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:30:41,794 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:30:41,865 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:30:41,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:30:41,865 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647461926] [2025-04-13 22:30:41,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [647461926] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:30:41,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:30:41,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 22:30:41,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111888105] [2025-04-13 22:30:41,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:30:41,865 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 22:30:41,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:30:41,865 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 22:30:41,865 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-04-13 22:30:41,866 INFO L87 Difference]: Start difference. First operand 6023 states and 17557 transitions. Second operand has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 9 states have internal predecessors, (69), 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:30:42,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:30:42,276 INFO L93 Difference]: Finished difference Result 8429 states and 23925 transitions. [2025-04-13 22:30:42,276 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-13 22:30:42,276 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 9 states have internal predecessors, (69), 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 69 [2025-04-13 22:30:42,276 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:30:42,319 INFO L225 Difference]: With dead ends: 8429 [2025-04-13 22:30:42,319 INFO L226 Difference]: Without dead ends: 8036 [2025-04-13 22:30:42,321 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=138, Invalid=282, Unknown=0, NotChecked=0, Total=420 [2025-04-13 22:30:42,321 INFO L437 NwaCegarLoop]: 20 mSDtfsCounter, 307 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 1081 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 307 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 1095 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1081 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:30:42,321 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [307 Valid, 86 Invalid, 1095 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1081 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:30:42,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8036 states. [2025-04-13 22:30:42,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8036 to 6176. [2025-04-13 22:30:42,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6176 states, 6175 states have (on average 2.9107692307692306) internal successors, (17974), 6175 states have internal predecessors, (17974), 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:30:42,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6176 states to 6176 states and 17974 transitions. [2025-04-13 22:30:42,422 INFO L79 Accepts]: Start accepts. Automaton has 6176 states and 17974 transitions. Word has length 69 [2025-04-13 22:30:42,422 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:30:42,422 INFO L485 AbstractCegarLoop]: Abstraction has 6176 states and 17974 transitions. [2025-04-13 22:30:42,422 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 9 states have internal predecessors, (69), 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:30:42,422 INFO L278 IsEmpty]: Start isEmpty. Operand 6176 states and 17974 transitions. [2025-04-13 22:30:42,429 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-04-13 22:30:42,429 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:30:42,429 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:30:42,429 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable88 [2025-04-13 22:30:42,429 INFO L403 AbstractCegarLoop]: === Iteration 90 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:30:42,430 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:30:42,430 INFO L85 PathProgramCache]: Analyzing trace with hash 897803206, now seen corresponding path program 4 times [2025-04-13 22:30:42,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:30:42,430 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785288162] [2025-04-13 22:30:42,430 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:30:42,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:30:42,433 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 69 statements into 2 equivalence classes. [2025-04-13 22:30:42,437 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 69 of 69 statements. [2025-04-13 22:30:42,437 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:30:42,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:30:42,557 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:30:42,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:30:42,558 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785288162] [2025-04-13 22:30:42,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785288162] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:30:42,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:30:42,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 22:30:42,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149783222] [2025-04-13 22:30:42,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:30:42,558 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 22:30:42,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:30:42,558 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 22:30:42,558 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-04-13 22:30:42,558 INFO L87 Difference]: Start difference. First operand 6176 states and 17974 transitions. Second operand has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 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:30:42,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:30:42,979 INFO L93 Difference]: Finished difference Result 6660 states and 19264 transitions. [2025-04-13 22:30:42,979 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-13 22:30:42,979 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 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 69 [2025-04-13 22:30:42,980 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:30:43,012 INFO L225 Difference]: With dead ends: 6660 [2025-04-13 22:30:43,012 INFO L226 Difference]: Without dead ends: 6198 [2025-04-13 22:30:43,014 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=111, Invalid=395, Unknown=0, NotChecked=0, Total=506 [2025-04-13 22:30:43,014 INFO L437 NwaCegarLoop]: 19 mSDtfsCounter, 209 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 1023 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 1027 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1023 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:30:43,014 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 82 Invalid, 1027 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1023 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:30:43,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6198 states. [2025-04-13 22:30:43,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6198 to 6146. [2025-04-13 22:30:43,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6146 states, 6145 states have (on average 2.9104963384865745) internal successors, (17885), 6145 states have internal predecessors, (17885), 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:30:43,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6146 states to 6146 states and 17885 transitions. [2025-04-13 22:30:43,098 INFO L79 Accepts]: Start accepts. Automaton has 6146 states and 17885 transitions. Word has length 69 [2025-04-13 22:30:43,098 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:30:43,098 INFO L485 AbstractCegarLoop]: Abstraction has 6146 states and 17885 transitions. [2025-04-13 22:30:43,098 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 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:30:43,099 INFO L278 IsEmpty]: Start isEmpty. Operand 6146 states and 17885 transitions. [2025-04-13 22:30:43,106 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-04-13 22:30:43,106 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:30:43,106 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:30:43,106 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable89 [2025-04-13 22:30:43,106 INFO L403 AbstractCegarLoop]: === Iteration 91 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:30:43,106 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:30:43,106 INFO L85 PathProgramCache]: Analyzing trace with hash -1527255211, now seen corresponding path program 8 times [2025-04-13 22:30:43,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:30:43,106 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15805931] [2025-04-13 22:30:43,106 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:30:43,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:30:43,109 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 69 statements into 1 equivalence classes. [2025-04-13 22:30:43,112 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-04-13 22:30:43,112 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 22:30:43,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:30:43,190 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:30:43,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:30:43,190 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15805931] [2025-04-13 22:30:43,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15805931] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:30:43,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:30:43,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 22:30:43,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516661550] [2025-04-13 22:30:43,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:30:43,190 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 22:30:43,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:30:43,191 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 22:30:43,191 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-04-13 22:30:43,191 INFO L87 Difference]: Start difference. First operand 6146 states and 17885 transitions. Second operand has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 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:30:43,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:30:43,649 INFO L93 Difference]: Finished difference Result 8610 states and 24671 transitions. [2025-04-13 22:30:43,649 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 22:30:43,650 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 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 69 [2025-04-13 22:30:43,650 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:30:43,692 INFO L225 Difference]: With dead ends: 8610 [2025-04-13 22:30:43,692 INFO L226 Difference]: Without dead ends: 7129 [2025-04-13 22:30:43,695 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=110, Invalid=310, Unknown=0, NotChecked=0, Total=420 [2025-04-13 22:30:43,695 INFO L437 NwaCegarLoop]: 17 mSDtfsCounter, 230 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 1301 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 1314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:30:43,695 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 102 Invalid, 1314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1301 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:30:43,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7129 states. [2025-04-13 22:30:43,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7129 to 6180. [2025-04-13 22:30:43,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6180 states, 6179 states have (on average 2.9012785240330152) internal successors, (17927), 6179 states have internal predecessors, (17927), 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:30:43,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6180 states to 6180 states and 17927 transitions. [2025-04-13 22:30:43,794 INFO L79 Accepts]: Start accepts. Automaton has 6180 states and 17927 transitions. Word has length 69 [2025-04-13 22:30:43,794 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:30:43,794 INFO L485 AbstractCegarLoop]: Abstraction has 6180 states and 17927 transitions. [2025-04-13 22:30:43,794 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 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:30:43,795 INFO L278 IsEmpty]: Start isEmpty. Operand 6180 states and 17927 transitions. [2025-04-13 22:30:43,802 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-04-13 22:30:43,802 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:30:43,802 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:30:43,802 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90 [2025-04-13 22:30:43,802 INFO L403 AbstractCegarLoop]: === Iteration 92 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:30:43,802 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:30:43,802 INFO L85 PathProgramCache]: Analyzing trace with hash 912587590, now seen corresponding path program 5 times [2025-04-13 22:30:43,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:30:43,802 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282688831] [2025-04-13 22:30:43,802 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:30:43,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:30:43,806 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 69 statements into 1 equivalence classes. [2025-04-13 22:30:43,808 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-04-13 22:30:43,808 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 22:30:43,808 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:30:43,889 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:30:43,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:30:43,889 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282688831] [2025-04-13 22:30:43,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282688831] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:30:43,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:30:43,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 22:30:43,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931834201] [2025-04-13 22:30:43,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:30:43,889 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 22:30:43,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:30:43,889 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 22:30:43,890 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-04-13 22:30:43,890 INFO L87 Difference]: Start difference. First operand 6180 states and 17927 transitions. Second operand has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 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:30:44,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:30:44,272 INFO L93 Difference]: Finished difference Result 7157 states and 20627 transitions. [2025-04-13 22:30:44,272 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 22:30:44,272 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 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 69 [2025-04-13 22:30:44,272 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:30:44,311 INFO L225 Difference]: With dead ends: 7157 [2025-04-13 22:30:44,311 INFO L226 Difference]: Without dead ends: 6859 [2025-04-13 22:30:44,312 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=110, Invalid=310, Unknown=0, NotChecked=0, Total=420 [2025-04-13 22:30:44,313 INFO L437 NwaCegarLoop]: 17 mSDtfsCounter, 193 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 1043 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 1047 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1043 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:30:44,313 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 93 Invalid, 1047 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1043 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:30:44,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6859 states. [2025-04-13 22:30:44,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6859 to 6260. [2025-04-13 22:30:44,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6260 states, 6259 states have (on average 2.903179421632849) internal successors, (18171), 6259 states have internal predecessors, (18171), 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:30:44,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6260 states to 6260 states and 18171 transitions. [2025-04-13 22:30:44,407 INFO L79 Accepts]: Start accepts. Automaton has 6260 states and 18171 transitions. Word has length 69 [2025-04-13 22:30:44,407 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:30:44,407 INFO L485 AbstractCegarLoop]: Abstraction has 6260 states and 18171 transitions. [2025-04-13 22:30:44,407 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 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:30:44,407 INFO L278 IsEmpty]: Start isEmpty. Operand 6260 states and 18171 transitions. [2025-04-13 22:30:44,415 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-04-13 22:30:44,415 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:30:44,415 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:30:44,415 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable91 [2025-04-13 22:30:44,415 INFO L403 AbstractCegarLoop]: === Iteration 93 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:30:44,415 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:30:44,416 INFO L85 PathProgramCache]: Analyzing trace with hash -1149732455, now seen corresponding path program 9 times [2025-04-13 22:30:44,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:30:44,416 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314383955] [2025-04-13 22:30:44,416 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:30:44,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:30:44,419 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 69 statements into 1 equivalence classes. [2025-04-13 22:30:44,421 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-04-13 22:30:44,421 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 22:30:44,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:30:44,510 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:30:44,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:30:44,510 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314383955] [2025-04-13 22:30:44,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314383955] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:30:44,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:30:44,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 22:30:44,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968722992] [2025-04-13 22:30:44,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:30:44,511 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 22:30:44,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:30:44,511 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 22:30:44,511 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-04-13 22:30:44,511 INFO L87 Difference]: Start difference. First operand 6260 states and 18171 transitions. Second operand has 11 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 11 states have internal predecessors, (69), 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:30:44,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:30:44,999 INFO L93 Difference]: Finished difference Result 7691 states and 22011 transitions. [2025-04-13 22:30:44,999 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-13 22:30:44,999 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 11 states have internal predecessors, (69), 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 69 [2025-04-13 22:30:44,999 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:30:45,042 INFO L225 Difference]: With dead ends: 7691 [2025-04-13 22:30:45,042 INFO L226 Difference]: Without dead ends: 6931 [2025-04-13 22:30:45,045 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=166, Invalid=434, Unknown=0, NotChecked=0, Total=600 [2025-04-13 22:30:45,045 INFO L437 NwaCegarLoop]: 19 mSDtfsCounter, 290 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 1193 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 290 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 1209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 1193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:30:45,045 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [290 Valid, 96 Invalid, 1209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 1193 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:30:45,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6931 states. [2025-04-13 22:30:45,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6931 to 6151. [2025-04-13 22:30:45,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6151 states, 6150 states have (on average 2.908130081300813) internal successors, (17885), 6150 states have internal predecessors, (17885), 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:30:45,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6151 states to 6151 states and 17885 transitions. [2025-04-13 22:30:45,166 INFO L79 Accepts]: Start accepts. Automaton has 6151 states and 17885 transitions. Word has length 69 [2025-04-13 22:30:45,166 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:30:45,166 INFO L485 AbstractCegarLoop]: Abstraction has 6151 states and 17885 transitions. [2025-04-13 22:30:45,166 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 11 states have internal predecessors, (69), 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:30:45,166 INFO L278 IsEmpty]: Start isEmpty. Operand 6151 states and 17885 transitions. [2025-04-13 22:30:45,173 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-04-13 22:30:45,173 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:30:45,173 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:30:45,173 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable92 [2025-04-13 22:30:45,173 INFO L403 AbstractCegarLoop]: === Iteration 94 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:30:45,174 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:30:45,174 INFO L85 PathProgramCache]: Analyzing trace with hash 1010614150, now seen corresponding path program 6 times [2025-04-13 22:30:45,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:30:45,174 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320667183] [2025-04-13 22:30:45,174 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:30:45,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:30:45,177 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 69 statements into 1 equivalence classes. [2025-04-13 22:30:45,180 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-04-13 22:30:45,180 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 22:30:45,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:30:45,261 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:30:45,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:30:45,261 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320667183] [2025-04-13 22:30:45,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320667183] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:30:45,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:30:45,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 22:30:45,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387655217] [2025-04-13 22:30:45,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:30:45,261 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 22:30:45,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:30:45,262 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 22:30:45,262 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-04-13 22:30:45,262 INFO L87 Difference]: Start difference. First operand 6151 states and 17885 transitions. Second operand has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 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:30:45,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:30:45,612 INFO L93 Difference]: Finished difference Result 7296 states and 21007 transitions. [2025-04-13 22:30:45,612 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 22:30:45,612 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 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 69 [2025-04-13 22:30:45,612 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:30:45,653 INFO L225 Difference]: With dead ends: 7296 [2025-04-13 22:30:45,653 INFO L226 Difference]: Without dead ends: 6718 [2025-04-13 22:30:45,655 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=115, Invalid=305, Unknown=0, NotChecked=0, Total=420 [2025-04-13 22:30:45,655 INFO L437 NwaCegarLoop]: 16 mSDtfsCounter, 199 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 898 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 904 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 898 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:30:45,655 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 76 Invalid, 904 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 898 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:30:45,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6718 states. [2025-04-13 22:30:45,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6718 to 6119. [2025-04-13 22:30:45,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6119 states, 6118 states have (on average 2.9037267080745344) internal successors, (17765), 6118 states have internal predecessors, (17765), 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:30:45,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6119 states to 6119 states and 17765 transitions. [2025-04-13 22:30:45,748 INFO L79 Accepts]: Start accepts. Automaton has 6119 states and 17765 transitions. Word has length 69 [2025-04-13 22:30:45,748 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:30:45,748 INFO L485 AbstractCegarLoop]: Abstraction has 6119 states and 17765 transitions. [2025-04-13 22:30:45,748 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 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:30:45,748 INFO L278 IsEmpty]: Start isEmpty. Operand 6119 states and 17765 transitions. [2025-04-13 22:30:45,755 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-04-13 22:30:45,755 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:30:45,755 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:30:45,755 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable93 [2025-04-13 22:30:45,755 INFO L403 AbstractCegarLoop]: === Iteration 95 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:30:45,755 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:30:45,755 INFO L85 PathProgramCache]: Analyzing trace with hash 1376658871, now seen corresponding path program 10 times [2025-04-13 22:30:45,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:30:45,755 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132453663] [2025-04-13 22:30:45,755 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:30:45,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:30:45,758 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 69 statements into 2 equivalence classes. [2025-04-13 22:30:45,762 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 69 of 69 statements. [2025-04-13 22:30:45,762 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:30:45,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:30:45,856 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:30:45,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:30:45,856 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132453663] [2025-04-13 22:30:45,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132453663] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:30:45,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:30:45,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 22:30:45,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686555615] [2025-04-13 22:30:45,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:30:45,856 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 22:30:45,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:30:45,857 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 22:30:45,857 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-04-13 22:30:45,857 INFO L87 Difference]: Start difference. First operand 6119 states and 17765 transitions. Second operand has 11 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 11 states have internal predecessors, (69), 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:30:46,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:30:46,299 INFO L93 Difference]: Finished difference Result 8403 states and 24164 transitions. [2025-04-13 22:30:46,299 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-13 22:30:46,299 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 11 states have internal predecessors, (69), 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 69 [2025-04-13 22:30:46,299 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:30:46,343 INFO L225 Difference]: With dead ends: 8403 [2025-04-13 22:30:46,343 INFO L226 Difference]: Without dead ends: 7272 [2025-04-13 22:30:46,346 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=146, Invalid=360, Unknown=0, NotChecked=0, Total=506 [2025-04-13 22:30:46,346 INFO L437 NwaCegarLoop]: 18 mSDtfsCounter, 259 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 1048 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 1061 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1048 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:30:46,346 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 82 Invalid, 1061 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1048 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:30:46,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7272 states. [2025-04-13 22:30:46,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7272 to 6125. [2025-04-13 22:30:46,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6125 states, 6124 states have (on average 2.90055519268452) internal successors, (17763), 6124 states have internal predecessors, (17763), 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:30:46,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6125 states to 6125 states and 17763 transitions. [2025-04-13 22:30:46,449 INFO L79 Accepts]: Start accepts. Automaton has 6125 states and 17763 transitions. Word has length 69 [2025-04-13 22:30:46,449 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:30:46,449 INFO L485 AbstractCegarLoop]: Abstraction has 6125 states and 17763 transitions. [2025-04-13 22:30:46,449 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 11 states have internal predecessors, (69), 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:30:46,449 INFO L278 IsEmpty]: Start isEmpty. Operand 6125 states and 17763 transitions. [2025-04-13 22:30:46,456 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-04-13 22:30:46,456 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:30:46,456 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:30:46,456 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable94 [2025-04-13 22:30:46,456 INFO L403 AbstractCegarLoop]: === Iteration 96 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:30:46,456 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:30:46,456 INFO L85 PathProgramCache]: Analyzing trace with hash -18006620, now seen corresponding path program 7 times [2025-04-13 22:30:46,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:30:46,456 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038289827] [2025-04-13 22:30:46,456 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:30:46,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:30:46,459 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-04-13 22:30:46,462 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-04-13 22:30:46,462 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:30:46,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:30:46,552 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:30:46,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:30:46,552 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038289827] [2025-04-13 22:30:46,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038289827] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:30:46,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:30:46,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 22:30:46,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773164599] [2025-04-13 22:30:46,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:30:46,553 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 22:30:46,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:30:46,553 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 22:30:46,553 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-04-13 22:30:46,553 INFO L87 Difference]: Start difference. First operand 6125 states and 17763 transitions. Second operand has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 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:30:46,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:30:46,953 INFO L93 Difference]: Finished difference Result 7281 states and 20908 transitions. [2025-04-13 22:30:46,954 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-13 22:30:46,954 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 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 69 [2025-04-13 22:30:46,954 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:30:47,000 INFO L225 Difference]: With dead ends: 7281 [2025-04-13 22:30:47,000 INFO L226 Difference]: Without dead ends: 6903 [2025-04-13 22:30:47,002 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=123, Invalid=339, Unknown=0, NotChecked=0, Total=462 [2025-04-13 22:30:47,002 INFO L437 NwaCegarLoop]: 17 mSDtfsCounter, 213 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 1048 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 1052 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1048 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:30:47,002 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 94 Invalid, 1052 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1048 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:30:47,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6903 states. [2025-04-13 22:30:47,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6903 to 6093. [2025-04-13 22:30:47,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6093 states, 6092 states have (on average 2.9013460275771505) internal successors, (17675), 6092 states have internal predecessors, (17675), 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:30:47,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6093 states to 6093 states and 17675 transitions. [2025-04-13 22:30:47,104 INFO L79 Accepts]: Start accepts. Automaton has 6093 states and 17675 transitions. Word has length 69 [2025-04-13 22:30:47,105 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:30:47,105 INFO L485 AbstractCegarLoop]: Abstraction has 6093 states and 17675 transitions. [2025-04-13 22:30:47,105 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 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:30:47,105 INFO L278 IsEmpty]: Start isEmpty. Operand 6093 states and 17675 transitions. [2025-04-13 22:30:47,111 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-04-13 22:30:47,111 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:30:47,112 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:30:47,112 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable95 [2025-04-13 22:30:47,112 INFO L403 AbstractCegarLoop]: === Iteration 97 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:30:47,112 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:30:47,112 INFO L85 PathProgramCache]: Analyzing trace with hash 1225697555, now seen corresponding path program 11 times [2025-04-13 22:30:47,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:30:47,112 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719365246] [2025-04-13 22:30:47,112 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:30:47,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:30:47,115 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 69 statements into 1 equivalence classes. [2025-04-13 22:30:47,118 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-04-13 22:30:47,118 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 22:30:47,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:30:47,194 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:30:47,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:30:47,194 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719365246] [2025-04-13 22:30:47,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719365246] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:30:47,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:30:47,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 22:30:47,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880660875] [2025-04-13 22:30:47,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:30:47,195 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 22:30:47,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:30:47,195 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 22:30:47,195 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-04-13 22:30:47,195 INFO L87 Difference]: Start difference. First operand 6093 states and 17675 transitions. Second operand has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 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:30:47,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:30:47,669 INFO L93 Difference]: Finished difference Result 8052 states and 22934 transitions. [2025-04-13 22:30:47,669 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 22:30:47,669 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 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 69 [2025-04-13 22:30:47,669 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:30:47,713 INFO L225 Difference]: With dead ends: 8052 [2025-04-13 22:30:47,713 INFO L226 Difference]: Without dead ends: 7232 [2025-04-13 22:30:47,716 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=108, Invalid=272, Unknown=0, NotChecked=0, Total=380 [2025-04-13 22:30:47,716 INFO L437 NwaCegarLoop]: 17 mSDtfsCounter, 240 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 1065 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 1073 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1065 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:30:47,716 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [240 Valid, 79 Invalid, 1073 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1065 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:30:47,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7232 states. [2025-04-13 22:30:47,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7232 to 6036. [2025-04-13 22:30:47,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6036 states, 6035 states have (on average 2.9017398508699253) internal successors, (17512), 6035 states have internal predecessors, (17512), 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:30:47,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6036 states to 6036 states and 17512 transitions. [2025-04-13 22:30:47,818 INFO L79 Accepts]: Start accepts. Automaton has 6036 states and 17512 transitions. Word has length 69 [2025-04-13 22:30:47,819 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:30:47,819 INFO L485 AbstractCegarLoop]: Abstraction has 6036 states and 17512 transitions. [2025-04-13 22:30:47,819 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 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:30:47,819 INFO L278 IsEmpty]: Start isEmpty. Operand 6036 states and 17512 transitions. [2025-04-13 22:30:47,825 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-04-13 22:30:47,825 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:30:47,826 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:30:47,826 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable96 [2025-04-13 22:30:47,826 INFO L403 AbstractCegarLoop]: === Iteration 98 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:30:47,826 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:30:47,826 INFO L85 PathProgramCache]: Analyzing trace with hash 1934828738, now seen corresponding path program 8 times [2025-04-13 22:30:47,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:30:47,826 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31891186] [2025-04-13 22:30:47,826 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:30:47,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:30:47,829 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 69 statements into 1 equivalence classes. [2025-04-13 22:30:47,832 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-04-13 22:30:47,832 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 22:30:47,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:30:47,917 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:30:47,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:30:47,917 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31891186] [2025-04-13 22:30:47,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31891186] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:30:47,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:30:47,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 22:30:47,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012577872] [2025-04-13 22:30:47,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:30:47,918 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 22:30:47,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:30:47,918 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 22:30:47,918 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-04-13 22:30:47,918 INFO L87 Difference]: Start difference. First operand 6036 states and 17512 transitions. Second operand has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 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:30:48,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:30:48,265 INFO L93 Difference]: Finished difference Result 6933 states and 19952 transitions. [2025-04-13 22:30:48,265 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 22:30:48,265 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 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 69 [2025-04-13 22:30:48,265 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:30:48,311 INFO L225 Difference]: With dead ends: 6933 [2025-04-13 22:30:48,311 INFO L226 Difference]: Without dead ends: 6635 [2025-04-13 22:30:48,313 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=115, Invalid=305, Unknown=0, NotChecked=0, Total=420 [2025-04-13 22:30:48,313 INFO L437 NwaCegarLoop]: 16 mSDtfsCounter, 202 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 902 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 906 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 902 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:30:48,313 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 76 Invalid, 906 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 902 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:30:48,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6635 states. [2025-04-13 22:30:48,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6635 to 6084. [2025-04-13 22:30:48,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6084 states, 6083 states have (on average 2.901857636034851) internal successors, (17652), 6083 states have internal predecessors, (17652), 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:30:48,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6084 states to 6084 states and 17652 transitions. [2025-04-13 22:30:48,420 INFO L79 Accepts]: Start accepts. Automaton has 6084 states and 17652 transitions. Word has length 69 [2025-04-13 22:30:48,420 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:30:48,420 INFO L485 AbstractCegarLoop]: Abstraction has 6084 states and 17652 transitions. [2025-04-13 22:30:48,420 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 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:30:48,420 INFO L278 IsEmpty]: Start isEmpty. Operand 6084 states and 17652 transitions. [2025-04-13 22:30:48,427 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-04-13 22:30:48,427 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:30:48,427 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:30:48,427 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable97 [2025-04-13 22:30:48,427 INFO L403 AbstractCegarLoop]: === Iteration 99 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:30:48,428 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:30:48,428 INFO L85 PathProgramCache]: Analyzing trace with hash -637798441, now seen corresponding path program 12 times [2025-04-13 22:30:48,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:30:48,428 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043802217] [2025-04-13 22:30:48,428 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:30:48,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:30:48,431 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 69 statements into 1 equivalence classes. [2025-04-13 22:30:48,433 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-04-13 22:30:48,433 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 22:30:48,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:30:48,512 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:30:48,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:30:48,512 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043802217] [2025-04-13 22:30:48,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1043802217] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:30:48,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:30:48,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 22:30:48,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47115127] [2025-04-13 22:30:48,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:30:48,513 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 22:30:48,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:30:48,513 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 22:30:48,513 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-04-13 22:30:48,513 INFO L87 Difference]: Start difference. First operand 6084 states and 17652 transitions. Second operand has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 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:30:48,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:30:48,982 INFO L93 Difference]: Finished difference Result 8812 states and 25239 transitions. [2025-04-13 22:30:48,982 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 22:30:48,982 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 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 69 [2025-04-13 22:30:48,982 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:30:49,030 INFO L225 Difference]: With dead ends: 8812 [2025-04-13 22:30:49,031 INFO L226 Difference]: Without dead ends: 7331 [2025-04-13 22:30:49,034 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=110, Invalid=310, Unknown=0, NotChecked=0, Total=420 [2025-04-13 22:30:49,035 INFO L437 NwaCegarLoop]: 16 mSDtfsCounter, 237 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 1337 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 1349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:30:49,035 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 95 Invalid, 1349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1337 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:30:49,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7331 states. [2025-04-13 22:30:49,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7331 to 6152. [2025-04-13 22:30:49,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6152 states, 6151 states have (on average 2.897252479271663) internal successors, (17821), 6151 states have internal predecessors, (17821), 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:30:49,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6152 states to 6152 states and 17821 transitions. [2025-04-13 22:30:49,144 INFO L79 Accepts]: Start accepts. Automaton has 6152 states and 17821 transitions. Word has length 69 [2025-04-13 22:30:49,145 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:30:49,145 INFO L485 AbstractCegarLoop]: Abstraction has 6152 states and 17821 transitions. [2025-04-13 22:30:49,145 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 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:30:49,145 INFO L278 IsEmpty]: Start isEmpty. Operand 6152 states and 17821 transitions. [2025-04-13 22:30:49,152 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-04-13 22:30:49,152 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:30:49,152 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:30:49,152 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable98 [2025-04-13 22:30:49,152 INFO L403 AbstractCegarLoop]: === Iteration 100 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:30:49,153 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:30:49,153 INFO L85 PathProgramCache]: Analyzing trace with hash 2032855298, now seen corresponding path program 9 times [2025-04-13 22:30:49,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:30:49,153 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143485223] [2025-04-13 22:30:49,153 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:30:49,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:30:49,156 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 69 statements into 1 equivalence classes. [2025-04-13 22:30:49,159 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-04-13 22:30:49,159 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 22:30:49,159 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:30:49,250 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:30:49,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:30:49,251 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143485223] [2025-04-13 22:30:49,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143485223] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:30:49,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:30:49,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 22:30:49,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681913030] [2025-04-13 22:30:49,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:30:49,251 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 22:30:49,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:30:49,251 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 22:30:49,251 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-04-13 22:30:49,251 INFO L87 Difference]: Start difference. First operand 6152 states and 17821 transitions. Second operand has 11 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 11 states have internal predecessors, (69), 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:30:49,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:30:49,663 INFO L93 Difference]: Finished difference Result 7067 states and 20275 transitions. [2025-04-13 22:30:49,663 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-13 22:30:49,663 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 11 states have internal predecessors, (69), 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 69 [2025-04-13 22:30:49,663 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:30:49,718 INFO L225 Difference]: With dead ends: 7067 [2025-04-13 22:30:49,718 INFO L226 Difference]: Without dead ends: 6753 [2025-04-13 22:30:49,721 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=192, Invalid=458, Unknown=0, NotChecked=0, Total=650 [2025-04-13 22:30:49,721 INFO L437 NwaCegarLoop]: 20 mSDtfsCounter, 228 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 870 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 881 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 870 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:30:49,721 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 80 Invalid, 881 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 870 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:30:49,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6753 states. [2025-04-13 22:30:49,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6753 to 6136. [2025-04-13 22:30:49,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6136 states, 6135 states have (on average 2.8963325183374082) internal successors, (17769), 6135 states have internal predecessors, (17769), 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:30:49,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6136 states to 6136 states and 17769 transitions. [2025-04-13 22:30:49,839 INFO L79 Accepts]: Start accepts. Automaton has 6136 states and 17769 transitions. Word has length 69 [2025-04-13 22:30:49,839 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:30:49,839 INFO L485 AbstractCegarLoop]: Abstraction has 6136 states and 17769 transitions. [2025-04-13 22:30:49,839 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 11 states have internal predecessors, (69), 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:30:49,839 INFO L278 IsEmpty]: Start isEmpty. Operand 6136 states and 17769 transitions. [2025-04-13 22:30:49,847 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-04-13 22:30:49,847 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:30:49,847 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:30:49,847 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable99 [2025-04-13 22:30:49,847 INFO L403 AbstractCegarLoop]: === Iteration 101 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:30:49,847 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:30:49,847 INFO L85 PathProgramCache]: Analyzing trace with hash 900807891, now seen corresponding path program 13 times [2025-04-13 22:30:49,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:30:49,847 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929383433] [2025-04-13 22:30:49,847 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:30:49,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:30:49,851 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-04-13 22:30:49,853 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-04-13 22:30:49,853 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:30:49,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:30:49,967 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:30:49,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:30:49,967 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929383433] [2025-04-13 22:30:49,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929383433] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:30:49,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:30:49,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 22:30:49,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596423697] [2025-04-13 22:30:49,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:30:49,968 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 22:30:49,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:30:49,968 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 22:30:49,968 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-04-13 22:30:49,968 INFO L87 Difference]: Start difference. First operand 6136 states and 17769 transitions. Second operand has 11 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 11 states have internal predecessors, (69), 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:30:50,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:30:50,550 INFO L93 Difference]: Finished difference Result 8022 states and 22831 transitions. [2025-04-13 22:30:50,551 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-13 22:30:50,551 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 11 states have internal predecessors, (69), 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 69 [2025-04-13 22:30:50,551 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:30:50,601 INFO L225 Difference]: With dead ends: 8022 [2025-04-13 22:30:50,601 INFO L226 Difference]: Without dead ends: 7286 [2025-04-13 22:30:50,604 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=202, Invalid=500, Unknown=0, NotChecked=0, Total=702 [2025-04-13 22:30:50,604 INFO L437 NwaCegarLoop]: 18 mSDtfsCounter, 355 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 1353 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 355 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 1374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 1353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:30:50,604 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [355 Valid, 93 Invalid, 1374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 1353 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:30:50,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7286 states. [2025-04-13 22:30:50,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7286 to 6051. [2025-04-13 22:30:50,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6051 states, 6050 states have (on average 2.9008264462809916) internal successors, (17550), 6050 states have internal predecessors, (17550), 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:30:50,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6051 states to 6051 states and 17550 transitions. [2025-04-13 22:30:50,707 INFO L79 Accepts]: Start accepts. Automaton has 6051 states and 17550 transitions. Word has length 69 [2025-04-13 22:30:50,707 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:30:50,707 INFO L485 AbstractCegarLoop]: Abstraction has 6051 states and 17550 transitions. [2025-04-13 22:30:50,707 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 11 states have internal predecessors, (69), 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:30:50,707 INFO L278 IsEmpty]: Start isEmpty. Operand 6051 states and 17550 transitions. [2025-04-13 22:30:50,714 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-04-13 22:30:50,714 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:30:50,714 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:30:50,714 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable100 [2025-04-13 22:30:50,714 INFO L403 AbstractCegarLoop]: === Iteration 102 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:30:50,714 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:30:50,714 INFO L85 PathProgramCache]: Analyzing trace with hash 698202366, now seen corresponding path program 10 times [2025-04-13 22:30:50,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:30:50,714 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997463705] [2025-04-13 22:30:50,714 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:30:50,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:30:50,718 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 69 statements into 2 equivalence classes. [2025-04-13 22:30:50,719 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 57 of 69 statements. [2025-04-13 22:30:50,719 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 22:30:50,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:30:50,743 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:30:50,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:30:50,743 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997463705] [2025-04-13 22:30:50,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997463705] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:30:50,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:30:50,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 22:30:50,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649740707] [2025-04-13 22:30:50,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:30:50,743 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 22:30:50,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:30:50,743 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 22:30:50,743 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-04-13 22:30:50,743 INFO L87 Difference]: Start difference. First operand 6051 states and 17550 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 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:30:51,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:30:51,120 INFO L93 Difference]: Finished difference Result 9160 states and 25884 transitions. [2025-04-13 22:30:51,120 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-13 22:30:51,120 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 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 69 [2025-04-13 22:30:51,120 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:30:51,164 INFO L225 Difference]: With dead ends: 9160 [2025-04-13 22:30:51,164 INFO L226 Difference]: Without dead ends: 8798 [2025-04-13 22:30:51,166 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=122, Invalid=298, Unknown=0, NotChecked=0, Total=420 [2025-04-13 22:30:51,166 INFO L437 NwaCegarLoop]: 12 mSDtfsCounter, 391 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 895 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 391 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 922 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 895 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:30:51,166 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [391 Valid, 53 Invalid, 922 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 895 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:30:51,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8798 states. [2025-04-13 22:30:51,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8798 to 6035. [2025-04-13 22:30:51,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6035 states, 6034 states have (on average 2.899900563473649) internal successors, (17498), 6034 states have internal predecessors, (17498), 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:30:51,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6035 states to 6035 states and 17498 transitions. [2025-04-13 22:30:51,269 INFO L79 Accepts]: Start accepts. Automaton has 6035 states and 17498 transitions. Word has length 69 [2025-04-13 22:30:51,269 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:30:51,269 INFO L485 AbstractCegarLoop]: Abstraction has 6035 states and 17498 transitions. [2025-04-13 22:30:51,269 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 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:30:51,269 INFO L278 IsEmpty]: Start isEmpty. Operand 6035 states and 17498 transitions. [2025-04-13 22:30:51,276 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-04-13 22:30:51,276 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:30:51,276 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:30:51,276 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable101 [2025-04-13 22:30:51,276 INFO L403 AbstractCegarLoop]: === Iteration 103 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:30:51,276 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:30:51,276 INFO L85 PathProgramCache]: Analyzing trace with hash -25036813, now seen corresponding path program 14 times [2025-04-13 22:30:51,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:30:51,276 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979271399] [2025-04-13 22:30:51,276 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:30:51,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:30:51,279 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 69 statements into 1 equivalence classes. [2025-04-13 22:30:51,282 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-04-13 22:30:51,282 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 22:30:51,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:30:51,360 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:30:51,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:30:51,361 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979271399] [2025-04-13 22:30:51,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979271399] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:30:51,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:30:51,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 22:30:51,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979485285] [2025-04-13 22:30:51,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:30:51,361 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 22:30:51,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:30:51,361 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 22:30:51,361 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-04-13 22:30:51,361 INFO L87 Difference]: Start difference. First operand 6035 states and 17498 transitions. Second operand has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 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:30:51,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:30:51,724 INFO L93 Difference]: Finished difference Result 7389 states and 21130 transitions. [2025-04-13 22:30:51,724 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-13 22:30:51,724 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 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 69 [2025-04-13 22:30:51,724 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:30:51,764 INFO L225 Difference]: With dead ends: 7389 [2025-04-13 22:30:51,764 INFO L226 Difference]: Without dead ends: 5908 [2025-04-13 22:30:51,767 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2025-04-13 22:30:51,767 INFO L437 NwaCegarLoop]: 15 mSDtfsCounter, 186 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 1019 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 1029 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1019 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:30:51,767 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 81 Invalid, 1029 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1019 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:30:51,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5908 states. [2025-04-13 22:30:51,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5908 to 5533. [2025-04-13 22:30:51,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5533 states, 5532 states have (on average 2.8779826464208242) internal successors, (15921), 5532 states have internal predecessors, (15921), 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:30:51,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5533 states to 5533 states and 15921 transitions. [2025-04-13 22:30:51,856 INFO L79 Accepts]: Start accepts. Automaton has 5533 states and 15921 transitions. Word has length 69 [2025-04-13 22:30:51,856 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:30:51,856 INFO L485 AbstractCegarLoop]: Abstraction has 5533 states and 15921 transitions. [2025-04-13 22:30:51,856 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 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:30:51,856 INFO L278 IsEmpty]: Start isEmpty. Operand 5533 states and 15921 transitions. [2025-04-13 22:30:51,862 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-04-13 22:30:51,862 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:30:51,862 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:30:51,862 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable102 [2025-04-13 22:30:51,862 INFO L403 AbstractCegarLoop]: === Iteration 104 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:30:51,862 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:30:51,862 INFO L85 PathProgramCache]: Analyzing trace with hash -160144442, now seen corresponding path program 11 times [2025-04-13 22:30:51,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:30:51,862 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68942802] [2025-04-13 22:30:51,862 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:30:51,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:30:51,866 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 69 statements into 1 equivalence classes. [2025-04-13 22:30:51,868 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-04-13 22:30:51,868 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 22:30:51,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:30:51,900 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:30:51,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:30:51,900 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68942802] [2025-04-13 22:30:51,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68942802] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:30:51,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:30:51,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 22:30:51,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748741249] [2025-04-13 22:30:51,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:30:51,900 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 22:30:51,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:30:51,900 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 22:30:51,901 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-04-13 22:30:51,901 INFO L87 Difference]: Start difference. First operand 5533 states and 15921 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 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:30:52,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:30:52,239 INFO L93 Difference]: Finished difference Result 8096 states and 22711 transitions. [2025-04-13 22:30:52,239 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 22:30:52,239 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 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 69 [2025-04-13 22:30:52,239 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:30:52,284 INFO L225 Difference]: With dead ends: 8096 [2025-04-13 22:30:52,284 INFO L226 Difference]: Without dead ends: 7658 [2025-04-13 22:30:52,286 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=76, Invalid=164, Unknown=0, NotChecked=0, Total=240 [2025-04-13 22:30:52,286 INFO L437 NwaCegarLoop]: 12 mSDtfsCounter, 260 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 909 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 925 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 909 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:30:52,286 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [260 Valid, 60 Invalid, 925 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 909 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:30:52,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7658 states. [2025-04-13 22:30:52,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7658 to 5489. [2025-04-13 22:30:52,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5489 states, 5488 states have (on average 2.878826530612245) internal successors, (15799), 5488 states have internal predecessors, (15799), 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:30:52,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5489 states to 5489 states and 15799 transitions. [2025-04-13 22:30:52,383 INFO L79 Accepts]: Start accepts. Automaton has 5489 states and 15799 transitions. Word has length 69 [2025-04-13 22:30:52,383 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:30:52,383 INFO L485 AbstractCegarLoop]: Abstraction has 5489 states and 15799 transitions. [2025-04-13 22:30:52,383 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 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:30:52,383 INFO L278 IsEmpty]: Start isEmpty. Operand 5489 states and 15799 transitions. [2025-04-13 22:30:52,389 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-04-13 22:30:52,389 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:30:52,389 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:30:52,389 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable103 [2025-04-13 22:30:52,389 INFO L403 AbstractCegarLoop]: === Iteration 105 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:30:52,389 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:30:52,389 INFO L85 PathProgramCache]: Analyzing trace with hash 1513569519, now seen corresponding path program 15 times [2025-04-13 22:30:52,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:30:52,390 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141657709] [2025-04-13 22:30:52,390 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:30:52,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:30:52,393 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 69 statements into 1 equivalence classes. [2025-04-13 22:30:52,395 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-04-13 22:30:52,395 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 22:30:52,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:30:52,472 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:30:52,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:30:52,473 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141657709] [2025-04-13 22:30:52,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141657709] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:30:52,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:30:52,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 22:30:52,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412687644] [2025-04-13 22:30:52,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:30:52,473 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 22:30:52,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:30:52,473 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 22:30:52,473 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-04-13 22:30:52,473 INFO L87 Difference]: Start difference. First operand 5489 states and 15799 transitions. Second operand has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 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:30:52,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:30:52,889 INFO L93 Difference]: Finished difference Result 6138 states and 17482 transitions. [2025-04-13 22:30:52,889 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-13 22:30:52,889 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 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 69 [2025-04-13 22:30:52,889 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:30:52,929 INFO L225 Difference]: With dead ends: 6138 [2025-04-13 22:30:52,929 INFO L226 Difference]: Without dead ends: 5779 [2025-04-13 22:30:52,931 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=251, Unknown=0, NotChecked=0, Total=342 [2025-04-13 22:30:52,931 INFO L437 NwaCegarLoop]: 14 mSDtfsCounter, 174 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 1138 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 1142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:30:52,931 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 82 Invalid, 1142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1138 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:30:52,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5779 states. [2025-04-13 22:30:52,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5779 to 5419. [2025-04-13 22:30:52,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5419 states, 5418 states have (on average 2.878922111480251) internal successors, (15598), 5418 states have internal predecessors, (15598), 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:30:52,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5419 states to 5419 states and 15598 transitions. [2025-04-13 22:30:53,019 INFO L79 Accepts]: Start accepts. Automaton has 5419 states and 15598 transitions. Word has length 69 [2025-04-13 22:30:53,019 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:30:53,019 INFO L485 AbstractCegarLoop]: Abstraction has 5419 states and 15598 transitions. [2025-04-13 22:30:53,019 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 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:30:53,019 INFO L278 IsEmpty]: Start isEmpty. Operand 5419 states and 15598 transitions. [2025-04-13 22:30:53,025 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-04-13 22:30:53,025 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:30:53,026 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:30:53,026 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable104 [2025-04-13 22:30:53,026 INFO L403 AbstractCegarLoop]: === Iteration 106 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:30:53,026 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:30:53,026 INFO L85 PathProgramCache]: Analyzing trace with hash 1209202942, now seen corresponding path program 12 times [2025-04-13 22:30:53,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:30:53,026 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594718185] [2025-04-13 22:30:53,026 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:30:53,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:30:53,029 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 69 statements into 1 equivalence classes. [2025-04-13 22:30:53,032 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-04-13 22:30:53,032 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 22:30:53,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:30:53,124 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:30:53,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:30:53,124 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594718185] [2025-04-13 22:30:53,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594718185] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:30:53,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:30:53,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 22:30:53,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393793530] [2025-04-13 22:30:53,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:30:53,124 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 22:30:53,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:30:53,125 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 22:30:53,125 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-04-13 22:30:53,125 INFO L87 Difference]: Start difference. First operand 5419 states and 15598 transitions. Second operand has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 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:30:53,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:30:53,500 INFO L93 Difference]: Finished difference Result 6165 states and 17599 transitions. [2025-04-13 22:30:53,500 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 22:30:53,500 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 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 69 [2025-04-13 22:30:53,500 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:30:53,540 INFO L225 Difference]: With dead ends: 6165 [2025-04-13 22:30:53,540 INFO L226 Difference]: Without dead ends: 5867 [2025-04-13 22:30:53,542 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=110, Invalid=310, Unknown=0, NotChecked=0, Total=420 [2025-04-13 22:30:53,542 INFO L437 NwaCegarLoop]: 17 mSDtfsCounter, 178 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 1019 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 1022 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1019 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:30:53,542 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 93 Invalid, 1022 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1019 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:30:53,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5867 states. [2025-04-13 22:30:53,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5867 to 5455. [2025-04-13 22:30:53,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5455 states, 5454 states have (on average 2.8782544921158784) internal successors, (15698), 5454 states have internal predecessors, (15698), 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:30:53,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5455 states to 5455 states and 15698 transitions. [2025-04-13 22:30:53,625 INFO L79 Accepts]: Start accepts. Automaton has 5455 states and 15698 transitions. Word has length 69 [2025-04-13 22:30:53,625 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:30:53,625 INFO L485 AbstractCegarLoop]: Abstraction has 5455 states and 15698 transitions. [2025-04-13 22:30:53,625 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 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:30:53,625 INFO L278 IsEmpty]: Start isEmpty. Operand 5455 states and 15698 transitions. [2025-04-13 22:30:53,631 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-04-13 22:30:53,631 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:30:53,631 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:30:53,631 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable105 [2025-04-13 22:30:53,632 INFO L403 AbstractCegarLoop]: === Iteration 107 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:30:53,632 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:30:53,632 INFO L85 PathProgramCache]: Analyzing trace with hash 140533203, now seen corresponding path program 16 times [2025-04-13 22:30:53,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:30:53,632 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473429982] [2025-04-13 22:30:53,632 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:30:53,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:30:53,635 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 69 statements into 2 equivalence classes. [2025-04-13 22:30:53,636 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 57 of 69 statements. [2025-04-13 22:30:53,636 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 22:30:53,636 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:30:53,672 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:30:53,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:30:53,672 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473429982] [2025-04-13 22:30:53,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473429982] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:30:53,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:30:53,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 22:30:53,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413845664] [2025-04-13 22:30:53,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:30:53,672 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 22:30:53,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:30:53,673 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 22:30:53,673 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-04-13 22:30:53,673 INFO L87 Difference]: Start difference. First operand 5455 states and 15698 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 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:30:54,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:30:54,042 INFO L93 Difference]: Finished difference Result 7499 states and 21163 transitions. [2025-04-13 22:30:54,042 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-13 22:30:54,042 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 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 69 [2025-04-13 22:30:54,042 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:30:54,082 INFO L225 Difference]: With dead ends: 7499 [2025-04-13 22:30:54,082 INFO L226 Difference]: Without dead ends: 7038 [2025-04-13 22:30:54,084 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2025-04-13 22:30:54,084 INFO L437 NwaCegarLoop]: 13 mSDtfsCounter, 296 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 933 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 951 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 933 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:30:54,085 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [296 Valid, 71 Invalid, 951 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 933 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:30:54,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7038 states. [2025-04-13 22:30:54,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7038 to 5421. [2025-04-13 22:30:54,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5421 states, 5420 states have (on average 2.877859778597786) internal successors, (15598), 5420 states have internal predecessors, (15598), 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:30:54,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5421 states to 5421 states and 15598 transitions. [2025-04-13 22:30:54,174 INFO L79 Accepts]: Start accepts. Automaton has 5421 states and 15598 transitions. Word has length 69 [2025-04-13 22:30:54,175 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:30:54,175 INFO L485 AbstractCegarLoop]: Abstraction has 5421 states and 15598 transitions. [2025-04-13 22:30:54,175 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 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:30:54,175 INFO L278 IsEmpty]: Start isEmpty. Operand 5421 states and 15598 transitions. [2025-04-13 22:30:54,181 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-04-13 22:30:54,181 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:30:54,181 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:30:54,181 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable106 [2025-04-13 22:30:54,181 INFO L403 AbstractCegarLoop]: === Iteration 108 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:30:54,181 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:30:54,181 INFO L85 PathProgramCache]: Analyzing trace with hash -46940994, now seen corresponding path program 13 times [2025-04-13 22:30:54,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:30:54,181 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352186383] [2025-04-13 22:30:54,181 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:30:54,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:30:54,184 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-04-13 22:30:54,186 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-04-13 22:30:54,186 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:30:54,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:30:54,265 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:30:54,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:30:54,266 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352186383] [2025-04-13 22:30:54,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352186383] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:30:54,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:30:54,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 22:30:54,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475695799] [2025-04-13 22:30:54,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:30:54,266 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 22:30:54,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:30:54,266 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 22:30:54,266 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-04-13 22:30:54,266 INFO L87 Difference]: Start difference. First operand 5421 states and 15598 transitions. Second operand has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 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:30:54,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:30:54,675 INFO L93 Difference]: Finished difference Result 6379 states and 18165 transitions. [2025-04-13 22:30:54,675 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 22:30:54,675 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 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 69 [2025-04-13 22:30:54,675 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:30:54,725 INFO L225 Difference]: With dead ends: 6379 [2025-04-13 22:30:54,725 INFO L226 Difference]: Without dead ends: 5801 [2025-04-13 22:30:54,727 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=115, Invalid=305, Unknown=0, NotChecked=0, Total=420 [2025-04-13 22:30:54,727 INFO L437 NwaCegarLoop]: 16 mSDtfsCounter, 178 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 1090 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 1095 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1090 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:30:54,727 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 94 Invalid, 1095 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1090 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:30:54,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5801 states. [2025-04-13 22:30:54,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5801 to 5389. [2025-04-13 22:30:54,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5389 states, 5388 states have (on average 2.87268002969562) internal successors, (15478), 5388 states have internal predecessors, (15478), 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:30:54,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5389 states to 5389 states and 15478 transitions. [2025-04-13 22:30:54,839 INFO L79 Accepts]: Start accepts. Automaton has 5389 states and 15478 transitions. Word has length 69 [2025-04-13 22:30:54,839 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:30:54,839 INFO L485 AbstractCegarLoop]: Abstraction has 5389 states and 15478 transitions. [2025-04-13 22:30:54,839 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 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:30:54,839 INFO L278 IsEmpty]: Start isEmpty. Operand 5389 states and 15478 transitions. [2025-04-13 22:30:54,845 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-04-13 22:30:54,846 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:30:54,846 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:30:54,846 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable107 [2025-04-13 22:30:54,846 INFO L403 AbstractCegarLoop]: === Iteration 109 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:30:54,846 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:30:54,846 INFO L85 PathProgramCache]: Analyzing trace with hash 927520271, now seen corresponding path program 17 times [2025-04-13 22:30:54,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:30:54,846 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524230121] [2025-04-13 22:30:54,846 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:30:54,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:30:54,849 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 69 statements into 1 equivalence classes. [2025-04-13 22:30:54,851 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-04-13 22:30:54,852 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 22:30:54,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:30:54,887 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:30:54,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:30:54,888 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524230121] [2025-04-13 22:30:54,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524230121] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:30:54,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:30:54,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 22:30:54,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046596951] [2025-04-13 22:30:54,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:30:54,888 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 22:30:54,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:30:54,888 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 22:30:54,888 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-04-13 22:30:54,888 INFO L87 Difference]: Start difference. First operand 5389 states and 15478 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 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:30:55,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:30:55,238 INFO L93 Difference]: Finished difference Result 7009 states and 19836 transitions. [2025-04-13 22:30:55,238 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 22:30:55,239 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 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 69 [2025-04-13 22:30:55,239 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:30:55,280 INFO L225 Difference]: With dead ends: 7009 [2025-04-13 22:30:55,281 INFO L226 Difference]: Without dead ends: 6366 [2025-04-13 22:30:55,282 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=75, Invalid=165, Unknown=0, NotChecked=0, Total=240 [2025-04-13 22:30:55,283 INFO L437 NwaCegarLoop]: 15 mSDtfsCounter, 218 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 928 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 943 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 928 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:30:55,283 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 75 Invalid, 943 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 928 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:30:55,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6366 states. [2025-04-13 22:30:55,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6366 to 4927. [2025-04-13 22:30:55,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4927 states, 4926 states have (on average 2.8670320747056435) internal successors, (14123), 4926 states have internal predecessors, (14123), 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:30:55,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4927 states to 4927 states and 14123 transitions. [2025-04-13 22:30:55,366 INFO L79 Accepts]: Start accepts. Automaton has 4927 states and 14123 transitions. Word has length 69 [2025-04-13 22:30:55,366 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:30:55,366 INFO L485 AbstractCegarLoop]: Abstraction has 4927 states and 14123 transitions. [2025-04-13 22:30:55,366 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 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:30:55,366 INFO L278 IsEmpty]: Start isEmpty. Operand 4927 states and 14123 transitions. [2025-04-13 22:30:55,371 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-04-13 22:30:55,371 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:30:55,371 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:30:55,371 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable108 [2025-04-13 22:30:55,371 INFO L403 AbstractCegarLoop]: === Iteration 110 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:30:55,372 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:30:55,372 INFO L85 PathProgramCache]: Analyzing trace with hash -1869413792, now seen corresponding path program 14 times [2025-04-13 22:30:55,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:30:55,372 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17050617] [2025-04-13 22:30:55,372 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:30:55,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:30:55,393 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 69 statements into 1 equivalence classes. [2025-04-13 22:30:55,396 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-04-13 22:30:55,396 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 22:30:55,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:30:55,479 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:30:55,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:30:55,479 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17050617] [2025-04-13 22:30:55,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17050617] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:30:55,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:30:55,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 22:30:55,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043074326] [2025-04-13 22:30:55,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:30:55,480 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 22:30:55,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:30:55,480 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 22:30:55,480 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-04-13 22:30:55,480 INFO L87 Difference]: Start difference. First operand 4927 states and 14123 transitions. Second operand has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 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:30:55,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:30:55,874 INFO L93 Difference]: Finished difference Result 5645 states and 16028 transitions. [2025-04-13 22:30:55,875 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-13 22:30:55,875 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 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 69 [2025-04-13 22:30:55,875 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:30:55,917 INFO L225 Difference]: With dead ends: 5645 [2025-04-13 22:30:55,917 INFO L226 Difference]: Without dead ends: 5267 [2025-04-13 22:30:55,919 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=123, Invalid=339, Unknown=0, NotChecked=0, Total=462 [2025-04-13 22:30:55,919 INFO L437 NwaCegarLoop]: 17 mSDtfsCounter, 193 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 1030 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 1033 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1030 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:30:55,919 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 94 Invalid, 1033 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1030 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:30:55,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5267 states. [2025-04-13 22:30:55,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5267 to 4895. [2025-04-13 22:30:55,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4895 states, 4894 states have (on average 2.8677973028197794) internal successors, (14035), 4894 states have internal predecessors, (14035), 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:30:55,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4895 states to 4895 states and 14035 transitions. [2025-04-13 22:30:56,002 INFO L79 Accepts]: Start accepts. Automaton has 4895 states and 14035 transitions. Word has length 69 [2025-04-13 22:30:56,002 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:30:56,002 INFO L485 AbstractCegarLoop]: Abstraction has 4895 states and 14035 transitions. [2025-04-13 22:30:56,002 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 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:30:56,002 INFO L278 IsEmpty]: Start isEmpty. Operand 4895 states and 14035 transitions. [2025-04-13 22:30:56,007 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-04-13 22:30:56,007 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:30:56,008 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:30:56,008 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable109 [2025-04-13 22:30:56,008 INFO L403 AbstractCegarLoop]: === Iteration 111 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:30:56,008 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:30:56,008 INFO L85 PathProgramCache]: Analyzing trace with hash -2128419462, now seen corresponding path program 2 times [2025-04-13 22:30:56,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:30:56,008 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004916120] [2025-04-13 22:30:56,008 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:30:56,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:30:56,011 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 69 statements into 1 equivalence classes. [2025-04-13 22:30:56,013 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-04-13 22:30:56,013 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 22:30:56,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:30:56,087 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:30:56,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:30:56,088 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004916120] [2025-04-13 22:30:56,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004916120] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:30:56,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:30:56,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 22:30:56,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878270790] [2025-04-13 22:30:56,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:30:56,088 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 22:30:56,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:30:56,088 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 22:30:56,088 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-04-13 22:30:56,088 INFO L87 Difference]: Start difference. First operand 4895 states and 14035 transitions. Second operand has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 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:30:56,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:30:56,570 INFO L93 Difference]: Finished difference Result 7395 states and 20669 transitions. [2025-04-13 22:30:56,570 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-04-13 22:30:56,570 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 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 69 [2025-04-13 22:30:56,570 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:30:56,615 INFO L225 Difference]: With dead ends: 7395 [2025-04-13 22:30:56,615 INFO L226 Difference]: Without dead ends: 6374 [2025-04-13 22:30:56,617 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=211, Invalid=601, Unknown=0, NotChecked=0, Total=812 [2025-04-13 22:30:56,618 INFO L437 NwaCegarLoop]: 20 mSDtfsCounter, 364 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 1193 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 364 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 1208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 1193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:30:56,618 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [364 Valid, 107 Invalid, 1208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 1193 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:30:56,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6374 states. [2025-04-13 22:30:56,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6374 to 4842. [2025-04-13 22:30:56,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4842 states, 4841 states have (on average 2.8558149142739104) internal successors, (13825), 4841 states have internal predecessors, (13825), 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:30:56,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4842 states to 4842 states and 13825 transitions. [2025-04-13 22:30:56,706 INFO L79 Accepts]: Start accepts. Automaton has 4842 states and 13825 transitions. Word has length 69 [2025-04-13 22:30:56,706 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:30:56,706 INFO L485 AbstractCegarLoop]: Abstraction has 4842 states and 13825 transitions. [2025-04-13 22:30:56,706 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 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:30:56,706 INFO L278 IsEmpty]: Start isEmpty. Operand 4842 states and 13825 transitions. [2025-04-13 22:30:56,712 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-04-13 22:30:56,712 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:30:56,712 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:30:56,712 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable110 [2025-04-13 22:30:56,712 INFO L403 AbstractCegarLoop]: === Iteration 112 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:30:56,712 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:30:56,712 INFO L85 PathProgramCache]: Analyzing trace with hash -1461059838, now seen corresponding path program 15 times [2025-04-13 22:30:56,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:30:56,712 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700285704] [2025-04-13 22:30:56,712 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:30:56,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:30:56,715 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 69 statements into 1 equivalence classes. [2025-04-13 22:30:56,718 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-04-13 22:30:56,718 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 22:30:56,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:30:56,796 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:30:56,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:30:56,797 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700285704] [2025-04-13 22:30:56,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [700285704] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:30:56,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:30:56,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 22:30:56,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990644975] [2025-04-13 22:30:56,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:30:56,797 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 22:30:56,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:30:56,797 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 22:30:56,797 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-04-13 22:30:56,797 INFO L87 Difference]: Start difference. First operand 4842 states and 13825 transitions. Second operand has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 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:30:57,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:30:57,156 INFO L93 Difference]: Finished difference Result 5552 states and 15726 transitions. [2025-04-13 22:30:57,156 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 22:30:57,156 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 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 69 [2025-04-13 22:30:57,157 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:30:57,198 INFO L225 Difference]: With dead ends: 5552 [2025-04-13 22:30:57,199 INFO L226 Difference]: Without dead ends: 5254 [2025-04-13 22:30:57,200 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=115, Invalid=305, Unknown=0, NotChecked=0, Total=420 [2025-04-13 22:30:57,200 INFO L437 NwaCegarLoop]: 16 mSDtfsCounter, 193 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 945 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 948 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 945 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:30:57,200 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 81 Invalid, 948 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 945 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:30:57,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5254 states. [2025-04-13 22:30:57,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5254 to 4890. [2025-04-13 22:30:57,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4890 states, 4889 states have (on average 2.856412354264676) internal successors, (13965), 4889 states have internal predecessors, (13965), 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:30:57,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4890 states to 4890 states and 13965 transitions. [2025-04-13 22:30:57,279 INFO L79 Accepts]: Start accepts. Automaton has 4890 states and 13965 transitions. Word has length 69 [2025-04-13 22:30:57,279 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:30:57,279 INFO L485 AbstractCegarLoop]: Abstraction has 4890 states and 13965 transitions. [2025-04-13 22:30:57,279 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 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:30:57,279 INFO L278 IsEmpty]: Start isEmpty. Operand 4890 states and 13965 transitions. [2025-04-13 22:30:57,284 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-04-13 22:30:57,284 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:30:57,284 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:30:57,284 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable111 [2025-04-13 22:30:57,285 INFO L403 AbstractCegarLoop]: === Iteration 113 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:30:57,285 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:30:57,285 INFO L85 PathProgramCache]: Analyzing trace with hash 161942362, now seen corresponding path program 3 times [2025-04-13 22:30:57,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:30:57,285 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683600694] [2025-04-13 22:30:57,285 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:30:57,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:30:57,288 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 69 statements into 1 equivalence classes. [2025-04-13 22:30:57,290 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-04-13 22:30:57,290 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 22:30:57,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:30:57,364 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:30:57,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:30:57,364 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683600694] [2025-04-13 22:30:57,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683600694] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:30:57,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:30:57,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 22:30:57,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741846125] [2025-04-13 22:30:57,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:30:57,364 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 22:30:57,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:30:57,365 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 22:30:57,365 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-04-13 22:30:57,365 INFO L87 Difference]: Start difference. First operand 4890 states and 13965 transitions. Second operand has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 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:30:57,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:30:57,830 INFO L93 Difference]: Finished difference Result 6751 states and 18784 transitions. [2025-04-13 22:30:57,830 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-04-13 22:30:57,830 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 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 69 [2025-04-13 22:30:57,830 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:30:57,877 INFO L225 Difference]: With dead ends: 6751 [2025-04-13 22:30:57,877 INFO L226 Difference]: Without dead ends: 6411 [2025-04-13 22:30:57,878 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=186, Invalid=516, Unknown=0, NotChecked=0, Total=702 [2025-04-13 22:30:57,878 INFO L437 NwaCegarLoop]: 20 mSDtfsCounter, 357 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 1194 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 357 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 1205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:30:57,879 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [357 Valid, 109 Invalid, 1205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1194 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:30:57,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6411 states. [2025-04-13 22:30:57,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6411 to 4879. [2025-04-13 22:30:57,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4879 states, 4878 states have (on average 2.853628536285363) internal successors, (13920), 4878 states have internal predecessors, (13920), 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:30:57,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4879 states to 4879 states and 13920 transitions. [2025-04-13 22:30:57,967 INFO L79 Accepts]: Start accepts. Automaton has 4879 states and 13920 transitions. Word has length 69 [2025-04-13 22:30:57,967 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:30:57,967 INFO L485 AbstractCegarLoop]: Abstraction has 4879 states and 13920 transitions. [2025-04-13 22:30:57,967 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 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:30:57,967 INFO L278 IsEmpty]: Start isEmpty. Operand 4879 states and 13920 transitions. [2025-04-13 22:30:57,973 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-04-13 22:30:57,973 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:30:57,973 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:30:57,973 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable112 [2025-04-13 22:30:57,973 INFO L403 AbstractCegarLoop]: === Iteration 114 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:30:57,973 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:30:57,973 INFO L85 PathProgramCache]: Analyzing trace with hash 1577763522, now seen corresponding path program 16 times [2025-04-13 22:30:57,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:30:57,973 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40382641] [2025-04-13 22:30:57,973 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:30:57,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:30:57,976 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 69 statements into 2 equivalence classes. [2025-04-13 22:30:57,979 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 69 of 69 statements. [2025-04-13 22:30:57,979 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:30:57,979 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:30:58,078 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:30:58,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:30:58,079 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40382641] [2025-04-13 22:30:58,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [40382641] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:30:58,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:30:58,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 22:30:58,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371344292] [2025-04-13 22:30:58,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:30:58,079 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 22:30:58,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:30:58,079 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 22:30:58,079 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-04-13 22:30:58,079 INFO L87 Difference]: Start difference. First operand 4879 states and 13920 transitions. Second operand has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 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:30:58,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:30:58,447 INFO L93 Difference]: Finished difference Result 5789 states and 16347 transitions. [2025-04-13 22:30:58,447 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 22:30:58,447 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 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 69 [2025-04-13 22:30:58,447 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:30:58,487 INFO L225 Difference]: With dead ends: 5789 [2025-04-13 22:30:58,487 INFO L226 Difference]: Without dead ends: 5211 [2025-04-13 22:30:58,488 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=110, Invalid=310, Unknown=0, NotChecked=0, Total=420 [2025-04-13 22:30:58,489 INFO L437 NwaCegarLoop]: 17 mSDtfsCounter, 169 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 1028 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 1033 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1028 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:30:58,489 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 94 Invalid, 1033 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1028 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:30:58,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5211 states. [2025-04-13 22:30:58,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5211 to 4847. [2025-04-13 22:30:58,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4847 states, 4846 states have (on average 2.8510111432108958) internal successors, (13816), 4846 states have internal predecessors, (13816), 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:30:58,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4847 states to 4847 states and 13816 transitions. [2025-04-13 22:30:58,567 INFO L79 Accepts]: Start accepts. Automaton has 4847 states and 13816 transitions. Word has length 69 [2025-04-13 22:30:58,567 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:30:58,567 INFO L485 AbstractCegarLoop]: Abstraction has 4847 states and 13816 transitions. [2025-04-13 22:30:58,567 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 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:30:58,568 INFO L278 IsEmpty]: Start isEmpty. Operand 4847 states and 13816 transitions. [2025-04-13 22:30:58,573 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-04-13 22:30:58,573 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:30:58,573 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:30:58,573 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable113 [2025-04-13 22:30:58,573 INFO L403 AbstractCegarLoop]: === Iteration 115 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:30:58,573 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:30:58,573 INFO L85 PathProgramCache]: Analyzing trace with hash 1227331608, now seen corresponding path program 4 times [2025-04-13 22:30:58,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:30:58,573 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342296638] [2025-04-13 22:30:58,573 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:30:58,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:30:58,576 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 69 statements into 2 equivalence classes. [2025-04-13 22:30:58,579 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 69 of 69 statements. [2025-04-13 22:30:58,580 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:30:58,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:30:58,654 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:30:58,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:30:58,654 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342296638] [2025-04-13 22:30:58,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342296638] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:30:58,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:30:58,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 22:30:58,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751424232] [2025-04-13 22:30:58,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:30:58,655 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 22:30:58,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:30:58,655 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 22:30:58,655 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-04-13 22:30:58,655 INFO L87 Difference]: Start difference. First operand 4847 states and 13816 transitions. Second operand has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 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:30:59,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:30:59,129 INFO L93 Difference]: Finished difference Result 6445 states and 17955 transitions. [2025-04-13 22:30:59,129 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-13 22:30:59,129 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 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 69 [2025-04-13 22:30:59,129 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:30:59,177 INFO L225 Difference]: With dead ends: 6445 [2025-04-13 22:30:59,178 INFO L226 Difference]: Without dead ends: 6018 [2025-04-13 22:30:59,180 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=168, Invalid=432, Unknown=0, NotChecked=0, Total=600 [2025-04-13 22:30:59,180 INFO L437 NwaCegarLoop]: 19 mSDtfsCounter, 337 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 1249 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 337 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 1259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:30:59,180 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [337 Valid, 105 Invalid, 1259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1249 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:30:59,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6018 states. [2025-04-13 22:30:59,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6018 to 4782. [2025-04-13 22:30:59,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4782 states, 4781 states have (on average 2.848358084082828) internal successors, (13618), 4781 states have internal predecessors, (13618), 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:30:59,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4782 states to 4782 states and 13618 transitions. [2025-04-13 22:30:59,264 INFO L79 Accepts]: Start accepts. Automaton has 4782 states and 13618 transitions. Word has length 69 [2025-04-13 22:30:59,264 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:30:59,264 INFO L485 AbstractCegarLoop]: Abstraction has 4782 states and 13618 transitions. [2025-04-13 22:30:59,264 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 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:30:59,264 INFO L278 IsEmpty]: Start isEmpty. Operand 4782 states and 13618 transitions. [2025-04-13 22:30:59,269 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-04-13 22:30:59,269 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:30:59,269 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:30:59,269 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable114 [2025-04-13 22:30:59,270 INFO L403 AbstractCegarLoop]: === Iteration 116 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:30:59,270 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:30:59,270 INFO L85 PathProgramCache]: Analyzing trace with hash -1980718978, now seen corresponding path program 17 times [2025-04-13 22:30:59,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:30:59,270 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506785074] [2025-04-13 22:30:59,270 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:30:59,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:30:59,273 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 69 statements into 1 equivalence classes. [2025-04-13 22:30:59,275 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-04-13 22:30:59,275 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 22:30:59,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:30:59,311 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:30:59,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:30:59,311 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506785074] [2025-04-13 22:30:59,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506785074] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:30:59,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:30:59,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 22:30:59,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146091597] [2025-04-13 22:30:59,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:30:59,312 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 22:30:59,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:30:59,312 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 22:30:59,312 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-04-13 22:30:59,312 INFO L87 Difference]: Start difference. First operand 4782 states and 13618 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 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:30:59,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:30:59,617 INFO L93 Difference]: Finished difference Result 6947 states and 19391 transitions. [2025-04-13 22:30:59,617 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-13 22:30:59,617 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 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 69 [2025-04-13 22:30:59,617 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:30:59,660 INFO L225 Difference]: With dead ends: 6947 [2025-04-13 22:30:59,661 INFO L226 Difference]: Without dead ends: 6521 [2025-04-13 22:30:59,662 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=77, Invalid=163, Unknown=0, NotChecked=0, Total=240 [2025-04-13 22:30:59,662 INFO L437 NwaCegarLoop]: 15 mSDtfsCounter, 164 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 862 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 871 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 862 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:30:59,663 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 65 Invalid, 871 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 862 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:30:59,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6521 states. [2025-04-13 22:30:59,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6521 to 4750. [2025-04-13 22:30:59,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4750 states, 4749 states have (on average 2.8498631290798064) internal successors, (13534), 4749 states have internal predecessors, (13534), 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:30:59,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4750 states to 4750 states and 13534 transitions. [2025-04-13 22:30:59,750 INFO L79 Accepts]: Start accepts. Automaton has 4750 states and 13534 transitions. Word has length 69 [2025-04-13 22:30:59,750 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:30:59,750 INFO L485 AbstractCegarLoop]: Abstraction has 4750 states and 13534 transitions. [2025-04-13 22:30:59,750 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 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:30:59,751 INFO L278 IsEmpty]: Start isEmpty. Operand 4750 states and 13534 transitions. [2025-04-13 22:30:59,755 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-04-13 22:30:59,756 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:30:59,756 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:30:59,756 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable115 [2025-04-13 22:30:59,756 INFO L403 AbstractCegarLoop]: === Iteration 117 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:30:59,756 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:30:59,756 INFO L85 PathProgramCache]: Analyzing trace with hash 212659542, now seen corresponding path program 1 times [2025-04-13 22:30:59,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:30:59,756 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733077009] [2025-04-13 22:30:59,756 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:30:59,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:30:59,759 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-04-13 22:30:59,761 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-04-13 22:30:59,762 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:30:59,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:30:59,835 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:30:59,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:30:59,835 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733077009] [2025-04-13 22:30:59,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733077009] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:30:59,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:30:59,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 22:30:59,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020588020] [2025-04-13 22:30:59,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:30:59,835 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 22:30:59,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:30:59,836 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 22:30:59,836 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-04-13 22:30:59,836 INFO L87 Difference]: Start difference. First operand 4750 states and 13534 transitions. Second operand has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 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:31:00,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:31:00,391 INFO L93 Difference]: Finished difference Result 6572 states and 18339 transitions. [2025-04-13 22:31:00,391 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-04-13 22:31:00,391 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 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 69 [2025-04-13 22:31:00,391 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:31:00,433 INFO L225 Difference]: With dead ends: 6572 [2025-04-13 22:31:00,433 INFO L226 Difference]: Without dead ends: 5998 [2025-04-13 22:31:00,434 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=218, Invalid=594, Unknown=0, NotChecked=0, Total=812 [2025-04-13 22:31:00,435 INFO L437 NwaCegarLoop]: 19 mSDtfsCounter, 356 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 1532 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 356 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 1550 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 1532 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:31:00,435 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [356 Valid, 113 Invalid, 1550 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 1532 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:31:00,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5998 states. [2025-04-13 22:31:00,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5998 to 4708. [2025-04-13 22:31:00,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4708 states, 4707 states have (on average 2.8423624389207562) internal successors, (13379), 4707 states have internal predecessors, (13379), 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:31:00,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4708 states to 4708 states and 13379 transitions. [2025-04-13 22:31:00,518 INFO L79 Accepts]: Start accepts. Automaton has 4708 states and 13379 transitions. Word has length 69 [2025-04-13 22:31:00,519 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:31:00,519 INFO L485 AbstractCegarLoop]: Abstraction has 4708 states and 13379 transitions. [2025-04-13 22:31:00,519 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 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:31:00,519 INFO L278 IsEmpty]: Start isEmpty. Operand 4708 states and 13379 transitions. [2025-04-13 22:31:00,524 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-04-13 22:31:00,524 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:31:00,524 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:31:00,524 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable116 [2025-04-13 22:31:00,524 INFO L403 AbstractCegarLoop]: === Iteration 118 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:31:00,524 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:31:00,524 INFO L85 PathProgramCache]: Analyzing trace with hash -917322152, now seen corresponding path program 18 times [2025-04-13 22:31:00,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:31:00,524 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652619087] [2025-04-13 22:31:00,524 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:31:00,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:31:00,527 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 69 statements into 1 equivalence classes. [2025-04-13 22:31:00,530 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-04-13 22:31:00,530 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 22:31:00,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:31:00,608 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:31:00,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:31:00,608 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652619087] [2025-04-13 22:31:00,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652619087] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:31:00,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:31:00,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 22:31:00,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343255666] [2025-04-13 22:31:00,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:31:00,608 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 22:31:00,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:31:00,608 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 22:31:00,608 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-04-13 22:31:00,609 INFO L87 Difference]: Start difference. First operand 4708 states and 13379 transitions. Second operand has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 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:31:00,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:31:00,946 INFO L93 Difference]: Finished difference Result 5166 states and 14570 transitions. [2025-04-13 22:31:00,946 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-13 22:31:00,946 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 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 69 [2025-04-13 22:31:00,946 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:31:00,984 INFO L225 Difference]: With dead ends: 5166 [2025-04-13 22:31:00,984 INFO L226 Difference]: Without dead ends: 4868 [2025-04-13 22:31:00,985 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=251, Unknown=0, NotChecked=0, Total=342 [2025-04-13 22:31:00,985 INFO L437 NwaCegarLoop]: 15 mSDtfsCounter, 157 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 900 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 903 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 900 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:31:00,985 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 77 Invalid, 903 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 900 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:31:00,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4868 states. [2025-04-13 22:31:01,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4868 to 4712. [2025-04-13 22:31:01,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4712 states, 4711 states have (on average 2.8390999787730844) internal successors, (13375), 4711 states have internal predecessors, (13375), 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:31:01,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4712 states to 4712 states and 13375 transitions. [2025-04-13 22:31:01,064 INFO L79 Accepts]: Start accepts. Automaton has 4712 states and 13375 transitions. Word has length 69 [2025-04-13 22:31:01,064 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:31:01,064 INFO L485 AbstractCegarLoop]: Abstraction has 4712 states and 13375 transitions. [2025-04-13 22:31:01,064 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 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:31:01,064 INFO L278 IsEmpty]: Start isEmpty. Operand 4712 states and 13375 transitions. [2025-04-13 22:31:01,069 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-04-13 22:31:01,069 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:31:01,069 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:31:01,069 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable117 [2025-04-13 22:31:01,069 INFO L403 AbstractCegarLoop]: === Iteration 119 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:31:01,069 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:31:01,069 INFO L85 PathProgramCache]: Analyzing trace with hash -1791945930, now seen corresponding path program 2 times [2025-04-13 22:31:01,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:31:01,070 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401747683] [2025-04-13 22:31:01,070 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:31:01,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:31:01,072 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 69 statements into 1 equivalence classes. [2025-04-13 22:31:01,075 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-04-13 22:31:01,075 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 22:31:01,075 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:31:01,149 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:31:01,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:31:01,149 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401747683] [2025-04-13 22:31:01,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401747683] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:31:01,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:31:01,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 22:31:01,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878559003] [2025-04-13 22:31:01,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:31:01,149 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 22:31:01,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:31:01,150 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 22:31:01,150 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-04-13 22:31:01,150 INFO L87 Difference]: Start difference. First operand 4712 states and 13375 transitions. Second operand has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 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:31:01,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:31:01,624 INFO L93 Difference]: Finished difference Result 6294 states and 17502 transitions. [2025-04-13 22:31:01,625 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-13 22:31:01,625 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 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 69 [2025-04-13 22:31:01,625 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:31:01,667 INFO L225 Difference]: With dead ends: 6294 [2025-04-13 22:31:01,667 INFO L226 Difference]: Without dead ends: 5964 [2025-04-13 22:31:01,668 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=200, Invalid=556, Unknown=0, NotChecked=0, Total=756 [2025-04-13 22:31:01,668 INFO L437 NwaCegarLoop]: 20 mSDtfsCounter, 346 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 1239 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 346 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 1256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:31:01,668 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [346 Valid, 97 Invalid, 1256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1239 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:31:01,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5964 states. [2025-04-13 22:31:01,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5964 to 4696. [2025-04-13 22:31:01,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4696 states, 4695 states have (on average 2.8364217252396164) internal successors, (13317), 4695 states have internal predecessors, (13317), 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:31:01,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4696 states to 4696 states and 13317 transitions. [2025-04-13 22:31:01,749 INFO L79 Accepts]: Start accepts. Automaton has 4696 states and 13317 transitions. Word has length 69 [2025-04-13 22:31:01,749 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:31:01,749 INFO L485 AbstractCegarLoop]: Abstraction has 4696 states and 13317 transitions. [2025-04-13 22:31:01,749 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 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:31:01,749 INFO L278 IsEmpty]: Start isEmpty. Operand 4696 states and 13317 transitions. [2025-04-13 22:31:01,754 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-04-13 22:31:01,754 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:31:01,754 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:31:01,754 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable118 [2025-04-13 22:31:01,754 INFO L403 AbstractCegarLoop]: === Iteration 120 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:31:01,755 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:31:01,755 INFO L85 PathProgramCache]: Analyzing trace with hash 2121501208, now seen corresponding path program 19 times [2025-04-13 22:31:01,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:31:01,755 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581735744] [2025-04-13 22:31:01,755 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:31:01,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:31:01,758 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-04-13 22:31:01,760 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-04-13 22:31:01,760 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:31:01,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:31:01,838 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:31:01,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:31:01,838 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581735744] [2025-04-13 22:31:01,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581735744] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:31:01,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:31:01,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 22:31:01,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163634902] [2025-04-13 22:31:01,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:31:01,839 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 22:31:01,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:31:01,839 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 22:31:01,839 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-04-13 22:31:01,839 INFO L87 Difference]: Start difference. First operand 4696 states and 13317 transitions. Second operand has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 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:31:02,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:31:02,149 INFO L93 Difference]: Finished difference Result 5398 states and 15178 transitions. [2025-04-13 22:31:02,149 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-13 22:31:02,150 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 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 69 [2025-04-13 22:31:02,150 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:31:02,191 INFO L225 Difference]: With dead ends: 5398 [2025-04-13 22:31:02,191 INFO L226 Difference]: Without dead ends: 4820 [2025-04-13 22:31:02,192 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2025-04-13 22:31:02,193 INFO L437 NwaCegarLoop]: 16 mSDtfsCounter, 154 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 871 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 876 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 871 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:31:02,193 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 82 Invalid, 876 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 871 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:31:02,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4820 states. [2025-04-13 22:31:02,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4820 to 4664. [2025-04-13 22:31:02,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4664 states, 4663 states have (on average 2.8335835299163628) internal successors, (13213), 4663 states have internal predecessors, (13213), 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:31:02,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4664 states to 4664 states and 13213 transitions. [2025-04-13 22:31:02,273 INFO L79 Accepts]: Start accepts. Automaton has 4664 states and 13213 transitions. Word has length 69 [2025-04-13 22:31:02,273 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:31:02,273 INFO L485 AbstractCegarLoop]: Abstraction has 4664 states and 13213 transitions. [2025-04-13 22:31:02,273 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 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:31:02,274 INFO L278 IsEmpty]: Start isEmpty. Operand 4664 states and 13213 transitions. [2025-04-13 22:31:02,278 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-04-13 22:31:02,278 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:31:02,279 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:31:02,279 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable119 [2025-04-13 22:31:02,279 INFO L403 AbstractCegarLoop]: === Iteration 121 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:31:02,279 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:31:02,279 INFO L85 PathProgramCache]: Analyzing trace with hash -432064262, now seen corresponding path program 3 times [2025-04-13 22:31:02,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:31:02,279 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544512449] [2025-04-13 22:31:02,279 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:31:02,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:31:02,282 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 69 statements into 1 equivalence classes. [2025-04-13 22:31:02,285 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-04-13 22:31:02,285 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 22:31:02,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:31:02,362 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:31:02,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:31:02,362 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544512449] [2025-04-13 22:31:02,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544512449] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:31:02,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:31:02,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 22:31:02,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663775907] [2025-04-13 22:31:02,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:31:02,362 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 22:31:02,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:31:02,362 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 22:31:02,363 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-04-13 22:31:02,363 INFO L87 Difference]: Start difference. First operand 4664 states and 13213 transitions. Second operand has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 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:31:02,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:31:02,817 INFO L93 Difference]: Finished difference Result 6284 states and 17430 transitions. [2025-04-13 22:31:02,817 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-13 22:31:02,817 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 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 69 [2025-04-13 22:31:02,817 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:31:02,863 INFO L225 Difference]: With dead ends: 6284 [2025-04-13 22:31:02,863 INFO L226 Difference]: Without dead ends: 5952 [2025-04-13 22:31:02,864 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=181, Invalid=469, Unknown=0, NotChecked=0, Total=650 [2025-04-13 22:31:02,864 INFO L437 NwaCegarLoop]: 20 mSDtfsCounter, 331 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 1099 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 331 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 1114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 1099 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:31:02,864 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [331 Valid, 98 Invalid, 1114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 1099 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:31:02,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5952 states. [2025-04-13 22:31:02,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5952 to 4568. [2025-04-13 22:31:02,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4568 states, 4567 states have (on average 2.827895774031093) internal successors, (12915), 4567 states have internal predecessors, (12915), 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:31:02,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4568 states to 4568 states and 12915 transitions. [2025-04-13 22:31:02,950 INFO L79 Accepts]: Start accepts. Automaton has 4568 states and 12915 transitions. Word has length 69 [2025-04-13 22:31:02,950 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:31:02,950 INFO L485 AbstractCegarLoop]: Abstraction has 4568 states and 12915 transitions. [2025-04-13 22:31:02,950 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 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:31:02,951 INFO L278 IsEmpty]: Start isEmpty. Operand 4568 states and 12915 transitions. [2025-04-13 22:31:02,955 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-04-13 22:31:02,955 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:31:02,955 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:31:02,955 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable120 [2025-04-13 22:31:02,955 INFO L403 AbstractCegarLoop]: === Iteration 122 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:31:02,956 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:31:02,956 INFO L85 PathProgramCache]: Analyzing trace with hash -1436981292, now seen corresponding path program 20 times [2025-04-13 22:31:02,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:31:02,956 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797143520] [2025-04-13 22:31:02,956 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:31:02,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:31:02,959 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 69 statements into 1 equivalence classes. [2025-04-13 22:31:02,961 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-04-13 22:31:02,961 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 22:31:02,961 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:31:02,998 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:31:02,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:31:02,998 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797143520] [2025-04-13 22:31:02,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [797143520] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:31:02,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:31:02,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 22:31:02,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903771813] [2025-04-13 22:31:02,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:31:02,998 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 22:31:02,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:31:02,999 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 22:31:02,999 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-04-13 22:31:02,999 INFO L87 Difference]: Start difference. First operand 4568 states and 12915 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 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:31:03,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:31:03,339 INFO L93 Difference]: Finished difference Result 6231 states and 17247 transitions. [2025-04-13 22:31:03,339 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-13 22:31:03,339 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 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 69 [2025-04-13 22:31:03,339 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:31:03,384 INFO L225 Difference]: With dead ends: 6231 [2025-04-13 22:31:03,384 INFO L226 Difference]: Without dead ends: 5821 [2025-04-13 22:31:03,386 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=109, Invalid=271, Unknown=0, NotChecked=0, Total=380 [2025-04-13 22:31:03,386 INFO L437 NwaCegarLoop]: 10 mSDtfsCounter, 312 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 801 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 312 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 820 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 801 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:31:03,386 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [312 Valid, 53 Invalid, 820 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 801 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:31:03,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5821 states. [2025-04-13 22:31:03,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5821 to 4552. [2025-04-13 22:31:03,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4552 states, 4551 states have (on average 2.827290705339486) internal successors, (12867), 4551 states have internal predecessors, (12867), 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:31:03,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4552 states to 4552 states and 12867 transitions. [2025-04-13 22:31:03,468 INFO L79 Accepts]: Start accepts. Automaton has 4552 states and 12867 transitions. Word has length 69 [2025-04-13 22:31:03,468 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:31:03,469 INFO L485 AbstractCegarLoop]: Abstraction has 4552 states and 12867 transitions. [2025-04-13 22:31:03,469 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 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:31:03,469 INFO L278 IsEmpty]: Start isEmpty. Operand 4552 states and 12867 transitions. [2025-04-13 22:31:03,493 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-04-13 22:31:03,493 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:31:03,493 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:31:03,493 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable121 [2025-04-13 22:31:03,493 INFO L403 AbstractCegarLoop]: === Iteration 123 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:31:03,493 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:31:03,494 INFO L85 PathProgramCache]: Analyzing trace with hash -1793692000, now seen corresponding path program 21 times [2025-04-13 22:31:03,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:31:03,494 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294086443] [2025-04-13 22:31:03,494 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:31:03,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:31:03,496 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 69 statements into 1 equivalence classes. [2025-04-13 22:31:03,499 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-04-13 22:31:03,499 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 22:31:03,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:31:03,530 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:31:03,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:31:03,530 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294086443] [2025-04-13 22:31:03,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294086443] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:31:03,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:31:03,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 22:31:03,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393965017] [2025-04-13 22:31:03,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:31:03,530 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 22:31:03,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:31:03,531 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 22:31:03,531 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-04-13 22:31:03,531 INFO L87 Difference]: Start difference. First operand 4552 states and 12867 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 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:31:03,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:31:03,852 INFO L93 Difference]: Finished difference Result 5997 states and 16626 transitions. [2025-04-13 22:31:03,853 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-13 22:31:03,853 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 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 69 [2025-04-13 22:31:03,853 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:31:03,893 INFO L225 Difference]: With dead ends: 5997 [2025-04-13 22:31:03,893 INFO L226 Difference]: Without dead ends: 5381 [2025-04-13 22:31:03,895 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2025-04-13 22:31:03,895 INFO L437 NwaCegarLoop]: 13 mSDtfsCounter, 251 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 836 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 852 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 836 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:31:03,895 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 58 Invalid, 852 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 836 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:31:03,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5381 states. [2025-04-13 22:31:03,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5381 to 4198. [2025-04-13 22:31:03,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4198 states, 4197 states have (on average 2.812008577555397) internal successors, (11802), 4197 states have internal predecessors, (11802), 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:31:03,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4198 states to 4198 states and 11802 transitions. [2025-04-13 22:31:03,972 INFO L79 Accepts]: Start accepts. Automaton has 4198 states and 11802 transitions. Word has length 69 [2025-04-13 22:31:03,972 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:31:03,972 INFO L485 AbstractCegarLoop]: Abstraction has 4198 states and 11802 transitions. [2025-04-13 22:31:03,972 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 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:31:03,972 INFO L278 IsEmpty]: Start isEmpty. Operand 4198 states and 11802 transitions. [2025-04-13 22:31:03,977 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-04-13 22:31:03,977 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:31:03,977 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:31:03,977 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable122 [2025-04-13 22:31:03,977 INFO L403 AbstractCegarLoop]: === Iteration 124 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:31:03,977 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:31:03,977 INFO L85 PathProgramCache]: Analyzing trace with hash 2000200084, now seen corresponding path program 1 times [2025-04-13 22:31:03,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:31:03,977 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754871125] [2025-04-13 22:31:03,977 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:31:03,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:31:03,980 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-04-13 22:31:03,982 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-04-13 22:31:03,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:31:03,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:31:04,056 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:31:04,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:31:04,057 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754871125] [2025-04-13 22:31:04,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754871125] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:31:04,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:31:04,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 22:31:04,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385787934] [2025-04-13 22:31:04,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:31:04,057 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 22:31:04,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:31:04,057 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 22:31:04,057 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-04-13 22:31:04,057 INFO L87 Difference]: Start difference. First operand 4198 states and 11802 transitions. Second operand has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 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:31:04,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:31:04,478 INFO L93 Difference]: Finished difference Result 5694 states and 15695 transitions. [2025-04-13 22:31:04,478 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-13 22:31:04,478 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 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 69 [2025-04-13 22:31:04,478 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:31:04,519 INFO L225 Difference]: With dead ends: 5694 [2025-04-13 22:31:04,519 INFO L226 Difference]: Without dead ends: 5112 [2025-04-13 22:31:04,521 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=225, Invalid=587, Unknown=0, NotChecked=0, Total=812 [2025-04-13 22:31:04,521 INFO L437 NwaCegarLoop]: 18 mSDtfsCounter, 380 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 907 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 380 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 924 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 907 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:31:04,521 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [380 Valid, 83 Invalid, 924 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 907 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:31:04,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5112 states. [2025-04-13 22:31:04,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5112 to 4092. [2025-04-13 22:31:04,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4092 states, 4091 states have (on average 2.8020043999022244) internal successors, (11463), 4091 states have internal predecessors, (11463), 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:31:04,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4092 states to 4092 states and 11463 transitions. [2025-04-13 22:31:04,596 INFO L79 Accepts]: Start accepts. Automaton has 4092 states and 11463 transitions. Word has length 69 [2025-04-13 22:31:04,596 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:31:04,596 INFO L485 AbstractCegarLoop]: Abstraction has 4092 states and 11463 transitions. [2025-04-13 22:31:04,596 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 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:31:04,596 INFO L278 IsEmpty]: Start isEmpty. Operand 4092 states and 11463 transitions. [2025-04-13 22:31:04,601 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-04-13 22:31:04,601 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:31:04,601 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:31:04,601 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable123 [2025-04-13 22:31:04,601 INFO L403 AbstractCegarLoop]: === Iteration 125 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:31:04,601 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:31:04,601 INFO L85 PathProgramCache]: Analyzing trace with hash -77158538, now seen corresponding path program 2 times [2025-04-13 22:31:04,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:31:04,601 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953873910] [2025-04-13 22:31:04,601 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:31:04,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:31:04,604 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 69 statements into 1 equivalence classes. [2025-04-13 22:31:04,606 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-04-13 22:31:04,606 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 22:31:04,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:31:04,683 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:31:04,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:31:04,683 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953873910] [2025-04-13 22:31:04,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953873910] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:31:04,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:31:04,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 22:31:04,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448699178] [2025-04-13 22:31:04,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:31:04,684 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 22:31:04,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:31:04,684 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 22:31:04,684 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-04-13 22:31:04,684 INFO L87 Difference]: Start difference. First operand 4092 states and 11463 transitions. Second operand has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 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:31:05,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:31:05,171 INFO L93 Difference]: Finished difference Result 5456 states and 14994 transitions. [2025-04-13 22:31:05,172 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-04-13 22:31:05,172 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 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 69 [2025-04-13 22:31:05,172 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:31:05,214 INFO L225 Difference]: With dead ends: 5456 [2025-04-13 22:31:05,214 INFO L226 Difference]: Without dead ends: 5120 [2025-04-13 22:31:05,215 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=207, Invalid=549, Unknown=0, NotChecked=0, Total=756 [2025-04-13 22:31:05,215 INFO L437 NwaCegarLoop]: 19 mSDtfsCounter, 354 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 1300 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 354 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 1317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:31:05,215 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [354 Valid, 105 Invalid, 1317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1300 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:31:05,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5120 states. [2025-04-13 22:31:05,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5120 to 4086. [2025-04-13 22:31:05,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4086 states, 4085 states have (on average 2.7975520195838435) internal successors, (11428), 4085 states have internal predecessors, (11428), 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:31:05,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4086 states to 4086 states and 11428 transitions. [2025-04-13 22:31:05,301 INFO L79 Accepts]: Start accepts. Automaton has 4086 states and 11428 transitions. Word has length 69 [2025-04-13 22:31:05,301 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:31:05,301 INFO L485 AbstractCegarLoop]: Abstraction has 4086 states and 11428 transitions. [2025-04-13 22:31:05,301 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 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:31:05,301 INFO L278 IsEmpty]: Start isEmpty. Operand 4086 states and 11428 transitions. [2025-04-13 22:31:05,306 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-04-13 22:31:05,306 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:31:05,306 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:31:05,306 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable124 [2025-04-13 22:31:05,306 INFO L403 AbstractCegarLoop]: === Iteration 126 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:31:05,306 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:31:05,306 INFO L85 PathProgramCache]: Analyzing trace with hash 1067260280, now seen corresponding path program 3 times [2025-04-13 22:31:05,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:31:05,306 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477420261] [2025-04-13 22:31:05,307 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:31:05,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:31:05,310 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 69 statements into 1 equivalence classes. [2025-04-13 22:31:05,312 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-04-13 22:31:05,312 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 22:31:05,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:31:05,398 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:31:05,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:31:05,398 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477420261] [2025-04-13 22:31:05,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477420261] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:31:05,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:31:05,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 22:31:05,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074052223] [2025-04-13 22:31:05,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:31:05,398 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 22:31:05,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:31:05,398 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 22:31:05,398 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-04-13 22:31:05,398 INFO L87 Difference]: Start difference. First operand 4086 states and 11428 transitions. Second operand has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 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:31:05,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:31:05,852 INFO L93 Difference]: Finished difference Result 5376 states and 14755 transitions. [2025-04-13 22:31:05,853 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-13 22:31:05,853 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 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 69 [2025-04-13 22:31:05,853 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:31:05,894 INFO L225 Difference]: With dead ends: 5376 [2025-04-13 22:31:05,894 INFO L226 Difference]: Without dead ends: 5016 [2025-04-13 22:31:05,895 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=183, Invalid=467, Unknown=0, NotChecked=0, Total=650 [2025-04-13 22:31:05,895 INFO L437 NwaCegarLoop]: 19 mSDtfsCounter, 327 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 1124 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 327 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 1138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:31:05,896 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [327 Valid, 99 Invalid, 1138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1124 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:31:05,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5016 states. [2025-04-13 22:31:05,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5016 to 3962. [2025-04-13 22:31:05,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3962 states, 3961 states have (on average 2.7881848018177227) internal successors, (11044), 3961 states have internal predecessors, (11044), 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:31:05,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3962 states to 3962 states and 11044 transitions. [2025-04-13 22:31:05,982 INFO L79 Accepts]: Start accepts. Automaton has 3962 states and 11044 transitions. Word has length 69 [2025-04-13 22:31:05,982 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:31:05,982 INFO L485 AbstractCegarLoop]: Abstraction has 3962 states and 11044 transitions. [2025-04-13 22:31:05,982 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 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:31:05,982 INFO L278 IsEmpty]: Start isEmpty. Operand 3962 states and 11044 transitions. [2025-04-13 22:31:05,986 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-04-13 22:31:05,986 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:31:05,986 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:31:05,987 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable125 [2025-04-13 22:31:05,987 INFO L403 AbstractCegarLoop]: === Iteration 127 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:31:05,987 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:31:05,987 INFO L85 PathProgramCache]: Analyzing trace with hash 993460322, now seen corresponding path program 1 times [2025-04-13 22:31:05,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:31:05,987 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808731887] [2025-04-13 22:31:05,987 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:31:05,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:31:05,990 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-04-13 22:31:05,992 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-04-13 22:31:05,992 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:31:05,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:31:06,036 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:31:06,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:31:06,037 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808731887] [2025-04-13 22:31:06,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808731887] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:31:06,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:31:06,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 22:31:06,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436690499] [2025-04-13 22:31:06,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:31:06,037 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 22:31:06,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:31:06,037 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 22:31:06,037 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-04-13 22:31:06,037 INFO L87 Difference]: Start difference. First operand 3962 states and 11044 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 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:31:06,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:31:06,298 INFO L93 Difference]: Finished difference Result 5028 states and 13818 transitions. [2025-04-13 22:31:06,298 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 22:31:06,298 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 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 69 [2025-04-13 22:31:06,298 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:31:06,341 INFO L225 Difference]: With dead ends: 5028 [2025-04-13 22:31:06,342 INFO L226 Difference]: Without dead ends: 4708 [2025-04-13 22:31:06,343 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2025-04-13 22:31:06,343 INFO L437 NwaCegarLoop]: 8 mSDtfsCounter, 183 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 662 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 679 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 662 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:31:06,343 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 34 Invalid, 679 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 662 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:31:06,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4708 states. [2025-04-13 22:31:06,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4708 to 3938. [2025-04-13 22:31:06,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3938 states, 3937 states have (on average 2.7843535687071372) internal successors, (10962), 3937 states have internal predecessors, (10962), 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:31:06,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3938 states to 3938 states and 10962 transitions. [2025-04-13 22:31:06,437 INFO L79 Accepts]: Start accepts. Automaton has 3938 states and 10962 transitions. Word has length 69 [2025-04-13 22:31:06,437 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:31:06,438 INFO L485 AbstractCegarLoop]: Abstraction has 3938 states and 10962 transitions. [2025-04-13 22:31:06,438 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 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:31:06,438 INFO L278 IsEmpty]: Start isEmpty. Operand 3938 states and 10962 transitions. [2025-04-13 22:31:06,442 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-04-13 22:31:06,442 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:31:06,442 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:31:06,442 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable126 [2025-04-13 22:31:06,442 INFO L403 AbstractCegarLoop]: === Iteration 128 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:31:06,443 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:31:06,443 INFO L85 PathProgramCache]: Analyzing trace with hash 206622914, now seen corresponding path program 1 times [2025-04-13 22:31:06,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:31:06,443 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281926886] [2025-04-13 22:31:06,443 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:31:06,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:31:06,447 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-04-13 22:31:06,450 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-04-13 22:31:06,450 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:31:06,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:31:06,500 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:31:06,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:31:06,501 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281926886] [2025-04-13 22:31:06,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281926886] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:31:06,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:31:06,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 22:31:06,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117271115] [2025-04-13 22:31:06,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:31:06,501 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 22:31:06,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:31:06,501 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 22:31:06,501 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-04-13 22:31:06,501 INFO L87 Difference]: Start difference. First operand 3938 states and 10962 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 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:31:06,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:31:06,728 INFO L93 Difference]: Finished difference Result 4518 states and 12444 transitions. [2025-04-13 22:31:06,728 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 22:31:06,728 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 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 69 [2025-04-13 22:31:06,728 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:31:06,769 INFO L225 Difference]: With dead ends: 4518 [2025-04-13 22:31:06,769 INFO L226 Difference]: Without dead ends: 4162 [2025-04-13 22:31:06,770 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2025-04-13 22:31:06,770 INFO L437 NwaCegarLoop]: 6 mSDtfsCounter, 190 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 564 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 580 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 564 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:31:06,770 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 29 Invalid, 580 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 564 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:31:06,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4162 states. [2025-04-13 22:31:06,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4162 to 3878. [2025-04-13 22:31:06,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3878 states, 3877 states have (on average 2.779984524116585) internal successors, (10778), 3877 states have internal predecessors, (10778), 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:31:06,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3878 states to 3878 states and 10778 transitions. [2025-04-13 22:31:06,842 INFO L79 Accepts]: Start accepts. Automaton has 3878 states and 10778 transitions. Word has length 69 [2025-04-13 22:31:06,842 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:31:06,842 INFO L485 AbstractCegarLoop]: Abstraction has 3878 states and 10778 transitions. [2025-04-13 22:31:06,842 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 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:31:06,842 INFO L278 IsEmpty]: Start isEmpty. Operand 3878 states and 10778 transitions. [2025-04-13 22:31:06,846 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-04-13 22:31:06,847 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:31:06,847 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:31:06,847 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable127 [2025-04-13 22:31:06,847 INFO L403 AbstractCegarLoop]: === Iteration 129 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:31:06,847 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:31:06,847 INFO L85 PathProgramCache]: Analyzing trace with hash -87681793, now seen corresponding path program 1 times [2025-04-13 22:31:06,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:31:06,847 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470849139] [2025-04-13 22:31:06,847 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:31:06,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:31:06,850 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-04-13 22:31:06,853 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-04-13 22:31:06,853 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:31:06,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:31:06,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:31:06,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:31:06,935 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470849139] [2025-04-13 22:31:06,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470849139] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:31:06,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:31:06,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-04-13 22:31:06,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089660919] [2025-04-13 22:31:06,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:31:06,935 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:31:06,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:31:06,935 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:31:06,935 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2025-04-13 22:31:06,935 INFO L87 Difference]: Start difference. First operand 3878 states and 10778 transitions. Second operand has 12 states, 12 states have (on average 5.833333333333333) internal successors, (70), 12 states have internal predecessors, (70), 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:31:07,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:31:07,524 INFO L93 Difference]: Finished difference Result 5242 states and 14229 transitions. [2025-04-13 22:31:07,524 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-04-13 22:31:07,524 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.833333333333333) internal successors, (70), 12 states have internal predecessors, (70), 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 70 [2025-04-13 22:31:07,524 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:31:07,567 INFO L225 Difference]: With dead ends: 5242 [2025-04-13 22:31:07,567 INFO L226 Difference]: Without dead ends: 4697 [2025-04-13 22:31:07,569 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 364 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=433, Invalid=1049, Unknown=0, NotChecked=0, Total=1482 [2025-04-13 22:31:07,569 INFO L437 NwaCegarLoop]: 24 mSDtfsCounter, 422 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 1520 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 422 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 1532 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1520 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:31:07,569 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [422 Valid, 137 Invalid, 1532 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1520 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:31:07,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4697 states. [2025-04-13 22:31:07,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4697 to 3539. [2025-04-13 22:31:07,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3539 states, 3538 states have (on average 2.7976257772752966) internal successors, (9898), 3538 states have internal predecessors, (9898), 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:31:07,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3539 states to 3539 states and 9898 transitions. [2025-04-13 22:31:07,641 INFO L79 Accepts]: Start accepts. Automaton has 3539 states and 9898 transitions. Word has length 70 [2025-04-13 22:31:07,641 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:31:07,641 INFO L485 AbstractCegarLoop]: Abstraction has 3539 states and 9898 transitions. [2025-04-13 22:31:07,641 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.833333333333333) internal successors, (70), 12 states have internal predecessors, (70), 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:31:07,641 INFO L278 IsEmpty]: Start isEmpty. Operand 3539 states and 9898 transitions. [2025-04-13 22:31:07,645 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-04-13 22:31:07,645 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:31:07,645 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:31:07,645 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable128 [2025-04-13 22:31:07,645 INFO L403 AbstractCegarLoop]: === Iteration 130 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:31:07,645 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:31:07,645 INFO L85 PathProgramCache]: Analyzing trace with hash -1252602872, now seen corresponding path program 1 times [2025-04-13 22:31:07,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:31:07,646 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402421996] [2025-04-13 22:31:07,646 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:31:07,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:31:07,648 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-04-13 22:31:07,651 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-04-13 22:31:07,651 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:31:07,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:31:07,713 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:31:07,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:31:07,714 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402421996] [2025-04-13 22:31:07,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402421996] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:31:07,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:31:07,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 22:31:07,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054421309] [2025-04-13 22:31:07,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:31:07,714 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 22:31:07,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:31:07,714 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 22:31:07,714 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-04-13 22:31:07,714 INFO L87 Difference]: Start difference. First operand 3539 states and 9898 transitions. Second operand has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 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:31:08,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:31:08,139 INFO L93 Difference]: Finished difference Result 4639 states and 12732 transitions. [2025-04-13 22:31:08,139 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-13 22:31:08,140 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 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 70 [2025-04-13 22:31:08,140 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:31:08,182 INFO L225 Difference]: With dead ends: 4639 [2025-04-13 22:31:08,182 INFO L226 Difference]: Without dead ends: 4321 [2025-04-13 22:31:08,183 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=152, Invalid=354, Unknown=0, NotChecked=0, Total=506 [2025-04-13 22:31:08,183 INFO L437 NwaCegarLoop]: 13 mSDtfsCounter, 318 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 1190 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 318 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 1199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:31:08,183 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [318 Valid, 87 Invalid, 1199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1190 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:31:08,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4321 states. [2025-04-13 22:31:08,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4321 to 3539. [2025-04-13 22:31:08,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3539 states, 3538 states have (on average 2.790842283776145) internal successors, (9874), 3538 states have internal predecessors, (9874), 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:31:08,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3539 states to 3539 states and 9874 transitions. [2025-04-13 22:31:08,257 INFO L79 Accepts]: Start accepts. Automaton has 3539 states and 9874 transitions. Word has length 70 [2025-04-13 22:31:08,257 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:31:08,257 INFO L485 AbstractCegarLoop]: Abstraction has 3539 states and 9874 transitions. [2025-04-13 22:31:08,257 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 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:31:08,257 INFO L278 IsEmpty]: Start isEmpty. Operand 3539 states and 9874 transitions. [2025-04-13 22:31:08,261 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-04-13 22:31:08,261 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:31:08,261 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:31:08,261 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable129 [2025-04-13 22:31:08,261 INFO L403 AbstractCegarLoop]: === Iteration 131 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:31:08,262 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:31:08,262 INFO L85 PathProgramCache]: Analyzing trace with hash -535270203, now seen corresponding path program 1 times [2025-04-13 22:31:08,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:31:08,262 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879792590] [2025-04-13 22:31:08,262 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:31:08,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:31:08,264 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-04-13 22:31:08,267 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-04-13 22:31:08,267 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:31:08,267 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:31:08,346 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:31:08,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:31:08,346 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879792590] [2025-04-13 22:31:08,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879792590] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:31:08,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:31:08,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-04-13 22:31:08,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72211991] [2025-04-13 22:31:08,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:31:08,346 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:31:08,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:31:08,347 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:31:08,347 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2025-04-13 22:31:08,347 INFO L87 Difference]: Start difference. First operand 3539 states and 9874 transitions. Second operand has 12 states, 12 states have (on average 5.833333333333333) internal successors, (70), 12 states have internal predecessors, (70), 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:31:08,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:31:08,968 INFO L93 Difference]: Finished difference Result 4625 states and 12560 transitions. [2025-04-13 22:31:08,968 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2025-04-13 22:31:08,968 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.833333333333333) internal successors, (70), 12 states have internal predecessors, (70), 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 70 [2025-04-13 22:31:08,968 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:31:09,009 INFO L225 Difference]: With dead ends: 4625 [2025-04-13 22:31:09,009 INFO L226 Difference]: Without dead ends: 3832 [2025-04-13 22:31:09,011 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 674 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=603, Invalid=1559, Unknown=0, NotChecked=0, Total=2162 [2025-04-13 22:31:09,011 INFO L437 NwaCegarLoop]: 23 mSDtfsCounter, 478 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 1401 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 478 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 1415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:31:09,011 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [478 Valid, 120 Invalid, 1415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1401 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:31:09,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3832 states. [2025-04-13 22:31:09,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3832 to 2930. [2025-04-13 22:31:09,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2930 states, 2929 states have (on average 2.7767156025947424) internal successors, (8133), 2929 states have internal predecessors, (8133), 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:31:09,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2930 states to 2930 states and 8133 transitions. [2025-04-13 22:31:09,075 INFO L79 Accepts]: Start accepts. Automaton has 2930 states and 8133 transitions. Word has length 70 [2025-04-13 22:31:09,075 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:31:09,075 INFO L485 AbstractCegarLoop]: Abstraction has 2930 states and 8133 transitions. [2025-04-13 22:31:09,075 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.833333333333333) internal successors, (70), 12 states have internal predecessors, (70), 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:31:09,076 INFO L278 IsEmpty]: Start isEmpty. Operand 2930 states and 8133 transitions. [2025-04-13 22:31:09,078 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-04-13 22:31:09,078 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:31:09,078 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:31:09,078 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable130 [2025-04-13 22:31:09,079 INFO L403 AbstractCegarLoop]: === Iteration 132 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:31:09,079 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:31:09,079 INFO L85 PathProgramCache]: Analyzing trace with hash 1408761352, now seen corresponding path program 2 times [2025-04-13 22:31:09,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:31:09,079 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72491101] [2025-04-13 22:31:09,079 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:31:09,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:31:09,082 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 70 statements into 1 equivalence classes. [2025-04-13 22:31:09,084 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-04-13 22:31:09,084 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 22:31:09,084 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:31:09,144 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:31:09,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:31:09,144 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72491101] [2025-04-13 22:31:09,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72491101] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:31:09,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:31:09,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 22:31:09,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561257268] [2025-04-13 22:31:09,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:31:09,145 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 22:31:09,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:31:09,145 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 22:31:09,145 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-04-13 22:31:09,145 INFO L87 Difference]: Start difference. First operand 2930 states and 8133 transitions. Second operand has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 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:31:09,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:31:09,575 INFO L93 Difference]: Finished difference Result 4246 states and 11565 transitions. [2025-04-13 22:31:09,575 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-04-13 22:31:09,575 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 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 70 [2025-04-13 22:31:09,575 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:31:09,613 INFO L225 Difference]: With dead ends: 4246 [2025-04-13 22:31:09,613 INFO L226 Difference]: Without dead ends: 4056 [2025-04-13 22:31:09,614 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=188, Invalid=462, Unknown=0, NotChecked=0, Total=650 [2025-04-13 22:31:09,614 INFO L437 NwaCegarLoop]: 14 mSDtfsCounter, 379 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 1076 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 379 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 1086 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1076 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:31:09,614 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [379 Valid, 82 Invalid, 1086 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1076 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:31:09,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4056 states. [2025-04-13 22:31:09,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4056 to 2948. [2025-04-13 22:31:09,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2948 states, 2947 states have (on average 2.7770614183915847) internal successors, (8184), 2947 states have internal predecessors, (8184), 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:31:09,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2948 states to 2948 states and 8184 transitions. [2025-04-13 22:31:09,679 INFO L79 Accepts]: Start accepts. Automaton has 2948 states and 8184 transitions. Word has length 70 [2025-04-13 22:31:09,679 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:31:09,679 INFO L485 AbstractCegarLoop]: Abstraction has 2948 states and 8184 transitions. [2025-04-13 22:31:09,679 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 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:31:09,679 INFO L278 IsEmpty]: Start isEmpty. Operand 2948 states and 8184 transitions. [2025-04-13 22:31:09,682 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-04-13 22:31:09,682 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:31:09,682 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:31:09,682 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable131 [2025-04-13 22:31:09,682 INFO L403 AbstractCegarLoop]: === Iteration 133 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:31:09,682 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:31:09,683 INFO L85 PathProgramCache]: Analyzing trace with hash -661414011, now seen corresponding path program 2 times [2025-04-13 22:31:09,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:31:09,683 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188967618] [2025-04-13 22:31:09,683 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:31:09,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:31:09,686 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 70 statements into 1 equivalence classes. [2025-04-13 22:31:09,688 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-04-13 22:31:09,688 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 22:31:09,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:31:09,756 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:31:09,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:31:09,757 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188967618] [2025-04-13 22:31:09,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188967618] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:31:09,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:31:09,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 22:31:09,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683480605] [2025-04-13 22:31:09,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:31:09,757 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 22:31:09,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:31:09,757 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 22:31:09,757 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-04-13 22:31:09,757 INFO L87 Difference]: Start difference. First operand 2948 states and 8184 transitions. Second operand has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 9 states have internal predecessors, (70), 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:31:09,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:31:09,895 INFO L93 Difference]: Finished difference Result 3056 states and 8447 transitions. [2025-04-13 22:31:09,896 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 22:31:09,896 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 9 states have internal predecessors, (70), 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 70 [2025-04-13 22:31:09,896 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:31:09,933 INFO L225 Difference]: With dead ends: 3056 [2025-04-13 22:31:09,933 INFO L226 Difference]: Without dead ends: 2692 [2025-04-13 22:31:09,934 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=110, Unknown=0, NotChecked=0, Total=182 [2025-04-13 22:31:09,934 INFO L437 NwaCegarLoop]: 10 mSDtfsCounter, 92 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:31:09,934 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 34 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 288 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:31:09,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2692 states. [2025-04-13 22:31:09,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2692 to 2692. [2025-04-13 22:31:09,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2692 states, 2691 states have (on average 2.7956150130063175) internal successors, (7523), 2691 states have internal predecessors, (7523), 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:31:09,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2692 states to 2692 states and 7523 transitions. [2025-04-13 22:31:09,993 INFO L79 Accepts]: Start accepts. Automaton has 2692 states and 7523 transitions. Word has length 70 [2025-04-13 22:31:09,993 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:31:09,993 INFO L485 AbstractCegarLoop]: Abstraction has 2692 states and 7523 transitions. [2025-04-13 22:31:09,993 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 9 states have internal predecessors, (70), 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:31:09,993 INFO L278 IsEmpty]: Start isEmpty. Operand 2692 states and 7523 transitions. [2025-04-13 22:31:09,996 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-04-13 22:31:09,996 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:31:09,996 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:31:09,996 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable132 [2025-04-13 22:31:09,996 INFO L403 AbstractCegarLoop]: === Iteration 134 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:31:09,996 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:31:09,996 INFO L85 PathProgramCache]: Analyzing trace with hash -396871578, now seen corresponding path program 3 times [2025-04-13 22:31:09,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:31:09,996 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985868361] [2025-04-13 22:31:09,996 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:31:09,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:31:09,999 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 70 statements into 1 equivalence classes. [2025-04-13 22:31:10,003 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-04-13 22:31:10,003 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 22:31:10,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:31:10,070 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:31:10,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:31:10,070 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985868361] [2025-04-13 22:31:10,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1985868361] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:31:10,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:31:10,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 22:31:10,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903658730] [2025-04-13 22:31:10,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:31:10,070 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 22:31:10,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:31:10,071 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 22:31:10,071 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-04-13 22:31:10,071 INFO L87 Difference]: Start difference. First operand 2692 states and 7523 transitions. Second operand has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 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:31:10,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:31:10,590 INFO L93 Difference]: Finished difference Result 4064 states and 11069 transitions. [2025-04-13 22:31:10,590 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-04-13 22:31:10,590 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 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 70 [2025-04-13 22:31:10,590 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:31:10,631 INFO L225 Difference]: With dead ends: 4064 [2025-04-13 22:31:10,631 INFO L226 Difference]: Without dead ends: 3886 [2025-04-13 22:31:10,632 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 287 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=296, Invalid=826, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 22:31:10,632 INFO L437 NwaCegarLoop]: 14 mSDtfsCounter, 423 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 1412 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 423 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 1427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 1412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:31:10,632 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [423 Valid, 94 Invalid, 1427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 1412 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:31:10,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3886 states. [2025-04-13 22:31:10,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3886 to 2710. [2025-04-13 22:31:10,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2710 states, 2709 states have (on average 2.795865633074935) internal successors, (7574), 2709 states have internal predecessors, (7574), 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:31:10,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2710 states to 2710 states and 7574 transitions. [2025-04-13 22:31:10,695 INFO L79 Accepts]: Start accepts. Automaton has 2710 states and 7574 transitions. Word has length 70 [2025-04-13 22:31:10,695 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:31:10,696 INFO L485 AbstractCegarLoop]: Abstraction has 2710 states and 7574 transitions. [2025-04-13 22:31:10,696 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 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:31:10,696 INFO L278 IsEmpty]: Start isEmpty. Operand 2710 states and 7574 transitions. [2025-04-13 22:31:10,698 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-04-13 22:31:10,698 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:31:10,698 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:31:10,699 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable133 [2025-04-13 22:31:10,699 INFO L403 AbstractCegarLoop]: === Iteration 135 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:31:10,699 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:31:10,699 INFO L85 PathProgramCache]: Analyzing trace with hash -900175805, now seen corresponding path program 1 times [2025-04-13 22:31:10,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:31:10,699 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161330853] [2025-04-13 22:31:10,699 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:31:10,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:31:10,702 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-04-13 22:31:10,704 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-04-13 22:31:10,704 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:31:10,704 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:31:10,728 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:31:10,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:31:10,728 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161330853] [2025-04-13 22:31:10,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161330853] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:31:10,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:31:10,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 22:31:10,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736562963] [2025-04-13 22:31:10,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:31:10,729 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 22:31:10,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:31:10,729 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 22:31:10,729 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-13 22:31:10,729 INFO L87 Difference]: Start difference. First operand 2710 states and 7574 transitions. Second operand has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 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:31:10,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:31:10,970 INFO L93 Difference]: Finished difference Result 3440 states and 9451 transitions. [2025-04-13 22:31:10,970 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-13 22:31:10,970 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 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 70 [2025-04-13 22:31:10,970 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:31:11,009 INFO L225 Difference]: With dead ends: 3440 [2025-04-13 22:31:11,009 INFO L226 Difference]: Without dead ends: 3060 [2025-04-13 22:31:11,010 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2025-04-13 22:31:11,010 INFO L437 NwaCegarLoop]: 8 mSDtfsCounter, 268 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 597 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 268 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 616 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 597 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:31:11,010 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [268 Valid, 36 Invalid, 616 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 597 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:31:11,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3060 states. [2025-04-13 22:31:11,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3060 to 2482. [2025-04-13 22:31:11,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2482 states, 2481 states have (on average 2.7944377267230953) internal successors, (6933), 2481 states have internal predecessors, (6933), 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:31:11,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2482 states to 2482 states and 6933 transitions. [2025-04-13 22:31:11,068 INFO L79 Accepts]: Start accepts. Automaton has 2482 states and 6933 transitions. Word has length 70 [2025-04-13 22:31:11,068 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:31:11,068 INFO L485 AbstractCegarLoop]: Abstraction has 2482 states and 6933 transitions. [2025-04-13 22:31:11,069 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 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:31:11,069 INFO L278 IsEmpty]: Start isEmpty. Operand 2482 states and 6933 transitions. [2025-04-13 22:31:11,071 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-04-13 22:31:11,071 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:31:11,071 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:31:11,071 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable134 [2025-04-13 22:31:11,071 INFO L403 AbstractCegarLoop]: === Iteration 136 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:31:11,071 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:31:11,071 INFO L85 PathProgramCache]: Analyzing trace with hash -2031694328, now seen corresponding path program 4 times [2025-04-13 22:31:11,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:31:11,072 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278634180] [2025-04-13 22:31:11,072 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:31:11,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:31:11,074 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 70 statements into 2 equivalence classes. [2025-04-13 22:31:11,076 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 58 of 70 statements. [2025-04-13 22:31:11,076 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 22:31:11,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:31:11,099 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:31:11,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:31:11,099 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278634180] [2025-04-13 22:31:11,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278634180] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:31:11,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:31:11,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 22:31:11,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395905666] [2025-04-13 22:31:11,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:31:11,100 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 22:31:11,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:31:11,100 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 22:31:11,100 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-04-13 22:31:11,100 INFO L87 Difference]: Start difference. First operand 2482 states and 6933 transitions. Second operand has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 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:31:11,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:31:11,378 INFO L93 Difference]: Finished difference Result 3214 states and 8846 transitions. [2025-04-13 22:31:11,379 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-13 22:31:11,379 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 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 70 [2025-04-13 22:31:11,379 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:31:11,419 INFO L225 Difference]: With dead ends: 3214 [2025-04-13 22:31:11,419 INFO L226 Difference]: Without dead ends: 2652 [2025-04-13 22:31:11,420 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2025-04-13 22:31:11,420 INFO L437 NwaCegarLoop]: 14 mSDtfsCounter, 197 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 747 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 757 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 747 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:31:11,420 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 54 Invalid, 757 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 747 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:31:11,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2652 states. [2025-04-13 22:31:11,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2652 to 2302. [2025-04-13 22:31:11,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2302 states, 2301 states have (on average 2.775749674054759) internal successors, (6387), 2301 states have internal predecessors, (6387), 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:31:11,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2302 states to 2302 states and 6387 transitions. [2025-04-13 22:31:11,473 INFO L79 Accepts]: Start accepts. Automaton has 2302 states and 6387 transitions. Word has length 70 [2025-04-13 22:31:11,473 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:31:11,473 INFO L485 AbstractCegarLoop]: Abstraction has 2302 states and 6387 transitions. [2025-04-13 22:31:11,473 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 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:31:11,473 INFO L278 IsEmpty]: Start isEmpty. Operand 2302 states and 6387 transitions. [2025-04-13 22:31:11,475 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-04-13 22:31:11,475 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:31:11,475 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:31:11,475 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable135 [2025-04-13 22:31:11,476 INFO L403 AbstractCegarLoop]: === Iteration 137 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:31:11,476 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:31:11,476 INFO L85 PathProgramCache]: Analyzing trace with hash 566319742, now seen corresponding path program 5 times [2025-04-13 22:31:11,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:31:11,476 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59754680] [2025-04-13 22:31:11,476 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:31:11,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:31:11,479 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 70 statements into 1 equivalence classes. [2025-04-13 22:31:11,481 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-04-13 22:31:11,481 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 22:31:11,481 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:31:11,506 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:31:11,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:31:11,506 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59754680] [2025-04-13 22:31:11,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [59754680] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:31:11,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:31:11,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 22:31:11,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643700266] [2025-04-13 22:31:11,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:31:11,506 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 22:31:11,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:31:11,506 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 22:31:11,506 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-13 22:31:11,507 INFO L87 Difference]: Start difference. First operand 2302 states and 6387 transitions. Second operand has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 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:31:11,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:31:11,758 INFO L93 Difference]: Finished difference Result 2984 states and 8103 transitions. [2025-04-13 22:31:11,758 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-13 22:31:11,758 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 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 70 [2025-04-13 22:31:11,758 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:31:11,799 INFO L225 Difference]: With dead ends: 2984 [2025-04-13 22:31:11,799 INFO L226 Difference]: Without dead ends: 2442 [2025-04-13 22:31:11,801 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2025-04-13 22:31:11,801 INFO L437 NwaCegarLoop]: 10 mSDtfsCounter, 295 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 589 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 609 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 589 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:31:11,801 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [295 Valid, 36 Invalid, 609 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 589 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:31:11,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2442 states. [2025-04-13 22:31:11,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2442 to 1926. [2025-04-13 22:31:11,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1926 states, 1925 states have (on average 2.745974025974026) internal successors, (5286), 1925 states have internal predecessors, (5286), 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:31:11,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1926 states to 1926 states and 5286 transitions. [2025-04-13 22:31:11,858 INFO L79 Accepts]: Start accepts. Automaton has 1926 states and 5286 transitions. Word has length 70 [2025-04-13 22:31:11,858 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:31:11,858 INFO L485 AbstractCegarLoop]: Abstraction has 1926 states and 5286 transitions. [2025-04-13 22:31:11,858 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 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:31:11,858 INFO L278 IsEmpty]: Start isEmpty. Operand 1926 states and 5286 transitions. [2025-04-13 22:31:11,860 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-04-13 22:31:11,860 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:31:11,860 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:31:11,861 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable136 [2025-04-13 22:31:11,861 INFO L403 AbstractCegarLoop]: === Iteration 138 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:31:11,861 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:31:11,861 INFO L85 PathProgramCache]: Analyzing trace with hash -2039201903, now seen corresponding path program 2 times [2025-04-13 22:31:11,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:31:11,861 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858247092] [2025-04-13 22:31:11,861 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:31:11,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:31:11,864 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 70 statements into 1 equivalence classes. [2025-04-13 22:31:11,866 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-04-13 22:31:11,866 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 22:31:11,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:31:11,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:31:11,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:31:11,934 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858247092] [2025-04-13 22:31:11,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858247092] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:31:11,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:31:11,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 22:31:11,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720856753] [2025-04-13 22:31:11,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:31:11,935 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 22:31:11,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:31:11,935 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 22:31:11,935 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-04-13 22:31:11,935 INFO L87 Difference]: Start difference. First operand 1926 states and 5286 transitions. Second operand has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 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:31:12,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:31:12,322 INFO L93 Difference]: Finished difference Result 2922 states and 7825 transitions. [2025-04-13 22:31:12,322 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-13 22:31:12,322 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 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 70 [2025-04-13 22:31:12,322 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:31:12,359 INFO L225 Difference]: With dead ends: 2922 [2025-04-13 22:31:12,360 INFO L226 Difference]: Without dead ends: 2626 [2025-04-13 22:31:12,360 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=152, Invalid=354, Unknown=0, NotChecked=0, Total=506 [2025-04-13 22:31:12,360 INFO L437 NwaCegarLoop]: 13 mSDtfsCounter, 325 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 1112 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 325 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 1125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:31:12,361 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [325 Valid, 73 Invalid, 1125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1112 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:31:12,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2626 states. [2025-04-13 22:31:12,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2626 to 1926. [2025-04-13 22:31:12,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1926 states, 1925 states have (on average 2.7366233766233767) internal successors, (5268), 1925 states have internal predecessors, (5268), 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:31:12,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1926 states to 1926 states and 5268 transitions. [2025-04-13 22:31:12,413 INFO L79 Accepts]: Start accepts. Automaton has 1926 states and 5268 transitions. Word has length 70 [2025-04-13 22:31:12,413 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:31:12,413 INFO L485 AbstractCegarLoop]: Abstraction has 1926 states and 5268 transitions. [2025-04-13 22:31:12,413 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 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:31:12,413 INFO L278 IsEmpty]: Start isEmpty. Operand 1926 states and 5268 transitions. [2025-04-13 22:31:12,415 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-04-13 22:31:12,415 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:31:12,415 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:31:12,415 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable137 [2025-04-13 22:31:12,415 INFO L403 AbstractCegarLoop]: === Iteration 139 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:31:12,416 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:31:12,416 INFO L85 PathProgramCache]: Analyzing trace with hash -2044352416, now seen corresponding path program 6 times [2025-04-13 22:31:12,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:31:12,416 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615330148] [2025-04-13 22:31:12,416 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:31:12,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:31:12,419 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 70 statements into 1 equivalence classes. [2025-04-13 22:31:12,421 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-04-13 22:31:12,421 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 22:31:12,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:31:12,478 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:31:12,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:31:12,478 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615330148] [2025-04-13 22:31:12,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615330148] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:31:12,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:31:12,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 22:31:12,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721925403] [2025-04-13 22:31:12,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:31:12,478 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 22:31:12,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:31:12,478 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 22:31:12,478 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-04-13 22:31:12,478 INFO L87 Difference]: Start difference. First operand 1926 states and 5268 transitions. Second operand has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 9 states have internal predecessors, (70), 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:31:12,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:31:12,774 INFO L93 Difference]: Finished difference Result 2490 states and 6755 transitions. [2025-04-13 22:31:12,776 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 22:31:12,777 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 9 states have internal predecessors, (70), 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 70 [2025-04-13 22:31:12,777 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:31:12,825 INFO L225 Difference]: With dead ends: 2490 [2025-04-13 22:31:12,825 INFO L226 Difference]: Without dead ends: 2092 [2025-04-13 22:31:12,826 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=217, Unknown=0, NotChecked=0, Total=306 [2025-04-13 22:31:12,826 INFO L437 NwaCegarLoop]: 8 mSDtfsCounter, 211 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 821 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 825 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 821 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:31:12,826 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 45 Invalid, 825 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 821 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:31:12,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2092 states. [2025-04-13 22:31:12,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2092 to 1950. [2025-04-13 22:31:12,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1950 states, 1949 states have (on average 2.7265264238070808) internal successors, (5314), 1949 states have internal predecessors, (5314), 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:31:12,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1950 states to 1950 states and 5314 transitions. [2025-04-13 22:31:12,892 INFO L79 Accepts]: Start accepts. Automaton has 1950 states and 5314 transitions. Word has length 70 [2025-04-13 22:31:12,892 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:31:12,892 INFO L485 AbstractCegarLoop]: Abstraction has 1950 states and 5314 transitions. [2025-04-13 22:31:12,892 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 9 states have internal predecessors, (70), 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:31:12,892 INFO L278 IsEmpty]: Start isEmpty. Operand 1950 states and 5314 transitions. [2025-04-13 22:31:12,894 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-04-13 22:31:12,894 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:31:12,894 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:31:12,894 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable138 [2025-04-13 22:31:12,894 INFO L403 AbstractCegarLoop]: === Iteration 140 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:31:12,894 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:31:12,895 INFO L85 PathProgramCache]: Analyzing trace with hash 60816465, now seen corresponding path program 3 times [2025-04-13 22:31:12,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:31:12,895 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429328815] [2025-04-13 22:31:12,895 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:31:12,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:31:12,897 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 70 statements into 1 equivalence classes. [2025-04-13 22:31:12,900 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-04-13 22:31:12,900 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 22:31:12,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:31:12,961 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:31:12,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:31:12,961 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429328815] [2025-04-13 22:31:12,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429328815] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:31:12,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:31:12,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 22:31:12,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301067182] [2025-04-13 22:31:12,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:31:12,961 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 22:31:12,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:31:12,961 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 22:31:12,962 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-04-13 22:31:12,962 INFO L87 Difference]: Start difference. First operand 1950 states and 5314 transitions. Second operand has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 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:31:13,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:31:13,382 INFO L93 Difference]: Finished difference Result 2998 states and 7968 transitions. [2025-04-13 22:31:13,382 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-13 22:31:13,382 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 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 70 [2025-04-13 22:31:13,382 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:31:13,420 INFO L225 Difference]: With dead ends: 2998 [2025-04-13 22:31:13,420 INFO L226 Difference]: Without dead ends: 2810 [2025-04-13 22:31:13,421 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=177, Invalid=423, Unknown=0, NotChecked=0, Total=600 [2025-04-13 22:31:13,421 INFO L437 NwaCegarLoop]: 14 mSDtfsCounter, 326 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 1226 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 326 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 1240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:31:13,421 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [326 Valid, 84 Invalid, 1240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1226 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:31:13,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2810 states. [2025-04-13 22:31:13,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2810 to 1968. [2025-04-13 22:31:13,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1968 states, 1967 states have (on average 2.7275038129130658) internal successors, (5365), 1967 states have internal predecessors, (5365), 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:31:13,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1968 states to 1968 states and 5365 transitions. [2025-04-13 22:31:13,473 INFO L79 Accepts]: Start accepts. Automaton has 1968 states and 5365 transitions. Word has length 70 [2025-04-13 22:31:13,473 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:31:13,473 INFO L485 AbstractCegarLoop]: Abstraction has 1968 states and 5365 transitions. [2025-04-13 22:31:13,473 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 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:31:13,473 INFO L278 IsEmpty]: Start isEmpty. Operand 1968 states and 5365 transitions. [2025-04-13 22:31:13,475 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-04-13 22:31:13,475 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:31:13,475 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:31:13,476 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable139 [2025-04-13 22:31:13,476 INFO L403 AbstractCegarLoop]: === Iteration 141 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:31:13,476 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:31:13,476 INFO L85 PathProgramCache]: Analyzing trace with hash 636276062, now seen corresponding path program 1 times [2025-04-13 22:31:13,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:31:13,476 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235545204] [2025-04-13 22:31:13,476 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:31:13,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:31:13,479 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-04-13 22:31:13,481 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-04-13 22:31:13,481 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:31:13,481 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:31:13,564 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:31:13,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:31:13,565 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235545204] [2025-04-13 22:31:13,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235545204] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:31:13,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:31:13,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-04-13 22:31:13,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917583246] [2025-04-13 22:31:13,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:31:13,565 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:31:13,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:31:13,565 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:31:13,565 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2025-04-13 22:31:13,565 INFO L87 Difference]: Start difference. First operand 1968 states and 5365 transitions. Second operand has 12 states, 12 states have (on average 5.833333333333333) internal successors, (70), 12 states have internal predecessors, (70), 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:31:14,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:31:14,168 INFO L93 Difference]: Finished difference Result 3034 states and 8028 transitions. [2025-04-13 22:31:14,168 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2025-04-13 22:31:14,169 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.833333333333333) internal successors, (70), 12 states have internal predecessors, (70), 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 70 [2025-04-13 22:31:14,169 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:31:14,203 INFO L225 Difference]: With dead ends: 3034 [2025-04-13 22:31:14,203 INFO L226 Difference]: Without dead ends: 2736 [2025-04-13 22:31:14,204 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=512, Invalid=1210, Unknown=0, NotChecked=0, Total=1722 [2025-04-13 22:31:14,204 INFO L437 NwaCegarLoop]: 20 mSDtfsCounter, 525 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 1444 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 525 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 1470 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 1444 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:31:14,204 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [525 Valid, 107 Invalid, 1470 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 1444 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:31:14,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2736 states. [2025-04-13 22:31:14,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2736 to 1976. [2025-04-13 22:31:14,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1976 states, 1975 states have (on average 2.7225316455696205) internal successors, (5377), 1975 states have internal predecessors, (5377), 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:31:14,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1976 states to 1976 states and 5377 transitions. [2025-04-13 22:31:14,255 INFO L79 Accepts]: Start accepts. Automaton has 1976 states and 5377 transitions. Word has length 70 [2025-04-13 22:31:14,255 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:31:14,255 INFO L485 AbstractCegarLoop]: Abstraction has 1976 states and 5377 transitions. [2025-04-13 22:31:14,255 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.833333333333333) internal successors, (70), 12 states have internal predecessors, (70), 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:31:14,255 INFO L278 IsEmpty]: Start isEmpty. Operand 1976 states and 5377 transitions. [2025-04-13 22:31:14,257 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-04-13 22:31:14,257 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:31:14,258 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:31:14,258 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable140 [2025-04-13 22:31:14,258 INFO L403 AbstractCegarLoop]: === Iteration 142 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:31:14,258 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:31:14,258 INFO L85 PathProgramCache]: Analyzing trace with hash -1148997969, now seen corresponding path program 4 times [2025-04-13 22:31:14,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:31:14,258 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687606840] [2025-04-13 22:31:14,258 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:31:14,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:31:14,261 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 70 statements into 2 equivalence classes. [2025-04-13 22:31:14,264 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 70 of 70 statements. [2025-04-13 22:31:14,264 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:31:14,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:31:14,310 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:31:14,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:31:14,310 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687606840] [2025-04-13 22:31:14,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687606840] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:31:14,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:31:14,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 22:31:14,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641706991] [2025-04-13 22:31:14,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:31:14,311 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 22:31:14,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:31:14,311 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 22:31:14,311 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-04-13 22:31:14,311 INFO L87 Difference]: Start difference. First operand 1976 states and 5377 transitions. Second operand has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 9 states have internal predecessors, (70), 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:31:14,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:31:14,587 INFO L93 Difference]: Finished difference Result 2430 states and 6514 transitions. [2025-04-13 22:31:14,587 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-13 22:31:14,587 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 9 states have internal predecessors, (70), 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 70 [2025-04-13 22:31:14,587 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:31:14,622 INFO L225 Difference]: With dead ends: 2430 [2025-04-13 22:31:14,622 INFO L226 Difference]: Without dead ends: 2028 [2025-04-13 22:31:14,623 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=100, Invalid=206, Unknown=0, NotChecked=0, Total=306 [2025-04-13 22:31:14,623 INFO L437 NwaCegarLoop]: 12 mSDtfsCounter, 160 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 889 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 893 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 889 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:31:14,623 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 58 Invalid, 893 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 889 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:31:14,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2028 states. [2025-04-13 22:31:14,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2028 to 1768. [2025-04-13 22:31:14,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1768 states, 1767 states have (on average 2.704584040747029) internal successors, (4779), 1767 states have internal predecessors, (4779), 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:31:14,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1768 states to 1768 states and 4779 transitions. [2025-04-13 22:31:14,670 INFO L79 Accepts]: Start accepts. Automaton has 1768 states and 4779 transitions. Word has length 70 [2025-04-13 22:31:14,671 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:31:14,671 INFO L485 AbstractCegarLoop]: Abstraction has 1768 states and 4779 transitions. [2025-04-13 22:31:14,671 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 9 states have internal predecessors, (70), 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:31:14,671 INFO L278 IsEmpty]: Start isEmpty. Operand 1768 states and 4779 transitions. [2025-04-13 22:31:14,673 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-04-13 22:31:14,673 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:31:14,673 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:31:14,673 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable141 [2025-04-13 22:31:14,673 INFO L403 AbstractCegarLoop]: === Iteration 143 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:31:14,673 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:31:14,673 INFO L85 PathProgramCache]: Analyzing trace with hash 159751230, now seen corresponding path program 7 times [2025-04-13 22:31:14,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:31:14,673 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21805498] [2025-04-13 22:31:14,673 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:31:14,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:31:14,676 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-04-13 22:31:14,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-04-13 22:31:14,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:31:14,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:31:14,737 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:31:14,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:31:14,738 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21805498] [2025-04-13 22:31:14,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [21805498] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:31:14,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:31:14,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 22:31:14,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115139773] [2025-04-13 22:31:14,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:31:14,738 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 22:31:14,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:31:14,738 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 22:31:14,738 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-04-13 22:31:14,738 INFO L87 Difference]: Start difference. First operand 1768 states and 4779 transitions. Second operand has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 9 states have internal predecessors, (70), 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:31:15,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:31:15,026 INFO L93 Difference]: Finished difference Result 2428 states and 6475 transitions. [2025-04-13 22:31:15,026 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-13 22:31:15,026 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 9 states have internal predecessors, (70), 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 70 [2025-04-13 22:31:15,026 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:31:15,061 INFO L225 Difference]: With dead ends: 2428 [2025-04-13 22:31:15,061 INFO L226 Difference]: Without dead ends: 1942 [2025-04-13 22:31:15,062 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2025-04-13 22:31:15,062 INFO L437 NwaCegarLoop]: 9 mSDtfsCounter, 306 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 786 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 306 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 800 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 786 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:31:15,062 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [306 Valid, 42 Invalid, 800 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 786 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:31:15,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1942 states. [2025-04-13 22:31:15,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1942 to 1608. [2025-04-13 22:31:15,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1608 states, 1607 states have (on average 2.70130678282514) internal successors, (4341), 1607 states have internal predecessors, (4341), 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:31:15,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1608 states to 1608 states and 4341 transitions. [2025-04-13 22:31:15,110 INFO L79 Accepts]: Start accepts. Automaton has 1608 states and 4341 transitions. Word has length 70 [2025-04-13 22:31:15,110 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:31:15,110 INFO L485 AbstractCegarLoop]: Abstraction has 1608 states and 4341 transitions. [2025-04-13 22:31:15,111 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 9 states have internal predecessors, (70), 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:31:15,111 INFO L278 IsEmpty]: Start isEmpty. Operand 1608 states and 4341 transitions. [2025-04-13 22:31:15,112 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-04-13 22:31:15,112 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:31:15,112 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:31:15,112 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable142 [2025-04-13 22:31:15,112 INFO L403 AbstractCegarLoop]: === Iteration 144 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:31:15,113 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:31:15,113 INFO L85 PathProgramCache]: Analyzing trace with hash -198663362, now seen corresponding path program 8 times [2025-04-13 22:31:15,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:31:15,113 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877664258] [2025-04-13 22:31:15,113 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:31:15,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:31:15,116 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 70 statements into 1 equivalence classes. [2025-04-13 22:31:15,118 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-04-13 22:31:15,118 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 22:31:15,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:31:15,171 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:31:15,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:31:15,171 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877664258] [2025-04-13 22:31:15,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1877664258] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:31:15,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:31:15,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 22:31:15,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51919252] [2025-04-13 22:31:15,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:31:15,171 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 22:31:15,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:31:15,171 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 22:31:15,172 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-04-13 22:31:15,172 INFO L87 Difference]: Start difference. First operand 1608 states and 4341 transitions. Second operand has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 9 states have internal predecessors, (70), 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:31:15,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:31:15,477 INFO L93 Difference]: Finished difference Result 2248 states and 5981 transitions. [2025-04-13 22:31:15,477 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-13 22:31:15,477 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 9 states have internal predecessors, (70), 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 70 [2025-04-13 22:31:15,477 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:31:15,512 INFO L225 Difference]: With dead ends: 2248 [2025-04-13 22:31:15,512 INFO L226 Difference]: Without dead ends: 1922 [2025-04-13 22:31:15,513 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=96, Invalid=246, Unknown=0, NotChecked=0, Total=342 [2025-04-13 22:31:15,513 INFO L437 NwaCegarLoop]: 8 mSDtfsCounter, 252 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 884 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 252 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 896 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 884 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:31:15,513 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [252 Valid, 41 Invalid, 896 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 884 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:31:15,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1922 states. [2025-04-13 22:31:15,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1922 to 1588. [2025-04-13 22:31:15,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1588 states, 1587 states have (on average 2.6937618147448017) internal successors, (4275), 1587 states have internal predecessors, (4275), 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:31:15,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1588 states to 1588 states and 4275 transitions. [2025-04-13 22:31:15,559 INFO L79 Accepts]: Start accepts. Automaton has 1588 states and 4275 transitions. Word has length 70 [2025-04-13 22:31:15,559 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:31:15,559 INFO L485 AbstractCegarLoop]: Abstraction has 1588 states and 4275 transitions. [2025-04-13 22:31:15,559 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 9 states have internal predecessors, (70), 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:31:15,559 INFO L278 IsEmpty]: Start isEmpty. Operand 1588 states and 4275 transitions. [2025-04-13 22:31:15,561 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-04-13 22:31:15,561 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:31:15,561 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:31:15,561 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable143 [2025-04-13 22:31:15,561 INFO L403 AbstractCegarLoop]: === Iteration 145 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:31:15,561 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:31:15,561 INFO L85 PathProgramCache]: Analyzing trace with hash -79724418, now seen corresponding path program 9 times [2025-04-13 22:31:15,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:31:15,561 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193684775] [2025-04-13 22:31:15,562 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:31:15,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:31:15,564 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 70 statements into 1 equivalence classes. [2025-04-13 22:31:15,567 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-04-13 22:31:15,567 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 22:31:15,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:31:15,618 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:31:15,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:31:15,618 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193684775] [2025-04-13 22:31:15,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193684775] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:31:15,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:31:15,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 22:31:15,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865574913] [2025-04-13 22:31:15,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:31:15,618 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 22:31:15,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:31:15,619 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 22:31:15,619 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-04-13 22:31:15,619 INFO L87 Difference]: Start difference. First operand 1588 states and 4275 transitions. Second operand has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 9 states have internal predecessors, (70), 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:31:15,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:31:15,853 INFO L93 Difference]: Finished difference Result 1994 states and 5287 transitions. [2025-04-13 22:31:15,853 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-13 22:31:15,853 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 9 states have internal predecessors, (70), 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 70 [2025-04-13 22:31:15,853 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:31:15,888 INFO L225 Difference]: With dead ends: 1994 [2025-04-13 22:31:15,888 INFO L226 Difference]: Without dead ends: 1436 [2025-04-13 22:31:15,889 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=73, Invalid=167, Unknown=0, NotChecked=0, Total=240 [2025-04-13 22:31:15,889 INFO L437 NwaCegarLoop]: 8 mSDtfsCounter, 189 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 725 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 735 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 725 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:31:15,890 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 39 Invalid, 735 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 725 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:31:15,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1436 states. [2025-04-13 22:31:15,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1436 to 1070. [2025-04-13 22:31:15,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1070 states, 1069 states have (on average 2.7025257249766135) internal successors, (2889), 1069 states have internal predecessors, (2889), 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:31:15,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1070 states to 1070 states and 2889 transitions. [2025-04-13 22:31:15,933 INFO L79 Accepts]: Start accepts. Automaton has 1070 states and 2889 transitions. Word has length 70 [2025-04-13 22:31:15,933 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:31:15,933 INFO L485 AbstractCegarLoop]: Abstraction has 1070 states and 2889 transitions. [2025-04-13 22:31:15,933 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 9 states have internal predecessors, (70), 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:31:15,933 INFO L278 IsEmpty]: Start isEmpty. Operand 1070 states and 2889 transitions. [2025-04-13 22:31:15,934 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-04-13 22:31:15,934 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:31:15,934 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:31:15,934 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable144 [2025-04-13 22:31:15,934 INFO L403 AbstractCegarLoop]: === Iteration 146 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:31:15,935 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:31:15,935 INFO L85 PathProgramCache]: Analyzing trace with hash 1742639167, now seen corresponding path program 1 times [2025-04-13 22:31:15,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:31:15,935 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540401817] [2025-04-13 22:31:15,935 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:31:15,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:31:15,938 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-04-13 22:31:15,940 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-04-13 22:31:15,940 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:31:15,940 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:31:16,014 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:31:16,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:31:16,014 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540401817] [2025-04-13 22:31:16,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1540401817] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:31:16,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:31:16,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 22:31:16,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109903335] [2025-04-13 22:31:16,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:31:16,015 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 22:31:16,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:31:16,015 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 22:31:16,015 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-04-13 22:31:16,015 INFO L87 Difference]: Start difference. First operand 1070 states and 2889 transitions. Second operand has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 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:31:16,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:31:16,292 INFO L93 Difference]: Finished difference Result 1682 states and 4449 transitions. [2025-04-13 22:31:16,293 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-13 22:31:16,293 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 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 70 [2025-04-13 22:31:16,293 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:31:16,324 INFO L225 Difference]: With dead ends: 1682 [2025-04-13 22:31:16,324 INFO L226 Difference]: Without dead ends: 1386 [2025-04-13 22:31:16,324 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2025-04-13 22:31:16,325 INFO L437 NwaCegarLoop]: 12 mSDtfsCounter, 287 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 777 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 781 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 777 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:31:16,325 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [287 Valid, 59 Invalid, 781 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 777 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:31:16,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1386 states. [2025-04-13 22:31:16,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1386 to 1070. [2025-04-13 22:31:16,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1070 states, 1069 states have (on average 2.685687558465856) internal successors, (2871), 1069 states have internal predecessors, (2871), 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:31:16,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1070 states to 1070 states and 2871 transitions. [2025-04-13 22:31:16,364 INFO L79 Accepts]: Start accepts. Automaton has 1070 states and 2871 transitions. Word has length 70 [2025-04-13 22:31:16,364 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:31:16,364 INFO L485 AbstractCegarLoop]: Abstraction has 1070 states and 2871 transitions. [2025-04-13 22:31:16,364 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 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:31:16,365 INFO L278 IsEmpty]: Start isEmpty. Operand 1070 states and 2871 transitions. [2025-04-13 22:31:16,366 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-04-13 22:31:16,366 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:31:16,366 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:31:16,366 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable145 [2025-04-13 22:31:16,366 INFO L403 AbstractCegarLoop]: === Iteration 147 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:31:16,366 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:31:16,366 INFO L85 PathProgramCache]: Analyzing trace with hash 91148063, now seen corresponding path program 2 times [2025-04-13 22:31:16,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:31:16,366 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379818707] [2025-04-13 22:31:16,366 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:31:16,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:31:16,369 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 70 statements into 1 equivalence classes. [2025-04-13 22:31:16,371 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-04-13 22:31:16,371 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 22:31:16,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:31:16,432 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:31:16,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:31:16,433 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379818707] [2025-04-13 22:31:16,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379818707] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:31:16,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:31:16,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 22:31:16,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186172668] [2025-04-13 22:31:16,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:31:16,433 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 22:31:16,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:31:16,433 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 22:31:16,433 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-04-13 22:31:16,433 INFO L87 Difference]: Start difference. First operand 1070 states and 2871 transitions. Second operand has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 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:31:16,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:31:16,732 INFO L93 Difference]: Finished difference Result 1730 states and 4536 transitions. [2025-04-13 22:31:16,732 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-13 22:31:16,732 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 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 70 [2025-04-13 22:31:16,732 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:31:16,764 INFO L225 Difference]: With dead ends: 1730 [2025-04-13 22:31:16,764 INFO L226 Difference]: Without dead ends: 1542 [2025-04-13 22:31:16,764 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=162, Invalid=390, Unknown=0, NotChecked=0, Total=552 [2025-04-13 22:31:16,765 INFO L437 NwaCegarLoop]: 13 mSDtfsCounter, 283 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 820 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 826 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 820 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:31:16,765 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [283 Valid, 62 Invalid, 826 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 820 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:31:16,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1542 states. [2025-04-13 22:31:16,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1542 to 1088. [2025-04-13 22:31:16,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1088 states, 1087 states have (on average 2.688132474701012) internal successors, (2922), 1087 states have internal predecessors, (2922), 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:31:16,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 2922 transitions. [2025-04-13 22:31:16,806 INFO L79 Accepts]: Start accepts. Automaton has 1088 states and 2922 transitions. Word has length 70 [2025-04-13 22:31:16,806 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:31:16,806 INFO L485 AbstractCegarLoop]: Abstraction has 1088 states and 2922 transitions. [2025-04-13 22:31:16,806 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 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:31:16,806 INFO L278 IsEmpty]: Start isEmpty. Operand 1088 states and 2922 transitions. [2025-04-13 22:31:16,807 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-04-13 22:31:16,807 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:31:16,807 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:31:16,807 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable146 [2025-04-13 22:31:16,807 INFO L403 AbstractCegarLoop]: === Iteration 148 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:31:16,808 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:31:16,808 INFO L85 PathProgramCache]: Analyzing trace with hash 259686237, now seen corresponding path program 3 times [2025-04-13 22:31:16,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:31:16,808 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822250439] [2025-04-13 22:31:16,808 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:31:16,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:31:16,811 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 70 statements into 1 equivalence classes. [2025-04-13 22:31:16,813 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-04-13 22:31:16,813 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 22:31:16,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:31:16,871 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:31:16,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:31:16,871 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822250439] [2025-04-13 22:31:16,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822250439] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:31:16,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:31:16,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 22:31:16,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624299952] [2025-04-13 22:31:16,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:31:16,872 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 22:31:16,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:31:16,872 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 22:31:16,872 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-04-13 22:31:16,872 INFO L87 Difference]: Start difference. First operand 1088 states and 2922 transitions. Second operand has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 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:31:17,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:31:17,231 INFO L93 Difference]: Finished difference Result 1734 states and 4521 transitions. [2025-04-13 22:31:17,231 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-04-13 22:31:17,231 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 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 70 [2025-04-13 22:31:17,231 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:31:17,264 INFO L225 Difference]: With dead ends: 1734 [2025-04-13 22:31:17,264 INFO L226 Difference]: Without dead ends: 1336 [2025-04-13 22:31:17,265 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=230, Invalid=582, Unknown=0, NotChecked=0, Total=812 [2025-04-13 22:31:17,265 INFO L437 NwaCegarLoop]: 12 mSDtfsCounter, 293 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 969 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 976 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 969 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:31:17,265 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [293 Valid, 62 Invalid, 976 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 969 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:31:17,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1336 states. [2025-04-13 22:31:17,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1336 to 884. [2025-04-13 22:31:17,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 884 states, 883 states have (on average 2.6409966024915064) internal successors, (2332), 883 states have internal predecessors, (2332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:31:17,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 884 states to 884 states and 2332 transitions. [2025-04-13 22:31:17,305 INFO L79 Accepts]: Start accepts. Automaton has 884 states and 2332 transitions. Word has length 70 [2025-04-13 22:31:17,305 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:31:17,305 INFO L485 AbstractCegarLoop]: Abstraction has 884 states and 2332 transitions. [2025-04-13 22:31:17,305 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 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:31:17,305 INFO L278 IsEmpty]: Start isEmpty. Operand 884 states and 2332 transitions. [2025-04-13 22:31:17,306 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-04-13 22:31:17,306 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:31:17,306 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:31:17,306 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable147 [2025-04-13 22:31:17,306 INFO L403 AbstractCegarLoop]: === Iteration 149 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:31:17,306 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:31:17,306 INFO L85 PathProgramCache]: Analyzing trace with hash 876028063, now seen corresponding path program 5 times [2025-04-13 22:31:17,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:31:17,307 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676121176] [2025-04-13 22:31:17,307 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:31:17,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:31:17,309 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 70 statements into 1 equivalence classes. [2025-04-13 22:31:17,312 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-04-13 22:31:17,312 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 22:31:17,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:31:17,374 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:31:17,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:31:17,374 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676121176] [2025-04-13 22:31:17,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676121176] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:31:17,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:31:17,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 22:31:17,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024978645] [2025-04-13 22:31:17,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:31:17,374 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 22:31:17,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:31:17,375 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 22:31:17,375 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-04-13 22:31:17,375 INFO L87 Difference]: Start difference. First operand 884 states and 2332 transitions. Second operand has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 9 states have internal predecessors, (70), 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:31:17,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:31:17,591 INFO L93 Difference]: Finished difference Result 1292 states and 3391 transitions. [2025-04-13 22:31:17,592 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 22:31:17,592 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 9 states have internal predecessors, (70), 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 70 [2025-04-13 22:31:17,592 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:31:17,624 INFO L225 Difference]: With dead ends: 1292 [2025-04-13 22:31:17,624 INFO L226 Difference]: Without dead ends: 944 [2025-04-13 22:31:17,625 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2025-04-13 22:31:17,625 INFO L437 NwaCegarLoop]: 7 mSDtfsCounter, 154 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 615 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 618 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 615 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:31:17,625 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 34 Invalid, 618 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 615 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:31:17,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 944 states. [2025-04-13 22:31:17,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 944 to 872. [2025-04-13 22:31:17,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 872 states, 871 states have (on average 2.6337543053960966) internal successors, (2294), 871 states have internal predecessors, (2294), 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:31:17,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 2294 transitions. [2025-04-13 22:31:17,669 INFO L79 Accepts]: Start accepts. Automaton has 872 states and 2294 transitions. Word has length 70 [2025-04-13 22:31:17,669 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:31:17,669 INFO L485 AbstractCegarLoop]: Abstraction has 872 states and 2294 transitions. [2025-04-13 22:31:17,669 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 9 states have internal predecessors, (70), 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:31:17,669 INFO L278 IsEmpty]: Start isEmpty. Operand 872 states and 2294 transitions. [2025-04-13 22:31:17,670 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-04-13 22:31:17,670 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:31:17,670 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:31:17,670 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable148 [2025-04-13 22:31:17,670 INFO L403 AbstractCegarLoop]: === Iteration 150 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:31:17,670 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:31:17,670 INFO L85 PathProgramCache]: Analyzing trace with hash -215844593, now seen corresponding path program 4 times [2025-04-13 22:31:17,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:31:17,670 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485793089] [2025-04-13 22:31:17,671 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:31:17,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:31:17,675 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 70 statements into 2 equivalence classes. [2025-04-13 22:31:17,678 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 70 of 70 statements. [2025-04-13 22:31:17,678 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:31:17,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:31:17,726 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:31:17,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:31:17,726 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485793089] [2025-04-13 22:31:17,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1485793089] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:31:17,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:31:17,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 22:31:17,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564569607] [2025-04-13 22:31:17,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:31:17,726 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 22:31:17,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:31:17,726 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 22:31:17,726 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-04-13 22:31:17,727 INFO L87 Difference]: Start difference. First operand 872 states and 2294 transitions. Second operand has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 9 states have internal predecessors, (70), 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:31:17,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:31:17,963 INFO L93 Difference]: Finished difference Result 1280 states and 3353 transitions. [2025-04-13 22:31:17,963 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 22:31:17,963 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 9 states have internal predecessors, (70), 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 70 [2025-04-13 22:31:17,963 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:31:17,998 INFO L225 Difference]: With dead ends: 1280 [2025-04-13 22:31:17,999 INFO L226 Difference]: Without dead ends: 932 [2025-04-13 22:31:17,999 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=195, Unknown=0, NotChecked=0, Total=272 [2025-04-13 22:31:17,999 INFO L437 NwaCegarLoop]: 7 mSDtfsCounter, 184 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 650 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 654 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 650 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:31:17,999 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 34 Invalid, 654 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 650 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:31:18,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 932 states. [2025-04-13 22:31:18,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 932 to 860. [2025-04-13 22:31:18,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 860 states, 859 states have (on average 2.6263096623981372) internal successors, (2256), 859 states have internal predecessors, (2256), 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:31:18,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 860 states to 860 states and 2256 transitions. [2025-04-13 22:31:18,052 INFO L79 Accepts]: Start accepts. Automaton has 860 states and 2256 transitions. Word has length 70 [2025-04-13 22:31:18,052 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:31:18,052 INFO L485 AbstractCegarLoop]: Abstraction has 860 states and 2256 transitions. [2025-04-13 22:31:18,052 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 9 states have internal predecessors, (70), 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:31:18,052 INFO L278 IsEmpty]: Start isEmpty. Operand 860 states and 2256 transitions. [2025-04-13 22:31:18,053 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-04-13 22:31:18,053 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:31:18,053 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:31:18,053 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable149 [2025-04-13 22:31:18,053 INFO L403 AbstractCegarLoop]: === Iteration 151 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:31:18,054 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:31:18,054 INFO L85 PathProgramCache]: Analyzing trace with hash 512772161, now seen corresponding path program 6 times [2025-04-13 22:31:18,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:31:18,054 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764621117] [2025-04-13 22:31:18,054 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:31:18,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:31:18,056 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 70 statements into 1 equivalence classes. [2025-04-13 22:31:18,059 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-04-13 22:31:18,059 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 22:31:18,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:31:18,115 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:31:18,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:31:18,115 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764621117] [2025-04-13 22:31:18,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764621117] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:31:18,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:31:18,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 22:31:18,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065499633] [2025-04-13 22:31:18,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:31:18,116 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 22:31:18,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:31:18,116 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 22:31:18,116 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-04-13 22:31:18,116 INFO L87 Difference]: Start difference. First operand 860 states and 2256 transitions. Second operand has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 9 states have internal predecessors, (70), 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:31:18,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:31:18,320 INFO L93 Difference]: Finished difference Result 1244 states and 3226 transitions. [2025-04-13 22:31:18,320 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-13 22:31:18,320 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 9 states have internal predecessors, (70), 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 70 [2025-04-13 22:31:18,320 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:31:18,358 INFO L225 Difference]: With dead ends: 1244 [2025-04-13 22:31:18,359 INFO L226 Difference]: Without dead ends: 908 [2025-04-13 22:31:18,359 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=73, Invalid=167, Unknown=0, NotChecked=0, Total=240 [2025-04-13 22:31:18,360 INFO L437 NwaCegarLoop]: 7 mSDtfsCounter, 194 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 568 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 575 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 568 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:31:18,360 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 30 Invalid, 575 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 568 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:31:18,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 908 states. [2025-04-13 22:31:18,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 908 to 740. [2025-04-13 22:31:18,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 740 states, 739 states have (on average 2.611637347767253) internal successors, (1930), 739 states have internal predecessors, (1930), 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:31:18,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 740 states to 740 states and 1930 transitions. [2025-04-13 22:31:18,411 INFO L79 Accepts]: Start accepts. Automaton has 740 states and 1930 transitions. Word has length 70 [2025-04-13 22:31:18,411 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:31:18,411 INFO L485 AbstractCegarLoop]: Abstraction has 740 states and 1930 transitions. [2025-04-13 22:31:18,411 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 9 states have internal predecessors, (70), 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:31:18,411 INFO L278 IsEmpty]: Start isEmpty. Operand 740 states and 1930 transitions. [2025-04-13 22:31:18,412 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-04-13 22:31:18,412 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:31:18,412 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:31:18,412 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable150 [2025-04-13 22:31:18,412 INFO L403 AbstractCegarLoop]: === Iteration 152 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:31:18,412 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:31:18,412 INFO L85 PathProgramCache]: Analyzing trace with hash 797433009, now seen corresponding path program 5 times [2025-04-13 22:31:18,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:31:18,412 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15697991] [2025-04-13 22:31:18,412 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:31:18,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:31:18,418 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 70 statements into 1 equivalence classes. [2025-04-13 22:31:18,420 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-04-13 22:31:18,420 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 22:31:18,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:31:18,475 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:31:18,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:31:18,475 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15697991] [2025-04-13 22:31:18,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15697991] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:31:18,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:31:18,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 22:31:18,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760842029] [2025-04-13 22:31:18,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:31:18,476 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 22:31:18,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:31:18,476 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 22:31:18,476 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-04-13 22:31:18,476 INFO L87 Difference]: Start difference. First operand 740 states and 1930 transitions. Second operand has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 9 states have internal predecessors, (70), 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:31:18,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:31:18,664 INFO L93 Difference]: Finished difference Result 1124 states and 2900 transitions. [2025-04-13 22:31:18,664 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-13 22:31:18,665 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 9 states have internal predecessors, (70), 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 70 [2025-04-13 22:31:18,665 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:31:18,697 INFO L225 Difference]: With dead ends: 1124 [2025-04-13 22:31:18,697 INFO L226 Difference]: Without dead ends: 788 [2025-04-13 22:31:18,698 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=73, Invalid=167, Unknown=0, NotChecked=0, Total=240 [2025-04-13 22:31:18,698 INFO L437 NwaCegarLoop]: 7 mSDtfsCounter, 207 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 543 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 550 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 543 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:31:18,698 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 30 Invalid, 550 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 543 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:31:18,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 788 states. [2025-04-13 22:31:18,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 788 to 620. [2025-04-13 22:31:18,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 620 states, 619 states have (on average 2.591276252019386) internal successors, (1604), 619 states have internal predecessors, (1604), 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:31:18,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 1604 transitions. [2025-04-13 22:31:18,737 INFO L79 Accepts]: Start accepts. Automaton has 620 states and 1604 transitions. Word has length 70 [2025-04-13 22:31:18,737 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:31:18,737 INFO L485 AbstractCegarLoop]: Abstraction has 620 states and 1604 transitions. [2025-04-13 22:31:18,737 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 9 states have internal predecessors, (70), 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:31:18,737 INFO L278 IsEmpty]: Start isEmpty. Operand 620 states and 1604 transitions. [2025-04-13 22:31:18,738 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-04-13 22:31:18,738 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:31:18,738 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:31:18,738 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable151 [2025-04-13 22:31:18,738 INFO L403 AbstractCegarLoop]: === Iteration 153 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:31:18,738 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:31:18,738 INFO L85 PathProgramCache]: Analyzing trace with hash -221768929, now seen corresponding path program 7 times [2025-04-13 22:31:18,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:31:18,738 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908572430] [2025-04-13 22:31:18,738 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:31:18,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:31:18,741 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-04-13 22:31:18,744 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-04-13 22:31:18,744 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:31:18,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:31:18,796 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:31:18,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:31:18,796 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908572430] [2025-04-13 22:31:18,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908572430] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:31:18,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:31:18,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 22:31:18,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774308729] [2025-04-13 22:31:18,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:31:18,797 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 22:31:18,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:31:18,797 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 22:31:18,797 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-04-13 22:31:18,797 INFO L87 Difference]: Start difference. First operand 620 states and 1604 transitions. Second operand has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 9 states have internal predecessors, (70), 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:31:18,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:31:18,968 INFO L93 Difference]: Finished difference Result 988 states and 2530 transitions. [2025-04-13 22:31:18,968 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 22:31:18,968 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 9 states have internal predecessors, (70), 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 70 [2025-04-13 22:31:18,968 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:31:18,999 INFO L225 Difference]: With dead ends: 988 [2025-04-13 22:31:18,999 INFO L226 Difference]: Without dead ends: 772 [2025-04-13 22:31:19,000 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2025-04-13 22:31:19,000 INFO L437 NwaCegarLoop]: 6 mSDtfsCounter, 198 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 510 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 518 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 510 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:31:19,000 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 25 Invalid, 518 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 510 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:31:19,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 772 states. [2025-04-13 22:31:19,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 772 to 604. [2025-04-13 22:31:19,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 604 states, 603 states have (on average 2.57379767827529) internal successors, (1552), 603 states have internal predecessors, (1552), 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:31:19,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 1552 transitions. [2025-04-13 22:31:19,036 INFO L79 Accepts]: Start accepts. Automaton has 604 states and 1552 transitions. Word has length 70 [2025-04-13 22:31:19,036 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:31:19,036 INFO L485 AbstractCegarLoop]: Abstraction has 604 states and 1552 transitions. [2025-04-13 22:31:19,036 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 9 states have internal predecessors, (70), 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:31:19,036 INFO L278 IsEmpty]: Start isEmpty. Operand 604 states and 1552 transitions. [2025-04-13 22:31:19,037 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-04-13 22:31:19,037 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:31:19,037 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:31:19,037 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable152 [2025-04-13 22:31:19,037 INFO L403 AbstractCegarLoop]: === Iteration 154 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:31:19,037 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:31:19,037 INFO L85 PathProgramCache]: Analyzing trace with hash -1505533041, now seen corresponding path program 6 times [2025-04-13 22:31:19,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:31:19,038 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814795928] [2025-04-13 22:31:19,038 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:31:19,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:31:19,040 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 70 statements into 1 equivalence classes. [2025-04-13 22:31:19,043 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-04-13 22:31:19,043 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 22:31:19,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:31:19,106 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:31:19,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:31:19,106 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814795928] [2025-04-13 22:31:19,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814795928] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:31:19,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:31:19,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 22:31:19,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119832080] [2025-04-13 22:31:19,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:31:19,106 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 22:31:19,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:31:19,106 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 22:31:19,106 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-04-13 22:31:19,107 INFO L87 Difference]: Start difference. First operand 604 states and 1552 transitions. Second operand has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 9 states have internal predecessors, (70), 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:31:19,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:31:19,272 INFO L93 Difference]: Finished difference Result 972 states and 2478 transitions. [2025-04-13 22:31:19,272 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 22:31:19,273 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 9 states have internal predecessors, (70), 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 70 [2025-04-13 22:31:19,273 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:31:19,303 INFO L225 Difference]: With dead ends: 972 [2025-04-13 22:31:19,303 INFO L226 Difference]: Without dead ends: 756 [2025-04-13 22:31:19,304 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2025-04-13 22:31:19,304 INFO L437 NwaCegarLoop]: 6 mSDtfsCounter, 215 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 492 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:31:19,304 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 25 Invalid, 500 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 492 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:31:19,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 756 states. [2025-04-13 22:31:19,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 756 to 588. [2025-04-13 22:31:19,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 588 states, 587 states have (on average 2.5553662691652472) internal successors, (1500), 587 states have internal predecessors, (1500), 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:31:19,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 1500 transitions. [2025-04-13 22:31:19,338 INFO L79 Accepts]: Start accepts. Automaton has 588 states and 1500 transitions. Word has length 70 [2025-04-13 22:31:19,338 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:31:19,338 INFO L485 AbstractCegarLoop]: Abstraction has 588 states and 1500 transitions. [2025-04-13 22:31:19,338 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 9 states have internal predecessors, (70), 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:31:19,338 INFO L278 IsEmpty]: Start isEmpty. Operand 588 states and 1500 transitions. [2025-04-13 22:31:19,339 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-04-13 22:31:19,339 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:31:19,339 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:31:19,339 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable153 [2025-04-13 22:31:19,339 INFO L403 AbstractCegarLoop]: === Iteration 155 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:31:19,339 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:31:19,340 INFO L85 PathProgramCache]: Analyzing trace with hash 1561975809, now seen corresponding path program 8 times [2025-04-13 22:31:19,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:31:19,340 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739115947] [2025-04-13 22:31:19,340 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:31:19,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:31:19,342 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 70 statements into 1 equivalence classes. [2025-04-13 22:31:19,345 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-04-13 22:31:19,345 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 22:31:19,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:31:19,396 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:31:19,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:31:19,396 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739115947] [2025-04-13 22:31:19,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739115947] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:31:19,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:31:19,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 22:31:19,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782920718] [2025-04-13 22:31:19,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:31:19,397 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 22:31:19,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:31:19,397 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 22:31:19,397 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-04-13 22:31:19,397 INFO L87 Difference]: Start difference. First operand 588 states and 1500 transitions. Second operand has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 9 states have internal predecessors, (70), 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:31:19,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:31:19,565 INFO L93 Difference]: Finished difference Result 756 states and 1919 transitions. [2025-04-13 22:31:19,565 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 22:31:19,565 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 9 states have internal predecessors, (70), 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 70 [2025-04-13 22:31:19,565 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:31:19,595 INFO L225 Difference]: With dead ends: 756 [2025-04-13 22:31:19,596 INFO L226 Difference]: Without dead ends: 454 [2025-04-13 22:31:19,596 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2025-04-13 22:31:19,596 INFO L437 NwaCegarLoop]: 5 mSDtfsCounter, 123 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 545 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 549 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 545 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:31:19,596 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 23 Invalid, 549 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 545 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:31:19,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2025-04-13 22:31:19,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 454. [2025-04-13 22:31:19,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 454 states, 453 states have (on average 2.492273730684327) internal successors, (1129), 453 states have internal predecessors, (1129), 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:31:19,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 454 states and 1129 transitions. [2025-04-13 22:31:19,629 INFO L79 Accepts]: Start accepts. Automaton has 454 states and 1129 transitions. Word has length 70 [2025-04-13 22:31:19,629 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:31:19,630 INFO L485 AbstractCegarLoop]: Abstraction has 454 states and 1129 transitions. [2025-04-13 22:31:19,630 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 9 states have internal predecessors, (70), 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:31:19,630 INFO L278 IsEmpty]: Start isEmpty. Operand 454 states and 1129 transitions. [2025-04-13 22:31:19,630 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-04-13 22:31:19,630 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:31:19,630 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:31:19,630 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable154 [2025-04-13 22:31:19,630 INFO L403 AbstractCegarLoop]: === Iteration 156 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:31:19,631 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:31:19,631 INFO L85 PathProgramCache]: Analyzing trace with hash 1890185329, now seen corresponding path program 7 times [2025-04-13 22:31:19,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:31:19,631 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999496912] [2025-04-13 22:31:19,631 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:31:19,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:31:19,633 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-04-13 22:31:19,636 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-04-13 22:31:19,636 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:31:19,636 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:31:19,687 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:31:19,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:31:19,687 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999496912] [2025-04-13 22:31:19,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999496912] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:31:19,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:31:19,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 22:31:19,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591957739] [2025-04-13 22:31:19,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:31:19,687 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 22:31:19,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:31:19,688 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 22:31:19,688 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-04-13 22:31:19,688 INFO L87 Difference]: Start difference. First operand 454 states and 1129 transitions. Second operand has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 9 states have internal predecessors, (70), 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:31:19,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:31:19,798 INFO L93 Difference]: Finished difference Result 454 states and 1129 transitions. [2025-04-13 22:31:19,798 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 22:31:19,798 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 9 states have internal predecessors, (70), 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 70 [2025-04-13 22:31:19,798 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:31:19,828 INFO L225 Difference]: With dead ends: 454 [2025-04-13 22:31:19,828 INFO L226 Difference]: Without dead ends: 0 [2025-04-13 22:31:19,829 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2025-04-13 22:31:19,829 INFO L437 NwaCegarLoop]: 4 mSDtfsCounter, 78 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 338 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:31:19,829 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 11 Invalid, 341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 338 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:31:19,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-04-13 22:31:19,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-04-13 22:31:19,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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:31:19,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-04-13 22:31:19,853 INFO L79 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 70 [2025-04-13 22:31:19,854 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:31:19,854 INFO L485 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-13 22:31:19,854 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 9 states have internal predecessors, (70), 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:31:19,854 INFO L278 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-04-13 22:31:19,854 INFO L284 IsEmpty]: Finished isEmpty. No accepting run. [2025-04-13 22:31:19,856 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2025-04-13 22:31:19,856 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2025-04-13 22:31:19,857 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2025-04-13 22:31:19,857 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2025-04-13 22:31:19,857 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable155 [2025-04-13 22:31:19,858 INFO L422 BasicCegarLoop]: Path program histogram: [21, 20, 17, 17, 9, 8, 7, 7, 6, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1] [2025-04-13 22:31:19,860 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-13 22:31:19,860 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-13 22:31:19,861 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 10:31:19 BasicIcfg [2025-04-13 22:31:19,861 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-13 22:31:19,862 INFO L158 Benchmark]: Toolchain (without parser) took 100834.22ms. Allocated memory was 142.6MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 99.0MB in the beginning and 915.1MB in the end (delta: -816.1MB). Peak memory consumption was 405.7MB. Max. memory is 8.0GB. [2025-04-13 22:31:19,862 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 159.4MB. Free memory is still 88.0MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 22:31:19,862 INFO L158 Benchmark]: CACSL2BoogieTranslator took 284.44ms. Allocated memory is still 142.6MB. Free memory was 99.0MB in the beginning and 83.7MB in the end (delta: 15.3MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-13 22:31:19,862 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.32ms. Allocated memory is still 142.6MB. Free memory was 83.7MB in the beginning and 81.2MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 22:31:19,862 INFO L158 Benchmark]: Boogie Preprocessor took 37.53ms. Allocated memory is still 142.6MB. Free memory was 81.2MB in the beginning and 79.3MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 22:31:19,862 INFO L158 Benchmark]: IcfgBuilder took 597.65ms. Allocated memory is still 142.6MB. Free memory was 79.3MB in the beginning and 97.4MB in the end (delta: -18.2MB). Peak memory consumption was 65.0MB. Max. memory is 8.0GB. [2025-04-13 22:31:19,862 INFO L158 Benchmark]: TraceAbstraction took 99871.10ms. Allocated memory was 142.6MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 96.7MB in the beginning and 915.1MB in the end (delta: -818.4MB). Peak memory consumption was 403.6MB. Max. memory is 8.0GB. [2025-04-13 22:31:19,862 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.32ms. Allocated memory is still 159.4MB. Free memory is still 88.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 284.44ms. Allocated memory is still 142.6MB. Free memory was 99.0MB in the beginning and 83.7MB in the end (delta: 15.3MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 38.32ms. Allocated memory is still 142.6MB. Free memory was 83.7MB in the beginning and 81.2MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 37.53ms. Allocated memory is still 142.6MB. Free memory was 81.2MB in the beginning and 79.3MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. * IcfgBuilder took 597.65ms. Allocated memory is still 142.6MB. Free memory was 79.3MB in the beginning and 97.4MB in the end (delta: -18.2MB). Peak memory consumption was 65.0MB. Max. memory is 8.0GB. * TraceAbstraction took 99871.10ms. Allocated memory was 142.6MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 96.7MB in the beginning and 915.1MB in the end (delta: -818.4MB). Peak memory consumption was 403.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 137]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 126 locations, 137 edges, 4 error locations. Started 1 CEGAR loops. OverallTime: 99.8s, OverallIterations: 156, TraceHistogramMax: 1, PathProgramHistogramMax: 21, EmptinessCheckTime: 1.4s, AutomataDifference: 66.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 34455 SdHoareTripleChecker+Valid, 44.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 34455 mSDsluCounter, 10907 SdHoareTripleChecker+Invalid, 36.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 8730 mSDsCounter, 1506 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 142438 IncrementalHoareTripleChecker+Invalid, 143944 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1506 mSolverCounterUnsat, 2177 mSDtfsCounter, 142438 mSolverCounterSat, 0.4s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3050 GetRequests, 441 SyntacticMatches, 0 SemanticMatches, 2609 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10442 ImplicationChecksByTransitivity, 11.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=12337occurred in iteration=10, InterpolantAutomatonStates: 2411, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 13.3s AutomataMinimizationTime, 156 MinimizatonAttempts, 158461 StatesRemovedByMinimization, 150 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 12.3s InterpolantComputationTime, 10729 NumberOfCodeBlocks, 10693 NumberOfCodeBlocksAsserted, 176 NumberOfCheckSat, 10573 ConstructedInterpolants, 0 QuantifiedInterpolants, 29917 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 156 InterpolantComputations, 156 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-04-13 22:31:19,872 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...