/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.xml -s ../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.automaton.type.used.in.concurrency.analysis FINITE_AUTOMATA -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 18:02:17,278 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 18:02:17,326 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 18:02:17,330 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 18:02:17,331 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 18:02:17,356 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 18:02:17,357 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 18:02:17,357 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 18:02:17,358 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 18:02:17,358 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 18:02:17,358 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 18:02:17,358 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 18:02:17,358 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 18:02:17,358 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 18:02:17,358 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 18:02:17,358 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 18:02:17,358 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 18:02:17,358 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 18:02:17,359 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 18:02:17,359 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 18:02:17,359 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 18:02:17,359 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 18:02:17,359 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 18:02:17,359 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 18:02:17,359 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 18:02:17,359 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 18:02:17,359 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 18:02:17,359 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 18:02:17,359 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 18:02:17,359 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 18:02:17,359 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 18:02:17,359 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 18:02:17,359 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 18:02:17,359 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 18:02:17,359 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 18:02:17,360 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 18:02:17,360 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 18:02:17,360 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 18:02:17,360 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 18:02:17,360 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 18:02:17,360 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 18:02:17,360 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 18:02:17,360 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 18:02:17,360 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 18:02:17,360 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 18:02:17,360 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 18:02:17,360 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 18:02:17,360 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 [2025-04-13 18:02:17,659 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 18:02:17,670 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 18:02:17,672 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 18:02:17,673 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 18:02:17,673 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 18:02:17,675 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 18:02:19,124 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d9c8a7de/146db162bdbd4b4f8531aa0d65a37d71/FLAGb6c2ba574 [2025-04-13 18:02:19,372 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 18:02:19,373 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-bakery-3.wvr.c [2025-04-13 18:02:19,386 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d9c8a7de/146db162bdbd4b4f8531aa0d65a37d71/FLAGb6c2ba574 [2025-04-13 18:02:20,174 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d9c8a7de/146db162bdbd4b4f8531aa0d65a37d71 [2025-04-13 18:02:20,178 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 18:02:20,179 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 18:02:20,180 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 18:02:20,180 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 18:02:20,186 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 18:02:20,186 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 06:02:20" (1/1) ... [2025-04-13 18:02:20,187 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@269238ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:02:20, skipping insertion in model container [2025-04-13 18:02:20,187 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 06:02:20" (1/1) ... [2025-04-13 18:02:20,201 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 18:02:20,379 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 18:02:20,386 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 18:02:20,394 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 18:02:20,430 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 18:02:20,431 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 18:02:20,443 INFO L204 MainTranslator]: Completed translation [2025-04-13 18:02:20,443 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:02:20 WrapperNode [2025-04-13 18:02:20,444 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 18:02:20,444 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 18:02:20,444 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 18:02:20,444 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 18:02:20,448 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:02:20" (1/1) ... [2025-04-13 18:02:20,458 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:02:20" (1/1) ... [2025-04-13 18:02:20,483 INFO L138 Inliner]: procedures = 19, calls = 23, calls flagged for inlining = 16, calls inlined = 16, statements flattened = 238 [2025-04-13 18:02:20,484 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 18:02:20,484 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 18:02:20,484 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 18:02:20,484 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 18:02:20,490 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:02:20" (1/1) ... [2025-04-13 18:02:20,490 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:02:20" (1/1) ... [2025-04-13 18:02:20,493 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:02:20" (1/1) ... [2025-04-13 18:02:20,503 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 18:02:20,503 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:02:20" (1/1) ... [2025-04-13 18:02:20,504 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:02:20" (1/1) ... [2025-04-13 18:02:20,508 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:02:20" (1/1) ... [2025-04-13 18:02:20,509 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:02:20" (1/1) ... [2025-04-13 18:02:20,515 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:02:20" (1/1) ... [2025-04-13 18:02:20,516 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:02:20" (1/1) ... [2025-04-13 18:02:20,516 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:02:20" (1/1) ... [2025-04-13 18:02:20,523 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 18:02:20,524 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-13 18:02:20,524 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-13 18:02:20,524 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-13 18:02:20,527 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:02:20" (1/1) ... [2025-04-13 18:02:20,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 18:02:20,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:02:20,549 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 18:02:20,552 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 18:02:20,570 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 18:02:20,570 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-13 18:02:20,570 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-13 18:02:20,570 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-13 18:02:20,570 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-13 18:02:20,570 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-13 18:02:20,570 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-13 18:02:20,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 18:02:20,570 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 18:02:20,570 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 18:02:20,571 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-13 18:02:20,635 INFO L234 CfgBuilder]: Building ICFG [2025-04-13 18:02:20,636 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 18:02:20,874 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 18:02:20,874 INFO L289 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 18:02:20,874 INFO L294 CfgBuilder]: Performing block encoding [2025-04-13 18:02:21,056 INFO L313 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 18:02:21,057 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 06:02:21 BoogieIcfgContainer [2025-04-13 18:02:21,057 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-13 18:02:21,059 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 18:02:21,059 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 18:02:21,063 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 18:02:21,063 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 06:02:20" (1/3) ... [2025-04-13 18:02:21,063 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6709655a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 06:02:21, skipping insertion in model container [2025-04-13 18:02:21,063 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:02:20" (2/3) ... [2025-04-13 18:02:21,063 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6709655a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 06:02:21, skipping insertion in model container [2025-04-13 18:02:21,063 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 06:02:21" (3/3) ... [2025-04-13 18:02:21,064 INFO L128 eAbstractionObserver]: Analyzing ICFG parallel-bakery-3.wvr.c [2025-04-13 18:02:21,074 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 18:02:21,086 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 18:02:21,087 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 18:02:21,125 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-13 18:02:21,148 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 87 places, 83 transitions, 187 flow [2025-04-13 18:02:21,392 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 18:02:21,414 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 18:02:21,422 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;@cc445c1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 18:02:21,425 INFO L341 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-04-13 18:02:21,450 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 18:02:21,509 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-04-13 18:02:21,510 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:02:21,510 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 18:02:21,511 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 18:02:21,514 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:02:21,514 INFO L85 PathProgramCache]: Analyzing trace with hash 1870565350, now seen corresponding path program 1 times [2025-04-13 18:02:21,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:02:21,520 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151815027] [2025-04-13 18:02:21,520 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:02:21,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:02:21,582 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-04-13 18:02:21,637 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-04-13 18:02:21,638 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:02:21,638 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:02:22,068 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 18:02:22,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:02:22,068 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151815027] [2025-04-13 18:02:22,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151815027] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:02:22,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:02:22,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-13 18:02:22,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249459453] [2025-04-13 18:02:22,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:02:22,075 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 18:02:22,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:02:22,088 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 18:02:22,088 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-04-13 18:02:22,114 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 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 18:02:22,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:02:22,757 INFO L93 Difference]: Finished difference Result 9363 states and 32608 transitions. [2025-04-13 18:02:22,758 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 18:02:22,759 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 18:02:22,759 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:02:22,834 INFO L225 Difference]: With dead ends: 9363 [2025-04-13 18:02:22,834 INFO L226 Difference]: Without dead ends: 9079 [2025-04-13 18:02:22,842 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 18:02:22,844 INFO L437 NwaCegarLoop]: 79 mSDtfsCounter, 287 mSDsluCounter, 379 mSDsCounter, 0 mSdLazyCounter, 898 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 458 SdHoareTripleChecker+Invalid, 900 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 898 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 18:02:22,844 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [287 Valid, 458 Invalid, 900 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 898 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 18:02:22,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9079 states. [2025-04-13 18:02:23,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9079 to 7560. [2025-04-13 18:02:23,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7560 states, 7559 states have (on average 3.619790977642545) internal successors, (27362), 7559 states have internal predecessors, (27362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:02:23,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7560 states to 7560 states and 27362 transitions. [2025-04-13 18:02:23,189 INFO L79 Accepts]: Start accepts. Automaton has 7560 states and 27362 transitions. Word has length 67 [2025-04-13 18:02:23,190 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:02:23,191 INFO L485 AbstractCegarLoop]: Abstraction has 7560 states and 27362 transitions. [2025-04-13 18:02:23,191 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 18:02:23,192 INFO L278 IsEmpty]: Start isEmpty. Operand 7560 states and 27362 transitions. [2025-04-13 18:02:23,216 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-04-13 18:02:23,216 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:02:23,216 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 18:02:23,217 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 18:02:23,217 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 18:02:23,217 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:02:23,217 INFO L85 PathProgramCache]: Analyzing trace with hash -1152428128, now seen corresponding path program 2 times [2025-04-13 18:02:23,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:02:23,217 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338353584] [2025-04-13 18:02:23,217 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:02:23,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:02:23,233 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 67 statements into 1 equivalence classes. [2025-04-13 18:02:23,252 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-04-13 18:02:23,252 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:02:23,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:02:23,525 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 18:02:23,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:02:23,526 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338353584] [2025-04-13 18:02:23,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338353584] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:02:23,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:02:23,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-13 18:02:23,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894726674] [2025-04-13 18:02:23,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:02:23,527 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 18:02:23,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:02:23,527 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 18:02:23,527 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-04-13 18:02:23,527 INFO L87 Difference]: Start difference. First operand 7560 states and 27362 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 18:02:24,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:02:24,095 INFO L93 Difference]: Finished difference Result 9537 states and 33069 transitions. [2025-04-13 18:02:24,095 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 18:02:24,096 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 18:02:24,096 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:02:24,141 INFO L225 Difference]: With dead ends: 9537 [2025-04-13 18:02:24,142 INFO L226 Difference]: Without dead ends: 9217 [2025-04-13 18:02:24,147 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 18:02:24,148 INFO L437 NwaCegarLoop]: 79 mSDtfsCounter, 299 mSDsluCounter, 375 mSDsCounter, 0 mSdLazyCounter, 888 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 299 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 890 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 888 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 18:02:24,148 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [299 Valid, 454 Invalid, 890 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 888 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 18:02:24,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9217 states. [2025-04-13 18:02:24,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9217 to 7637. [2025-04-13 18:02:24,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7637 states, 7636 states have (on average 3.606731272917758) internal successors, (27541), 7636 states have internal predecessors, (27541), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:02:24,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7637 states to 7637 states and 27541 transitions. [2025-04-13 18:02:24,385 INFO L79 Accepts]: Start accepts. Automaton has 7637 states and 27541 transitions. Word has length 67 [2025-04-13 18:02:24,386 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:02:24,386 INFO L485 AbstractCegarLoop]: Abstraction has 7637 states and 27541 transitions. [2025-04-13 18:02:24,386 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 18:02:24,387 INFO L278 IsEmpty]: Start isEmpty. Operand 7637 states and 27541 transitions. [2025-04-13 18:02:24,403 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-04-13 18:02:24,403 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:02:24,403 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 18:02:24,404 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 18:02:24,404 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 18:02:24,406 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:02:24,407 INFO L85 PathProgramCache]: Analyzing trace with hash 1032526754, now seen corresponding path program 3 times [2025-04-13 18:02:24,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:02:24,407 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196902792] [2025-04-13 18:02:24,407 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:02:24,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:02:24,419 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 67 statements into 1 equivalence classes. [2025-04-13 18:02:24,433 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-04-13 18:02:24,433 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 18:02:24,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:02:24,586 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 18:02:24,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:02:24,587 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196902792] [2025-04-13 18:02:24,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196902792] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:02:24,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:02:24,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 18:02:24,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707594229] [2025-04-13 18:02:24,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:02:24,588 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 18:02:24,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:02:24,588 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 18:02:24,588 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 18:02:24,588 INFO L87 Difference]: Start difference. First operand 7637 states and 27541 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 18:02:24,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:02:24,831 INFO L93 Difference]: Finished difference Result 17484 states and 63114 transitions. [2025-04-13 18:02:24,832 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 18:02:24,832 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 18:02:24,832 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:02:24,870 INFO L225 Difference]: With dead ends: 17484 [2025-04-13 18:02:24,870 INFO L226 Difference]: Without dead ends: 10163 [2025-04-13 18:02:24,884 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 18:02:24,885 INFO L437 NwaCegarLoop]: 63 mSDtfsCounter, 75 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:02:24,885 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 150 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:02:24,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10163 states. [2025-04-13 18:02:25,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10163 to 8929. [2025-04-13 18:02:25,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8929 states, 8928 states have (on average 3.5402105734767026) internal successors, (31607), 8928 states have internal predecessors, (31607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:02:25,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8929 states to 8929 states and 31607 transitions. [2025-04-13 18:02:25,162 INFO L79 Accepts]: Start accepts. Automaton has 8929 states and 31607 transitions. Word has length 67 [2025-04-13 18:02:25,162 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:02:25,162 INFO L485 AbstractCegarLoop]: Abstraction has 8929 states and 31607 transitions. [2025-04-13 18:02:25,162 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 18:02:25,162 INFO L278 IsEmpty]: Start isEmpty. Operand 8929 states and 31607 transitions. [2025-04-13 18:02:25,185 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-04-13 18:02:25,185 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:02:25,186 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 18:02:25,186 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 18:02:25,186 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 18:02:25,187 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:02:25,187 INFO L85 PathProgramCache]: Analyzing trace with hash 318208738, now seen corresponding path program 4 times [2025-04-13 18:02:25,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:02:25,187 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562455847] [2025-04-13 18:02:25,187 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:02:25,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:02:25,200 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 67 statements into 2 equivalence classes. [2025-04-13 18:02:25,217 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 18:02:25,217 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:02:25,217 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:02:25,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:02:25,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:02:25,404 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562455847] [2025-04-13 18:02:25,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [562455847] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:02:25,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:02:25,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 18:02:25,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156928197] [2025-04-13 18:02:25,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:02:25,404 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 18:02:25,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:02:25,405 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 18:02:25,405 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-13 18:02:25,405 INFO L87 Difference]: Start difference. First operand 8929 states and 31607 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 18:02:25,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:02:25,711 INFO L93 Difference]: Finished difference Result 21276 states and 74651 transitions. [2025-04-13 18:02:25,711 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 18:02:25,711 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 18:02:25,711 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:02:25,769 INFO L225 Difference]: With dead ends: 21276 [2025-04-13 18:02:25,769 INFO L226 Difference]: Without dead ends: 15659 [2025-04-13 18:02:25,782 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 18:02:25,783 INFO L437 NwaCegarLoop]: 64 mSDtfsCounter, 83 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:02:25,783 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 143 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:02:25,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15659 states. [2025-04-13 18:02:26,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15659 to 11596. [2025-04-13 18:02:26,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11596 states, 11595 states have (on average 3.538076757222941) internal successors, (41024), 11595 states have internal predecessors, (41024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:02:26,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11596 states to 11596 states and 41024 transitions. [2025-04-13 18:02:26,104 INFO L79 Accepts]: Start accepts. Automaton has 11596 states and 41024 transitions. Word has length 67 [2025-04-13 18:02:26,104 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:02:26,104 INFO L485 AbstractCegarLoop]: Abstraction has 11596 states and 41024 transitions. [2025-04-13 18:02:26,105 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 18:02:26,105 INFO L278 IsEmpty]: Start isEmpty. Operand 11596 states and 41024 transitions. [2025-04-13 18:02:26,126 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-04-13 18:02:26,126 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:02:26,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] [2025-04-13 18:02:26,127 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 18:02:26,127 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 18:02:26,127 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:02:26,127 INFO L85 PathProgramCache]: Analyzing trace with hash 215800270, now seen corresponding path program 5 times [2025-04-13 18:02:26,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:02:26,127 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104098228] [2025-04-13 18:02:26,127 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:02:26,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:02:26,138 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 67 statements into 1 equivalence classes. [2025-04-13 18:02:26,148 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-04-13 18:02:26,148 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:02:26,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:02:26,286 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 18:02:26,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:02:26,287 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104098228] [2025-04-13 18:02:26,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104098228] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:02:26,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:02:26,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-13 18:02:26,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343846684] [2025-04-13 18:02:26,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:02:26,287 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 18:02:26,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:02:26,287 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 18:02:26,288 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-04-13 18:02:26,288 INFO L87 Difference]: Start difference. First operand 11596 states and 41024 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 18:02:26,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:02:26,859 INFO L93 Difference]: Finished difference Result 12931 states and 44810 transitions. [2025-04-13 18:02:26,860 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 18:02:26,860 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 18:02:26,860 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:02:26,906 INFO L225 Difference]: With dead ends: 12931 [2025-04-13 18:02:26,906 INFO L226 Difference]: Without dead ends: 12503 [2025-04-13 18:02:26,911 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 18:02:26,912 INFO L437 NwaCegarLoop]: 80 mSDtfsCounter, 283 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 882 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 463 SdHoareTripleChecker+Invalid, 884 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 882 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 18:02:26,912 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [283 Valid, 463 Invalid, 884 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 882 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 18:02:26,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12503 states. [2025-04-13 18:02:27,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12503 to 11590. [2025-04-13 18:02:27,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11590 states, 11589 states have (on average 3.5320562602467858) internal successors, (40933), 11589 states have internal predecessors, (40933), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:02:27,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11590 states to 11590 states and 40933 transitions. [2025-04-13 18:02:27,200 INFO L79 Accepts]: Start accepts. Automaton has 11590 states and 40933 transitions. Word has length 67 [2025-04-13 18:02:27,201 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:02:27,201 INFO L485 AbstractCegarLoop]: Abstraction has 11590 states and 40933 transitions. [2025-04-13 18:02:27,201 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 18:02:27,201 INFO L278 IsEmpty]: Start isEmpty. Operand 11590 states and 40933 transitions. [2025-04-13 18:02:27,226 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-04-13 18:02:27,226 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:02:27,226 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 18:02:27,226 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-13 18:02:27,226 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 18:02:27,227 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:02:27,227 INFO L85 PathProgramCache]: Analyzing trace with hash 2021821344, now seen corresponding path program 6 times [2025-04-13 18:02:27,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:02:27,227 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711496530] [2025-04-13 18:02:27,227 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:02:27,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:02:27,237 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 67 statements into 1 equivalence classes. [2025-04-13 18:02:27,251 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-04-13 18:02:27,251 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 18:02:27,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:02:27,406 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 18:02:27,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:02:27,406 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711496530] [2025-04-13 18:02:27,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711496530] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:02:27,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:02:27,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-13 18:02:27,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60384987] [2025-04-13 18:02:27,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:02:27,407 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 18:02:27,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:02:27,407 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 18:02:27,407 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-04-13 18:02:27,407 INFO L87 Difference]: Start difference. First operand 11590 states and 40933 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 18:02:27,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:02:27,926 INFO L93 Difference]: Finished difference Result 13825 states and 47374 transitions. [2025-04-13 18:02:27,927 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 18:02:27,927 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 18:02:27,927 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:02:27,991 INFO L225 Difference]: With dead ends: 13825 [2025-04-13 18:02:27,992 INFO L226 Difference]: Without dead ends: 13057 [2025-04-13 18:02:27,998 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 18:02:28,000 INFO L437 NwaCegarLoop]: 80 mSDtfsCounter, 305 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 911 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 305 SdHoareTripleChecker+Valid, 456 SdHoareTripleChecker+Invalid, 913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 911 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 18:02:28,000 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [305 Valid, 456 Invalid, 913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 911 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 18:02:28,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13057 states. [2025-04-13 18:02:28,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13057 to 11451. [2025-04-13 18:02:28,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11451 states, 11450 states have (on average 3.522096069868996) internal successors, (40328), 11450 states have internal predecessors, (40328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:02:28,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11451 states to 11451 states and 40328 transitions. [2025-04-13 18:02:28,361 INFO L79 Accepts]: Start accepts. Automaton has 11451 states and 40328 transitions. Word has length 67 [2025-04-13 18:02:28,361 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:02:28,361 INFO L485 AbstractCegarLoop]: Abstraction has 11451 states and 40328 transitions. [2025-04-13 18:02:28,361 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 18:02:28,362 INFO L278 IsEmpty]: Start isEmpty. Operand 11451 states and 40328 transitions. [2025-04-13 18:02:28,383 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-04-13 18:02:28,383 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:02:28,383 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 18:02:28,383 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-13 18:02:28,383 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 18:02:28,384 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:02:28,384 INFO L85 PathProgramCache]: Analyzing trace with hash -1732361326, now seen corresponding path program 7 times [2025-04-13 18:02:28,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:02:28,384 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473057959] [2025-04-13 18:02:28,384 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:02:28,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:02:28,392 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-04-13 18:02:28,398 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-04-13 18:02:28,398 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:02:28,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:02:28,515 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 18:02:28,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:02:28,516 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473057959] [2025-04-13 18:02:28,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473057959] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:02:28,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:02:28,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 18:02:28,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051322904] [2025-04-13 18:02:28,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:02:28,516 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 18:02:28,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:02:28,516 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 18:02:28,516 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 18:02:28,517 INFO L87 Difference]: Start difference. First operand 11451 states and 40328 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 18:02:28,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:02:28,732 INFO L93 Difference]: Finished difference Result 19512 states and 67822 transitions. [2025-04-13 18:02:28,732 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 18:02:28,732 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 18:02:28,733 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:02:28,794 INFO L225 Difference]: With dead ends: 19512 [2025-04-13 18:02:28,794 INFO L226 Difference]: Without dead ends: 13416 [2025-04-13 18:02:28,807 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 18:02:28,808 INFO L437 NwaCegarLoop]: 62 mSDtfsCounter, 72 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:02:28,809 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 147 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:02:28,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13416 states. [2025-04-13 18:02:29,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13416 to 11711. [2025-04-13 18:02:29,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11711 states, 11710 states have (on average 3.4927412467976087) internal successors, (40900), 11710 states have internal predecessors, (40900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:02:29,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11711 states to 11711 states and 40900 transitions. [2025-04-13 18:02:29,164 INFO L79 Accepts]: Start accepts. Automaton has 11711 states and 40900 transitions. Word has length 67 [2025-04-13 18:02:29,164 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:02:29,164 INFO L485 AbstractCegarLoop]: Abstraction has 11711 states and 40900 transitions. [2025-04-13 18:02:29,164 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 18:02:29,164 INFO L278 IsEmpty]: Start isEmpty. Operand 11711 states and 40900 transitions. [2025-04-13 18:02:29,185 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-04-13 18:02:29,185 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:02:29,185 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 18:02:29,185 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-13 18:02:29,185 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 18:02:29,186 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:02:29,186 INFO L85 PathProgramCache]: Analyzing trace with hash -1815066432, now seen corresponding path program 8 times [2025-04-13 18:02:29,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:02:29,186 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152405523] [2025-04-13 18:02:29,186 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:02:29,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:02:29,192 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 67 statements into 1 equivalence classes. [2025-04-13 18:02:29,198 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-04-13 18:02:29,198 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:02:29,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:02:29,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 18:02:29,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:02:29,308 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152405523] [2025-04-13 18:02:29,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152405523] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:02:29,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:02:29,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 18:02:29,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537285704] [2025-04-13 18:02:29,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:02:29,309 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 18:02:29,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:02:29,310 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 18:02:29,310 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 18:02:29,310 INFO L87 Difference]: Start difference. First operand 11711 states and 40900 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 18:02:29,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:02:29,536 INFO L93 Difference]: Finished difference Result 18117 states and 62791 transitions. [2025-04-13 18:02:29,536 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 18:02:29,536 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 18:02:29,537 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:02:29,590 INFO L225 Difference]: With dead ends: 18117 [2025-04-13 18:02:29,590 INFO L226 Difference]: Without dead ends: 14095 [2025-04-13 18:02:29,602 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 18:02:29,603 INFO L437 NwaCegarLoop]: 61 mSDtfsCounter, 69 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 290 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:02:29,604 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 168 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 290 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:02:29,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14095 states. [2025-04-13 18:02:29,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14095 to 13103. [2025-04-13 18:02:29,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13103 states, 13102 states have (on average 3.4950389253549075) internal successors, (45792), 13102 states have internal predecessors, (45792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:02:29,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13103 states to 13103 states and 45792 transitions. [2025-04-13 18:02:30,022 INFO L79 Accepts]: Start accepts. Automaton has 13103 states and 45792 transitions. Word has length 67 [2025-04-13 18:02:30,023 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:02:30,023 INFO L485 AbstractCegarLoop]: Abstraction has 13103 states and 45792 transitions. [2025-04-13 18:02:30,023 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 18:02:30,023 INFO L278 IsEmpty]: Start isEmpty. Operand 13103 states and 45792 transitions. [2025-04-13 18:02:30,052 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-04-13 18:02:30,052 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:02:30,052 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 18:02:30,052 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-13 18:02:30,053 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 18:02:30,053 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:02:30,053 INFO L85 PathProgramCache]: Analyzing trace with hash -1186300614, now seen corresponding path program 9 times [2025-04-13 18:02:30,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:02:30,053 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662318667] [2025-04-13 18:02:30,053 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:02:30,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:02:30,059 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 67 statements into 1 equivalence classes. [2025-04-13 18:02:30,064 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-04-13 18:02:30,065 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 18:02:30,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:02:30,100 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 18:02:30,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:02:30,100 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662318667] [2025-04-13 18:02:30,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662318667] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:02:30,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:02:30,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 18:02:30,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134563040] [2025-04-13 18:02:30,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:02:30,100 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 18:02:30,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:02:30,101 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 18:02:30,101 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 18:02:30,101 INFO L87 Difference]: Start difference. First operand 13103 states and 45792 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 18:02:30,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:02:30,247 INFO L93 Difference]: Finished difference Result 18667 states and 64332 transitions. [2025-04-13 18:02:30,248 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 18:02:30,248 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 18:02:30,248 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:02:30,305 INFO L225 Difference]: With dead ends: 18667 [2025-04-13 18:02:30,306 INFO L226 Difference]: Without dead ends: 12935 [2025-04-13 18:02:30,318 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 18:02:30,319 INFO L437 NwaCegarLoop]: 48 mSDtfsCounter, 23 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:02:30,319 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 76 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:02:30,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12935 states. [2025-04-13 18:02:30,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12935 to 12927. [2025-04-13 18:02:30,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12927 states, 12926 states have (on average 3.4356336066842026) internal successors, (44409), 12926 states have internal predecessors, (44409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:02:30,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12927 states to 12927 states and 44409 transitions. [2025-04-13 18:02:30,663 INFO L79 Accepts]: Start accepts. Automaton has 12927 states and 44409 transitions. Word has length 67 [2025-04-13 18:02:30,663 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:02:30,663 INFO L485 AbstractCegarLoop]: Abstraction has 12927 states and 44409 transitions. [2025-04-13 18:02:30,663 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 18:02:30,663 INFO L278 IsEmpty]: Start isEmpty. Operand 12927 states and 44409 transitions. [2025-04-13 18:02:30,683 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-04-13 18:02:30,683 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:02:30,684 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 18:02:30,684 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-13 18:02:30,684 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 18:02:30,684 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:02:30,684 INFO L85 PathProgramCache]: Analyzing trace with hash 1929224144, now seen corresponding path program 10 times [2025-04-13 18:02:30,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:02:30,684 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45862414] [2025-04-13 18:02:30,684 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:02:30,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:02:30,690 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 67 statements into 2 equivalence classes. [2025-04-13 18:02:30,696 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 18:02:30,696 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:02:30,696 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:02:30,742 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 18:02:30,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:02:30,742 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45862414] [2025-04-13 18:02:30,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45862414] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:02:30,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:02:30,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 18:02:30,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497991229] [2025-04-13 18:02:30,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:02:30,743 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 18:02:30,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:02:30,743 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 18:02:30,743 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 18:02:30,743 INFO L87 Difference]: Start difference. First operand 12927 states and 44409 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 18:02:30,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:02:30,868 INFO L93 Difference]: Finished difference Result 18464 states and 62723 transitions. [2025-04-13 18:02:30,868 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 18:02:30,868 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 18:02:30,868 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:02:30,912 INFO L225 Difference]: With dead ends: 18464 [2025-04-13 18:02:30,912 INFO L226 Difference]: Without dead ends: 12407 [2025-04-13 18:02:30,923 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 18:02:30,924 INFO L437 NwaCegarLoop]: 49 mSDtfsCounter, 24 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:02:30,924 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 77 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:02:30,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12407 states. [2025-04-13 18:02:31,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12407 to 12347. [2025-04-13 18:02:31,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12347 states, 12346 states have (on average 3.378584156811923) internal successors, (41712), 12346 states have internal predecessors, (41712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:02:31,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12347 states to 12347 states and 41712 transitions. [2025-04-13 18:02:31,428 INFO L79 Accepts]: Start accepts. Automaton has 12347 states and 41712 transitions. Word has length 67 [2025-04-13 18:02:31,429 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:02:31,429 INFO L485 AbstractCegarLoop]: Abstraction has 12347 states and 41712 transitions. [2025-04-13 18:02:31,429 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 18:02:31,429 INFO L278 IsEmpty]: Start isEmpty. Operand 12347 states and 41712 transitions. [2025-04-13 18:02:31,454 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-04-13 18:02:31,454 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:02:31,455 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 18:02:31,455 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-13 18:02:31,455 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 18:02:31,456 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:02:31,456 INFO L85 PathProgramCache]: Analyzing trace with hash 2125723736, now seen corresponding path program 11 times [2025-04-13 18:02:31,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:02:31,456 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903571005] [2025-04-13 18:02:31,456 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:02:31,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:02:31,465 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 67 statements into 1 equivalence classes. [2025-04-13 18:02:31,471 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-04-13 18:02:31,471 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:02:31,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:02:31,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 18:02:31,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:02:31,698 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903571005] [2025-04-13 18:02:31,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903571005] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:02:31,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:02:31,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 18:02:31,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528839489] [2025-04-13 18:02:31,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:02:31,701 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 18:02:31,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:02:31,701 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 18:02:31,701 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 18:02:31,701 INFO L87 Difference]: Start difference. First operand 12347 states and 41712 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 18:02:32,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:02:32,059 INFO L93 Difference]: Finished difference Result 21524 states and 71483 transitions. [2025-04-13 18:02:32,059 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 18:02:32,059 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 18:02:32,059 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:02:32,096 INFO L225 Difference]: With dead ends: 21524 [2025-04-13 18:02:32,096 INFO L226 Difference]: Without dead ends: 11167 [2025-04-13 18:02:32,107 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 18:02:32,108 INFO L437 NwaCegarLoop]: 59 mSDtfsCounter, 61 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:02:32,108 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 161 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 255 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:02:32,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11167 states. [2025-04-13 18:02:32,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11167 to 10937. [2025-04-13 18:02:32,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10937 states, 10936 states have (on average 3.2536576444769567) internal successors, (35582), 10936 states have internal predecessors, (35582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:02:32,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10937 states to 10937 states and 35582 transitions. [2025-04-13 18:02:32,262 INFO L79 Accepts]: Start accepts. Automaton has 10937 states and 35582 transitions. Word has length 67 [2025-04-13 18:02:32,262 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:02:32,262 INFO L485 AbstractCegarLoop]: Abstraction has 10937 states and 35582 transitions. [2025-04-13 18:02:32,262 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 18:02:32,262 INFO L278 IsEmpty]: Start isEmpty. Operand 10937 states and 35582 transitions. [2025-04-13 18:02:32,277 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-04-13 18:02:32,277 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:02:32,277 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 18:02:32,277 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-13 18:02:32,277 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 18:02:32,277 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:02:32,278 INFO L85 PathProgramCache]: Analyzing trace with hash 325789442, now seen corresponding path program 12 times [2025-04-13 18:02:32,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:02:32,278 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831318081] [2025-04-13 18:02:32,278 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:02:32,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:02:32,284 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 67 statements into 1 equivalence classes. [2025-04-13 18:02:32,288 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-04-13 18:02:32,288 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 18:02:32,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:02:32,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 18:02:32,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:02:32,318 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831318081] [2025-04-13 18:02:32,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831318081] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:02:32,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:02:32,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 18:02:32,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347160545] [2025-04-13 18:02:32,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:02:32,319 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 18:02:32,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:02:32,319 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 18:02:32,319 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 18:02:32,319 INFO L87 Difference]: Start difference. First operand 10937 states and 35582 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 18:02:32,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:02:32,447 INFO L93 Difference]: Finished difference Result 16260 states and 52997 transitions. [2025-04-13 18:02:32,448 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 18:02:32,448 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 18:02:32,448 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:02:32,521 INFO L225 Difference]: With dead ends: 16260 [2025-04-13 18:02:32,521 INFO L226 Difference]: Without dead ends: 10645 [2025-04-13 18:02:32,534 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 18:02:32,535 INFO L437 NwaCegarLoop]: 50 mSDtfsCounter, 33 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:02:32,536 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 78 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:02:32,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10645 states. [2025-04-13 18:02:32,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10645 to 10645. [2025-04-13 18:02:32,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10645 states, 10644 states have (on average 3.2071589627959414) internal successors, (34137), 10644 states have internal predecessors, (34137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:02:32,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10645 states to 10645 states and 34137 transitions. [2025-04-13 18:02:32,767 INFO L79 Accepts]: Start accepts. Automaton has 10645 states and 34137 transitions. Word has length 67 [2025-04-13 18:02:32,767 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:02:32,767 INFO L485 AbstractCegarLoop]: Abstraction has 10645 states and 34137 transitions. [2025-04-13 18:02:32,767 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 18:02:32,767 INFO L278 IsEmpty]: Start isEmpty. Operand 10645 states and 34137 transitions. [2025-04-13 18:02:32,783 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-04-13 18:02:32,784 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:02:32,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] [2025-04-13 18:02:32,784 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-13 18:02:32,784 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 18:02:32,784 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:02:32,784 INFO L85 PathProgramCache]: Analyzing trace with hash -147823592, now seen corresponding path program 13 times [2025-04-13 18:02:32,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:02:32,784 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875679779] [2025-04-13 18:02:32,784 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:02:32,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:02:32,876 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-04-13 18:02:32,885 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-04-13 18:02:32,885 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:02:32,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:02:32,969 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 18:02:32,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:02:32,969 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875679779] [2025-04-13 18:02:32,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875679779] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:02:32,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:02:32,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 18:02:32,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195186966] [2025-04-13 18:02:32,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:02:32,969 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 18:02:32,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:02:32,970 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 18:02:32,970 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 18:02:32,970 INFO L87 Difference]: Start difference. First operand 10645 states and 34137 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 18:02:33,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:02:33,157 INFO L93 Difference]: Finished difference Result 14005 states and 44228 transitions. [2025-04-13 18:02:33,158 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 18:02:33,158 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 18:02:33,158 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:02:33,211 INFO L225 Difference]: With dead ends: 14005 [2025-04-13 18:02:33,211 INFO L226 Difference]: Without dead ends: 11129 [2025-04-13 18:02:33,220 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 18:02:33,220 INFO L437 NwaCegarLoop]: 57 mSDtfsCounter, 67 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:02:33,220 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 158 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 253 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:02:33,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11129 states. [2025-04-13 18:02:33,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11129 to 10645. [2025-04-13 18:02:33,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10645 states, 10644 states have (on average 3.185174746335964) internal successors, (33903), 10644 states have internal predecessors, (33903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:02:33,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10645 states to 10645 states and 33903 transitions. [2025-04-13 18:02:33,425 INFO L79 Accepts]: Start accepts. Automaton has 10645 states and 33903 transitions. Word has length 67 [2025-04-13 18:02:33,425 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:02:33,425 INFO L485 AbstractCegarLoop]: Abstraction has 10645 states and 33903 transitions. [2025-04-13 18:02:33,426 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 18:02:33,426 INFO L278 IsEmpty]: Start isEmpty. Operand 10645 states and 33903 transitions. [2025-04-13 18:02:33,441 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-04-13 18:02:33,441 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:02:33,441 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 18:02:33,441 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-04-13 18:02:33,442 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 18:02:33,442 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:02:33,442 INFO L85 PathProgramCache]: Analyzing trace with hash -2109440980, now seen corresponding path program 14 times [2025-04-13 18:02:33,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:02:33,442 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524906185] [2025-04-13 18:02:33,442 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:02:33,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:02:33,447 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 67 statements into 1 equivalence classes. [2025-04-13 18:02:33,450 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-04-13 18:02:33,450 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:02:33,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:02:33,501 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 18:02:33,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:02:33,501 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524906185] [2025-04-13 18:02:33,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524906185] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:02:33,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:02:33,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 18:02:33,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887338011] [2025-04-13 18:02:33,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:02:33,502 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 18:02:33,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:02:33,502 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 18:02:33,502 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-13 18:02:33,502 INFO L87 Difference]: Start difference. First operand 10645 states and 33903 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 18:02:33,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:02:33,658 INFO L93 Difference]: Finished difference Result 15740 states and 48658 transitions. [2025-04-13 18:02:33,658 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 18:02:33,658 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 18:02:33,658 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:02:33,724 INFO L225 Difference]: With dead ends: 15740 [2025-04-13 18:02:33,725 INFO L226 Difference]: Without dead ends: 13507 [2025-04-13 18:02:33,733 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 18:02:33,734 INFO L437 NwaCegarLoop]: 55 mSDtfsCounter, 85 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:02:33,734 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 99 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:02:33,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13507 states. [2025-04-13 18:02:33,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13507 to 10766. [2025-04-13 18:02:33,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10766 states, 10765 states have (on average 3.168973525313516) internal successors, (34114), 10765 states have internal predecessors, (34114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:02:34,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10766 states to 10766 states and 34114 transitions. [2025-04-13 18:02:34,044 INFO L79 Accepts]: Start accepts. Automaton has 10766 states and 34114 transitions. Word has length 67 [2025-04-13 18:02:34,045 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:02:34,045 INFO L485 AbstractCegarLoop]: Abstraction has 10766 states and 34114 transitions. [2025-04-13 18:02:34,045 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 18:02:34,045 INFO L278 IsEmpty]: Start isEmpty. Operand 10766 states and 34114 transitions. [2025-04-13 18:02:34,059 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-04-13 18:02:34,059 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:02:34,059 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 18:02:34,059 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-04-13 18:02:34,060 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 18:02:34,060 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:02:34,060 INFO L85 PathProgramCache]: Analyzing trace with hash -1618841348, now seen corresponding path program 15 times [2025-04-13 18:02:34,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:02:34,060 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605951720] [2025-04-13 18:02:34,060 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:02:34,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:02:34,065 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 67 statements into 1 equivalence classes. [2025-04-13 18:02:34,069 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-04-13 18:02:34,069 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 18:02:34,069 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:02:34,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 18:02:34,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:02:34,150 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605951720] [2025-04-13 18:02:34,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605951720] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:02:34,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:02:34,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-13 18:02:34,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074959876] [2025-04-13 18:02:34,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:02:34,150 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 18:02:34,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:02:34,151 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 18:02:34,151 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-04-13 18:02:34,151 INFO L87 Difference]: Start difference. First operand 10766 states and 34114 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 18:02:34,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:02:34,595 INFO L93 Difference]: Finished difference Result 12800 states and 39959 transitions. [2025-04-13 18:02:34,595 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 18:02:34,596 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 18:02:34,596 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:02:34,655 INFO L225 Difference]: With dead ends: 12800 [2025-04-13 18:02:34,655 INFO L226 Difference]: Without dead ends: 12189 [2025-04-13 18:02:34,662 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 18:02:34,662 INFO L437 NwaCegarLoop]: 79 mSDtfsCounter, 304 mSDsluCounter, 377 mSDsCounter, 0 mSdLazyCounter, 900 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 304 SdHoareTripleChecker+Valid, 456 SdHoareTripleChecker+Invalid, 902 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 900 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:02:34,662 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [304 Valid, 456 Invalid, 902 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 900 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:02:34,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12189 states. [2025-04-13 18:02:34,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12189 to 10708. [2025-04-13 18:02:34,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10708 states, 10707 states have (on average 3.164565237694966) internal successors, (33883), 10707 states have internal predecessors, (33883), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:02:34,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10708 states to 10708 states and 33883 transitions. [2025-04-13 18:02:34,876 INFO L79 Accepts]: Start accepts. Automaton has 10708 states and 33883 transitions. Word has length 67 [2025-04-13 18:02:34,877 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:02:34,877 INFO L485 AbstractCegarLoop]: Abstraction has 10708 states and 33883 transitions. [2025-04-13 18:02:34,877 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 18:02:34,877 INFO L278 IsEmpty]: Start isEmpty. Operand 10708 states and 33883 transitions. [2025-04-13 18:02:34,893 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-04-13 18:02:34,893 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:02:34,893 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 18:02:34,893 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-04-13 18:02:34,893 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 18:02:34,893 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:02:34,894 INFO L85 PathProgramCache]: Analyzing trace with hash 1511597990, now seen corresponding path program 16 times [2025-04-13 18:02:34,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:02:34,894 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810034604] [2025-04-13 18:02:34,894 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:02:34,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:02:34,899 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 67 statements into 2 equivalence classes. [2025-04-13 18:02:34,904 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 18:02:34,904 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:02:34,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:02:34,993 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 18:02:34,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:02:34,994 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810034604] [2025-04-13 18:02:34,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1810034604] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:02:34,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:02:34,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-13 18:02:34,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400448413] [2025-04-13 18:02:34,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:02:34,994 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 18:02:34,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:02:34,994 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 18:02:34,994 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-04-13 18:02:34,995 INFO L87 Difference]: Start difference. First operand 10708 states and 33883 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 18:02:35,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:02:35,452 INFO L93 Difference]: Finished difference Result 12076 states and 37803 transitions. [2025-04-13 18:02:35,452 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 18:02:35,452 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 18:02:35,452 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:02:35,525 INFO L225 Difference]: With dead ends: 12076 [2025-04-13 18:02:35,526 INFO L226 Difference]: Without dead ends: 11756 [2025-04-13 18:02:35,531 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 18:02:35,532 INFO L437 NwaCegarLoop]: 80 mSDtfsCounter, 288 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 870 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 288 SdHoareTripleChecker+Valid, 464 SdHoareTripleChecker+Invalid, 872 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 870 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:02:35,532 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [288 Valid, 464 Invalid, 872 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 870 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:02:35,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11756 states. [2025-04-13 18:02:35,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11756 to 10794. [2025-04-13 18:02:35,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10794 states, 10793 states have (on average 3.1577874548318356) internal successors, (34082), 10793 states have internal predecessors, (34082), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:02:35,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10794 states to 10794 states and 34082 transitions. [2025-04-13 18:02:35,745 INFO L79 Accepts]: Start accepts. Automaton has 10794 states and 34082 transitions. Word has length 67 [2025-04-13 18:02:35,745 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:02:35,745 INFO L485 AbstractCegarLoop]: Abstraction has 10794 states and 34082 transitions. [2025-04-13 18:02:35,746 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 18:02:35,746 INFO L278 IsEmpty]: Start isEmpty. Operand 10794 states and 34082 transitions. [2025-04-13 18:02:35,760 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-04-13 18:02:35,760 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:02:35,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 18:02:35,760 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-04-13 18:02:35,760 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 18:02:35,760 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:02:35,761 INFO L85 PathProgramCache]: Analyzing trace with hash -1746302367, now seen corresponding path program 1 times [2025-04-13 18:02:35,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:02:35,761 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691336011] [2025-04-13 18:02:35,761 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:02:35,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:02:35,765 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-04-13 18:02:35,769 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-04-13 18:02:35,769 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:02:35,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:02:35,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 18:02:35,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:02:35,842 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691336011] [2025-04-13 18:02:35,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691336011] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:02:35,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:02:35,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 18:02:35,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326137554] [2025-04-13 18:02:35,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:02:35,843 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 18:02:35,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:02:35,843 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 18:02:35,843 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2025-04-13 18:02:35,843 INFO L87 Difference]: Start difference. First operand 10794 states and 34082 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 18:02:36,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:02:36,178 INFO L93 Difference]: Finished difference Result 13738 states and 42581 transitions. [2025-04-13 18:02:36,178 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 18:02:36,178 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 18:02:36,178 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:02:36,243 INFO L225 Difference]: With dead ends: 13738 [2025-04-13 18:02:36,243 INFO L226 Difference]: Without dead ends: 11878 [2025-04-13 18:02:36,252 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 18:02:36,253 INFO L437 NwaCegarLoop]: 87 mSDtfsCounter, 156 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 405 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 411 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 405 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:02:36,253 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 280 Invalid, 411 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 405 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:02:36,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11878 states. [2025-04-13 18:02:36,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11878 to 10622. [2025-04-13 18:02:36,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10622 states, 10621 states have (on average 3.1460314471330384) internal successors, (33414), 10621 states have internal predecessors, (33414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:02:36,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10622 states to 10622 states and 33414 transitions. [2025-04-13 18:02:36,428 INFO L79 Accepts]: Start accepts. Automaton has 10622 states and 33414 transitions. Word has length 68 [2025-04-13 18:02:36,428 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:02:36,429 INFO L485 AbstractCegarLoop]: Abstraction has 10622 states and 33414 transitions. [2025-04-13 18:02:36,429 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 18:02:36,429 INFO L278 IsEmpty]: Start isEmpty. Operand 10622 states and 33414 transitions. [2025-04-13 18:02:36,442 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-04-13 18:02:36,442 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:02:36,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] [2025-04-13 18:02:36,443 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-04-13 18:02:36,443 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 18:02:36,443 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:02:36,443 INFO L85 PathProgramCache]: Analyzing trace with hash -1802496793, now seen corresponding path program 1 times [2025-04-13 18:02:36,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:02:36,443 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445176471] [2025-04-13 18:02:36,443 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:02:36,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:02:36,447 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-04-13 18:02:36,450 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-04-13 18:02:36,450 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:02:36,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:02:36,517 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 18:02:36,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:02:36,518 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445176471] [2025-04-13 18:02:36,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445176471] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:02:36,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:02:36,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 18:02:36,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768768859] [2025-04-13 18:02:36,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:02:36,518 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 18:02:36,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:02:36,518 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 18:02:36,518 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2025-04-13 18:02:36,518 INFO L87 Difference]: Start difference. First operand 10622 states and 33414 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 18:02:36,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:02:36,732 INFO L93 Difference]: Finished difference Result 13708 states and 42140 transitions. [2025-04-13 18:02:36,732 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 18:02:36,732 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 18:02:36,733 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:02:36,787 INFO L225 Difference]: With dead ends: 13708 [2025-04-13 18:02:36,787 INFO L226 Difference]: Without dead ends: 11830 [2025-04-13 18:02:36,794 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 18:02:36,795 INFO L437 NwaCegarLoop]: 89 mSDtfsCounter, 160 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:02:36,795 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 220 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 282 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:02:36,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11830 states. [2025-04-13 18:02:36,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11830 to 10406. [2025-04-13 18:02:36,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10406 states, 10405 states have (on average 3.127150408457472) internal successors, (32538), 10405 states have internal predecessors, (32538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:02:36,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10406 states to 10406 states and 32538 transitions. [2025-04-13 18:02:36,983 INFO L79 Accepts]: Start accepts. Automaton has 10406 states and 32538 transitions. Word has length 68 [2025-04-13 18:02:36,984 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:02:36,984 INFO L485 AbstractCegarLoop]: Abstraction has 10406 states and 32538 transitions. [2025-04-13 18:02:36,984 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 18:02:36,984 INFO L278 IsEmpty]: Start isEmpty. Operand 10406 states and 32538 transitions. [2025-04-13 18:02:36,997 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-04-13 18:02:36,997 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:02:36,997 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 18:02:36,997 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-04-13 18:02:36,997 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 18:02:36,998 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:02:36,998 INFO L85 PathProgramCache]: Analyzing trace with hash -514841315, now seen corresponding path program 1 times [2025-04-13 18:02:36,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:02:36,998 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921537617] [2025-04-13 18:02:36,998 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:02:36,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:02:37,002 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-04-13 18:02:37,005 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-04-13 18:02:37,005 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:02:37,005 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:02:37,067 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 18:02:37,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:02:37,068 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921537617] [2025-04-13 18:02:37,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921537617] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:02:37,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:02:37,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 18:02:37,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285573976] [2025-04-13 18:02:37,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:02:37,068 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 18:02:37,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:02:37,068 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 18:02:37,068 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2025-04-13 18:02:37,069 INFO L87 Difference]: Start difference. First operand 10406 states and 32538 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 18:02:37,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:02:37,302 INFO L93 Difference]: Finished difference Result 12197 states and 37454 transitions. [2025-04-13 18:02:37,302 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 18:02:37,302 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 18:02:37,302 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:02:37,362 INFO L225 Difference]: With dead ends: 12197 [2025-04-13 18:02:37,362 INFO L226 Difference]: Without dead ends: 10771 [2025-04-13 18:02:37,369 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 18:02:37,370 INFO L437 NwaCegarLoop]: 86 mSDtfsCounter, 151 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:02:37,370 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 244 Invalid, 345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 339 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:02:37,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10771 states. [2025-04-13 18:02:37,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10771 to 9605. [2025-04-13 18:02:37,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9605 states, 9604 states have (on average 3.127030403998334) internal successors, (30032), 9604 states have internal predecessors, (30032), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:02:37,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9605 states to 9605 states and 30032 transitions. [2025-04-13 18:02:37,673 INFO L79 Accepts]: Start accepts. Automaton has 9605 states and 30032 transitions. Word has length 68 [2025-04-13 18:02:37,673 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:02:37,673 INFO L485 AbstractCegarLoop]: Abstraction has 9605 states and 30032 transitions. [2025-04-13 18:02:37,673 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 18:02:37,673 INFO L278 IsEmpty]: Start isEmpty. Operand 9605 states and 30032 transitions. [2025-04-13 18:02:37,691 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-04-13 18:02:37,691 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:02:37,691 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 18:02:37,691 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-04-13 18:02:37,691 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 18:02:37,692 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:02:37,692 INFO L85 PathProgramCache]: Analyzing trace with hash 1216436414, now seen corresponding path program 1 times [2025-04-13 18:02:37,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:02:37,692 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178425931] [2025-04-13 18:02:37,692 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:02:37,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:02:37,701 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-04-13 18:02:37,707 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-04-13 18:02:37,707 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:02:37,707 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:02:37,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 18:02:37,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:02:37,860 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178425931] [2025-04-13 18:02:37,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178425931] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:02:37,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:02:37,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-13 18:02:37,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912906779] [2025-04-13 18:02:37,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:02:37,860 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 18:02:37,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:02:37,861 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 18:02:37,861 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-04-13 18:02:37,861 INFO L87 Difference]: Start difference. First operand 9605 states and 30032 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 18:02:38,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:02:38,324 INFO L93 Difference]: Finished difference Result 13132 states and 40392 transitions. [2025-04-13 18:02:38,324 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 18:02:38,324 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 18:02:38,324 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:02:38,375 INFO L225 Difference]: With dead ends: 13132 [2025-04-13 18:02:38,375 INFO L226 Difference]: Without dead ends: 10414 [2025-04-13 18:02:38,382 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 18:02:38,383 INFO L437 NwaCegarLoop]: 84 mSDtfsCounter, 206 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 633 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 655 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 633 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:02:38,383 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 355 Invalid, 655 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 633 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:02:38,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10414 states. [2025-04-13 18:02:38,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10414 to 9626. [2025-04-13 18:02:38,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9626 states, 9625 states have (on average 3.1204155844155843) internal successors, (30034), 9625 states have internal predecessors, (30034), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:02:38,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9626 states to 9626 states and 30034 transitions. [2025-04-13 18:02:38,567 INFO L79 Accepts]: Start accepts. Automaton has 9626 states and 30034 transitions. Word has length 68 [2025-04-13 18:02:38,567 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:02:38,567 INFO L485 AbstractCegarLoop]: Abstraction has 9626 states and 30034 transitions. [2025-04-13 18:02:38,567 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 18:02:38,567 INFO L278 IsEmpty]: Start isEmpty. Operand 9626 states and 30034 transitions. [2025-04-13 18:02:38,582 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-04-13 18:02:38,582 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:02:38,582 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 18:02:38,582 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-04-13 18:02:38,582 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 18:02:38,583 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:02:38,583 INFO L85 PathProgramCache]: Analyzing trace with hash -908423606, now seen corresponding path program 1 times [2025-04-13 18:02:38,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:02:38,585 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898637467] [2025-04-13 18:02:38,586 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:02:38,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:02:38,591 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-04-13 18:02:38,596 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-04-13 18:02:38,596 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:02:38,596 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:02:38,725 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 18:02:38,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:02:38,725 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898637467] [2025-04-13 18:02:38,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898637467] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:02:38,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:02:38,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-13 18:02:38,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104931603] [2025-04-13 18:02:38,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:02:38,726 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 18:02:38,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:02:38,726 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 18:02:38,726 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-04-13 18:02:38,726 INFO L87 Difference]: Start difference. First operand 9626 states and 30034 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 18:02:39,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:02:39,190 INFO L93 Difference]: Finished difference Result 15016 states and 45675 transitions. [2025-04-13 18:02:39,191 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 18:02:39,192 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 18:02:39,192 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:02:39,247 INFO L225 Difference]: With dead ends: 15016 [2025-04-13 18:02:39,247 INFO L226 Difference]: Without dead ends: 12592 [2025-04-13 18:02:39,254 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2025-04-13 18:02:39,255 INFO L437 NwaCegarLoop]: 102 mSDtfsCounter, 250 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 674 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 707 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 674 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:02:39,255 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [250 Valid, 408 Invalid, 707 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 674 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:02:39,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12592 states. [2025-04-13 18:02:39,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12592 to 10093. [2025-04-13 18:02:39,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10093 states, 10092 states have (on average 3.080757035275466) internal successors, (31091), 10092 states have internal predecessors, (31091), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:02:39,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10093 states to 10093 states and 31091 transitions. [2025-04-13 18:02:39,532 INFO L79 Accepts]: Start accepts. Automaton has 10093 states and 31091 transitions. Word has length 68 [2025-04-13 18:02:39,533 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:02:39,533 INFO L485 AbstractCegarLoop]: Abstraction has 10093 states and 31091 transitions. [2025-04-13 18:02:39,533 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 18:02:39,533 INFO L278 IsEmpty]: Start isEmpty. Operand 10093 states and 31091 transitions. [2025-04-13 18:02:39,546 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-04-13 18:02:39,546 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:02:39,546 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 18:02:39,546 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-04-13 18:02:39,546 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 18:02:39,546 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:02:39,546 INFO L85 PathProgramCache]: Analyzing trace with hash -367239538, now seen corresponding path program 1 times [2025-04-13 18:02:39,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:02:39,547 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151550045] [2025-04-13 18:02:39,547 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:02:39,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:02:39,550 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-04-13 18:02:39,554 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-04-13 18:02:39,554 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:02:39,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:02:39,636 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 18:02:39,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:02:39,637 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151550045] [2025-04-13 18:02:39,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151550045] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:02:39,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:02:39,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-13 18:02:39,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087451394] [2025-04-13 18:02:39,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:02:39,638 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 18:02:39,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:02:39,638 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 18:02:39,638 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-04-13 18:02:39,638 INFO L87 Difference]: Start difference. First operand 10093 states and 31091 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 18:02:40,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:02:40,125 INFO L93 Difference]: Finished difference Result 13620 states and 41155 transitions. [2025-04-13 18:02:40,125 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-13 18:02:40,125 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 18:02:40,125 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:02:40,182 INFO L225 Difference]: With dead ends: 13620 [2025-04-13 18:02:40,182 INFO L226 Difference]: Without dead ends: 10753 [2025-04-13 18:02:40,191 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=219, Unknown=0, NotChecked=0, Total=306 [2025-04-13 18:02:40,192 INFO L437 NwaCegarLoop]: 90 mSDtfsCounter, 237 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 811 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 833 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 811 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:02:40,193 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 426 Invalid, 833 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 811 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:02:40,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10753 states. [2025-04-13 18:02:40,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10753 to 9349. [2025-04-13 18:02:40,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9349 states, 9348 states have (on average 3.0660034231921265) internal successors, (28661), 9348 states have internal predecessors, (28661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:02:40,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9349 states to 9349 states and 28661 transitions. [2025-04-13 18:02:40,377 INFO L79 Accepts]: Start accepts. Automaton has 9349 states and 28661 transitions. Word has length 68 [2025-04-13 18:02:40,377 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:02:40,377 INFO L485 AbstractCegarLoop]: Abstraction has 9349 states and 28661 transitions. [2025-04-13 18:02:40,377 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 18:02:40,377 INFO L278 IsEmpty]: Start isEmpty. Operand 9349 states and 28661 transitions. [2025-04-13 18:02:40,389 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-04-13 18:02:40,389 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:02:40,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] [2025-04-13 18:02:40,389 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-04-13 18:02:40,390 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 18:02:40,390 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:02:40,390 INFO L85 PathProgramCache]: Analyzing trace with hash 1230692330, now seen corresponding path program 2 times [2025-04-13 18:02:40,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:02:40,390 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534839976] [2025-04-13 18:02:40,390 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:02:40,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:02:40,394 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 68 statements into 1 equivalence classes. [2025-04-13 18:02:40,397 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-04-13 18:02:40,397 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:02:40,397 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:02:40,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 18:02:40,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:02:40,479 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534839976] [2025-04-13 18:02:40,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534839976] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:02:40,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:02:40,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-13 18:02:40,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179010797] [2025-04-13 18:02:40,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:02:40,479 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 18:02:40,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:02:40,479 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 18:02:40,479 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-04-13 18:02:40,480 INFO L87 Difference]: Start difference. First operand 9349 states and 28661 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 18:02:40,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:02:40,865 INFO L93 Difference]: Finished difference Result 10973 states and 33131 transitions. [2025-04-13 18:02:40,865 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-13 18:02:40,866 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 18:02:40,866 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:02:40,924 INFO L225 Difference]: With dead ends: 10973 [2025-04-13 18:02:40,925 INFO L226 Difference]: Without dead ends: 10607 [2025-04-13 18:02:40,929 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=219, Unknown=0, NotChecked=0, Total=306 [2025-04-13 18:02:40,929 INFO L437 NwaCegarLoop]: 86 mSDtfsCounter, 246 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 613 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 630 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 613 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:02:40,929 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 332 Invalid, 630 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 613 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:02:40,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10607 states. [2025-04-13 18:02:41,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10607 to 9151. [2025-04-13 18:02:41,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9151 states, 9150 states have (on average 3.0756284153005464) internal successors, (28142), 9150 states have internal predecessors, (28142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:02:41,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9151 states to 9151 states and 28142 transitions. [2025-04-13 18:02:41,139 INFO L79 Accepts]: Start accepts. Automaton has 9151 states and 28142 transitions. Word has length 68 [2025-04-13 18:02:41,139 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:02:41,139 INFO L485 AbstractCegarLoop]: Abstraction has 9151 states and 28142 transitions. [2025-04-13 18:02:41,139 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 18:02:41,139 INFO L278 IsEmpty]: Start isEmpty. Operand 9151 states and 28142 transitions. [2025-04-13 18:02:41,151 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-04-13 18:02:41,151 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:02:41,151 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 18:02:41,151 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-04-13 18:02:41,151 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 18:02:41,152 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:02:41,152 INFO L85 PathProgramCache]: Analyzing trace with hash 1637365934, now seen corresponding path program 2 times [2025-04-13 18:02:41,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:02:41,152 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303387440] [2025-04-13 18:02:41,152 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:02:41,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:02:41,156 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 68 statements into 1 equivalence classes. [2025-04-13 18:02:41,159 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-04-13 18:02:41,159 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:02:41,159 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:02:41,239 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 18:02:41,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:02:41,239 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303387440] [2025-04-13 18:02:41,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303387440] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:02:41,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:02:41,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-13 18:02:41,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740255501] [2025-04-13 18:02:41,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:02:41,240 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 18:02:41,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:02:41,240 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 18:02:41,240 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-04-13 18:02:41,240 INFO L87 Difference]: Start difference. First operand 9151 states and 28142 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 18:02:41,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:02:41,577 INFO L93 Difference]: Finished difference Result 10882 states and 32823 transitions. [2025-04-13 18:02:41,577 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 18:02:41,578 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 18:02:41,578 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:02:41,632 INFO L225 Difference]: With dead ends: 10882 [2025-04-13 18:02:41,632 INFO L226 Difference]: Without dead ends: 10442 [2025-04-13 18:02:41,635 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2025-04-13 18:02:41,636 INFO L437 NwaCegarLoop]: 88 mSDtfsCounter, 254 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 602 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 627 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 602 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:02:41,636 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 335 Invalid, 627 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 602 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:02:41,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10442 states. [2025-04-13 18:02:41,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10442 to 9038. [2025-04-13 18:02:41,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9038 states, 9037 states have (on average 3.08088967577736) internal successors, (27842), 9037 states have internal predecessors, (27842), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:02:41,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9038 states to 9038 states and 27842 transitions. [2025-04-13 18:02:41,815 INFO L79 Accepts]: Start accepts. Automaton has 9038 states and 27842 transitions. Word has length 68 [2025-04-13 18:02:41,815 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:02:41,816 INFO L485 AbstractCegarLoop]: Abstraction has 9038 states and 27842 transitions. [2025-04-13 18:02:41,816 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 18:02:41,816 INFO L278 IsEmpty]: Start isEmpty. Operand 9038 states and 27842 transitions. [2025-04-13 18:02:41,827 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-04-13 18:02:41,827 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:02:41,827 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 18:02:41,827 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-04-13 18:02:41,827 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 18:02:41,828 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:02:41,828 INFO L85 PathProgramCache]: Analyzing trace with hash 350909600, now seen corresponding path program 3 times [2025-04-13 18:02:41,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:02:41,828 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069994713] [2025-04-13 18:02:41,828 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:02:41,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:02:41,832 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 68 statements into 1 equivalence classes. [2025-04-13 18:02:41,834 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-04-13 18:02:41,835 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 18:02:41,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:02:41,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 18:02:41,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:02:41,894 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069994713] [2025-04-13 18:02:41,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069994713] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:02:41,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:02:41,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 18:02:41,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924967928] [2025-04-13 18:02:41,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:02:41,894 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 18:02:41,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:02:41,895 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 18:02:41,895 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2025-04-13 18:02:41,895 INFO L87 Difference]: Start difference. First operand 9038 states and 27842 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 18:02:42,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:02:42,067 INFO L93 Difference]: Finished difference Result 10774 states and 32644 transitions. [2025-04-13 18:02:42,067 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 18:02:42,067 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 18:02:42,067 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:02:42,116 INFO L225 Difference]: With dead ends: 10774 [2025-04-13 18:02:42,116 INFO L226 Difference]: Without dead ends: 9864 [2025-04-13 18:02:42,120 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 18:02:42,120 INFO L437 NwaCegarLoop]: 76 mSDtfsCounter, 157 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 274 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:02:42,121 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 211 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 274 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:02:42,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9864 states. [2025-04-13 18:02:42,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9864 to 8942. [2025-04-13 18:02:42,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8942 states, 8941 states have (on average 3.077955485963539) internal successors, (27520), 8941 states have internal predecessors, (27520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:02:42,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8942 states to 8942 states and 27520 transitions. [2025-04-13 18:02:42,293 INFO L79 Accepts]: Start accepts. Automaton has 8942 states and 27520 transitions. Word has length 68 [2025-04-13 18:02:42,293 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:02:42,293 INFO L485 AbstractCegarLoop]: Abstraction has 8942 states and 27520 transitions. [2025-04-13 18:02:42,293 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 18:02:42,293 INFO L278 IsEmpty]: Start isEmpty. Operand 8942 states and 27520 transitions. [2025-04-13 18:02:42,306 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-04-13 18:02:42,306 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:02:42,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] [2025-04-13 18:02:42,306 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-04-13 18:02:42,306 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 18:02:42,306 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:02:42,306 INFO L85 PathProgramCache]: Analyzing trace with hash -1330844498, now seen corresponding path program 3 times [2025-04-13 18:02:42,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:02:42,307 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213560308] [2025-04-13 18:02:42,307 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:02:42,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:02:42,310 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 68 statements into 1 equivalence classes. [2025-04-13 18:02:42,314 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-04-13 18:02:42,314 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 18:02:42,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:02:42,378 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 18:02:42,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:02:42,378 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213560308] [2025-04-13 18:02:42,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213560308] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:02:42,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:02:42,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 18:02:42,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275263927] [2025-04-13 18:02:42,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:02:42,379 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 18:02:42,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:02:42,379 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 18:02:42,379 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2025-04-13 18:02:42,379 INFO L87 Difference]: Start difference. First operand 8942 states and 27520 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 18:02:42,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:02:42,624 INFO L93 Difference]: Finished difference Result 11273 states and 34131 transitions. [2025-04-13 18:02:42,624 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 18:02:42,624 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 18:02:42,625 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:02:42,670 INFO L225 Difference]: With dead ends: 11273 [2025-04-13 18:02:42,670 INFO L226 Difference]: Without dead ends: 9905 [2025-04-13 18:02:42,675 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 18:02:42,676 INFO L437 NwaCegarLoop]: 85 mSDtfsCounter, 161 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 380 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 384 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 380 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:02:42,676 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 278 Invalid, 384 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 380 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:02:42,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9905 states. [2025-04-13 18:02:42,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9905 to 8795. [2025-04-13 18:02:42,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8795 states, 8794 states have (on average 3.070388901523766) internal successors, (27001), 8794 states have internal predecessors, (27001), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:02:42,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8795 states to 8795 states and 27001 transitions. [2025-04-13 18:02:42,847 INFO L79 Accepts]: Start accepts. Automaton has 8795 states and 27001 transitions. Word has length 68 [2025-04-13 18:02:42,847 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:02:42,847 INFO L485 AbstractCegarLoop]: Abstraction has 8795 states and 27001 transitions. [2025-04-13 18:02:42,847 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 18:02:42,847 INFO L278 IsEmpty]: Start isEmpty. Operand 8795 states and 27001 transitions. [2025-04-13 18:02:42,859 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-04-13 18:02:42,859 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:02:42,859 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 18:02:42,860 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-04-13 18:02:42,860 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 18:02:42,860 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:02:42,860 INFO L85 PathProgramCache]: Analyzing trace with hash -1188959405, now seen corresponding path program 2 times [2025-04-13 18:02:42,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:02:42,860 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179332146] [2025-04-13 18:02:42,860 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:02:42,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:02:42,864 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 68 statements into 1 equivalence classes. [2025-04-13 18:02:42,867 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-04-13 18:02:42,867 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:02:42,867 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:02:42,920 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 18:02:42,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:02:42,921 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179332146] [2025-04-13 18:02:42,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179332146] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:02:42,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:02:42,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 18:02:42,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809066116] [2025-04-13 18:02:42,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:02:42,921 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 18:02:42,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:02:42,921 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 18:02:42,921 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-04-13 18:02:42,922 INFO L87 Difference]: Start difference. First operand 8795 states and 27001 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 18:02:43,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:02:43,242 INFO L93 Difference]: Finished difference Result 14683 states and 43941 transitions. [2025-04-13 18:02:43,242 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 18:02:43,242 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 18:02:43,242 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:02:43,307 INFO L225 Difference]: With dead ends: 14683 [2025-04-13 18:02:43,307 INFO L226 Difference]: Without dead ends: 13005 [2025-04-13 18:02:43,314 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 18:02:43,315 INFO L437 NwaCegarLoop]: 109 mSDtfsCounter, 289 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 569 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 595 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 569 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:02:43,315 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [289 Valid, 344 Invalid, 595 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 569 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:02:43,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13005 states. [2025-04-13 18:02:43,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13005 to 8812. [2025-04-13 18:02:43,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8812 states, 8811 states have (on average 3.0577686982181365) internal successors, (26942), 8811 states have internal predecessors, (26942), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:02:43,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8812 states to 8812 states and 26942 transitions. [2025-04-13 18:02:43,513 INFO L79 Accepts]: Start accepts. Automaton has 8812 states and 26942 transitions. Word has length 68 [2025-04-13 18:02:43,513 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:02:43,513 INFO L485 AbstractCegarLoop]: Abstraction has 8812 states and 26942 transitions. [2025-04-13 18:02:43,513 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 18:02:43,513 INFO L278 IsEmpty]: Start isEmpty. Operand 8812 states and 26942 transitions. [2025-04-13 18:02:43,525 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-04-13 18:02:43,525 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:02:43,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] [2025-04-13 18:02:43,526 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-04-13 18:02:43,526 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 18:02:43,526 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:02:43,527 INFO L85 PathProgramCache]: Analyzing trace with hash -183688959, now seen corresponding path program 2 times [2025-04-13 18:02:43,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:02:43,528 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443136287] [2025-04-13 18:02:43,528 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:02:43,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:02:43,533 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 68 statements into 1 equivalence classes. [2025-04-13 18:02:43,540 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-04-13 18:02:43,540 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:02:43,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:02:43,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 18:02:43,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:02:43,602 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443136287] [2025-04-13 18:02:43,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443136287] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:02:43,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:02:43,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 18:02:43,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908943736] [2025-04-13 18:02:43,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:02:43,603 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 18:02:43,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:02:43,603 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 18:02:43,603 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-04-13 18:02:43,603 INFO L87 Difference]: Start difference. First operand 8812 states and 26942 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 18:02:43,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:02:43,914 INFO L93 Difference]: Finished difference Result 11091 states and 33230 transitions. [2025-04-13 18:02:43,914 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 18:02:43,914 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 18:02:43,914 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:02:43,969 INFO L225 Difference]: With dead ends: 11091 [2025-04-13 18:02:43,969 INFO L226 Difference]: Without dead ends: 10357 [2025-04-13 18:02:43,974 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 18:02:43,974 INFO L437 NwaCegarLoop]: 90 mSDtfsCounter, 227 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 628 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 227 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 647 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 628 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:02:43,975 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [227 Valid, 348 Invalid, 647 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 628 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:02:43,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10357 states. [2025-04-13 18:02:44,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10357 to 8892. [2025-04-13 18:02:44,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8892 states, 8891 states have (on average 3.0496007198290407) internal successors, (27114), 8891 states have internal predecessors, (27114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:02:44,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8892 states to 8892 states and 27114 transitions. [2025-04-13 18:02:44,191 INFO L79 Accepts]: Start accepts. Automaton has 8892 states and 27114 transitions. Word has length 68 [2025-04-13 18:02:44,192 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:02:44,192 INFO L485 AbstractCegarLoop]: Abstraction has 8892 states and 27114 transitions. [2025-04-13 18:02:44,192 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 18:02:44,192 INFO L278 IsEmpty]: Start isEmpty. Operand 8892 states and 27114 transitions. [2025-04-13 18:02:44,203 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-04-13 18:02:44,203 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:02:44,203 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 18:02:44,203 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-04-13 18:02:44,204 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 18:02:44,204 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:02:44,204 INFO L85 PathProgramCache]: Analyzing trace with hash -1671705320, now seen corresponding path program 2 times [2025-04-13 18:02:44,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:02:44,204 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132010035] [2025-04-13 18:02:44,204 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:02:44,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:02:44,208 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 68 statements into 1 equivalence classes. [2025-04-13 18:02:44,210 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-04-13 18:02:44,210 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:02:44,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:02:44,271 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 18:02:44,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:02:44,271 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132010035] [2025-04-13 18:02:44,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132010035] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:02:44,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:02:44,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 18:02:44,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919571366] [2025-04-13 18:02:44,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:02:44,272 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 18:02:44,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:02:44,272 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 18:02:44,273 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2025-04-13 18:02:44,273 INFO L87 Difference]: Start difference. First operand 8892 states and 27114 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 18:02:44,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:02:44,437 INFO L93 Difference]: Finished difference Result 11410 states and 34193 transitions. [2025-04-13 18:02:44,437 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 18:02:44,437 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 18:02:44,437 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:02:44,491 INFO L225 Difference]: With dead ends: 11410 [2025-04-13 18:02:44,491 INFO L226 Difference]: Without dead ends: 10022 [2025-04-13 18:02:44,497 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 18:02:44,497 INFO L437 NwaCegarLoop]: 76 mSDtfsCounter, 176 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:02:44,498 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 204 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:02:44,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10022 states. [2025-04-13 18:02:44,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10022 to 8918. [2025-04-13 18:02:44,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8918 states, 8917 states have (on average 3.0316249859818325) internal successors, (27033), 8917 states have internal predecessors, (27033), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:02:44,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8918 states to 8918 states and 27033 transitions. [2025-04-13 18:02:44,683 INFO L79 Accepts]: Start accepts. Automaton has 8918 states and 27033 transitions. Word has length 68 [2025-04-13 18:02:44,683 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:02:44,683 INFO L485 AbstractCegarLoop]: Abstraction has 8918 states and 27033 transitions. [2025-04-13 18:02:44,683 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 18:02:44,683 INFO L278 IsEmpty]: Start isEmpty. Operand 8918 states and 27033 transitions. [2025-04-13 18:02:44,694 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-04-13 18:02:44,695 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:02:44,695 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 18:02:44,695 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-04-13 18:02:44,695 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 18:02:44,695 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:02:44,695 INFO L85 PathProgramCache]: Analyzing trace with hash 1993226093, now seen corresponding path program 2 times [2025-04-13 18:02:44,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:02:44,695 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730554234] [2025-04-13 18:02:44,695 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:02:44,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:02:44,699 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 68 statements into 1 equivalence classes. [2025-04-13 18:02:44,701 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-04-13 18:02:44,702 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:02:44,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:02:44,754 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 18:02:44,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:02:44,754 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730554234] [2025-04-13 18:02:44,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730554234] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:02:44,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:02:44,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 18:02:44,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066910096] [2025-04-13 18:02:44,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:02:44,755 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 18:02:44,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:02:44,755 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 18:02:44,755 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-04-13 18:02:44,755 INFO L87 Difference]: Start difference. First operand 8918 states and 27033 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 18:02:45,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:02:45,063 INFO L93 Difference]: Finished difference Result 10932 states and 32450 transitions. [2025-04-13 18:02:45,063 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 18:02:45,063 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 18:02:45,063 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:02:45,127 INFO L225 Difference]: With dead ends: 10932 [2025-04-13 18:02:45,127 INFO L226 Difference]: Without dead ends: 10570 [2025-04-13 18:02:45,132 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2025-04-13 18:02:45,132 INFO L437 NwaCegarLoop]: 93 mSDtfsCounter, 215 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 652 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 668 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 652 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:02:45,132 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 370 Invalid, 668 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 652 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:02:45,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10570 states. [2025-04-13 18:02:45,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10570 to 8950. [2025-04-13 18:02:45,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8950 states, 8949 states have (on average 3.0306179461392335) internal successors, (27121), 8949 states have internal predecessors, (27121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:02:45,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8950 states to 8950 states and 27121 transitions. [2025-04-13 18:02:45,338 INFO L79 Accepts]: Start accepts. Automaton has 8950 states and 27121 transitions. Word has length 68 [2025-04-13 18:02:45,339 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:02:45,339 INFO L485 AbstractCegarLoop]: Abstraction has 8950 states and 27121 transitions. [2025-04-13 18:02:45,339 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 18:02:45,339 INFO L278 IsEmpty]: Start isEmpty. Operand 8950 states and 27121 transitions. [2025-04-13 18:02:45,350 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-04-13 18:02:45,350 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:02:45,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] [2025-04-13 18:02:45,351 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-04-13 18:02:45,351 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 18:02:45,351 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:02:45,351 INFO L85 PathProgramCache]: Analyzing trace with hash -1022602066, now seen corresponding path program 4 times [2025-04-13 18:02:45,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:02:45,351 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655245061] [2025-04-13 18:02:45,351 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:02:45,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:02:45,359 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 68 statements into 2 equivalence classes. [2025-04-13 18:02:45,364 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 18:02:45,364 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:02:45,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:02:45,390 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 18:02:45,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:02:45,390 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655245061] [2025-04-13 18:02:45,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655245061] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:02:45,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:02:45,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 18:02:45,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835662357] [2025-04-13 18:02:45,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:02:45,391 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 18:02:45,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:02:45,391 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 18:02:45,392 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 18:02:45,392 INFO L87 Difference]: Start difference. First operand 8950 states and 27121 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 18:02:45,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:02:45,497 INFO L93 Difference]: Finished difference Result 10196 states and 30550 transitions. [2025-04-13 18:02:45,497 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 18:02:45,497 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 18:02:45,497 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:02:45,550 INFO L225 Difference]: With dead ends: 10196 [2025-04-13 18:02:45,550 INFO L226 Difference]: Without dead ends: 9224 [2025-04-13 18:02:45,554 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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 18:02:45,554 INFO L437 NwaCegarLoop]: 39 mSDtfsCounter, 129 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:02:45,554 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 95 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:02:45,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9224 states. [2025-04-13 18:02:45,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9224 to 8479. [2025-04-13 18:02:45,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8479 states, 8478 states have (on average 3.028072658645907) internal successors, (25672), 8478 states have internal predecessors, (25672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:02:45,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8479 states to 8479 states and 25672 transitions. [2025-04-13 18:02:45,728 INFO L79 Accepts]: Start accepts. Automaton has 8479 states and 25672 transitions. Word has length 68 [2025-04-13 18:02:45,728 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:02:45,728 INFO L485 AbstractCegarLoop]: Abstraction has 8479 states and 25672 transitions. [2025-04-13 18:02:45,728 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 18:02:45,728 INFO L278 IsEmpty]: Start isEmpty. Operand 8479 states and 25672 transitions. [2025-04-13 18:02:45,740 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-04-13 18:02:45,740 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:02:45,740 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 18:02:45,740 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-04-13 18:02:45,741 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 18:02:45,741 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:02:45,741 INFO L85 PathProgramCache]: Analyzing trace with hash -1406371559, now seen corresponding path program 3 times [2025-04-13 18:02:45,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:02:45,741 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286584188] [2025-04-13 18:02:45,741 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:02:45,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:02:45,746 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 68 statements into 1 equivalence classes. [2025-04-13 18:02:45,750 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-04-13 18:02:45,750 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 18:02:45,750 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:02:45,855 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 18:02:45,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:02:45,856 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286584188] [2025-04-13 18:02:45,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286584188] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:02:45,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:02:45,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-13 18:02:45,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544687158] [2025-04-13 18:02:45,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:02:45,856 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 18:02:45,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:02:45,857 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 18:02:45,857 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-04-13 18:02:45,857 INFO L87 Difference]: Start difference. First operand 8479 states and 25672 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 18:02:46,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:02:46,161 INFO L93 Difference]: Finished difference Result 9199 states and 27557 transitions. [2025-04-13 18:02:46,161 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-13 18:02:46,161 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 18:02:46,161 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:02:46,213 INFO L225 Difference]: With dead ends: 9199 [2025-04-13 18:02:46,213 INFO L226 Difference]: Without dead ends: 8985 [2025-04-13 18:02:46,216 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 18:02:46,217 INFO L437 NwaCegarLoop]: 78 mSDtfsCounter, 138 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 691 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 702 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 691 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:02:46,217 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 405 Invalid, 702 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 691 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:02:46,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8985 states. [2025-04-13 18:02:46,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8985 to 8483. [2025-04-13 18:02:46,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8483 states, 8482 states have (on average 3.027587833058241) internal successors, (25680), 8482 states have internal predecessors, (25680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:02:46,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8483 states to 8483 states and 25680 transitions. [2025-04-13 18:02:46,402 INFO L79 Accepts]: Start accepts. Automaton has 8483 states and 25680 transitions. Word has length 68 [2025-04-13 18:02:46,403 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:02:46,403 INFO L485 AbstractCegarLoop]: Abstraction has 8483 states and 25680 transitions. [2025-04-13 18:02:46,403 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 18:02:46,403 INFO L278 IsEmpty]: Start isEmpty. Operand 8483 states and 25680 transitions. [2025-04-13 18:02:46,414 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-04-13 18:02:46,414 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:02:46,414 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 18:02:46,414 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-04-13 18:02:46,414 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 18:02:46,414 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:02:46,414 INFO L85 PathProgramCache]: Analyzing trace with hash -1815604098, now seen corresponding path program 3 times [2025-04-13 18:02:46,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:02:46,415 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302856269] [2025-04-13 18:02:46,415 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:02:46,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:02:46,418 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 68 statements into 1 equivalence classes. [2025-04-13 18:02:46,420 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-04-13 18:02:46,420 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 18:02:46,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:02:46,450 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 18:02:46,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:02:46,450 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302856269] [2025-04-13 18:02:46,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302856269] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:02:46,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:02:46,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 18:02:46,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292845960] [2025-04-13 18:02:46,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:02:46,451 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 18:02:46,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:02:46,451 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 18:02:46,451 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-13 18:02:46,451 INFO L87 Difference]: Start difference. First operand 8483 states and 25680 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 18:02:46,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:02:46,567 INFO L93 Difference]: Finished difference Result 9406 states and 28233 transitions. [2025-04-13 18:02:46,567 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 18:02:46,568 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 18:02:46,568 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:02:46,618 INFO L225 Difference]: With dead ends: 9406 [2025-04-13 18:02:46,618 INFO L226 Difference]: Without dead ends: 8821 [2025-04-13 18:02:46,622 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 18:02:46,622 INFO L437 NwaCegarLoop]: 36 mSDtfsCounter, 82 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:02:46,622 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 84 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:02:46,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8821 states. [2025-04-13 18:02:46,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8821 to 8319. [2025-04-13 18:02:46,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8319 states, 8318 states have (on average 3.0244049050252464) internal successors, (25157), 8318 states have internal predecessors, (25157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:02:46,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8319 states to 8319 states and 25157 transitions. [2025-04-13 18:02:46,765 INFO L79 Accepts]: Start accepts. Automaton has 8319 states and 25157 transitions. Word has length 68 [2025-04-13 18:02:46,765 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:02:46,766 INFO L485 AbstractCegarLoop]: Abstraction has 8319 states and 25157 transitions. [2025-04-13 18:02:46,766 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 18:02:46,766 INFO L278 IsEmpty]: Start isEmpty. Operand 8319 states and 25157 transitions. [2025-04-13 18:02:46,776 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-04-13 18:02:46,776 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:02:46,776 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 18:02:46,776 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-04-13 18:02:46,776 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 18:02:46,776 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:02:46,777 INFO L85 PathProgramCache]: Analyzing trace with hash 843035643, now seen corresponding path program 4 times [2025-04-13 18:02:46,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:02:46,777 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513749745] [2025-04-13 18:02:46,777 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:02:46,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:02:46,781 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 68 statements into 2 equivalence classes. [2025-04-13 18:02:46,786 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 18:02:46,786 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:02:46,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:02:46,879 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 18:02:46,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:02:46,879 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513749745] [2025-04-13 18:02:46,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513749745] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:02:46,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:02:46,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 18:02:46,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501439009] [2025-04-13 18:02:46,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:02:46,880 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 18:02:46,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:02:46,880 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 18:02:46,880 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-04-13 18:02:46,880 INFO L87 Difference]: Start difference. First operand 8319 states and 25157 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 18:02:47,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:02:47,148 INFO L93 Difference]: Finished difference Result 8705 states and 26164 transitions. [2025-04-13 18:02:47,148 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 18:02:47,148 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 18:02:47,148 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:02:47,203 INFO L225 Difference]: With dead ends: 8705 [2025-04-13 18:02:47,203 INFO L226 Difference]: Without dead ends: 8535 [2025-04-13 18:02:47,206 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2025-04-13 18:02:47,207 INFO L437 NwaCegarLoop]: 76 mSDtfsCounter, 132 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 679 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 685 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 679 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:02:47,207 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 412 Invalid, 685 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 679 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:02:47,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8535 states. [2025-04-13 18:02:47,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8535 to 8315. [2025-04-13 18:02:47,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8315 states, 8314 states have (on average 3.0244166466201587) internal successors, (25145), 8314 states have internal predecessors, (25145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:02:47,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8315 states to 8315 states and 25145 transitions. [2025-04-13 18:02:47,404 INFO L79 Accepts]: Start accepts. Automaton has 8315 states and 25145 transitions. Word has length 68 [2025-04-13 18:02:47,405 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:02:47,405 INFO L485 AbstractCegarLoop]: Abstraction has 8315 states and 25145 transitions. [2025-04-13 18:02:47,405 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 18:02:47,405 INFO L278 IsEmpty]: Start isEmpty. Operand 8315 states and 25145 transitions. [2025-04-13 18:02:47,416 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-04-13 18:02:47,416 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:02:47,416 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:02:47,416 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-04-13 18:02:47,416 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 18:02:47,417 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:02:47,417 INFO L85 PathProgramCache]: Analyzing trace with hash -1059802654, now seen corresponding path program 4 times [2025-04-13 18:02:47,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:02:47,417 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329958899] [2025-04-13 18:02:47,417 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:02:47,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:02:47,421 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 68 statements into 2 equivalence classes. [2025-04-13 18:02:47,423 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 18:02:47,424 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:02:47,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:02:47,449 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 18:02:47,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:02:47,450 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329958899] [2025-04-13 18:02:47,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329958899] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:02:47,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:02:47,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 18:02:47,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195105175] [2025-04-13 18:02:47,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:02:47,450 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 18:02:47,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:02:47,450 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 18:02:47,450 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 18:02:47,450 INFO L87 Difference]: Start difference. First operand 8315 states and 25145 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 18:02:47,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:02:47,556 INFO L93 Difference]: Finished difference Result 9445 states and 28199 transitions. [2025-04-13 18:02:47,556 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 18:02:47,556 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 18:02:47,557 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:02:47,606 INFO L225 Difference]: With dead ends: 9445 [2025-04-13 18:02:47,607 INFO L226 Difference]: Without dead ends: 8831 [2025-04-13 18:02:47,610 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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 18:02:47,611 INFO L437 NwaCegarLoop]: 39 mSDtfsCounter, 126 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:02:47,611 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 103 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:02:47,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8831 states. [2025-04-13 18:02:47,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8831 to 8163. [2025-04-13 18:02:47,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8163 states, 8162 states have (on average 3.0224209752511637) internal successors, (24669), 8162 states have internal predecessors, (24669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:02:47,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8163 states to 8163 states and 24669 transitions. [2025-04-13 18:02:47,780 INFO L79 Accepts]: Start accepts. Automaton has 8163 states and 24669 transitions. Word has length 68 [2025-04-13 18:02:47,780 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:02:47,780 INFO L485 AbstractCegarLoop]: Abstraction has 8163 states and 24669 transitions. [2025-04-13 18:02:47,780 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 18:02:47,780 INFO L278 IsEmpty]: Start isEmpty. Operand 8163 states and 24669 transitions. [2025-04-13 18:02:47,791 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-04-13 18:02:47,791 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:02:47,791 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 18:02:47,791 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-04-13 18:02:47,791 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 18:02:47,792 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:02:47,792 INFO L85 PathProgramCache]: Analyzing trace with hash -69174837, now seen corresponding path program 3 times [2025-04-13 18:02:47,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:02:47,792 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100656737] [2025-04-13 18:02:47,792 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:02:47,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:02:47,797 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 68 statements into 1 equivalence classes. [2025-04-13 18:02:47,800 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-04-13 18:02:47,800 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 18:02:47,800 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:02:47,880 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 18:02:47,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:02:47,880 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100656737] [2025-04-13 18:02:47,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100656737] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:02:47,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:02:47,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-13 18:02:47,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051351776] [2025-04-13 18:02:47,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:02:47,880 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 18:02:47,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:02:47,881 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 18:02:47,881 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-04-13 18:02:47,881 INFO L87 Difference]: Start difference. First operand 8163 states and 24669 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 18:02:48,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:02:48,145 INFO L93 Difference]: Finished difference Result 8773 states and 26312 transitions. [2025-04-13 18:02:48,145 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 18:02:48,145 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 18:02:48,145 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:02:48,195 INFO L225 Difference]: With dead ends: 8773 [2025-04-13 18:02:48,195 INFO L226 Difference]: Without dead ends: 8621 [2025-04-13 18:02:48,197 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 18:02:48,198 INFO L437 NwaCegarLoop]: 79 mSDtfsCounter, 146 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 507 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 516 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 507 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:02:48,198 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 297 Invalid, 516 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 507 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:02:48,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8621 states. [2025-04-13 18:02:48,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8621 to 8175. [2025-04-13 18:02:48,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8175 states, 8174 states have (on average 3.0223880597014925) internal successors, (24705), 8174 states have internal predecessors, (24705), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:02:48,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8175 states to 8175 states and 24705 transitions. [2025-04-13 18:02:48,338 INFO L79 Accepts]: Start accepts. Automaton has 8175 states and 24705 transitions. Word has length 68 [2025-04-13 18:02:48,339 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:02:48,339 INFO L485 AbstractCegarLoop]: Abstraction has 8175 states and 24705 transitions. [2025-04-13 18:02:48,339 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 18:02:48,339 INFO L278 IsEmpty]: Start isEmpty. Operand 8175 states and 24705 transitions. [2025-04-13 18:02:48,350 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-04-13 18:02:48,350 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:02:48,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] [2025-04-13 18:02:48,350 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-04-13 18:02:48,350 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 18:02:48,350 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:02:48,350 INFO L85 PathProgramCache]: Analyzing trace with hash 770519099, now seen corresponding path program 3 times [2025-04-13 18:02:48,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:02:48,350 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025945673] [2025-04-13 18:02:48,351 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:02:48,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:02:48,354 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 68 statements into 1 equivalence classes. [2025-04-13 18:02:48,357 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-04-13 18:02:48,357 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 18:02:48,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:02:48,434 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 18:02:48,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:02:48,435 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025945673] [2025-04-13 18:02:48,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025945673] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:02:48,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:02:48,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-13 18:02:48,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022994408] [2025-04-13 18:02:48,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:02:48,435 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 18:02:48,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:02:48,435 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 18:02:48,435 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-04-13 18:02:48,435 INFO L87 Difference]: Start difference. First operand 8175 states and 24705 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 18:02:48,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:02:48,703 INFO L93 Difference]: Finished difference Result 8575 states and 25774 transitions. [2025-04-13 18:02:48,704 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 18:02:48,704 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 18:02:48,704 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:02:48,752 INFO L225 Difference]: With dead ends: 8575 [2025-04-13 18:02:48,752 INFO L226 Difference]: Without dead ends: 8423 [2025-04-13 18:02:48,755 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 18:02:48,755 INFO L437 NwaCegarLoop]: 73 mSDtfsCounter, 135 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 572 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 581 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 572 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:02:48,755 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 328 Invalid, 581 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 572 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:02:48,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8423 states. [2025-04-13 18:02:48,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8423 to 8187. [2025-04-13 18:02:48,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8187 states, 8186 states have (on average 3.0223552406547762) internal successors, (24741), 8186 states have internal predecessors, (24741), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:02:48,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8187 states to 8187 states and 24741 transitions. [2025-04-13 18:02:48,920 INFO L79 Accepts]: Start accepts. Automaton has 8187 states and 24741 transitions. Word has length 68 [2025-04-13 18:02:48,920 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:02:48,921 INFO L485 AbstractCegarLoop]: Abstraction has 8187 states and 24741 transitions. [2025-04-13 18:02:48,921 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 18:02:48,921 INFO L278 IsEmpty]: Start isEmpty. Operand 8187 states and 24741 transitions. [2025-04-13 18:02:48,931 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-04-13 18:02:48,932 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:02:48,932 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 18:02:48,932 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-04-13 18:02:48,932 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 18:02:48,932 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:02:48,932 INFO L85 PathProgramCache]: Analyzing trace with hash 2121244993, now seen corresponding path program 4 times [2025-04-13 18:02:48,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:02:48,932 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415058864] [2025-04-13 18:02:48,932 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:02:48,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:02:48,939 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 68 statements into 2 equivalence classes. [2025-04-13 18:02:48,944 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 18:02:48,944 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:02:48,944 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:02:49,065 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 18:02:49,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:02:49,065 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415058864] [2025-04-13 18:02:49,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415058864] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:02:49,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:02:49,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-13 18:02:49,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598090431] [2025-04-13 18:02:49,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:02:49,065 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 18:02:49,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:02:49,066 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 18:02:49,066 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-04-13 18:02:49,066 INFO L87 Difference]: Start difference. First operand 8187 states and 24741 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 18:02:49,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:02:49,290 INFO L93 Difference]: Finished difference Result 8785 states and 26332 transitions. [2025-04-13 18:02:49,290 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-13 18:02:49,291 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 18:02:49,291 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:02:49,335 INFO L225 Difference]: With dead ends: 8785 [2025-04-13 18:02:49,336 INFO L226 Difference]: Without dead ends: 8629 [2025-04-13 18:02:49,338 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 18:02:49,338 INFO L437 NwaCegarLoop]: 72 mSDtfsCounter, 132 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 469 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 482 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 469 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:02:49,339 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 269 Invalid, 482 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 469 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:02:49,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8629 states. [2025-04-13 18:02:49,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8629 to 8179. [2025-04-13 18:02:49,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8179 states, 8178 states have (on average 3.0218879921741255) internal successors, (24713), 8178 states have internal predecessors, (24713), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:02:49,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8179 states to 8179 states and 24713 transitions. [2025-04-13 18:02:49,481 INFO L79 Accepts]: Start accepts. Automaton has 8179 states and 24713 transitions. Word has length 68 [2025-04-13 18:02:49,481 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:02:49,481 INFO L485 AbstractCegarLoop]: Abstraction has 8179 states and 24713 transitions. [2025-04-13 18:02:49,481 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 18:02:49,481 INFO L278 IsEmpty]: Start isEmpty. Operand 8179 states and 24713 transitions. [2025-04-13 18:02:49,491 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-04-13 18:02:49,491 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:02:49,491 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 18:02:49,491 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-04-13 18:02:49,492 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 18:02:49,492 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:02:49,492 INFO L85 PathProgramCache]: Analyzing trace with hash -236491791, now seen corresponding path program 4 times [2025-04-13 18:02:49,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:02:49,492 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202060412] [2025-04-13 18:02:49,492 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:02:49,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:02:49,495 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 68 statements into 2 equivalence classes. [2025-04-13 18:02:49,500 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 18:02:49,500 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:02:49,500 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:02:49,588 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 18:02:49,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:02:49,588 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202060412] [2025-04-13 18:02:49,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202060412] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:02:49,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:02:49,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-13 18:02:49,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842949702] [2025-04-13 18:02:49,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:02:49,588 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 18:02:49,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:02:49,588 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 18:02:49,589 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-04-13 18:02:49,589 INFO L87 Difference]: Start difference. First operand 8179 states and 24713 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 18:02:49,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:02:49,821 INFO L93 Difference]: Finished difference Result 8567 states and 25730 transitions. [2025-04-13 18:02:49,822 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-13 18:02:49,822 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 18:02:49,822 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:02:49,869 INFO L225 Difference]: With dead ends: 8567 [2025-04-13 18:02:49,869 INFO L226 Difference]: Without dead ends: 8411 [2025-04-13 18:02:49,871 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2025-04-13 18:02:49,871 INFO L437 NwaCegarLoop]: 66 mSDtfsCounter, 111 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 501 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 510 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 501 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:02:49,871 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 290 Invalid, 510 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 501 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:02:49,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8411 states. [2025-04-13 18:02:49,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8411 to 8171. [2025-04-13 18:02:49,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8171 states, 8170 states have (on average 3.021419828641371) internal successors, (24685), 8170 states have internal predecessors, (24685), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:02:49,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8171 states to 8171 states and 24685 transitions. [2025-04-13 18:02:50,015 INFO L79 Accepts]: Start accepts. Automaton has 8171 states and 24685 transitions. Word has length 68 [2025-04-13 18:02:50,015 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:02:50,015 INFO L485 AbstractCegarLoop]: Abstraction has 8171 states and 24685 transitions. [2025-04-13 18:02:50,015 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 18:02:50,015 INFO L278 IsEmpty]: Start isEmpty. Operand 8171 states and 24685 transitions. [2025-04-13 18:02:50,026 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-04-13 18:02:50,026 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:02:50,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] [2025-04-13 18:02:50,026 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-04-13 18:02:50,027 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 18:02:50,027 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:02:50,027 INFO L85 PathProgramCache]: Analyzing trace with hash 564104969, now seen corresponding path program 5 times [2025-04-13 18:02:50,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:02:50,027 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035933311] [2025-04-13 18:02:50,027 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:02:50,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:02:50,031 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 68 statements into 1 equivalence classes. [2025-04-13 18:02:50,033 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-04-13 18:02:50,033 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:02:50,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:02:50,107 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 18:02:50,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:02:50,108 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035933311] [2025-04-13 18:02:50,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035933311] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:02:50,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:02:50,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-13 18:02:50,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880146953] [2025-04-13 18:02:50,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:02:50,108 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 18:02:50,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:02:50,108 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 18:02:50,108 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-04-13 18:02:50,108 INFO L87 Difference]: Start difference. First operand 8171 states and 24685 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 18:02:50,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:02:50,281 INFO L93 Difference]: Finished difference Result 8455 states and 25440 transitions. [2025-04-13 18:02:50,281 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 18:02:50,281 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 18:02:50,281 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:02:50,338 INFO L225 Difference]: With dead ends: 8455 [2025-04-13 18:02:50,338 INFO L226 Difference]: Without dead ends: 8287 [2025-04-13 18:02:50,341 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 18:02:50,341 INFO L437 NwaCegarLoop]: 54 mSDtfsCounter, 87 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 378 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:02:50,342 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 219 Invalid, 381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 378 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:02:50,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8287 states. [2025-04-13 18:02:50,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8287 to 8163. [2025-04-13 18:02:50,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8163 states, 8162 states have (on average 3.021440823327616) internal successors, (24661), 8162 states have internal predecessors, (24661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:02:50,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8163 states to 8163 states and 24661 transitions. [2025-04-13 18:02:50,503 INFO L79 Accepts]: Start accepts. Automaton has 8163 states and 24661 transitions. Word has length 68 [2025-04-13 18:02:50,503 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:02:50,503 INFO L485 AbstractCegarLoop]: Abstraction has 8163 states and 24661 transitions. [2025-04-13 18:02:50,503 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 18:02:50,503 INFO L278 IsEmpty]: Start isEmpty. Operand 8163 states and 24661 transitions. [2025-04-13 18:02:50,514 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-04-13 18:02:50,514 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:02:50,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 18:02:50,514 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-04-13 18:02:50,514 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 18:02:50,515 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:02:50,515 INFO L85 PathProgramCache]: Analyzing trace with hash 56707513, now seen corresponding path program 5 times [2025-04-13 18:02:50,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:02:50,515 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665539870] [2025-04-13 18:02:50,515 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:02:50,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:02:50,520 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 68 statements into 1 equivalence classes. [2025-04-13 18:02:50,523 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-04-13 18:02:50,523 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:02:50,523 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:02:50,604 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 18:02:50,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:02:50,604 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665539870] [2025-04-13 18:02:50,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665539870] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:02:50,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:02:50,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-13 18:02:50,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799034549] [2025-04-13 18:02:50,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:02:50,605 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 18:02:50,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:02:50,605 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 18:02:50,605 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-04-13 18:02:50,605 INFO L87 Difference]: Start difference. First operand 8163 states and 24661 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 18:02:50,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:02:50,846 INFO L93 Difference]: Finished difference Result 8447 states and 25416 transitions. [2025-04-13 18:02:50,846 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 18:02:50,847 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 18:02:50,847 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:02:50,935 INFO L225 Difference]: With dead ends: 8447 [2025-04-13 18:02:50,936 INFO L226 Difference]: Without dead ends: 8279 [2025-04-13 18:02:50,937 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 18:02:50,938 INFO L437 NwaCegarLoop]: 54 mSDtfsCounter, 82 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 453 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 456 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 453 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:02:50,938 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 257 Invalid, 456 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 453 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:02:50,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8279 states. [2025-04-13 18:02:51,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8279 to 8155. [2025-04-13 18:02:51,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8155 states, 8154 states have (on average 3.0214618592102034) internal successors, (24637), 8154 states have internal predecessors, (24637), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:02:51,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8155 states to 8155 states and 24637 transitions. [2025-04-13 18:02:51,092 INFO L79 Accepts]: Start accepts. Automaton has 8155 states and 24637 transitions. Word has length 68 [2025-04-13 18:02:51,093 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:02:51,093 INFO L485 AbstractCegarLoop]: Abstraction has 8155 states and 24637 transitions. [2025-04-13 18:02:51,093 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 18:02:51,093 INFO L278 IsEmpty]: Start isEmpty. Operand 8155 states and 24637 transitions. [2025-04-13 18:02:51,104 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-04-13 18:02:51,104 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:02:51,104 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 18:02:51,104 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2025-04-13 18:02:51,104 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 18:02:51,104 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:02:51,104 INFO L85 PathProgramCache]: Analyzing trace with hash 493524069, now seen corresponding path program 6 times [2025-04-13 18:02:51,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:02:51,104 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674523235] [2025-04-13 18:02:51,105 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:02:51,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:02:51,108 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 68 statements into 1 equivalence classes. [2025-04-13 18:02:51,110 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-04-13 18:02:51,110 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 18:02:51,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:02:51,139 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 18:02:51,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:02:51,140 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674523235] [2025-04-13 18:02:51,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1674523235] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:02:51,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:02:51,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 18:02:51,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893605218] [2025-04-13 18:02:51,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:02:51,140 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 18:02:51,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:02:51,140 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 18:02:51,140 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-13 18:02:51,141 INFO L87 Difference]: Start difference. First operand 8155 states and 24637 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 18:02:51,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:02:51,241 INFO L93 Difference]: Finished difference Result 9095 states and 27139 transitions. [2025-04-13 18:02:51,241 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 18:02:51,242 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 18:02:51,242 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:02:51,299 INFO L225 Difference]: With dead ends: 9095 [2025-04-13 18:02:51,300 INFO L226 Difference]: Without dead ends: 8639 [2025-04-13 18:02:51,302 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 18:02:51,302 INFO L437 NwaCegarLoop]: 36 mSDtfsCounter, 78 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:02:51,302 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 92 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:02:51,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8639 states. [2025-04-13 18:02:51,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8639 to 7979. [2025-04-13 18:02:51,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7979 states, 7978 states have (on average 3.0146653296565553) internal successors, (24051), 7978 states have internal predecessors, (24051), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:02:51,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7979 states to 7979 states and 24051 transitions. [2025-04-13 18:02:51,437 INFO L79 Accepts]: Start accepts. Automaton has 7979 states and 24051 transitions. Word has length 68 [2025-04-13 18:02:51,437 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:02:51,437 INFO L485 AbstractCegarLoop]: Abstraction has 7979 states and 24051 transitions. [2025-04-13 18:02:51,437 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 18:02:51,437 INFO L278 IsEmpty]: Start isEmpty. Operand 7979 states and 24051 transitions. [2025-04-13 18:02:51,449 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-04-13 18:02:51,449 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:02:51,449 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 18:02:51,449 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2025-04-13 18:02:51,449 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 18:02:51,449 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:02:51,449 INFO L85 PathProgramCache]: Analyzing trace with hash 1972075221, now seen corresponding path program 6 times [2025-04-13 18:02:51,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:02:51,450 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56783729] [2025-04-13 18:02:51,450 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:02:51,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:02:51,454 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 68 statements into 1 equivalence classes. [2025-04-13 18:02:51,456 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-04-13 18:02:51,456 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 18:02:51,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:02:51,484 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 18:02:51,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:02:51,486 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56783729] [2025-04-13 18:02:51,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56783729] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:02:51,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:02:51,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 18:02:51,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873161187] [2025-04-13 18:02:51,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:02:51,486 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 18:02:51,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:02:51,488 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 18:02:51,488 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-13 18:02:51,488 INFO L87 Difference]: Start difference. First operand 7979 states and 24051 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 18:02:51,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:02:51,575 INFO L93 Difference]: Finished difference Result 8787 states and 26227 transitions. [2025-04-13 18:02:51,575 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 18:02:51,575 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 18:02:51,575 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:02:51,623 INFO L225 Difference]: With dead ends: 8787 [2025-04-13 18:02:51,623 INFO L226 Difference]: Without dead ends: 8395 [2025-04-13 18:02:51,626 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 18:02:51,626 INFO L437 NwaCegarLoop]: 36 mSDtfsCounter, 109 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:02:51,626 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 78 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:02:51,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8395 states. [2025-04-13 18:02:51,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8395 to 7967. [2025-04-13 18:02:51,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7967 states, 7966 states have (on average 3.010168214913382) internal successors, (23979), 7966 states have internal predecessors, (23979), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:02:51,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7967 states to 7967 states and 23979 transitions. [2025-04-13 18:02:51,762 INFO L79 Accepts]: Start accepts. Automaton has 7967 states and 23979 transitions. Word has length 68 [2025-04-13 18:02:51,763 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:02:51,763 INFO L485 AbstractCegarLoop]: Abstraction has 7967 states and 23979 transitions. [2025-04-13 18:02:51,763 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 18:02:51,763 INFO L278 IsEmpty]: Start isEmpty. Operand 7967 states and 23979 transitions. [2025-04-13 18:02:51,773 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-04-13 18:02:51,773 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:02:51,773 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 18:02:51,773 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2025-04-13 18:02:51,773 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 18:02:51,773 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:02:51,773 INFO L85 PathProgramCache]: Analyzing trace with hash 928148318, now seen corresponding path program 1 times [2025-04-13 18:02:51,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:02:51,773 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591757037] [2025-04-13 18:02:51,773 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:02:51,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:02:51,777 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-04-13 18:02:51,779 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-04-13 18:02:51,779 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:02:51,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:02:51,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 18:02:51,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:02:51,856 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591757037] [2025-04-13 18:02:51,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591757037] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:02:51,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:02:51,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 18:02:51,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270177134] [2025-04-13 18:02:51,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:02:51,856 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 18:02:51,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:02:51,857 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 18:02:51,857 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-04-13 18:02:51,857 INFO L87 Difference]: Start difference. First operand 7967 states and 23979 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 18:02:52,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:02:52,098 INFO L93 Difference]: Finished difference Result 8875 states and 26477 transitions. [2025-04-13 18:02:52,098 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 18:02:52,098 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 18:02:52,098 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:02:52,147 INFO L225 Difference]: With dead ends: 8875 [2025-04-13 18:02:52,147 INFO L226 Difference]: Without dead ends: 8707 [2025-04-13 18:02:52,149 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2025-04-13 18:02:52,150 INFO L437 NwaCegarLoop]: 82 mSDtfsCounter, 164 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 456 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 465 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 456 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:02:52,150 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 323 Invalid, 465 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 456 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:02:52,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8707 states. [2025-04-13 18:02:52,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8707 to 8015. [2025-04-13 18:02:52,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8015 states, 8014 states have (on average 3.0106064387322187) internal successors, (24127), 8014 states have internal predecessors, (24127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:02:52,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8015 states to 8015 states and 24127 transitions. [2025-04-13 18:02:52,303 INFO L79 Accepts]: Start accepts. Automaton has 8015 states and 24127 transitions. Word has length 69 [2025-04-13 18:02:52,303 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:02:52,303 INFO L485 AbstractCegarLoop]: Abstraction has 8015 states and 24127 transitions. [2025-04-13 18:02:52,304 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 18:02:52,304 INFO L278 IsEmpty]: Start isEmpty. Operand 8015 states and 24127 transitions. [2025-04-13 18:02:52,314 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-04-13 18:02:52,314 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:02:52,314 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 18:02:52,314 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2025-04-13 18:02:52,314 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 18:02:52,314 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:02:52,314 INFO L85 PathProgramCache]: Analyzing trace with hash 761374322, now seen corresponding path program 1 times [2025-04-13 18:02:52,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:02:52,315 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513153076] [2025-04-13 18:02:52,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:02:52,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:02:52,318 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-04-13 18:02:52,321 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-04-13 18:02:52,321 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:02:52,321 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:02:52,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 18:02:52,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:02:52,441 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513153076] [2025-04-13 18:02:52,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513153076] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:02:52,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:02:52,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 18:02:52,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730350892] [2025-04-13 18:02:52,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:02:52,441 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 18:02:52,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:02:52,442 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 18:02:52,442 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-04-13 18:02:52,442 INFO L87 Difference]: Start difference. First operand 8015 states and 24127 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 18:02:52,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:02:52,791 INFO L93 Difference]: Finished difference Result 8959 states and 26788 transitions. [2025-04-13 18:02:52,791 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 18:02:52,792 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 18:02:52,792 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:02:52,848 INFO L225 Difference]: With dead ends: 8959 [2025-04-13 18:02:52,849 INFO L226 Difference]: Without dead ends: 8663 [2025-04-13 18:02:52,852 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 18:02:52,853 INFO L437 NwaCegarLoop]: 88 mSDtfsCounter, 170 mSDsluCounter, 390 mSDsCounter, 0 mSdLazyCounter, 616 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 478 SdHoareTripleChecker+Invalid, 621 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 616 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:02:52,853 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 478 Invalid, 621 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 616 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:02:52,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8663 states. [2025-04-13 18:02:52,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8663 to 8063. [2025-04-13 18:02:52,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8063 states, 8062 states have (on average 3.0100471347060282) internal successors, (24267), 8062 states have internal predecessors, (24267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:02:52,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8063 states to 8063 states and 24267 transitions. [2025-04-13 18:02:53,006 INFO L79 Accepts]: Start accepts. Automaton has 8063 states and 24267 transitions. Word has length 69 [2025-04-13 18:02:53,006 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:02:53,006 INFO L485 AbstractCegarLoop]: Abstraction has 8063 states and 24267 transitions. [2025-04-13 18:02:53,007 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 18:02:53,007 INFO L278 IsEmpty]: Start isEmpty. Operand 8063 states and 24267 transitions. [2025-04-13 18:02:53,017 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-04-13 18:02:53,017 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:02:53,017 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 18:02:53,017 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2025-04-13 18:02:53,017 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 18:02:53,018 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:02:53,018 INFO L85 PathProgramCache]: Analyzing trace with hash 749476928, now seen corresponding path program 2 times [2025-04-13 18:02:53,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:02:53,018 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012999582] [2025-04-13 18:02:53,018 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:02:53,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:02:53,021 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 69 statements into 1 equivalence classes. [2025-04-13 18:02:53,024 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-04-13 18:02:53,024 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:02:53,024 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:02:53,118 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 18:02:53,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:02:53,118 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012999582] [2025-04-13 18:02:53,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012999582] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:02:53,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:02:53,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 18:02:53,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245294751] [2025-04-13 18:02:53,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:02:53,119 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 18:02:53,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:02:53,119 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 18:02:53,119 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-04-13 18:02:53,119 INFO L87 Difference]: Start difference. First operand 8063 states and 24267 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 18:02:53,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:02:53,637 INFO L93 Difference]: Finished difference Result 11656 states and 34161 transitions. [2025-04-13 18:02:53,637 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-04-13 18:02:53,637 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 18:02:53,638 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:02:53,690 INFO L225 Difference]: With dead ends: 11656 [2025-04-13 18:02:53,690 INFO L226 Difference]: Without dead ends: 10972 [2025-04-13 18:02:53,694 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=219, Invalid=593, Unknown=0, NotChecked=0, Total=812 [2025-04-13 18:02:53,694 INFO L437 NwaCegarLoop]: 130 mSDtfsCounter, 341 mSDsluCounter, 548 mSDsCounter, 0 mSdLazyCounter, 840 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 341 SdHoareTripleChecker+Valid, 678 SdHoareTripleChecker+Invalid, 857 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 840 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:02:53,694 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [341 Valid, 678 Invalid, 857 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 840 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:02:53,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10972 states. [2025-04-13 18:02:53,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10972 to 7973. [2025-04-13 18:02:53,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7973 states, 7972 states have (on average 3.0050175614651278) internal successors, (23956), 7972 states have internal predecessors, (23956), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:02:53,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7973 states to 7973 states and 23956 transitions. [2025-04-13 18:02:53,862 INFO L79 Accepts]: Start accepts. Automaton has 7973 states and 23956 transitions. Word has length 69 [2025-04-13 18:02:53,863 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:02:53,863 INFO L485 AbstractCegarLoop]: Abstraction has 7973 states and 23956 transitions. [2025-04-13 18:02:53,863 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 18:02:53,863 INFO L278 IsEmpty]: Start isEmpty. Operand 7973 states and 23956 transitions. [2025-04-13 18:02:53,873 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-04-13 18:02:53,874 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:02:53,874 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 18:02:53,874 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2025-04-13 18:02:53,874 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 18:02:53,874 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:02:53,874 INFO L85 PathProgramCache]: Analyzing trace with hash -1243231150, now seen corresponding path program 2 times [2025-04-13 18:02:53,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:02:53,874 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127152227] [2025-04-13 18:02:53,874 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:02:53,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:02:53,878 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 69 statements into 1 equivalence classes. [2025-04-13 18:02:53,880 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-04-13 18:02:53,881 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:02:53,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:02:53,966 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 18:02:53,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:02:53,966 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127152227] [2025-04-13 18:02:53,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127152227] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:02:53,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:02:53,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 18:02:53,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474704830] [2025-04-13 18:02:53,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:02:53,967 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 18:02:53,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:02:53,967 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 18:02:53,967 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-04-13 18:02:53,967 INFO L87 Difference]: Start difference. First operand 7973 states and 23956 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 18:02:54,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:02:54,278 INFO L93 Difference]: Finished difference Result 8869 states and 26461 transitions. [2025-04-13 18:02:54,278 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 18:02:54,278 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 18:02:54,278 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:02:54,328 INFO L225 Difference]: With dead ends: 8869 [2025-04-13 18:02:54,328 INFO L226 Difference]: Without dead ends: 8557 [2025-04-13 18:02:54,331 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 18:02:54,331 INFO L437 NwaCegarLoop]: 86 mSDtfsCounter, 166 mSDsluCounter, 387 mSDsCounter, 0 mSdLazyCounter, 621 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 626 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 621 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:02:54,331 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 473 Invalid, 626 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 621 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:02:54,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8557 states. [2025-04-13 18:02:54,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8557 to 7957. [2025-04-13 18:02:54,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7957 states, 7956 states have (on average 3.004524886877828) internal successors, (23904), 7956 states have internal predecessors, (23904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:02:54,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7957 states to 7957 states and 23904 transitions. [2025-04-13 18:02:54,471 INFO L79 Accepts]: Start accepts. Automaton has 7957 states and 23904 transitions. Word has length 69 [2025-04-13 18:02:54,471 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:02:54,471 INFO L485 AbstractCegarLoop]: Abstraction has 7957 states and 23904 transitions. [2025-04-13 18:02:54,471 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 18:02:54,471 INFO L278 IsEmpty]: Start isEmpty. Operand 7957 states and 23904 transitions. [2025-04-13 18:02:54,482 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-04-13 18:02:54,483 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:02:54,483 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 18:02:54,483 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2025-04-13 18:02:54,483 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 18:02:54,483 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:02:54,483 INFO L85 PathProgramCache]: Analyzing trace with hash 463720576, now seen corresponding path program 3 times [2025-04-13 18:02:54,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:02:54,483 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500740992] [2025-04-13 18:02:54,484 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:02:54,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:02:54,488 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 69 statements into 1 equivalence classes. [2025-04-13 18:02:54,491 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-04-13 18:02:54,491 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 18:02:54,491 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:02:54,596 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 18:02:54,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:02:54,597 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500740992] [2025-04-13 18:02:54,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500740992] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:02:54,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:02:54,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 18:02:54,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141339024] [2025-04-13 18:02:54,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:02:54,597 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 18:02:54,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:02:54,597 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 18:02:54,597 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-04-13 18:02:54,597 INFO L87 Difference]: Start difference. First operand 7957 states and 23904 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 18:02:54,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:02:54,997 INFO L93 Difference]: Finished difference Result 11092 states and 32519 transitions. [2025-04-13 18:02:54,997 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-04-13 18:02:54,997 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 18:02:54,997 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:02:55,057 INFO L225 Difference]: With dead ends: 11092 [2025-04-13 18:02:55,057 INFO L226 Difference]: Without dead ends: 10778 [2025-04-13 18:02:55,061 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 18:02:55,062 INFO L437 NwaCegarLoop]: 122 mSDtfsCounter, 340 mSDsluCounter, 454 mSDsCounter, 0 mSdLazyCounter, 716 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 340 SdHoareTripleChecker+Valid, 576 SdHoareTripleChecker+Invalid, 732 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 716 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:02:55,062 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [340 Valid, 576 Invalid, 732 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 716 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:02:55,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10778 states. [2025-04-13 18:02:55,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10778 to 7941. [2025-04-13 18:02:55,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7941 states, 7940 states have (on average 3.004030226700252) internal successors, (23852), 7940 states have internal predecessors, (23852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:02:55,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7941 states to 7941 states and 23852 transitions. [2025-04-13 18:02:55,242 INFO L79 Accepts]: Start accepts. Automaton has 7941 states and 23852 transitions. Word has length 69 [2025-04-13 18:02:55,242 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:02:55,242 INFO L485 AbstractCegarLoop]: Abstraction has 7941 states and 23852 transitions. [2025-04-13 18:02:55,242 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 18:02:55,242 INFO L278 IsEmpty]: Start isEmpty. Operand 7941 states and 23852 transitions. [2025-04-13 18:02:55,252 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-04-13 18:02:55,253 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:02:55,253 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 18:02:55,253 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2025-04-13 18:02:55,253 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 18:02:55,253 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:02:55,253 INFO L85 PathProgramCache]: Analyzing trace with hash 1558251248, now seen corresponding path program 3 times [2025-04-13 18:02:55,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:02:55,253 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893744326] [2025-04-13 18:02:55,253 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:02:55,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:02:55,257 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 69 statements into 1 equivalence classes. [2025-04-13 18:02:55,260 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-04-13 18:02:55,260 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 18:02:55,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:02:55,350 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 18:02:55,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:02:55,350 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893744326] [2025-04-13 18:02:55,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1893744326] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:02:55,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:02:55,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 18:02:55,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548856169] [2025-04-13 18:02:55,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:02:55,351 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 18:02:55,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:02:55,351 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 18:02:55,351 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-04-13 18:02:55,351 INFO L87 Difference]: Start difference. First operand 7941 states and 23852 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 18:02:55,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:02:55,655 INFO L93 Difference]: Finished difference Result 9085 states and 27039 transitions. [2025-04-13 18:02:55,655 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-13 18:02:55,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 18:02:55,656 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:02:55,703 INFO L225 Difference]: With dead ends: 9085 [2025-04-13 18:02:55,703 INFO L226 Difference]: Without dead ends: 8725 [2025-04-13 18:02:55,706 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 18:02:55,706 INFO L437 NwaCegarLoop]: 89 mSDtfsCounter, 195 mSDsluCounter, 400 mSDsCounter, 0 mSdLazyCounter, 612 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 489 SdHoareTripleChecker+Invalid, 617 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 612 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:02:55,706 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 489 Invalid, 617 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 612 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:02:55,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8725 states. [2025-04-13 18:02:55,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8725 to 7925. [2025-04-13 18:02:55,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7925 states, 7924 states have (on average 3.0035335689045937) internal successors, (23800), 7924 states have internal predecessors, (23800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:02:55,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7925 states to 7925 states and 23800 transitions. [2025-04-13 18:02:55,844 INFO L79 Accepts]: Start accepts. Automaton has 7925 states and 23800 transitions. Word has length 69 [2025-04-13 18:02:55,844 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:02:55,844 INFO L485 AbstractCegarLoop]: Abstraction has 7925 states and 23800 transitions. [2025-04-13 18:02:55,844 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 18:02:55,844 INFO L278 IsEmpty]: Start isEmpty. Operand 7925 states and 23800 transitions. [2025-04-13 18:02:55,854 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-04-13 18:02:55,854 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:02:55,854 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 18:02:55,854 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2025-04-13 18:02:55,854 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 18:02:55,854 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:02:55,855 INFO L85 PathProgramCache]: Analyzing trace with hash -1021142306, now seen corresponding path program 4 times [2025-04-13 18:02:55,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:02:55,855 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598973322] [2025-04-13 18:02:55,855 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:02:55,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:02:55,858 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 69 statements into 2 equivalence classes. [2025-04-13 18:02:55,862 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 18:02:55,862 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:02:55,862 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:02:55,951 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 18:02:55,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:02:55,952 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598973322] [2025-04-13 18:02:55,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598973322] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:02:55,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:02:55,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 18:02:55,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220587211] [2025-04-13 18:02:55,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:02:55,952 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 18:02:55,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:02:55,952 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 18:02:55,952 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-04-13 18:02:55,952 INFO L87 Difference]: Start difference. First operand 7925 states and 23800 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 18:02:56,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:02:56,389 INFO L93 Difference]: Finished difference Result 12936 states and 37734 transitions. [2025-04-13 18:02:56,389 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-13 18:02:56,390 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 18:02:56,390 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:02:56,451 INFO L225 Difference]: With dead ends: 12936 [2025-04-13 18:02:56,451 INFO L226 Difference]: Without dead ends: 12133 [2025-04-13 18:02:56,456 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=216, Invalid=540, Unknown=0, NotChecked=0, Total=756 [2025-04-13 18:02:56,457 INFO L437 NwaCegarLoop]: 119 mSDtfsCounter, 433 mSDsluCounter, 539 mSDsCounter, 0 mSdLazyCounter, 796 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 433 SdHoareTripleChecker+Valid, 658 SdHoareTripleChecker+Invalid, 824 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 796 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:02:56,457 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [433 Valid, 658 Invalid, 824 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 796 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:02:56,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12133 states. [2025-04-13 18:02:56,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12133 to 7973. [2025-04-13 18:02:56,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7973 states, 7972 states have (on average 2.9979929754139487) internal successors, (23900), 7972 states have internal predecessors, (23900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:02:56,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7973 states to 7973 states and 23900 transitions. [2025-04-13 18:02:56,676 INFO L79 Accepts]: Start accepts. Automaton has 7973 states and 23900 transitions. Word has length 69 [2025-04-13 18:02:56,676 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:02:56,676 INFO L485 AbstractCegarLoop]: Abstraction has 7973 states and 23900 transitions. [2025-04-13 18:02:56,676 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 18:02:56,676 INFO L278 IsEmpty]: Start isEmpty. Operand 7973 states and 23900 transitions. [2025-04-13 18:02:56,686 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-04-13 18:02:56,686 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:02:56,686 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 18:02:56,686 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2025-04-13 18:02:56,686 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 18:02:56,687 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:02:56,687 INFO L85 PathProgramCache]: Analyzing trace with hash -1519135662, now seen corresponding path program 4 times [2025-04-13 18:02:56,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:02:56,687 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937833079] [2025-04-13 18:02:56,687 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:02:56,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:02:56,690 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 69 statements into 2 equivalence classes. [2025-04-13 18:02:56,694 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 18:02:56,694 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:02:56,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:02:56,803 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 18:02:56,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:02:56,803 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937833079] [2025-04-13 18:02:56,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937833079] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:02:56,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:02:56,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 18:02:56,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595949886] [2025-04-13 18:02:56,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:02:56,803 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 18:02:56,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:02:56,804 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 18:02:56,804 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-04-13 18:02:56,804 INFO L87 Difference]: Start difference. First operand 7973 states and 23900 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 18:02:57,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:02:57,165 INFO L93 Difference]: Finished difference Result 8933 states and 26512 transitions. [2025-04-13 18:02:57,165 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-13 18:02:57,165 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 18:02:57,165 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:02:57,228 INFO L225 Difference]: With dead ends: 8933 [2025-04-13 18:02:57,229 INFO L226 Difference]: Without dead ends: 8637 [2025-04-13 18:02:57,231 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=138, Invalid=324, Unknown=0, NotChecked=0, Total=462 [2025-04-13 18:02:57,232 INFO L437 NwaCegarLoop]: 98 mSDtfsCounter, 204 mSDsluCounter, 437 mSDsCounter, 0 mSdLazyCounter, 692 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 535 SdHoareTripleChecker+Invalid, 722 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 692 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:02:57,232 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 535 Invalid, 722 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 692 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:02:57,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8637 states. [2025-04-13 18:02:57,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8637 to 8005. [2025-04-13 18:02:57,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8005 states, 8004 states have (on average 2.997001499250375) internal successors, (23988), 8004 states have internal predecessors, (23988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:02:57,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8005 states to 8005 states and 23988 transitions. [2025-04-13 18:02:57,387 INFO L79 Accepts]: Start accepts. Automaton has 8005 states and 23988 transitions. Word has length 69 [2025-04-13 18:02:57,387 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:02:57,387 INFO L485 AbstractCegarLoop]: Abstraction has 8005 states and 23988 transitions. [2025-04-13 18:02:57,387 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 18:02:57,388 INFO L278 IsEmpty]: Start isEmpty. Operand 8005 states and 23988 transitions. [2025-04-13 18:02:57,399 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-04-13 18:02:57,399 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:02:57,399 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 18:02:57,399 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2025-04-13 18:02:57,399 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 18:02:57,399 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:02:57,399 INFO L85 PathProgramCache]: Analyzing trace with hash -2137665036, now seen corresponding path program 5 times [2025-04-13 18:02:57,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:02:57,399 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317237143] [2025-04-13 18:02:57,400 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:02:57,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:02:57,403 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 69 statements into 1 equivalence classes. [2025-04-13 18:02:57,406 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-04-13 18:02:57,406 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:02:57,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:02:57,501 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 18:02:57,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:02:57,501 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317237143] [2025-04-13 18:02:57,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [317237143] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:02:57,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:02:57,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 18:02:57,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913090012] [2025-04-13 18:02:57,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:02:57,502 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 18:02:57,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:02:57,502 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 18:02:57,502 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-04-13 18:02:57,502 INFO L87 Difference]: Start difference. First operand 8005 states and 23988 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 18:02:57,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:02:57,788 INFO L93 Difference]: Finished difference Result 8921 states and 26557 transitions. [2025-04-13 18:02:57,788 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 18:02:57,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 18:02:57,788 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:02:57,845 INFO L225 Difference]: With dead ends: 8921 [2025-04-13 18:02:57,845 INFO L226 Difference]: Without dead ends: 8625 [2025-04-13 18:02:57,848 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 18:02:57,848 INFO L437 NwaCegarLoop]: 87 mSDtfsCounter, 170 mSDsluCounter, 390 mSDsCounter, 0 mSdLazyCounter, 611 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 616 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 611 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:02:57,848 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 477 Invalid, 616 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 611 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:02:57,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8625 states. [2025-04-13 18:02:57,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8625 to 8037. [2025-04-13 18:02:57,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8037 states, 8036 states have (on average 2.996017919362867) internal successors, (24076), 8036 states have internal predecessors, (24076), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:02:57,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8037 states to 8037 states and 24076 transitions. [2025-04-13 18:02:57,992 INFO L79 Accepts]: Start accepts. Automaton has 8037 states and 24076 transitions. Word has length 69 [2025-04-13 18:02:57,992 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:02:57,992 INFO L485 AbstractCegarLoop]: Abstraction has 8037 states and 24076 transitions. [2025-04-13 18:02:57,992 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 18:02:57,992 INFO L278 IsEmpty]: Start isEmpty. Operand 8037 states and 24076 transitions. [2025-04-13 18:02:58,003 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-04-13 18:02:58,003 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:02:58,003 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 18:02:58,003 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2025-04-13 18:02:58,003 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 18:02:58,003 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:02:58,003 INFO L85 PathProgramCache]: Analyzing trace with hash 771226162, now seen corresponding path program 6 times [2025-04-13 18:02:58,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:02:58,004 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992557130] [2025-04-13 18:02:58,004 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:02:58,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:02:58,007 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 69 statements into 1 equivalence classes. [2025-04-13 18:02:58,010 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-04-13 18:02:58,010 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 18:02:58,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:02:58,110 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 18:02:58,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:02:58,110 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992557130] [2025-04-13 18:02:58,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1992557130] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:02:58,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:02:58,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 18:02:58,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745109135] [2025-04-13 18:02:58,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:02:58,111 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 18:02:58,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:02:58,111 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 18:02:58,111 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-04-13 18:02:58,111 INFO L87 Difference]: Start difference. First operand 8037 states and 24076 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 18:02:58,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:02:58,399 INFO L93 Difference]: Finished difference Result 8917 states and 26529 transitions. [2025-04-13 18:02:58,399 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 18:02:58,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 18:02:58,399 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:02:58,459 INFO L225 Difference]: With dead ends: 8917 [2025-04-13 18:02:58,459 INFO L226 Difference]: Without dead ends: 8605 [2025-04-13 18:02:58,462 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 18:02:58,463 INFO L437 NwaCegarLoop]: 88 mSDtfsCounter, 167 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 535 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 425 SdHoareTripleChecker+Invalid, 540 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 535 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:02:58,463 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 425 Invalid, 540 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 535 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:02:58,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8605 states. [2025-04-13 18:02:58,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8605 to 8021. [2025-04-13 18:02:58,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8021 states, 8020 states have (on average 2.995511221945137) internal successors, (24024), 8020 states have internal predecessors, (24024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:02:58,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8021 states to 8021 states and 24024 transitions. [2025-04-13 18:02:58,643 INFO L79 Accepts]: Start accepts. Automaton has 8021 states and 24024 transitions. Word has length 69 [2025-04-13 18:02:58,643 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:02:58,643 INFO L485 AbstractCegarLoop]: Abstraction has 8021 states and 24024 transitions. [2025-04-13 18:02:58,643 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 18:02:58,643 INFO L278 IsEmpty]: Start isEmpty. Operand 8021 states and 24024 transitions. [2025-04-13 18:02:58,653 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-04-13 18:02:58,654 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:02:58,654 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 18:02:58,654 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2025-04-13 18:02:58,654 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 18:02:58,654 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:02:58,654 INFO L85 PathProgramCache]: Analyzing trace with hash -133059564, now seen corresponding path program 7 times [2025-04-13 18:02:58,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:02:58,654 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669576368] [2025-04-13 18:02:58,654 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:02:58,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:02:58,658 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-04-13 18:02:58,660 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-04-13 18:02:58,660 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:02:58,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:02:58,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 18:02:58,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:02:58,757 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669576368] [2025-04-13 18:02:58,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669576368] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:02:58,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:02:58,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 18:02:58,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094586002] [2025-04-13 18:02:58,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:02:58,757 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 18:02:58,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:02:58,757 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 18:02:58,757 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-04-13 18:02:58,758 INFO L87 Difference]: Start difference. First operand 8021 states and 24024 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 18:02:59,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:02:59,042 INFO L93 Difference]: Finished difference Result 8905 states and 26489 transitions. [2025-04-13 18:02:59,042 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 18:02:59,042 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 18:02:59,043 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:02:59,105 INFO L225 Difference]: With dead ends: 8905 [2025-04-13 18:02:59,105 INFO L226 Difference]: Without dead ends: 8593 [2025-04-13 18:02:59,109 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 18:02:59,109 INFO L437 NwaCegarLoop]: 85 mSDtfsCounter, 170 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 529 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 411 SdHoareTripleChecker+Invalid, 534 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 529 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:02:59,109 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 411 Invalid, 534 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 529 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:02:59,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8593 states. [2025-04-13 18:02:59,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8593 to 7989. [2025-04-13 18:02:59,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7989 states, 7988 states have (on average 2.99649474211317) internal successors, (23936), 7988 states have internal predecessors, (23936), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:02:59,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7989 states to 7989 states and 23936 transitions. [2025-04-13 18:02:59,284 INFO L79 Accepts]: Start accepts. Automaton has 7989 states and 23936 transitions. Word has length 69 [2025-04-13 18:02:59,285 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:02:59,285 INFO L485 AbstractCegarLoop]: Abstraction has 7989 states and 23936 transitions. [2025-04-13 18:02:59,285 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 18:02:59,285 INFO L278 IsEmpty]: Start isEmpty. Operand 7989 states and 23936 transitions. [2025-04-13 18:02:59,296 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-04-13 18:02:59,296 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:02:59,296 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 18:02:59,296 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2025-04-13 18:02:59,296 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 18:02:59,296 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:02:59,296 INFO L85 PathProgramCache]: Analyzing trace with hash 1836615408, now seen corresponding path program 8 times [2025-04-13 18:02:59,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:02:59,297 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405200715] [2025-04-13 18:02:59,297 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:02:59,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:02:59,300 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 69 statements into 1 equivalence classes. [2025-04-13 18:02:59,303 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-04-13 18:02:59,303 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:02:59,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:02:59,388 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 18:02:59,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:02:59,388 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405200715] [2025-04-13 18:02:59,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405200715] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:02:59,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:02:59,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 18:02:59,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417605145] [2025-04-13 18:02:59,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:02:59,388 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 18:02:59,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:02:59,389 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 18:02:59,389 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-04-13 18:02:59,389 INFO L87 Difference]: Start difference. First operand 7989 states and 23936 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 18:02:59,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:02:59,711 INFO L93 Difference]: Finished difference Result 9085 states and 26967 transitions. [2025-04-13 18:02:59,712 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-13 18:02:59,712 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 18:02:59,712 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:02:59,766 INFO L225 Difference]: With dead ends: 9085 [2025-04-13 18:02:59,766 INFO L226 Difference]: Without dead ends: 8709 [2025-04-13 18:02:59,769 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 18:02:59,769 INFO L437 NwaCegarLoop]: 88 mSDtfsCounter, 191 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 665 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 516 SdHoareTripleChecker+Invalid, 670 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 665 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:02:59,770 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 516 Invalid, 670 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 665 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:02:59,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8709 states. [2025-04-13 18:02:59,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8709 to 7973. [2025-04-13 18:02:59,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7973 states, 7972 states have (on average 2.9964877069744102) internal successors, (23888), 7972 states have internal predecessors, (23888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:02:59,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7973 states to 7973 states and 23888 transitions. [2025-04-13 18:02:59,922 INFO L79 Accepts]: Start accepts. Automaton has 7973 states and 23888 transitions. Word has length 69 [2025-04-13 18:02:59,922 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:02:59,922 INFO L485 AbstractCegarLoop]: Abstraction has 7973 states and 23888 transitions. [2025-04-13 18:02:59,922 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 18:02:59,922 INFO L278 IsEmpty]: Start isEmpty. Operand 7973 states and 23888 transitions. [2025-04-13 18:02:59,932 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-04-13 18:02:59,932 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:02:59,933 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 18:02:59,933 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2025-04-13 18:02:59,933 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 18:02:59,933 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:02:59,933 INFO L85 PathProgramCache]: Analyzing trace with hash -1072275790, now seen corresponding path program 9 times [2025-04-13 18:02:59,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:02:59,933 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400189179] [2025-04-13 18:02:59,933 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:02:59,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:02:59,936 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 69 statements into 1 equivalence classes. [2025-04-13 18:02:59,939 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-04-13 18:02:59,939 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 18:02:59,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:03:00,030 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 18:03:00,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:03:00,030 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400189179] [2025-04-13 18:03:00,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400189179] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:03:00,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:03:00,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 18:03:00,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067692631] [2025-04-13 18:03:00,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:03:00,030 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 18:03:00,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:03:00,031 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 18:03:00,031 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-04-13 18:03:00,031 INFO L87 Difference]: Start difference. First operand 7973 states and 23888 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 18:03:00,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:03:00,338 INFO L93 Difference]: Finished difference Result 9069 states and 26927 transitions. [2025-04-13 18:03:00,338 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-13 18:03:00,338 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 18:03:00,338 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:03:00,389 INFO L225 Difference]: With dead ends: 9069 [2025-04-13 18:03:00,389 INFO L226 Difference]: Without dead ends: 8709 [2025-04-13 18:03:00,392 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 18:03:00,392 INFO L437 NwaCegarLoop]: 87 mSDtfsCounter, 198 mSDsluCounter, 395 mSDsCounter, 0 mSdLazyCounter, 602 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 482 SdHoareTripleChecker+Invalid, 607 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 602 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:03:00,392 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 482 Invalid, 607 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 602 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:03:00,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8709 states. [2025-04-13 18:03:00,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8709 to 7957. [2025-04-13 18:03:00,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7957 states, 7956 states have (on average 2.9959778783308195) internal successors, (23836), 7956 states have internal predecessors, (23836), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:03:00,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7957 states to 7957 states and 23836 transitions. [2025-04-13 18:03:00,567 INFO L79 Accepts]: Start accepts. Automaton has 7957 states and 23836 transitions. Word has length 69 [2025-04-13 18:03:00,568 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:03:00,568 INFO L485 AbstractCegarLoop]: Abstraction has 7957 states and 23836 transitions. [2025-04-13 18:03:00,568 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 18:03:00,568 INFO L278 IsEmpty]: Start isEmpty. Operand 7957 states and 23836 transitions. [2025-04-13 18:03:00,578 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-04-13 18:03:00,578 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:03:00,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, 1, 1] [2025-04-13 18:03:00,578 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2025-04-13 18:03:00,578 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 18:03:00,579 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:03:00,579 INFO L85 PathProgramCache]: Analyzing trace with hash 1374135950, now seen corresponding path program 10 times [2025-04-13 18:03:00,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:03:00,579 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467958281] [2025-04-13 18:03:00,579 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:03:00,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:03:00,582 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 69 statements into 2 equivalence classes. [2025-04-13 18:03:00,586 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 18:03:00,586 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:03:00,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:03:00,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 18:03:00,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:03:00,688 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467958281] [2025-04-13 18:03:00,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467958281] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:03:00,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:03:00,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 18:03:00,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897659197] [2025-04-13 18:03:00,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:03:00,688 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 18:03:00,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:03:00,688 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 18:03:00,688 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-04-13 18:03:00,688 INFO L87 Difference]: Start difference. First operand 7957 states and 23836 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 18:03:00,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:03:00,959 INFO L93 Difference]: Finished difference Result 8725 states and 25914 transitions. [2025-04-13 18:03:00,959 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 18:03:00,959 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 18:03:00,959 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:03:01,009 INFO L225 Difference]: With dead ends: 8725 [2025-04-13 18:03:01,010 INFO L226 Difference]: Without dead ends: 8429 [2025-04-13 18:03:01,012 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=117, Invalid=263, Unknown=0, NotChecked=0, Total=380 [2025-04-13 18:03:01,012 INFO L437 NwaCegarLoop]: 85 mSDtfsCounter, 196 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 399 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:03:01,012 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 288 Invalid, 425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 399 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:03:01,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8429 states. [2025-04-13 18:03:01,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8429 to 7989. [2025-04-13 18:03:01,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7989 states, 7988 states have (on average 2.9949924887330996) internal successors, (23924), 7988 states have internal predecessors, (23924), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:03:01,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7989 states to 7989 states and 23924 transitions. [2025-04-13 18:03:01,152 INFO L79 Accepts]: Start accepts. Automaton has 7989 states and 23924 transitions. Word has length 69 [2025-04-13 18:03:01,153 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:03:01,153 INFO L485 AbstractCegarLoop]: Abstraction has 7989 states and 23924 transitions. [2025-04-13 18:03:01,153 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 18:03:01,153 INFO L278 IsEmpty]: Start isEmpty. Operand 7989 states and 23924 transitions. [2025-04-13 18:03:01,163 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-04-13 18:03:01,163 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:03:01,163 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 18:03:01,163 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2025-04-13 18:03:01,163 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 18:03:01,163 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:03:01,163 INFO L85 PathProgramCache]: Analyzing trace with hash 142844948, now seen corresponding path program 11 times [2025-04-13 18:03:01,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:03:01,163 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094618381] [2025-04-13 18:03:01,164 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:03:01,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:03:01,167 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 69 statements into 1 equivalence classes. [2025-04-13 18:03:01,169 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-04-13 18:03:01,169 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:03:01,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:03:01,257 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 18:03:01,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:03:01,257 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094618381] [2025-04-13 18:03:01,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2094618381] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:03:01,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:03:01,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 18:03:01,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227438978] [2025-04-13 18:03:01,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:03:01,258 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 18:03:01,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:03:01,258 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 18:03:01,258 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-04-13 18:03:01,258 INFO L87 Difference]: Start difference. First operand 7989 states and 23924 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 18:03:01,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:03:01,555 INFO L93 Difference]: Finished difference Result 8853 states and 26333 transitions. [2025-04-13 18:03:01,555 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 18:03:01,555 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 18:03:01,555 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:03:01,610 INFO L225 Difference]: With dead ends: 8853 [2025-04-13 18:03:01,610 INFO L226 Difference]: Without dead ends: 8557 [2025-04-13 18:03:01,613 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 18:03:01,613 INFO L437 NwaCegarLoop]: 85 mSDtfsCounter, 167 mSDsluCounter, 387 mSDsCounter, 0 mSdLazyCounter, 617 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 472 SdHoareTripleChecker+Invalid, 622 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 617 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:03:01,613 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 472 Invalid, 622 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 617 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:03:01,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8557 states. [2025-04-13 18:03:01,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8557 to 8021. [2025-04-13 18:03:01,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8021 states, 8020 states have (on average 2.9940149625935164) internal successors, (24012), 8020 states have internal predecessors, (24012), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:03:01,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8021 states to 8021 states and 24012 transitions. [2025-04-13 18:03:01,767 INFO L79 Accepts]: Start accepts. Automaton has 8021 states and 24012 transitions. Word has length 69 [2025-04-13 18:03:01,767 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:03:01,767 INFO L485 AbstractCegarLoop]: Abstraction has 8021 states and 24012 transitions. [2025-04-13 18:03:01,767 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 18:03:01,767 INFO L278 IsEmpty]: Start isEmpty. Operand 8021 states and 24012 transitions. [2025-04-13 18:03:01,777 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-04-13 18:03:01,777 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:03:01,777 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 18:03:01,777 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2025-04-13 18:03:01,777 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 18:03:01,778 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:03:01,778 INFO L85 PathProgramCache]: Analyzing trace with hash -630469522, now seen corresponding path program 12 times [2025-04-13 18:03:01,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:03:01,778 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680752600] [2025-04-13 18:03:01,778 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:03:01,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:03:01,781 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 69 statements into 1 equivalence classes. [2025-04-13 18:03:01,784 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-04-13 18:03:01,784 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 18:03:01,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:03:01,876 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 18:03:01,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:03:01,877 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680752600] [2025-04-13 18:03:01,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680752600] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:03:01,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:03:01,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 18:03:01,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816582344] [2025-04-13 18:03:01,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:03:01,877 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 18:03:01,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:03:01,877 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 18:03:01,877 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-04-13 18:03:01,877 INFO L87 Difference]: Start difference. First operand 8021 states and 24012 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 18:03:02,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:03:02,169 INFO L93 Difference]: Finished difference Result 8601 states and 25631 transitions. [2025-04-13 18:03:02,169 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-13 18:03:02,169 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 18:03:02,169 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:03:02,268 INFO L225 Difference]: With dead ends: 8601 [2025-04-13 18:03:02,268 INFO L226 Difference]: Without dead ends: 8289 [2025-04-13 18:03:02,270 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 18:03:02,271 INFO L437 NwaCegarLoop]: 85 mSDtfsCounter, 157 mSDsluCounter, 403 mSDsCounter, 0 mSdLazyCounter, 686 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 488 SdHoareTripleChecker+Invalid, 691 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 686 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:03:02,271 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 488 Invalid, 691 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 686 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:03:02,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8289 states. [2025-04-13 18:03:02,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8289 to 7993. [2025-04-13 18:03:02,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7993 states, 7992 states have (on average 2.992992992992993) internal successors, (23920), 7992 states have internal predecessors, (23920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:03:02,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7993 states to 7993 states and 23920 transitions. [2025-04-13 18:03:02,422 INFO L79 Accepts]: Start accepts. Automaton has 7993 states and 23920 transitions. Word has length 69 [2025-04-13 18:03:02,423 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:03:02,423 INFO L485 AbstractCegarLoop]: Abstraction has 7993 states and 23920 transitions. [2025-04-13 18:03:02,423 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 18:03:02,423 INFO L278 IsEmpty]: Start isEmpty. Operand 7993 states and 23920 transitions. [2025-04-13 18:03:02,433 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-04-13 18:03:02,433 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:03:02,433 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 18:03:02,433 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2025-04-13 18:03:02,434 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 18:03:02,434 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:03:02,434 INFO L85 PathProgramCache]: Analyzing trace with hash 2147450420, now seen corresponding path program 13 times [2025-04-13 18:03:02,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:03:02,434 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32861286] [2025-04-13 18:03:02,434 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:03:02,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:03:02,437 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-04-13 18:03:02,440 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-04-13 18:03:02,440 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:03:02,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:03:02,525 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 18:03:02,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:03:02,526 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32861286] [2025-04-13 18:03:02,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [32861286] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:03:02,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:03:02,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 18:03:02,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552233283] [2025-04-13 18:03:02,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:03:02,526 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 18:03:02,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:03:02,527 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 18:03:02,527 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-04-13 18:03:02,527 INFO L87 Difference]: Start difference. First operand 7993 states and 23920 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 18:03:02,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:03:02,803 INFO L93 Difference]: Finished difference Result 8857 states and 26313 transitions. [2025-04-13 18:03:02,803 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 18:03:02,804 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 18:03:02,804 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:03:02,871 INFO L225 Difference]: With dead ends: 8857 [2025-04-13 18:03:02,871 INFO L226 Difference]: Without dead ends: 8545 [2025-04-13 18:03:02,875 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 18:03:02,876 INFO L437 NwaCegarLoop]: 87 mSDtfsCounter, 165 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 531 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 536 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:03:02,876 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 424 Invalid, 536 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 531 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:03:02,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8545 states. [2025-04-13 18:03:02,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8545 to 7993. [2025-04-13 18:03:02,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7993 states, 7992 states have (on average 2.992992992992993) internal successors, (23920), 7992 states have internal predecessors, (23920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:03:03,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7993 states to 7993 states and 23920 transitions. [2025-04-13 18:03:03,054 INFO L79 Accepts]: Start accepts. Automaton has 7993 states and 23920 transitions. Word has length 69 [2025-04-13 18:03:03,054 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:03:03,055 INFO L485 AbstractCegarLoop]: Abstraction has 7993 states and 23920 transitions. [2025-04-13 18:03:03,055 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 18:03:03,055 INFO L278 IsEmpty]: Start isEmpty. Operand 7993 states and 23920 transitions. [2025-04-13 18:03:03,065 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-04-13 18:03:03,065 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:03:03,065 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 18:03:03,065 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2025-04-13 18:03:03,066 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 18:03:03,066 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:03:03,066 INFO L85 PathProgramCache]: Analyzing trace with hash -2123954420, now seen corresponding path program 14 times [2025-04-13 18:03:03,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:03:03,066 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251199940] [2025-04-13 18:03:03,066 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:03:03,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:03:03,069 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 69 statements into 1 equivalence classes. [2025-04-13 18:03:03,072 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-04-13 18:03:03,072 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:03:03,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:03:03,158 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 18:03:03,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:03:03,159 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251199940] [2025-04-13 18:03:03,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251199940] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:03:03,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:03:03,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 18:03:03,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289971931] [2025-04-13 18:03:03,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:03:03,159 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 18:03:03,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:03:03,159 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 18:03:03,159 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-04-13 18:03:03,159 INFO L87 Difference]: Start difference. First operand 7993 states and 23920 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 18:03:03,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:03:03,439 INFO L93 Difference]: Finished difference Result 8817 states and 26193 transitions. [2025-04-13 18:03:03,439 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 18:03:03,440 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 18:03:03,440 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:03:03,502 INFO L225 Difference]: With dead ends: 8817 [2025-04-13 18:03:03,502 INFO L226 Difference]: Without dead ends: 8457 [2025-04-13 18:03:03,506 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 18:03:03,506 INFO L437 NwaCegarLoop]: 90 mSDtfsCounter, 184 mSDsluCounter, 390 mSDsCounter, 0 mSdLazyCounter, 558 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 480 SdHoareTripleChecker+Invalid, 563 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 558 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:03:03,506 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 480 Invalid, 563 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 558 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:03:03,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8457 states. [2025-04-13 18:03:03,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8457 to 7993. [2025-04-13 18:03:03,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7993 states, 7992 states have (on average 2.9894894894894897) internal successors, (23892), 7992 states have internal predecessors, (23892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:03:03,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7993 states to 7993 states and 23892 transitions. [2025-04-13 18:03:03,669 INFO L79 Accepts]: Start accepts. Automaton has 7993 states and 23892 transitions. Word has length 69 [2025-04-13 18:03:03,669 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:03:03,669 INFO L485 AbstractCegarLoop]: Abstraction has 7993 states and 23892 transitions. [2025-04-13 18:03:03,669 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 18:03:03,669 INFO L278 IsEmpty]: Start isEmpty. Operand 7993 states and 23892 transitions. [2025-04-13 18:03:03,680 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-04-13 18:03:03,680 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:03:03,680 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 18:03:03,680 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2025-04-13 18:03:03,680 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 18:03:03,680 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:03:03,680 INFO L85 PathProgramCache]: Analyzing trace with hash -1350639950, now seen corresponding path program 15 times [2025-04-13 18:03:03,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:03:03,681 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427711139] [2025-04-13 18:03:03,681 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:03:03,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:03:03,684 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 69 statements into 1 equivalence classes. [2025-04-13 18:03:03,686 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-04-13 18:03:03,686 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 18:03:03,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:03:03,769 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 18:03:03,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:03:03,769 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427711139] [2025-04-13 18:03:03,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427711139] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:03:03,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:03:03,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 18:03:03,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438264586] [2025-04-13 18:03:03,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:03:03,769 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 18:03:03,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:03:03,769 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 18:03:03,769 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-04-13 18:03:03,770 INFO L87 Difference]: Start difference. First operand 7993 states and 23892 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 18:03:04,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:03:04,072 INFO L93 Difference]: Finished difference Result 9025 states and 26739 transitions. [2025-04-13 18:03:04,072 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-13 18:03:04,072 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 18:03:04,072 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:03:04,160 INFO L225 Difference]: With dead ends: 9025 [2025-04-13 18:03:04,160 INFO L226 Difference]: Without dead ends: 8649 [2025-04-13 18:03:04,162 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 18:03:04,162 INFO L437 NwaCegarLoop]: 88 mSDtfsCounter, 188 mSDsluCounter, 410 mSDsCounter, 0 mSdLazyCounter, 607 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 498 SdHoareTripleChecker+Invalid, 612 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 607 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:03:04,162 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 498 Invalid, 612 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 607 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:03:04,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8649 states. [2025-04-13 18:03:04,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8649 to 7961. [2025-04-13 18:03:04,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7961 states, 7960 states have (on average 2.9909547738693467) internal successors, (23808), 7960 states have internal predecessors, (23808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:03:04,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7961 states to 7961 states and 23808 transitions. [2025-04-13 18:03:04,314 INFO L79 Accepts]: Start accepts. Automaton has 7961 states and 23808 transitions. Word has length 69 [2025-04-13 18:03:04,314 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:03:04,314 INFO L485 AbstractCegarLoop]: Abstraction has 7961 states and 23808 transitions. [2025-04-13 18:03:04,314 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 18:03:04,314 INFO L278 IsEmpty]: Start isEmpty. Operand 7961 states and 23808 transitions. [2025-04-13 18:03:04,324 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-04-13 18:03:04,324 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:03:04,325 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 18:03:04,325 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2025-04-13 18:03:04,325 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 18:03:04,325 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:03:04,325 INFO L85 PathProgramCache]: Analyzing trace with hash -1294897006, now seen corresponding path program 16 times [2025-04-13 18:03:04,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:03:04,325 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428342269] [2025-04-13 18:03:04,325 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:03:04,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:03:04,329 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 69 statements into 2 equivalence classes. [2025-04-13 18:03:04,332 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 18:03:04,332 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:03:04,333 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:03:04,420 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 18:03:04,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:03:04,421 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428342269] [2025-04-13 18:03:04,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428342269] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:03:04,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:03:04,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 18:03:04,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068770556] [2025-04-13 18:03:04,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:03:04,421 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 18:03:04,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:03:04,421 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 18:03:04,422 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-04-13 18:03:04,422 INFO L87 Difference]: Start difference. First operand 7961 states and 23808 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 18:03:04,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:03:04,694 INFO L93 Difference]: Finished difference Result 8305 states and 24721 transitions. [2025-04-13 18:03:04,695 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 18:03:04,695 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 18:03:04,695 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:03:04,752 INFO L225 Difference]: With dead ends: 8305 [2025-04-13 18:03:04,752 INFO L226 Difference]: Without dead ends: 7901 [2025-04-13 18:03:04,756 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=237, Unknown=0, NotChecked=0, Total=342 [2025-04-13 18:03:04,756 INFO L437 NwaCegarLoop]: 80 mSDtfsCounter, 150 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 569 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 581 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 569 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:03:04,756 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 382 Invalid, 581 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 569 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:03:04,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7901 states. [2025-04-13 18:03:04,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7901 to 7901. [2025-04-13 18:03:04,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7901 states, 7900 states have (on average 2.991139240506329) internal successors, (23630), 7900 states have internal predecessors, (23630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:03:04,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7901 states to 7901 states and 23630 transitions. [2025-04-13 18:03:04,929 INFO L79 Accepts]: Start accepts. Automaton has 7901 states and 23630 transitions. Word has length 69 [2025-04-13 18:03:04,929 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:03:04,929 INFO L485 AbstractCegarLoop]: Abstraction has 7901 states and 23630 transitions. [2025-04-13 18:03:04,930 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 18:03:04,930 INFO L278 IsEmpty]: Start isEmpty. Operand 7901 states and 23630 transitions. [2025-04-13 18:03:04,941 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-04-13 18:03:04,941 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:03:04,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 18:03:04,941 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2025-04-13 18:03:04,942 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 18:03:04,942 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:03:04,942 INFO L85 PathProgramCache]: Analyzing trace with hash -1182601648, now seen corresponding path program 17 times [2025-04-13 18:03:04,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:03:04,942 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508529607] [2025-04-13 18:03:04,942 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:03:04,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:03:04,946 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 69 statements into 1 equivalence classes. [2025-04-13 18:03:04,948 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-04-13 18:03:04,948 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:03:04,948 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:03:05,040 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 18:03:05,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:03:05,040 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508529607] [2025-04-13 18:03:05,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508529607] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:03:05,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:03:05,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 18:03:05,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222891738] [2025-04-13 18:03:05,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:03:05,041 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 18:03:05,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:03:05,041 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 18:03:05,041 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-04-13 18:03:05,041 INFO L87 Difference]: Start difference. First operand 7901 states and 23630 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 18:03:05,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:03:05,311 INFO L93 Difference]: Finished difference Result 8469 states and 25209 transitions. [2025-04-13 18:03:05,312 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-13 18:03:05,312 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 18:03:05,312 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:03:05,378 INFO L225 Difference]: With dead ends: 8469 [2025-04-13 18:03:05,378 INFO L226 Difference]: Without dead ends: 8173 [2025-04-13 18:03:05,381 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 18:03:05,382 INFO L437 NwaCegarLoop]: 82 mSDtfsCounter, 168 mSDsluCounter, 375 mSDsCounter, 0 mSdLazyCounter, 598 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 457 SdHoareTripleChecker+Invalid, 603 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 598 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:03:05,382 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 457 Invalid, 603 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 598 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:03:05,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8173 states. [2025-04-13 18:03:05,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8173 to 7905. [2025-04-13 18:03:05,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7905 states, 7904 states have (on average 2.9911437246963564) internal successors, (23642), 7904 states have internal predecessors, (23642), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:03:05,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7905 states to 7905 states and 23642 transitions. [2025-04-13 18:03:05,535 INFO L79 Accepts]: Start accepts. Automaton has 7905 states and 23642 transitions. Word has length 69 [2025-04-13 18:03:05,535 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:03:05,536 INFO L485 AbstractCegarLoop]: Abstraction has 7905 states and 23642 transitions. [2025-04-13 18:03:05,536 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 18:03:05,536 INFO L278 IsEmpty]: Start isEmpty. Operand 7905 states and 23642 transitions. [2025-04-13 18:03:05,546 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-04-13 18:03:05,546 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:03:05,546 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 18:03:05,546 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2025-04-13 18:03:05,547 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 18:03:05,547 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:03:05,547 INFO L85 PathProgramCache]: Analyzing trace with hash -1700845938, now seen corresponding path program 18 times [2025-04-13 18:03:05,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:03:05,547 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125811423] [2025-04-13 18:03:05,547 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:03:05,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:03:05,550 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 69 statements into 1 equivalence classes. [2025-04-13 18:03:05,553 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-04-13 18:03:05,553 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 18:03:05,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:03:05,633 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 18:03:05,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:03:05,633 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125811423] [2025-04-13 18:03:05,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125811423] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:03:05,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:03:05,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 18:03:05,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143502008] [2025-04-13 18:03:05,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:03:05,634 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 18:03:05,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:03:05,634 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 18:03:05,634 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-04-13 18:03:05,634 INFO L87 Difference]: Start difference. First operand 7905 states and 23642 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 18:03:05,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:03:05,882 INFO L93 Difference]: Finished difference Result 8469 states and 25193 transitions. [2025-04-13 18:03:05,883 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-13 18:03:05,883 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 18:03:05,883 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:03:05,975 INFO L225 Difference]: With dead ends: 8469 [2025-04-13 18:03:05,975 INFO L226 Difference]: Without dead ends: 8157 [2025-04-13 18:03:05,977 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 18:03:05,977 INFO L437 NwaCegarLoop]: 80 mSDtfsCounter, 177 mSDsluCounter, 338 mSDsCounter, 0 mSdLazyCounter, 533 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 538 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 533 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:03:05,977 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 418 Invalid, 538 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 533 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:03:05,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8157 states. [2025-04-13 18:03:06,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8157 to 7905. [2025-04-13 18:03:06,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7905 states, 7904 states have (on average 2.9891194331983804) internal successors, (23626), 7904 states have internal predecessors, (23626), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:03:06,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7905 states to 7905 states and 23626 transitions. [2025-04-13 18:03:06,131 INFO L79 Accepts]: Start accepts. Automaton has 7905 states and 23626 transitions. Word has length 69 [2025-04-13 18:03:06,131 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:03:06,131 INFO L485 AbstractCegarLoop]: Abstraction has 7905 states and 23626 transitions. [2025-04-13 18:03:06,131 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 18:03:06,131 INFO L278 IsEmpty]: Start isEmpty. Operand 7905 states and 23626 transitions. [2025-04-13 18:03:06,141 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-04-13 18:03:06,141 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:03:06,142 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 18:03:06,142 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2025-04-13 18:03:06,142 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 18:03:06,142 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:03:06,142 INFO L85 PathProgramCache]: Analyzing trace with hash -117212402, now seen corresponding path program 19 times [2025-04-13 18:03:06,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:03:06,142 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773901663] [2025-04-13 18:03:06,142 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:03:06,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:03:06,145 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-04-13 18:03:06,148 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-04-13 18:03:06,148 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:03:06,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:03:06,232 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 18:03:06,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:03:06,233 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773901663] [2025-04-13 18:03:06,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [773901663] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:03:06,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:03:06,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 18:03:06,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588239482] [2025-04-13 18:03:06,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:03:06,233 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 18:03:06,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:03:06,233 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 18:03:06,233 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-04-13 18:03:06,233 INFO L87 Difference]: Start difference. First operand 7905 states and 23626 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 18:03:06,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:03:06,492 INFO L93 Difference]: Finished difference Result 8701 states and 25823 transitions. [2025-04-13 18:03:06,493 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-13 18:03:06,493 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 18:03:06,493 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:03:06,551 INFO L225 Difference]: With dead ends: 8701 [2025-04-13 18:03:06,551 INFO L226 Difference]: Without dead ends: 8341 [2025-04-13 18:03:06,554 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 18:03:06,554 INFO L437 NwaCegarLoop]: 84 mSDtfsCounter, 181 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 553 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 467 SdHoareTripleChecker+Invalid, 558 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 553 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:03:06,554 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 467 Invalid, 558 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 553 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:03:06,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8341 states. [2025-04-13 18:03:06,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8341 to 7889. [2025-04-13 18:03:06,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7889 states, 7888 states have (on average 2.987576064908722) internal successors, (23566), 7888 states have internal predecessors, (23566), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:03:06,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7889 states to 7889 states and 23566 transitions. [2025-04-13 18:03:06,718 INFO L79 Accepts]: Start accepts. Automaton has 7889 states and 23566 transitions. Word has length 69 [2025-04-13 18:03:06,718 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:03:06,718 INFO L485 AbstractCegarLoop]: Abstraction has 7889 states and 23566 transitions. [2025-04-13 18:03:06,718 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 18:03:06,718 INFO L278 IsEmpty]: Start isEmpty. Operand 7889 states and 23566 transitions. [2025-04-13 18:03:06,728 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-04-13 18:03:06,728 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:03:06,729 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 18:03:06,729 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2025-04-13 18:03:06,729 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 18:03:06,729 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:03:06,729 INFO L85 PathProgramCache]: Analyzing trace with hash -2077057422, now seen corresponding path program 20 times [2025-04-13 18:03:06,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:03:06,729 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786554317] [2025-04-13 18:03:06,729 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:03:06,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:03:06,732 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 69 statements into 1 equivalence classes. [2025-04-13 18:03:06,735 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-04-13 18:03:06,735 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:03:06,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:03:06,818 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 18:03:06,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:03:06,819 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786554317] [2025-04-13 18:03:06,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786554317] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:03:06,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:03:06,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 18:03:06,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311214255] [2025-04-13 18:03:06,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:03:06,819 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 18:03:06,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:03:06,819 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 18:03:06,819 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-04-13 18:03:06,819 INFO L87 Difference]: Start difference. First operand 7889 states and 23566 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 18:03:07,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:03:07,077 INFO L93 Difference]: Finished difference Result 8741 states and 25901 transitions. [2025-04-13 18:03:07,077 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-13 18:03:07,077 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 18:03:07,077 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:03:07,130 INFO L225 Difference]: With dead ends: 8741 [2025-04-13 18:03:07,131 INFO L226 Difference]: Without dead ends: 8321 [2025-04-13 18:03:07,133 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 18:03:07,134 INFO L437 NwaCegarLoop]: 88 mSDtfsCounter, 181 mSDsluCounter, 372 mSDsCounter, 0 mSdLazyCounter, 562 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 460 SdHoareTripleChecker+Invalid, 567 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 562 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:03:07,134 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 460 Invalid, 567 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 562 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:03:07,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8321 states. [2025-04-13 18:03:07,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8321 to 7777. [2025-04-13 18:03:07,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7777 states, 7776 states have (on average 2.982253086419753) internal successors, (23190), 7776 states have internal predecessors, (23190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:03:07,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7777 states to 7777 states and 23190 transitions. [2025-04-13 18:03:07,282 INFO L79 Accepts]: Start accepts. Automaton has 7777 states and 23190 transitions. Word has length 69 [2025-04-13 18:03:07,282 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:03:07,282 INFO L485 AbstractCegarLoop]: Abstraction has 7777 states and 23190 transitions. [2025-04-13 18:03:07,282 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 18:03:07,282 INFO L278 IsEmpty]: Start isEmpty. Operand 7777 states and 23190 transitions. [2025-04-13 18:03:07,292 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-04-13 18:03:07,292 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:03:07,292 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 18:03:07,292 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2025-04-13 18:03:07,293 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 18:03:07,293 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:03:07,293 INFO L85 PathProgramCache]: Analyzing trace with hash 1168479053, now seen corresponding path program 1 times [2025-04-13 18:03:07,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:03:07,293 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605285875] [2025-04-13 18:03:07,293 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:03:07,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:03:07,296 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-04-13 18:03:07,299 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-04-13 18:03:07,299 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:03:07,299 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:03:07,365 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 18:03:07,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:03:07,365 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605285875] [2025-04-13 18:03:07,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605285875] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:03:07,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:03:07,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 18:03:07,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672858166] [2025-04-13 18:03:07,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:03:07,366 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 18:03:07,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:03:07,366 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 18:03:07,366 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-04-13 18:03:07,366 INFO L87 Difference]: Start difference. First operand 7777 states and 23190 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 18:03:07,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:03:07,600 INFO L93 Difference]: Finished difference Result 9788 states and 28812 transitions. [2025-04-13 18:03:07,600 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 18:03:07,600 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 18:03:07,600 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:03:07,664 INFO L225 Difference]: With dead ends: 9788 [2025-04-13 18:03:07,664 INFO L226 Difference]: Without dead ends: 9201 [2025-04-13 18:03:07,668 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 18:03:07,669 INFO L437 NwaCegarLoop]: 98 mSDtfsCounter, 225 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 451 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 463 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 451 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:03:07,669 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 349 Invalid, 463 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 451 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:03:07,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9201 states. [2025-04-13 18:03:07,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9201 to 7383. [2025-04-13 18:03:07,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7383 states, 7382 states have (on average 2.980086697371986) internal successors, (21999), 7382 states have internal predecessors, (21999), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:03:07,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7383 states to 7383 states and 21999 transitions. [2025-04-13 18:03:07,871 INFO L79 Accepts]: Start accepts. Automaton has 7383 states and 21999 transitions. Word has length 69 [2025-04-13 18:03:07,872 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:03:07,872 INFO L485 AbstractCegarLoop]: Abstraction has 7383 states and 21999 transitions. [2025-04-13 18:03:07,872 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 18:03:07,872 INFO L278 IsEmpty]: Start isEmpty. Operand 7383 states and 21999 transitions. [2025-04-13 18:03:07,881 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-04-13 18:03:07,882 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:03:07,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 18:03:07,882 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2025-04-13 18:03:07,882 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 18:03:07,882 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:03:07,882 INFO L85 PathProgramCache]: Analyzing trace with hash 1198532059, now seen corresponding path program 1 times [2025-04-13 18:03:07,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:03:07,882 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016888867] [2025-04-13 18:03:07,882 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:03:07,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:03:07,886 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-04-13 18:03:07,888 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-04-13 18:03:07,889 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:03:07,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:03:07,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 18:03:07,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:03:07,967 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016888867] [2025-04-13 18:03:07,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016888867] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:03:07,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:03:07,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 18:03:07,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17802807] [2025-04-13 18:03:07,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:03:07,967 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 18:03:07,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:03:07,968 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 18:03:07,968 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-04-13 18:03:07,968 INFO L87 Difference]: Start difference. First operand 7383 states and 21999 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 18:03:08,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:03:08,393 INFO L93 Difference]: Finished difference Result 10606 states and 30826 transitions. [2025-04-13 18:03:08,393 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-04-13 18:03:08,393 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 18:03:08,394 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:03:08,457 INFO L225 Difference]: With dead ends: 10606 [2025-04-13 18:03:08,457 INFO L226 Difference]: Without dead ends: 10310 [2025-04-13 18:03:08,461 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=217, Invalid=595, Unknown=0, NotChecked=0, Total=812 [2025-04-13 18:03:08,461 INFO L437 NwaCegarLoop]: 125 mSDtfsCounter, 393 mSDsluCounter, 541 mSDsCounter, 0 mSdLazyCounter, 840 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 393 SdHoareTripleChecker+Valid, 666 SdHoareTripleChecker+Invalid, 859 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 840 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:03:08,461 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [393 Valid, 666 Invalid, 859 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 840 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:03:08,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10310 states. [2025-04-13 18:03:08,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10310 to 7435. [2025-04-13 18:03:08,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7435 states, 7434 states have (on average 2.9786117836965293) internal successors, (22143), 7434 states have internal predecessors, (22143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:03:08,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7435 states to 7435 states and 22143 transitions. [2025-04-13 18:03:08,631 INFO L79 Accepts]: Start accepts. Automaton has 7435 states and 22143 transitions. Word has length 69 [2025-04-13 18:03:08,631 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:03:08,631 INFO L485 AbstractCegarLoop]: Abstraction has 7435 states and 22143 transitions. [2025-04-13 18:03:08,631 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 18:03:08,631 INFO L278 IsEmpty]: Start isEmpty. Operand 7435 states and 22143 transitions. [2025-04-13 18:03:08,640 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-04-13 18:03:08,641 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:03:08,641 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 18:03:08,641 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2025-04-13 18:03:08,641 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 18:03:08,641 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:03:08,641 INFO L85 PathProgramCache]: Analyzing trace with hash -79785125, now seen corresponding path program 2 times [2025-04-13 18:03:08,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:03:08,641 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049704536] [2025-04-13 18:03:08,641 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:03:08,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:03:08,644 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 69 statements into 1 equivalence classes. [2025-04-13 18:03:08,647 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-04-13 18:03:08,647 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:03:08,647 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:03:08,724 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 18:03:08,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:03:08,725 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049704536] [2025-04-13 18:03:08,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049704536] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:03:08,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:03:08,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 18:03:08,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147590453] [2025-04-13 18:03:08,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:03:08,725 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 18:03:08,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:03:08,725 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 18:03:08,725 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-04-13 18:03:08,725 INFO L87 Difference]: Start difference. First operand 7435 states and 22143 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 18:03:09,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:03:09,134 INFO L93 Difference]: Finished difference Result 10744 states and 31236 transitions. [2025-04-13 18:03:09,134 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-04-13 18:03:09,134 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 18:03:09,134 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:03:09,195 INFO L225 Difference]: With dead ends: 10744 [2025-04-13 18:03:09,195 INFO L226 Difference]: Without dead ends: 9414 [2025-04-13 18:03:09,200 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=202, Invalid=500, Unknown=0, NotChecked=0, Total=702 [2025-04-13 18:03:09,200 INFO L437 NwaCegarLoop]: 117 mSDtfsCounter, 326 mSDsluCounter, 444 mSDsCounter, 0 mSdLazyCounter, 753 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 326 SdHoareTripleChecker+Valid, 561 SdHoareTripleChecker+Invalid, 772 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 753 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:03:09,200 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [326 Valid, 561 Invalid, 772 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 753 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:03:09,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9414 states. [2025-04-13 18:03:09,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9414 to 7330. [2025-04-13 18:03:09,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7330 states, 7329 states have (on average 2.9712102606085415) internal successors, (21776), 7329 states have internal predecessors, (21776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:03:09,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7330 states to 7330 states and 21776 transitions. [2025-04-13 18:03:09,359 INFO L79 Accepts]: Start accepts. Automaton has 7330 states and 21776 transitions. Word has length 69 [2025-04-13 18:03:09,359 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:03:09,359 INFO L485 AbstractCegarLoop]: Abstraction has 7330 states and 21776 transitions. [2025-04-13 18:03:09,360 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 18:03:09,360 INFO L278 IsEmpty]: Start isEmpty. Operand 7330 states and 21776 transitions. [2025-04-13 18:03:09,370 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-04-13 18:03:09,371 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:03:09,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 18:03:09,371 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2025-04-13 18:03:09,371 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 18:03:09,371 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:03:09,371 INFO L85 PathProgramCache]: Analyzing trace with hash -806073413, now seen corresponding path program 2 times [2025-04-13 18:03:09,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:03:09,371 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489120534] [2025-04-13 18:03:09,371 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:03:09,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:03:09,375 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 69 statements into 1 equivalence classes. [2025-04-13 18:03:09,377 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-04-13 18:03:09,377 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:03:09,377 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:03:09,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 18:03:09,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:03:09,464 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489120534] [2025-04-13 18:03:09,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [489120534] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:03:09,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:03:09,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 18:03:09,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194754394] [2025-04-13 18:03:09,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:03:09,464 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 18:03:09,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:03:09,464 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 18:03:09,464 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-04-13 18:03:09,465 INFO L87 Difference]: Start difference. First operand 7330 states and 21776 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 18:03:09,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:03:09,969 INFO L93 Difference]: Finished difference Result 10565 states and 30537 transitions. [2025-04-13 18:03:09,969 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-04-13 18:03:09,969 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 18:03:09,969 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:03:10,034 INFO L225 Difference]: With dead ends: 10565 [2025-04-13 18:03:10,034 INFO L226 Difference]: Without dead ends: 10021 [2025-04-13 18:03:10,039 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=243, Invalid=687, Unknown=0, NotChecked=0, Total=930 [2025-04-13 18:03:10,040 INFO L437 NwaCegarLoop]: 130 mSDtfsCounter, 381 mSDsluCounter, 623 mSDsCounter, 0 mSdLazyCounter, 940 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 381 SdHoareTripleChecker+Valid, 753 SdHoareTripleChecker+Invalid, 959 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 940 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:03:10,040 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [381 Valid, 753 Invalid, 959 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 940 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:03:10,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10021 states. [2025-04-13 18:03:10,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10021 to 7274. [2025-04-13 18:03:10,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7274 states, 7273 states have (on average 2.972638526055273) internal successors, (21620), 7273 states have internal predecessors, (21620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:03:10,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7274 states to 7274 states and 21620 transitions. [2025-04-13 18:03:10,193 INFO L79 Accepts]: Start accepts. Automaton has 7274 states and 21620 transitions. Word has length 69 [2025-04-13 18:03:10,193 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:03:10,193 INFO L485 AbstractCegarLoop]: Abstraction has 7274 states and 21620 transitions. [2025-04-13 18:03:10,193 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 18:03:10,193 INFO L278 IsEmpty]: Start isEmpty. Operand 7274 states and 21620 transitions. [2025-04-13 18:03:10,202 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-04-13 18:03:10,202 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:03:10,202 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 18:03:10,202 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2025-04-13 18:03:10,202 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 18:03:10,202 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:03:10,202 INFO L85 PathProgramCache]: Analyzing trace with hash 1924820347, now seen corresponding path program 3 times [2025-04-13 18:03:10,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:03:10,202 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826234824] [2025-04-13 18:03:10,202 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:03:10,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:03:10,205 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 69 statements into 1 equivalence classes. [2025-04-13 18:03:10,208 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-04-13 18:03:10,208 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 18:03:10,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:03:10,284 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 18:03:10,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:03:10,284 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826234824] [2025-04-13 18:03:10,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826234824] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:03:10,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:03:10,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 18:03:10,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360054350] [2025-04-13 18:03:10,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:03:10,284 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 18:03:10,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:03:10,285 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 18:03:10,285 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-04-13 18:03:10,285 INFO L87 Difference]: Start difference. First operand 7274 states and 21620 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 18:03:10,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:03:10,633 INFO L93 Difference]: Finished difference Result 9545 states and 27710 transitions. [2025-04-13 18:03:10,633 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-13 18:03:10,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 18:03:10,633 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:03:10,691 INFO L225 Difference]: With dead ends: 9545 [2025-04-13 18:03:10,691 INFO L226 Difference]: Without dead ends: 9203 [2025-04-13 18:03:10,695 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=174, Invalid=426, Unknown=0, NotChecked=0, Total=600 [2025-04-13 18:03:10,695 INFO L437 NwaCegarLoop]: 114 mSDtfsCounter, 305 mSDsluCounter, 411 mSDsCounter, 0 mSdLazyCounter, 671 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 305 SdHoareTripleChecker+Valid, 525 SdHoareTripleChecker+Invalid, 684 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 671 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:03:10,696 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [305 Valid, 525 Invalid, 684 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 671 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:03:10,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9203 states. [2025-04-13 18:03:10,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9203 to 7257. [2025-04-13 18:03:10,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7257 states, 7256 states have (on average 2.9696802646086) internal successors, (21548), 7256 states have internal predecessors, (21548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:03:10,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7257 states to 7257 states and 21548 transitions. [2025-04-13 18:03:10,865 INFO L79 Accepts]: Start accepts. Automaton has 7257 states and 21548 transitions. Word has length 69 [2025-04-13 18:03:10,865 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:03:10,865 INFO L485 AbstractCegarLoop]: Abstraction has 7257 states and 21548 transitions. [2025-04-13 18:03:10,865 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 18:03:10,865 INFO L278 IsEmpty]: Start isEmpty. Operand 7257 states and 21548 transitions. [2025-04-13 18:03:10,874 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-04-13 18:03:10,874 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:03:10,874 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 18:03:10,874 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2025-04-13 18:03:10,874 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 18:03:10,875 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:03:10,875 INFO L85 PathProgramCache]: Analyzing trace with hash -1739013217, now seen corresponding path program 3 times [2025-04-13 18:03:10,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:03:10,875 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678810430] [2025-04-13 18:03:10,875 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:03:10,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:03:10,878 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 69 statements into 1 equivalence classes. [2025-04-13 18:03:10,880 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-04-13 18:03:10,881 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 18:03:10,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:03:10,962 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 18:03:10,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:03:10,962 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678810430] [2025-04-13 18:03:10,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678810430] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:03:10,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:03:10,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 18:03:10,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792920889] [2025-04-13 18:03:10,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:03:10,963 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 18:03:10,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:03:10,963 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 18:03:10,963 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-04-13 18:03:10,963 INFO L87 Difference]: Start difference. First operand 7257 states and 21548 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 18:03:11,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:03:11,407 INFO L93 Difference]: Finished difference Result 10384 states and 30010 transitions. [2025-04-13 18:03:11,407 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-13 18:03:11,407 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 18:03:11,407 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:03:11,469 INFO L225 Difference]: With dead ends: 10384 [2025-04-13 18:03:11,469 INFO L226 Difference]: Without dead ends: 10088 [2025-04-13 18:03:11,474 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=183, Invalid=467, Unknown=0, NotChecked=0, Total=650 [2025-04-13 18:03:11,474 INFO L437 NwaCegarLoop]: 121 mSDtfsCounter, 343 mSDsluCounter, 613 mSDsCounter, 0 mSdLazyCounter, 990 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 343 SdHoareTripleChecker+Valid, 734 SdHoareTripleChecker+Invalid, 1006 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 990 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:03:11,474 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [343 Valid, 734 Invalid, 1006 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 990 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:03:11,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10088 states. [2025-04-13 18:03:11,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10088 to 7161. [2025-04-13 18:03:11,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7161 states, 7160 states have (on average 2.963687150837989) internal successors, (21220), 7160 states have internal predecessors, (21220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:03:11,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7161 states to 7161 states and 21220 transitions. [2025-04-13 18:03:11,634 INFO L79 Accepts]: Start accepts. Automaton has 7161 states and 21220 transitions. Word has length 69 [2025-04-13 18:03:11,634 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:03:11,634 INFO L485 AbstractCegarLoop]: Abstraction has 7161 states and 21220 transitions. [2025-04-13 18:03:11,634 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 18:03:11,634 INFO L278 IsEmpty]: Start isEmpty. Operand 7161 states and 21220 transitions. [2025-04-13 18:03:11,643 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-04-13 18:03:11,643 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:03:11,643 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 18:03:11,643 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2025-04-13 18:03:11,643 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 18:03:11,643 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:03:11,643 INFO L85 PathProgramCache]: Analyzing trace with hash -1573270023, now seen corresponding path program 4 times [2025-04-13 18:03:11,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:03:11,643 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42975945] [2025-04-13 18:03:11,643 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:03:11,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:03:11,647 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 69 statements into 2 equivalence classes. [2025-04-13 18:03:11,650 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 18:03:11,650 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:03:11,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:03:11,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 18:03:11,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:03:11,735 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42975945] [2025-04-13 18:03:11,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42975945] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:03:11,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:03:11,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 18:03:11,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484948885] [2025-04-13 18:03:11,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:03:11,735 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 18:03:11,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:03:11,735 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 18:03:11,735 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-04-13 18:03:11,735 INFO L87 Difference]: Start difference. First operand 7161 states and 21220 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 18:03:12,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:03:12,129 INFO L93 Difference]: Finished difference Result 9646 states and 27888 transitions. [2025-04-13 18:03:12,129 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-13 18:03:12,130 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 18:03:12,130 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:03:12,187 INFO L225 Difference]: With dead ends: 9646 [2025-04-13 18:03:12,187 INFO L226 Difference]: Without dead ends: 9227 [2025-04-13 18:03:12,191 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=183, Invalid=467, Unknown=0, NotChecked=0, Total=650 [2025-04-13 18:03:12,191 INFO L437 NwaCegarLoop]: 117 mSDtfsCounter, 317 mSDsluCounter, 449 mSDsCounter, 0 mSdLazyCounter, 678 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 317 SdHoareTripleChecker+Valid, 566 SdHoareTripleChecker+Invalid, 695 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 678 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:03:12,192 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [317 Valid, 566 Invalid, 695 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 678 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:03:12,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9227 states. [2025-04-13 18:03:12,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9227 to 7118. [2025-04-13 18:03:12,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7118 states, 7117 states have (on average 2.957144864409161) internal successors, (21046), 7117 states have internal predecessors, (21046), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:03:12,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7118 states to 7118 states and 21046 transitions. [2025-04-13 18:03:12,346 INFO L79 Accepts]: Start accepts. Automaton has 7118 states and 21046 transitions. Word has length 69 [2025-04-13 18:03:12,346 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:03:12,346 INFO L485 AbstractCegarLoop]: Abstraction has 7118 states and 21046 transitions. [2025-04-13 18:03:12,346 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 18:03:12,346 INFO L278 IsEmpty]: Start isEmpty. Operand 7118 states and 21046 transitions. [2025-04-13 18:03:12,355 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-04-13 18:03:12,355 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:03:12,355 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 18:03:12,355 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2025-04-13 18:03:12,355 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 18:03:12,356 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:03:12,356 INFO L85 PathProgramCache]: Analyzing trace with hash 979327593, now seen corresponding path program 1 times [2025-04-13 18:03:12,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:03:12,356 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248422963] [2025-04-13 18:03:12,356 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:03:12,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:03:12,359 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-04-13 18:03:12,361 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-04-13 18:03:12,361 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:03:12,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:03:12,440 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 18:03:12,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:03:12,440 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248422963] [2025-04-13 18:03:12,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248422963] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:03:12,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:03:12,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 18:03:12,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49975557] [2025-04-13 18:03:12,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:03:12,440 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 18:03:12,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:03:12,440 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 18:03:12,441 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-04-13 18:03:12,441 INFO L87 Difference]: Start difference. First operand 7118 states and 21046 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 18:03:12,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:03:12,723 INFO L93 Difference]: Finished difference Result 8147 states and 23854 transitions. [2025-04-13 18:03:12,724 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-13 18:03:12,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 18:03:12,724 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:03:12,782 INFO L225 Difference]: With dead ends: 8147 [2025-04-13 18:03:12,782 INFO L226 Difference]: Without dead ends: 7601 [2025-04-13 18:03:12,785 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 18:03:12,785 INFO L437 NwaCegarLoop]: 89 mSDtfsCounter, 195 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 642 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 649 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 642 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:03:12,785 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 445 Invalid, 649 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 642 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:03:12,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7601 states. [2025-04-13 18:03:12,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7601 to 7182. [2025-04-13 18:03:12,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7182 states, 7181 states have (on average 2.9552987049157498) internal successors, (21222), 7181 states have internal predecessors, (21222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:03:12,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7182 states to 7182 states and 21222 transitions. [2025-04-13 18:03:12,925 INFO L79 Accepts]: Start accepts. Automaton has 7182 states and 21222 transitions. Word has length 69 [2025-04-13 18:03:12,926 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:03:12,926 INFO L485 AbstractCegarLoop]: Abstraction has 7182 states and 21222 transitions. [2025-04-13 18:03:12,926 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 18:03:12,926 INFO L278 IsEmpty]: Start isEmpty. Operand 7182 states and 21222 transitions. [2025-04-13 18:03:12,934 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-04-13 18:03:12,934 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:03:12,935 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 18:03:12,935 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2025-04-13 18:03:12,935 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 18:03:12,935 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:03:12,935 INFO L85 PathProgramCache]: Analyzing trace with hash 737754957, now seen corresponding path program 1 times [2025-04-13 18:03:12,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:03:12,935 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528703256] [2025-04-13 18:03:12,935 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:03:12,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:03:12,938 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-04-13 18:03:12,941 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-04-13 18:03:12,941 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:03:12,941 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:03:13,022 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 18:03:13,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:03:13,022 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528703256] [2025-04-13 18:03:13,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528703256] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:03:13,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:03:13,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 18:03:13,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942893108] [2025-04-13 18:03:13,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:03:13,023 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 18:03:13,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:03:13,023 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 18:03:13,023 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-04-13 18:03:13,023 INFO L87 Difference]: Start difference. First operand 7182 states and 21222 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 18:03:13,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:03:13,524 INFO L93 Difference]: Finished difference Result 11686 states and 33510 transitions. [2025-04-13 18:03:13,524 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-04-13 18:03:13,524 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 18:03:13,525 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:03:13,586 INFO L225 Difference]: With dead ends: 11686 [2025-04-13 18:03:13,586 INFO L226 Difference]: Without dead ends: 10437 [2025-04-13 18:03:13,590 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=209, Invalid=603, Unknown=0, NotChecked=0, Total=812 [2025-04-13 18:03:13,591 INFO L437 NwaCegarLoop]: 133 mSDtfsCounter, 366 mSDsluCounter, 677 mSDsCounter, 0 mSdLazyCounter, 1099 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 366 SdHoareTripleChecker+Valid, 810 SdHoareTripleChecker+Invalid, 1120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 1099 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:03:13,591 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [366 Valid, 810 Invalid, 1120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 1099 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:03:13,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10437 states. [2025-04-13 18:03:13,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10437 to 7140. [2025-04-13 18:03:13,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7140 states, 7139 states have (on average 2.9490124667320354) internal successors, (21053), 7139 states have internal predecessors, (21053), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:03:13,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7140 states to 7140 states and 21053 transitions. [2025-04-13 18:03:13,752 INFO L79 Accepts]: Start accepts. Automaton has 7140 states and 21053 transitions. Word has length 69 [2025-04-13 18:03:13,753 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:03:13,753 INFO L485 AbstractCegarLoop]: Abstraction has 7140 states and 21053 transitions. [2025-04-13 18:03:13,753 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 18:03:13,753 INFO L278 IsEmpty]: Start isEmpty. Operand 7140 states and 21053 transitions. [2025-04-13 18:03:13,762 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-04-13 18:03:13,762 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:03:13,762 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 18:03:13,762 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2025-04-13 18:03:13,762 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 18:03:13,763 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:03:13,763 INFO L85 PathProgramCache]: Analyzing trace with hash 1265083945, now seen corresponding path program 2 times [2025-04-13 18:03:13,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:03:13,763 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434023628] [2025-04-13 18:03:13,763 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:03:13,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:03:13,766 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 69 statements into 1 equivalence classes. [2025-04-13 18:03:13,769 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-04-13 18:03:13,769 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:03:13,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:03:13,876 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 18:03:13,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:03:13,876 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434023628] [2025-04-13 18:03:13,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434023628] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:03:13,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:03:13,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 18:03:13,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238576583] [2025-04-13 18:03:13,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:03:13,877 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 18:03:13,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:03:13,877 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 18:03:13,877 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-04-13 18:03:13,877 INFO L87 Difference]: Start difference. First operand 7140 states and 21053 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 18:03:14,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:03:14,152 INFO L93 Difference]: Finished difference Result 7857 states and 22971 transitions. [2025-04-13 18:03:14,152 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-13 18:03:14,152 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 18:03:14,152 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:03:14,211 INFO L225 Difference]: With dead ends: 7857 [2025-04-13 18:03:14,211 INFO L226 Difference]: Without dead ends: 7527 [2025-04-13 18:03:14,215 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 18:03:14,215 INFO L437 NwaCegarLoop]: 92 mSDtfsCounter, 186 mSDsluCounter, 378 mSDsCounter, 0 mSdLazyCounter, 647 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 470 SdHoareTripleChecker+Invalid, 652 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 647 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:03:14,215 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 470 Invalid, 652 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 647 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:03:14,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7527 states. [2025-04-13 18:03:14,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7527 to 7108. [2025-04-13 18:03:14,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7108 states, 7107 states have (on average 2.945405937807795) internal successors, (20933), 7107 states have internal predecessors, (20933), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:03:14,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7108 states to 7108 states and 20933 transitions. [2025-04-13 18:03:14,358 INFO L79 Accepts]: Start accepts. Automaton has 7108 states and 20933 transitions. Word has length 69 [2025-04-13 18:03:14,359 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:03:14,359 INFO L485 AbstractCegarLoop]: Abstraction has 7108 states and 20933 transitions. [2025-04-13 18:03:14,359 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 18:03:14,359 INFO L278 IsEmpty]: Start isEmpty. Operand 7108 states and 20933 transitions. [2025-04-13 18:03:14,368 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-04-13 18:03:14,368 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:03:14,368 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 18:03:14,368 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2025-04-13 18:03:14,368 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 18:03:14,368 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:03:14,368 INFO L85 PathProgramCache]: Analyzing trace with hash -1552606867, now seen corresponding path program 2 times [2025-04-13 18:03:14,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:03:14,369 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875886443] [2025-04-13 18:03:14,369 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:03:14,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:03:14,372 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 69 statements into 1 equivalence classes. [2025-04-13 18:03:14,375 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-04-13 18:03:14,375 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:03:14,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:03:14,449 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 18:03:14,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:03:14,450 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875886443] [2025-04-13 18:03:14,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875886443] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:03:14,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:03:14,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 18:03:14,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133238899] [2025-04-13 18:03:14,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:03:14,450 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 18:03:14,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:03:14,450 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 18:03:14,450 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-04-13 18:03:14,450 INFO L87 Difference]: Start difference. First operand 7108 states and 20933 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 18:03:14,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:03:14,898 INFO L93 Difference]: Finished difference Result 11415 states and 32549 transitions. [2025-04-13 18:03:14,898 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-04-13 18:03:14,899 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 18:03:14,899 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:03:14,966 INFO L225 Difference]: With dead ends: 11415 [2025-04-13 18:03:14,966 INFO L226 Difference]: Without dead ends: 10328 [2025-04-13 18:03:14,971 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=235, Invalid=695, Unknown=0, NotChecked=0, Total=930 [2025-04-13 18:03:14,971 INFO L437 NwaCegarLoop]: 145 mSDtfsCounter, 409 mSDsluCounter, 595 mSDsCounter, 0 mSdLazyCounter, 896 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 409 SdHoareTripleChecker+Valid, 740 SdHoareTripleChecker+Invalid, 921 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 896 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:03:14,971 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [409 Valid, 740 Invalid, 921 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 896 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:03:14,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10328 states. [2025-04-13 18:03:15,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10328 to 6910. [2025-04-13 18:03:15,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6910 states, 6909 states have (on average 2.9208279056303375) internal successors, (20180), 6909 states have internal predecessors, (20180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:03:15,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6910 states to 6910 states and 20180 transitions. [2025-04-13 18:03:15,131 INFO L79 Accepts]: Start accepts. Automaton has 6910 states and 20180 transitions. Word has length 69 [2025-04-13 18:03:15,131 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:03:15,131 INFO L485 AbstractCegarLoop]: Abstraction has 6910 states and 20180 transitions. [2025-04-13 18:03:15,132 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 18:03:15,132 INFO L278 IsEmpty]: Start isEmpty. Operand 6910 states and 20180 transitions. [2025-04-13 18:03:15,140 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-04-13 18:03:15,140 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:03:15,140 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 18:03:15,140 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2025-04-13 18:03:15,140 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 18:03:15,141 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:03:15,141 INFO L85 PathProgramCache]: Analyzing trace with hash 317245703, now seen corresponding path program 3 times [2025-04-13 18:03:15,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:03:15,141 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485830125] [2025-04-13 18:03:15,141 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:03:15,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:03:15,144 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 69 statements into 1 equivalence classes. [2025-04-13 18:03:15,147 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-04-13 18:03:15,147 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 18:03:15,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:03:15,236 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 18:03:15,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:03:15,236 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485830125] [2025-04-13 18:03:15,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1485830125] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:03:15,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:03:15,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 18:03:15,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723494813] [2025-04-13 18:03:15,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:03:15,236 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 18:03:15,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:03:15,236 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 18:03:15,236 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-04-13 18:03:15,236 INFO L87 Difference]: Start difference. First operand 6910 states and 20180 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 18:03:15,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:03:15,530 INFO L93 Difference]: Finished difference Result 7875 states and 22780 transitions. [2025-04-13 18:03:15,530 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-13 18:03:15,531 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 18:03:15,531 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:03:15,581 INFO L225 Difference]: With dead ends: 7875 [2025-04-13 18:03:15,581 INFO L226 Difference]: Without dead ends: 7497 [2025-04-13 18:03:15,584 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 18:03:15,584 INFO L437 NwaCegarLoop]: 94 mSDtfsCounter, 202 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 706 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 514 SdHoareTripleChecker+Invalid, 711 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 706 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:03:15,584 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 514 Invalid, 711 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 706 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:03:15,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7497 states. [2025-04-13 18:03:15,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7497 to 6878. [2025-04-13 18:03:15,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6878 states, 6877 states have (on average 2.9163879598662206) internal successors, (20056), 6877 states have internal predecessors, (20056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:03:15,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6878 states to 6878 states and 20056 transitions. [2025-04-13 18:03:15,720 INFO L79 Accepts]: Start accepts. Automaton has 6878 states and 20056 transitions. Word has length 69 [2025-04-13 18:03:15,720 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:03:15,720 INFO L485 AbstractCegarLoop]: Abstraction has 6878 states and 20056 transitions. [2025-04-13 18:03:15,720 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 18:03:15,720 INFO L278 IsEmpty]: Start isEmpty. Operand 6878 states and 20056 transitions. [2025-04-13 18:03:15,729 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-04-13 18:03:15,729 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:03:15,729 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 18:03:15,729 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78 [2025-04-13 18:03:15,729 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 18:03:15,730 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:03:15,730 INFO L85 PathProgramCache]: Analyzing trace with hash 1803144203, now seen corresponding path program 3 times [2025-04-13 18:03:15,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:03:15,730 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842583010] [2025-04-13 18:03:15,730 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:03:15,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:03:15,733 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 69 statements into 1 equivalence classes. [2025-04-13 18:03:15,736 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-04-13 18:03:15,736 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 18:03:15,736 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:03:15,818 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 18:03:15,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:03:15,818 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842583010] [2025-04-13 18:03:15,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842583010] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:03:15,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:03:15,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 18:03:15,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573995988] [2025-04-13 18:03:15,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:03:15,819 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 18:03:15,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:03:15,819 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 18:03:15,819 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-04-13 18:03:15,819 INFO L87 Difference]: Start difference. First operand 6878 states and 20056 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 18:03:16,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:03:16,276 INFO L93 Difference]: Finished difference Result 9965 states and 28283 transitions. [2025-04-13 18:03:16,276 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-13 18:03:16,276 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 18:03:16,276 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:03:16,334 INFO L225 Difference]: With dead ends: 9965 [2025-04-13 18:03:16,334 INFO L226 Difference]: Without dead ends: 9472 [2025-04-13 18:03:16,338 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=181, Invalid=469, Unknown=0, NotChecked=0, Total=650 [2025-04-13 18:03:16,338 INFO L437 NwaCegarLoop]: 124 mSDtfsCounter, 366 mSDsluCounter, 592 mSDsCounter, 0 mSdLazyCounter, 936 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 366 SdHoareTripleChecker+Valid, 716 SdHoareTripleChecker+Invalid, 952 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 936 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:03:16,338 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [366 Valid, 716 Invalid, 952 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 936 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:03:16,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9472 states. [2025-04-13 18:03:16,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9472 to 6831. [2025-04-13 18:03:16,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6831 states, 6830 states have (on average 2.9083455344070277) internal successors, (19864), 6830 states have internal predecessors, (19864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:03:16,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6831 states to 6831 states and 19864 transitions. [2025-04-13 18:03:16,520 INFO L79 Accepts]: Start accepts. Automaton has 6831 states and 19864 transitions. Word has length 69 [2025-04-13 18:03:16,520 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:03:16,520 INFO L485 AbstractCegarLoop]: Abstraction has 6831 states and 19864 transitions. [2025-04-13 18:03:16,520 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 18:03:16,520 INFO L278 IsEmpty]: Start isEmpty. Operand 6831 states and 19864 transitions. [2025-04-13 18:03:16,530 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-04-13 18:03:16,531 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:03:16,531 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 18:03:16,531 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79 [2025-04-13 18:03:16,531 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 18:03:16,531 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:03:16,531 INFO L85 PathProgramCache]: Analyzing trace with hash -1739743349, now seen corresponding path program 4 times [2025-04-13 18:03:16,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:03:16,531 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523853846] [2025-04-13 18:03:16,531 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:03:16,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:03:16,535 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 69 statements into 2 equivalence classes. [2025-04-13 18:03:16,540 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 18:03:16,540 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:03:16,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:03:16,653 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 18:03:16,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:03:16,653 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523853846] [2025-04-13 18:03:16,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523853846] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:03:16,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:03:16,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 18:03:16,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227890899] [2025-04-13 18:03:16,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:03:16,654 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 18:03:16,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:03:16,654 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 18:03:16,654 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-04-13 18:03:16,654 INFO L87 Difference]: Start difference. First operand 6831 states and 19864 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 18:03:17,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:03:17,085 INFO L93 Difference]: Finished difference Result 7285 states and 21077 transitions. [2025-04-13 18:03:17,085 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-13 18:03:17,085 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 18:03:17,085 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:03:17,149 INFO L225 Difference]: With dead ends: 7285 [2025-04-13 18:03:17,149 INFO L226 Difference]: Without dead ends: 6823 [2025-04-13 18:03:17,151 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 18:03:17,152 INFO L437 NwaCegarLoop]: 101 mSDtfsCounter, 185 mSDsluCounter, 400 mSDsCounter, 0 mSdLazyCounter, 786 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 501 SdHoareTripleChecker+Invalid, 790 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 786 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:03:17,152 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 501 Invalid, 790 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 786 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:03:17,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6823 states. [2025-04-13 18:03:17,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6823 to 6771. [2025-04-13 18:03:17,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6771 states, 6770 states have (on average 2.9096011816838994) internal successors, (19698), 6770 states have internal predecessors, (19698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:03:17,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6771 states to 6771 states and 19698 transitions. [2025-04-13 18:03:17,277 INFO L79 Accepts]: Start accepts. Automaton has 6771 states and 19698 transitions. Word has length 69 [2025-04-13 18:03:17,277 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:03:17,277 INFO L485 AbstractCegarLoop]: Abstraction has 6771 states and 19698 transitions. [2025-04-13 18:03:17,277 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 18:03:17,277 INFO L278 IsEmpty]: Start isEmpty. Operand 6771 states and 19698 transitions. [2025-04-13 18:03:17,285 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-04-13 18:03:17,285 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:03:17,285 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 18:03:17,286 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80 [2025-04-13 18:03:17,286 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 18:03:17,286 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:03:17,286 INFO L85 PathProgramCache]: Analyzing trace with hash -1434947235, now seen corresponding path program 1 times [2025-04-13 18:03:17,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:03:17,286 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486632137] [2025-04-13 18:03:17,286 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:03:17,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:03:17,289 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-04-13 18:03:17,292 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-04-13 18:03:17,292 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:03:17,292 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:03:17,378 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 18:03:17,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:03:17,378 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486632137] [2025-04-13 18:03:17,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486632137] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:03:17,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:03:17,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 18:03:17,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088712580] [2025-04-13 18:03:17,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:03:17,378 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 18:03:17,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:03:17,379 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 18:03:17,379 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-04-13 18:03:17,379 INFO L87 Difference]: Start difference. First operand 6771 states and 19698 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 18:03:17,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:03:17,836 INFO L93 Difference]: Finished difference Result 10890 states and 30870 transitions. [2025-04-13 18:03:17,836 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-04-13 18:03:17,836 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 18:03:17,836 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:03:17,901 INFO L225 Difference]: With dead ends: 10890 [2025-04-13 18:03:17,901 INFO L226 Difference]: Without dead ends: 10576 [2025-04-13 18:03:17,905 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=233, Invalid=697, Unknown=0, NotChecked=0, Total=930 [2025-04-13 18:03:17,905 INFO L437 NwaCegarLoop]: 136 mSDtfsCounter, 409 mSDsluCounter, 532 mSDsCounter, 0 mSdLazyCounter, 719 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 409 SdHoareTripleChecker+Valid, 668 SdHoareTripleChecker+Invalid, 738 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 719 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:03:17,905 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [409 Valid, 668 Invalid, 738 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 719 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:03:17,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10576 states. [2025-04-13 18:03:17,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10576 to 6777. [2025-04-13 18:03:17,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6777 states, 6776 states have (on average 2.90599173553719) internal successors, (19691), 6776 states have internal predecessors, (19691), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:03:18,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6777 states to 6777 states and 19691 transitions. [2025-04-13 18:03:18,065 INFO L79 Accepts]: Start accepts. Automaton has 6777 states and 19691 transitions. Word has length 69 [2025-04-13 18:03:18,065 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:03:18,065 INFO L485 AbstractCegarLoop]: Abstraction has 6777 states and 19691 transitions. [2025-04-13 18:03:18,065 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 18:03:18,065 INFO L278 IsEmpty]: Start isEmpty. Operand 6777 states and 19691 transitions. [2025-04-13 18:03:18,074 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-04-13 18:03:18,074 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:03:18,074 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 18:03:18,074 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81 [2025-04-13 18:03:18,074 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 18:03:18,075 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:03:18,075 INFO L85 PathProgramCache]: Analyzing trace with hash -702608565, now seen corresponding path program 5 times [2025-04-13 18:03:18,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:03:18,075 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800339323] [2025-04-13 18:03:18,075 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:03:18,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:03:18,078 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 69 statements into 1 equivalence classes. [2025-04-13 18:03:18,082 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-04-13 18:03:18,082 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:03:18,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:03:18,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 18:03:18,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:03:18,171 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800339323] [2025-04-13 18:03:18,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800339323] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:03:18,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:03:18,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 18:03:18,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391611990] [2025-04-13 18:03:18,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:03:18,172 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 18:03:18,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:03:18,172 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 18:03:18,172 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-04-13 18:03:18,172 INFO L87 Difference]: Start difference. First operand 6777 states and 19691 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 18:03:18,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:03:18,524 INFO L93 Difference]: Finished difference Result 8285 states and 23872 transitions. [2025-04-13 18:03:18,525 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 18:03:18,525 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 18:03:18,525 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:03:18,589 INFO L225 Difference]: With dead ends: 8285 [2025-04-13 18:03:18,589 INFO L226 Difference]: Without dead ends: 7739 [2025-04-13 18:03:18,593 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 18:03:18,594 INFO L437 NwaCegarLoop]: 87 mSDtfsCounter, 232 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 574 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 583 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 574 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:03:18,594 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [232 Valid, 408 Invalid, 583 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 574 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:03:18,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7739 states. [2025-04-13 18:03:18,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7739 to 6857. [2025-04-13 18:03:18,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6857 states, 6856 states have (on average 2.905338389731622) internal successors, (19919), 6856 states have internal predecessors, (19919), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:03:18,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6857 states to 6857 states and 19919 transitions. [2025-04-13 18:03:18,732 INFO L79 Accepts]: Start accepts. Automaton has 6857 states and 19919 transitions. Word has length 69 [2025-04-13 18:03:18,732 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:03:18,732 INFO L485 AbstractCegarLoop]: Abstraction has 6857 states and 19919 transitions. [2025-04-13 18:03:18,732 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 18:03:18,732 INFO L278 IsEmpty]: Start isEmpty. Operand 6857 states and 19919 transitions. [2025-04-13 18:03:18,741 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-04-13 18:03:18,742 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:03:18,742 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 18:03:18,742 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82 [2025-04-13 18:03:18,742 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 18:03:18,742 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:03:18,742 INFO L85 PathProgramCache]: Analyzing trace with hash 569658237, now seen corresponding path program 2 times [2025-04-13 18:03:18,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:03:18,742 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019133903] [2025-04-13 18:03:18,742 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:03:18,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:03:18,746 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 69 statements into 1 equivalence classes. [2025-04-13 18:03:18,748 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-04-13 18:03:18,748 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:03:18,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:03:18,834 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 18:03:18,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:03:18,834 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019133903] [2025-04-13 18:03:18,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2019133903] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:03:18,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:03:18,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 18:03:18,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578818460] [2025-04-13 18:03:18,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:03:18,835 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 18:03:18,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:03:18,835 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 18:03:18,835 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-04-13 18:03:18,835 INFO L87 Difference]: Start difference. First operand 6857 states and 19919 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 18:03:19,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:03:19,385 INFO L93 Difference]: Finished difference Result 11018 states and 31154 transitions. [2025-04-13 18:03:19,385 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-04-13 18:03:19,385 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 18:03:19,385 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:03:19,457 INFO L225 Difference]: With dead ends: 11018 [2025-04-13 18:03:19,457 INFO L226 Difference]: Without dead ends: 10422 [2025-04-13 18:03:19,461 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 261 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=274, Invalid=848, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 18:03:19,461 INFO L437 NwaCegarLoop]: 146 mSDtfsCounter, 412 mSDsluCounter, 710 mSDsCounter, 0 mSdLazyCounter, 993 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 412 SdHoareTripleChecker+Valid, 856 SdHoareTripleChecker+Invalid, 1012 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 993 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:03:19,461 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [412 Valid, 856 Invalid, 1012 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 993 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:03:19,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10422 states. [2025-04-13 18:03:19,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10422 to 6775. [2025-04-13 18:03:19,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6775 states, 6774 states have (on average 2.90227339828757) internal successors, (19660), 6774 states have internal predecessors, (19660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:03:19,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6775 states to 6775 states and 19660 transitions. [2025-04-13 18:03:19,623 INFO L79 Accepts]: Start accepts. Automaton has 6775 states and 19660 transitions. Word has length 69 [2025-04-13 18:03:19,623 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:03:19,624 INFO L485 AbstractCegarLoop]: Abstraction has 6775 states and 19660 transitions. [2025-04-13 18:03:19,624 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 18:03:19,624 INFO L278 IsEmpty]: Start isEmpty. Operand 6775 states and 19660 transitions. [2025-04-13 18:03:19,633 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-04-13 18:03:19,634 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:03:19,634 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 18:03:19,634 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83 [2025-04-13 18:03:19,634 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 18:03:19,634 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:03:19,634 INFO L85 PathProgramCache]: Analyzing trace with hash -416852213, now seen corresponding path program 6 times [2025-04-13 18:03:19,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:03:19,634 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182011225] [2025-04-13 18:03:19,634 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:03:19,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:03:19,638 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 69 statements into 1 equivalence classes. [2025-04-13 18:03:19,640 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-04-13 18:03:19,640 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 18:03:19,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:03:19,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 18:03:19,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:03:19,728 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182011225] [2025-04-13 18:03:19,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182011225] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:03:19,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:03:19,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 18:03:19,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851404695] [2025-04-13 18:03:19,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:03:19,728 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 18:03:19,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:03:19,729 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 18:03:19,729 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-04-13 18:03:19,729 INFO L87 Difference]: Start difference. First operand 6775 states and 19660 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 18:03:20,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:03:20,067 INFO L93 Difference]: Finished difference Result 7955 states and 22899 transitions. [2025-04-13 18:03:20,067 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 18:03:20,067 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 18:03:20,067 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:03:20,129 INFO L225 Difference]: With dead ends: 7955 [2025-04-13 18:03:20,129 INFO L226 Difference]: Without dead ends: 7625 [2025-04-13 18:03:20,132 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 18:03:20,132 INFO L437 NwaCegarLoop]: 89 mSDtfsCounter, 214 mSDsluCounter, 405 mSDsCounter, 0 mSdLazyCounter, 684 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 494 SdHoareTripleChecker+Invalid, 691 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 684 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:03:20,132 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 494 Invalid, 691 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 684 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:03:20,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7625 states. [2025-04-13 18:03:20,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7625 to 6743. [2025-04-13 18:03:20,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6743 states, 6742 states have (on average 2.900622960545832) internal successors, (19556), 6742 states have internal predecessors, (19556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:03:20,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6743 states to 6743 states and 19556 transitions. [2025-04-13 18:03:20,276 INFO L79 Accepts]: Start accepts. Automaton has 6743 states and 19556 transitions. Word has length 69 [2025-04-13 18:03:20,277 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:03:20,277 INFO L485 AbstractCegarLoop]: Abstraction has 6743 states and 19556 transitions. [2025-04-13 18:03:20,277 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 18:03:20,277 INFO L278 IsEmpty]: Start isEmpty. Operand 6743 states and 19556 transitions. [2025-04-13 18:03:20,286 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-04-13 18:03:20,287 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:03:20,287 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 18:03:20,287 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84 [2025-04-13 18:03:20,287 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 18:03:20,287 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:03:20,287 INFO L85 PathProgramCache]: Analyzing trace with hash -75065567, now seen corresponding path program 3 times [2025-04-13 18:03:20,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:03:20,287 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344025737] [2025-04-13 18:03:20,287 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:03:20,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:03:20,291 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 69 statements into 1 equivalence classes. [2025-04-13 18:03:20,293 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-04-13 18:03:20,294 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 18:03:20,294 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:03:20,384 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 18:03:20,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:03:20,385 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344025737] [2025-04-13 18:03:20,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344025737] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:03:20,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:03:20,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 18:03:20,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820550600] [2025-04-13 18:03:20,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:03:20,385 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 18:03:20,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:03:20,385 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 18:03:20,385 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-04-13 18:03:20,385 INFO L87 Difference]: Start difference. First operand 6743 states and 19556 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 18:03:20,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:03:20,833 INFO L93 Difference]: Finished difference Result 9953 states and 28210 transitions. [2025-04-13 18:03:20,833 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-13 18:03:20,834 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 18:03:20,834 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:03:20,899 INFO L225 Difference]: With dead ends: 9953 [2025-04-13 18:03:20,899 INFO L226 Difference]: Without dead ends: 9595 [2025-04-13 18:03:20,903 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=203, Invalid=553, Unknown=0, NotChecked=0, Total=756 [2025-04-13 18:03:20,906 INFO L437 NwaCegarLoop]: 127 mSDtfsCounter, 376 mSDsluCounter, 493 mSDsCounter, 0 mSdLazyCounter, 683 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 376 SdHoareTripleChecker+Valid, 620 SdHoareTripleChecker+Invalid, 697 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 683 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:03:20,906 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [376 Valid, 620 Invalid, 697 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 683 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:03:20,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9595 states. [2025-04-13 18:03:20,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9595 to 6585. [2025-04-13 18:03:20,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6585 states, 6584 states have (on average 2.8965674362089917) internal successors, (19071), 6584 states have internal predecessors, (19071), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:03:21,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6585 states to 6585 states and 19071 transitions. [2025-04-13 18:03:21,063 INFO L79 Accepts]: Start accepts. Automaton has 6585 states and 19071 transitions. Word has length 69 [2025-04-13 18:03:21,063 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:03:21,063 INFO L485 AbstractCegarLoop]: Abstraction has 6585 states and 19071 transitions. [2025-04-13 18:03:21,063 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 18:03:21,063 INFO L278 IsEmpty]: Start isEmpty. Operand 6585 states and 19071 transitions. [2025-04-13 18:03:21,072 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-04-13 18:03:21,072 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:03:21,072 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 18:03:21,072 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable85 [2025-04-13 18:03:21,072 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 18:03:21,073 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:03:21,073 INFO L85 PathProgramCache]: Analyzing trace with hash -1364690455, now seen corresponding path program 7 times [2025-04-13 18:03:21,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:03:21,073 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479451000] [2025-04-13 18:03:21,073 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:03:21,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:03:21,076 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-04-13 18:03:21,078 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-04-13 18:03:21,079 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:03:21,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:03:21,167 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 18:03:21,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:03:21,167 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479451000] [2025-04-13 18:03:21,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479451000] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:03:21,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:03:21,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 18:03:21,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730875302] [2025-04-13 18:03:21,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:03:21,168 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 18:03:21,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:03:21,168 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 18:03:21,168 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-04-13 18:03:21,168 INFO L87 Difference]: Start difference. First operand 6585 states and 19071 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 18:03:21,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:03:21,542 INFO L93 Difference]: Finished difference Result 8013 states and 22992 transitions. [2025-04-13 18:03:21,542 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-13 18:03:21,542 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 18:03:21,543 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:03:21,609 INFO L225 Difference]: With dead ends: 8013 [2025-04-13 18:03:21,609 INFO L226 Difference]: Without dead ends: 7635 [2025-04-13 18:03:21,613 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 18:03:21,614 INFO L437 NwaCegarLoop]: 89 mSDtfsCounter, 228 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 737 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 530 SdHoareTripleChecker+Invalid, 744 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 737 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:03:21,614 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 530 Invalid, 744 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 737 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:03:21,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7635 states. [2025-04-13 18:03:21,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7635 to 6553. [2025-04-13 18:03:21,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6553 states, 6552 states have (on average 2.897283272283272) internal successors, (18983), 6552 states have internal predecessors, (18983), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:03:21,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6553 states to 6553 states and 18983 transitions. [2025-04-13 18:03:21,768 INFO L79 Accepts]: Start accepts. Automaton has 6553 states and 18983 transitions. Word has length 69 [2025-04-13 18:03:21,769 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:03:21,769 INFO L485 AbstractCegarLoop]: Abstraction has 6553 states and 18983 transitions. [2025-04-13 18:03:21,769 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 18:03:21,769 INFO L278 IsEmpty]: Start isEmpty. Operand 6553 states and 18983 transitions. [2025-04-13 18:03:21,777 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-04-13 18:03:21,777 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:03:21,777 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 18:03:21,778 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86 [2025-04-13 18:03:21,778 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 18:03:21,778 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:03:21,778 INFO L85 PathProgramCache]: Analyzing trace with hash 1118959348, now seen corresponding path program 1 times [2025-04-13 18:03:21,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:03:21,778 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066968387] [2025-04-13 18:03:21,778 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:03:21,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:03:21,781 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-04-13 18:03:21,784 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-04-13 18:03:21,784 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:03:21,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:03:21,879 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 18:03:21,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:03:21,880 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066968387] [2025-04-13 18:03:21,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066968387] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:03:21,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:03:21,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 18:03:21,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950656743] [2025-04-13 18:03:21,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:03:21,880 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 18:03:21,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:03:21,880 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 18:03:21,880 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-04-13 18:03:21,880 INFO L87 Difference]: Start difference. First operand 6553 states and 18983 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 18:03:22,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:03:22,373 INFO L93 Difference]: Finished difference Result 10113 states and 28760 transitions. [2025-04-13 18:03:22,374 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-13 18:03:22,374 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 18:03:22,374 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:03:22,435 INFO L225 Difference]: With dead ends: 10113 [2025-04-13 18:03:22,435 INFO L226 Difference]: Without dead ends: 9122 [2025-04-13 18:03:22,439 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=205, Invalid=551, Unknown=0, NotChecked=0, Total=756 [2025-04-13 18:03:22,439 INFO L437 NwaCegarLoop]: 118 mSDtfsCounter, 322 mSDsluCounter, 423 mSDsCounter, 0 mSdLazyCounter, 757 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 322 SdHoareTripleChecker+Valid, 541 SdHoareTripleChecker+Invalid, 782 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 757 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:03:22,439 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [322 Valid, 541 Invalid, 782 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 757 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:03:22,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9122 states. [2025-04-13 18:03:22,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9122 to 6706. [2025-04-13 18:03:22,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6706 states, 6705 states have (on average 2.902460850111857) internal successors, (19461), 6705 states have internal predecessors, (19461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:03:22,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6706 states to 6706 states and 19461 transitions. [2025-04-13 18:03:22,586 INFO L79 Accepts]: Start accepts. Automaton has 6706 states and 19461 transitions. Word has length 69 [2025-04-13 18:03:22,586 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:03:22,586 INFO L485 AbstractCegarLoop]: Abstraction has 6706 states and 19461 transitions. [2025-04-13 18:03:22,586 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 18:03:22,586 INFO L278 IsEmpty]: Start isEmpty. Operand 6706 states and 19461 transitions. [2025-04-13 18:03:22,594 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-04-13 18:03:22,595 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:03:22,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 18:03:22,595 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable87 [2025-04-13 18:03:22,595 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 18:03:22,595 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:03:22,595 INFO L85 PathProgramCache]: Analyzing trace with hash -1876376121, now seen corresponding path program 8 times [2025-04-13 18:03:22,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:03:22,595 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225695360] [2025-04-13 18:03:22,595 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:03:22,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:03:22,598 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 69 statements into 1 equivalence classes. [2025-04-13 18:03:22,601 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-04-13 18:03:22,601 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:03:22,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:03:22,700 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 18:03:22,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:03:22,700 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225695360] [2025-04-13 18:03:22,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [225695360] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:03:22,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:03:22,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 18:03:22,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197381428] [2025-04-13 18:03:22,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:03:22,700 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 18:03:22,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:03:22,701 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 18:03:22,701 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-04-13 18:03:22,701 INFO L87 Difference]: Start difference. First operand 6706 states and 19461 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 18:03:23,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:03:23,175 INFO L93 Difference]: Finished difference Result 8109 states and 23261 transitions. [2025-04-13 18:03:23,175 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-04-13 18:03:23,176 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 18:03:23,176 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:03:23,232 INFO L225 Difference]: With dead ends: 8109 [2025-04-13 18:03:23,232 INFO L226 Difference]: Without dead ends: 7811 [2025-04-13 18:03:23,236 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=233, Invalid=579, Unknown=0, NotChecked=0, Total=812 [2025-04-13 18:03:23,236 INFO L437 NwaCegarLoop]: 105 mSDtfsCounter, 300 mSDsluCounter, 425 mSDsCounter, 0 mSdLazyCounter, 698 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 300 SdHoareTripleChecker+Valid, 530 SdHoareTripleChecker+Invalid, 717 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 698 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:03:23,236 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [300 Valid, 530 Invalid, 717 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 698 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:03:23,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7811 states. [2025-04-13 18:03:23,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7811 to 6754. [2025-04-13 18:03:23,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6754 states, 6753 states have (on average 2.9025618243743523) internal successors, (19601), 6753 states have internal predecessors, (19601), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:03:23,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6754 states to 6754 states and 19601 transitions. [2025-04-13 18:03:23,373 INFO L79 Accepts]: Start accepts. Automaton has 6754 states and 19601 transitions. Word has length 69 [2025-04-13 18:03:23,373 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:03:23,373 INFO L485 AbstractCegarLoop]: Abstraction has 6754 states and 19601 transitions. [2025-04-13 18:03:23,373 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 18:03:23,373 INFO L278 IsEmpty]: Start isEmpty. Operand 6754 states and 19601 transitions. [2025-04-13 18:03:23,381 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-04-13 18:03:23,382 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:03:23,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, 1] [2025-04-13 18:03:23,382 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable88 [2025-04-13 18:03:23,382 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 18:03:23,382 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:03:23,382 INFO L85 PathProgramCache]: Analyzing trace with hash -1171402476, now seen corresponding path program 2 times [2025-04-13 18:03:23,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:03:23,382 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650753672] [2025-04-13 18:03:23,382 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:03:23,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:03:23,385 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 69 statements into 1 equivalence classes. [2025-04-13 18:03:23,388 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-04-13 18:03:23,388 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:03:23,388 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:03:23,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 18:03:23,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:03:23,479 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650753672] [2025-04-13 18:03:23,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650753672] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:03:23,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:03:23,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 18:03:23,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213992818] [2025-04-13 18:03:23,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:03:23,479 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 18:03:23,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:03:23,480 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 18:03:23,480 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-04-13 18:03:23,480 INFO L87 Difference]: Start difference. First operand 6754 states and 19601 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 18:03:23,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:03:23,826 INFO L93 Difference]: Finished difference Result 9249 states and 26277 transitions. [2025-04-13 18:03:23,827 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 18:03:23,827 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 18:03:23,827 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:03:23,889 INFO L225 Difference]: With dead ends: 9249 [2025-04-13 18:03:23,889 INFO L226 Difference]: Without dead ends: 8402 [2025-04-13 18:03:23,894 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 18:03:23,894 INFO L437 NwaCegarLoop]: 98 mSDtfsCounter, 256 mSDsluCounter, 363 mSDsCounter, 0 mSdLazyCounter, 672 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 256 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 681 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 672 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:03:23,895 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [256 Valid, 461 Invalid, 681 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 672 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:03:23,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8402 states. [2025-04-13 18:03:23,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8402 to 6686. [2025-04-13 18:03:23,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6686 states, 6685 states have (on average 2.899177262528048) internal successors, (19381), 6685 states have internal predecessors, (19381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:03:24,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6686 states to 6686 states and 19381 transitions. [2025-04-13 18:03:24,076 INFO L79 Accepts]: Start accepts. Automaton has 6686 states and 19381 transitions. Word has length 69 [2025-04-13 18:03:24,077 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:03:24,077 INFO L485 AbstractCegarLoop]: Abstraction has 6686 states and 19381 transitions. [2025-04-13 18:03:24,077 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 18:03:24,077 INFO L278 IsEmpty]: Start isEmpty. Operand 6686 states and 19381 transitions. [2025-04-13 18:03:24,087 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-04-13 18:03:24,088 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:03:24,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, 1] [2025-04-13 18:03:24,088 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable89 [2025-04-13 18:03:24,088 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 18:03:24,088 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:03:24,088 INFO L85 PathProgramCache]: Analyzing trace with hash -1590619769, now seen corresponding path program 9 times [2025-04-13 18:03:24,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:03:24,088 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198677899] [2025-04-13 18:03:24,089 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:03:24,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:03:24,092 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 69 statements into 1 equivalence classes. [2025-04-13 18:03:24,096 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-04-13 18:03:24,096 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 18:03:24,096 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:03:24,211 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 18:03:24,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:03:24,211 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198677899] [2025-04-13 18:03:24,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198677899] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:03:24,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:03:24,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 18:03:24,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309497945] [2025-04-13 18:03:24,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:03:24,212 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 18:03:24,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:03:24,212 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 18:03:24,212 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-04-13 18:03:24,212 INFO L87 Difference]: Start difference. First operand 6686 states and 19381 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 18:03:24,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:03:24,648 INFO L93 Difference]: Finished difference Result 8201 states and 23447 transitions. [2025-04-13 18:03:24,649 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-13 18:03:24,649 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 18:03:24,649 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:03:24,721 INFO L225 Difference]: With dead ends: 8201 [2025-04-13 18:03:24,721 INFO L226 Difference]: Without dead ends: 7523 [2025-04-13 18:03:24,725 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=229, Invalid=641, Unknown=0, NotChecked=0, Total=870 [2025-04-13 18:03:24,725 INFO L437 NwaCegarLoop]: 105 mSDtfsCounter, 315 mSDsluCounter, 396 mSDsCounter, 0 mSdLazyCounter, 633 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 315 SdHoareTripleChecker+Valid, 501 SdHoareTripleChecker+Invalid, 654 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 633 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:03:24,725 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [315 Valid, 501 Invalid, 654 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 633 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:03:24,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7523 states. [2025-04-13 18:03:24,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7523 to 6610. [2025-04-13 18:03:24,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6610 states, 6609 states have (on average 2.8983204720835225) internal successors, (19155), 6609 states have internal predecessors, (19155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:03:24,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6610 states to 6610 states and 19155 transitions. [2025-04-13 18:03:24,864 INFO L79 Accepts]: Start accepts. Automaton has 6610 states and 19155 transitions. Word has length 69 [2025-04-13 18:03:24,864 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:03:24,864 INFO L485 AbstractCegarLoop]: Abstraction has 6610 states and 19155 transitions. [2025-04-13 18:03:24,864 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 18:03:24,864 INFO L278 IsEmpty]: Start isEmpty. Operand 6610 states and 19155 transitions. [2025-04-13 18:03:24,873 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-04-13 18:03:24,873 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:03:24,873 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 18:03:24,873 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90 [2025-04-13 18:03:24,873 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 18:03:24,874 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:03:24,874 INFO L85 PathProgramCache]: Analyzing trace with hash 1986791156, now seen corresponding path program 3 times [2025-04-13 18:03:24,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:03:24,874 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890006541] [2025-04-13 18:03:24,874 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:03:24,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:03:24,877 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 69 statements into 1 equivalence classes. [2025-04-13 18:03:24,880 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-04-13 18:03:24,880 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 18:03:24,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:03:24,951 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 18:03:24,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:03:24,951 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890006541] [2025-04-13 18:03:24,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890006541] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:03:24,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:03:24,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 18:03:24,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334242505] [2025-04-13 18:03:24,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:03:24,952 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 18:03:24,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:03:24,952 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 18:03:24,952 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-04-13 18:03:24,952 INFO L87 Difference]: Start difference. First operand 6610 states and 19155 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 18:03:25,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:03:25,324 INFO L93 Difference]: Finished difference Result 9553 states and 26955 transitions. [2025-04-13 18:03:25,324 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-04-13 18:03:25,324 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 18:03:25,325 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:03:25,387 INFO L225 Difference]: With dead ends: 9553 [2025-04-13 18:03:25,387 INFO L226 Difference]: Without dead ends: 8734 [2025-04-13 18:03:25,391 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=183, Invalid=417, Unknown=0, NotChecked=0, Total=600 [2025-04-13 18:03:25,392 INFO L437 NwaCegarLoop]: 125 mSDtfsCounter, 329 mSDsluCounter, 372 mSDsCounter, 0 mSdLazyCounter, 542 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 329 SdHoareTripleChecker+Valid, 497 SdHoareTripleChecker+Invalid, 564 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 542 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:03:25,392 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [329 Valid, 497 Invalid, 564 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 542 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:03:25,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8734 states. [2025-04-13 18:03:25,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8734 to 6330. [2025-04-13 18:03:25,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6330 states, 6329 states have (on average 2.889556012008216) internal successors, (18288), 6329 states have internal predecessors, (18288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:03:25,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6330 states to 6330 states and 18288 transitions. [2025-04-13 18:03:25,543 INFO L79 Accepts]: Start accepts. Automaton has 6330 states and 18288 transitions. Word has length 69 [2025-04-13 18:03:25,544 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:03:25,544 INFO L485 AbstractCegarLoop]: Abstraction has 6330 states and 18288 transitions. [2025-04-13 18:03:25,544 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 18:03:25,544 INFO L278 IsEmpty]: Start isEmpty. Operand 6330 states and 18288 transitions. [2025-04-13 18:03:25,552 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-04-13 18:03:25,552 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:03:25,552 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 18:03:25,552 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable91 [2025-04-13 18:03:25,552 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 18:03:25,553 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:03:25,553 INFO L85 PathProgramCache]: Analyzing trace with hash -1729862171, now seen corresponding path program 10 times [2025-04-13 18:03:25,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:03:25,553 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155740921] [2025-04-13 18:03:25,553 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:03:25,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:03:25,556 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 69 statements into 2 equivalence classes. [2025-04-13 18:03:25,560 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 18:03:25,560 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:03:25,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:03:25,647 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 18:03:25,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:03:25,647 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155740921] [2025-04-13 18:03:25,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155740921] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:03:25,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:03:25,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 18:03:25,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773762047] [2025-04-13 18:03:25,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:03:25,647 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 18:03:25,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:03:25,648 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 18:03:25,648 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-04-13 18:03:25,648 INFO L87 Difference]: Start difference. First operand 6330 states and 18288 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 18:03:25,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:03:25,984 INFO L93 Difference]: Finished difference Result 7574 states and 21673 transitions. [2025-04-13 18:03:25,984 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 18:03:25,984 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 18:03:25,985 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:03:26,052 INFO L225 Difference]: With dead ends: 7574 [2025-04-13 18:03:26,052 INFO L226 Difference]: Without dead ends: 7028 [2025-04-13 18:03:26,055 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 18:03:26,056 INFO L437 NwaCegarLoop]: 86 mSDtfsCounter, 201 mSDsluCounter, 361 mSDsCounter, 0 mSdLazyCounter, 638 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 645 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 638 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:03:26,056 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 447 Invalid, 645 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 638 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:03:26,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7028 states. [2025-04-13 18:03:26,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7028 to 6366. [2025-04-13 18:03:26,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6366 states, 6365 states have (on average 2.886410054988217) internal successors, (18372), 6365 states have internal predecessors, (18372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:03:26,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6366 states to 6366 states and 18372 transitions. [2025-04-13 18:03:26,213 INFO L79 Accepts]: Start accepts. Automaton has 6366 states and 18372 transitions. Word has length 69 [2025-04-13 18:03:26,213 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:03:26,213 INFO L485 AbstractCegarLoop]: Abstraction has 6366 states and 18372 transitions. [2025-04-13 18:03:26,214 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 18:03:26,214 INFO L278 IsEmpty]: Start isEmpty. Operand 6366 states and 18372 transitions. [2025-04-13 18:03:26,222 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-04-13 18:03:26,222 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:03:26,222 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 18:03:26,222 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable92 [2025-04-13 18:03:26,223 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 18:03:26,223 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:03:26,223 INFO L85 PathProgramCache]: Analyzing trace with hash 1996642996, now seen corresponding path program 4 times [2025-04-13 18:03:26,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:03:26,223 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253124947] [2025-04-13 18:03:26,223 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:03:26,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:03:26,226 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 69 statements into 2 equivalence classes. [2025-04-13 18:03:26,230 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 18:03:26,230 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:03:26,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:03:26,328 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 18:03:26,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:03:26,328 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253124947] [2025-04-13 18:03:26,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253124947] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:03:26,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:03:26,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 18:03:26,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017302406] [2025-04-13 18:03:26,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:03:26,328 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 18:03:26,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:03:26,329 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 18:03:26,329 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-04-13 18:03:26,329 INFO L87 Difference]: Start difference. First operand 6366 states and 18372 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 18:03:26,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:03:26,732 INFO L93 Difference]: Finished difference Result 8947 states and 25291 transitions. [2025-04-13 18:03:26,732 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-13 18:03:26,732 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 18:03:26,732 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:03:26,807 INFO L225 Difference]: With dead ends: 8947 [2025-04-13 18:03:26,807 INFO L226 Difference]: Without dead ends: 8238 [2025-04-13 18:03:26,812 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 18:03:26,812 INFO L437 NwaCegarLoop]: 105 mSDtfsCounter, 256 mSDsluCounter, 417 mSDsCounter, 0 mSdLazyCounter, 769 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 256 SdHoareTripleChecker+Valid, 522 SdHoareTripleChecker+Invalid, 777 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 769 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:03:26,812 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [256 Valid, 522 Invalid, 777 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 769 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:03:26,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8238 states. [2025-04-13 18:03:26,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8238 to 6389. [2025-04-13 18:03:26,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6389 states, 6388 states have (on average 2.8869755792110205) internal successors, (18442), 6388 states have internal predecessors, (18442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:03:26,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6389 states to 6389 states and 18442 transitions. [2025-04-13 18:03:26,985 INFO L79 Accepts]: Start accepts. Automaton has 6389 states and 18442 transitions. Word has length 69 [2025-04-13 18:03:26,985 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:03:26,986 INFO L485 AbstractCegarLoop]: Abstraction has 6389 states and 18442 transitions. [2025-04-13 18:03:26,986 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 18:03:26,986 INFO L278 IsEmpty]: Start isEmpty. Operand 6389 states and 18442 transitions. [2025-04-13 18:03:26,995 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-04-13 18:03:26,995 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:03:26,995 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 18:03:26,995 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable93 [2025-04-13 18:03:26,995 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 18:03:26,995 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:03:26,995 INFO L85 PathProgramCache]: Analyzing trace with hash -1444105819, now seen corresponding path program 11 times [2025-04-13 18:03:26,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:03:26,995 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137995665] [2025-04-13 18:03:26,995 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:03:26,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:03:26,999 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 69 statements into 1 equivalence classes. [2025-04-13 18:03:27,002 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-04-13 18:03:27,002 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:03:27,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:03:27,095 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 18:03:27,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:03:27,096 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137995665] [2025-04-13 18:03:27,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137995665] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:03:27,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:03:27,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 18:03:27,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523216604] [2025-04-13 18:03:27,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:03:27,096 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 18:03:27,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:03:27,096 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 18:03:27,096 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-04-13 18:03:27,096 INFO L87 Difference]: Start difference. First operand 6389 states and 18442 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 18:03:27,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:03:27,410 INFO L93 Difference]: Finished difference Result 7360 states and 21052 transitions. [2025-04-13 18:03:27,410 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 18:03:27,410 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 18:03:27,410 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:03:27,476 INFO L225 Difference]: With dead ends: 7360 [2025-04-13 18:03:27,476 INFO L226 Difference]: Without dead ends: 7030 [2025-04-13 18:03:27,478 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 18:03:27,479 INFO L437 NwaCegarLoop]: 88 mSDtfsCounter, 199 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 574 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 432 SdHoareTripleChecker+Invalid, 579 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 574 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:03:27,479 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 432 Invalid, 579 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 574 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:03:27,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7030 states. [2025-04-13 18:03:27,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7030 to 6357. [2025-04-13 18:03:27,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6357 states, 6356 states have (on average 2.885147891755821) internal successors, (18338), 6356 states have internal predecessors, (18338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:03:27,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6357 states to 6357 states and 18338 transitions. [2025-04-13 18:03:27,663 INFO L79 Accepts]: Start accepts. Automaton has 6357 states and 18338 transitions. Word has length 69 [2025-04-13 18:03:27,664 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:03:27,664 INFO L485 AbstractCegarLoop]: Abstraction has 6357 states and 18338 transitions. [2025-04-13 18:03:27,664 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 18:03:27,664 INFO L278 IsEmpty]: Start isEmpty. Operand 6357 states and 18338 transitions. [2025-04-13 18:03:27,673 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-04-13 18:03:27,673 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:03:27,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] [2025-04-13 18:03:27,673 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable94 [2025-04-13 18:03:27,673 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 18:03:27,673 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:03:27,674 INFO L85 PathProgramCache]: Analyzing trace with hash -1343260912, now seen corresponding path program 5 times [2025-04-13 18:03:27,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:03:27,674 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578391391] [2025-04-13 18:03:27,674 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:03:27,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:03:27,677 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 69 statements into 1 equivalence classes. [2025-04-13 18:03:27,680 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-04-13 18:03:27,680 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:03:27,680 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:03:27,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 18:03:27,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:03:27,755 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578391391] [2025-04-13 18:03:27,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578391391] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:03:27,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:03:27,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 18:03:27,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264240977] [2025-04-13 18:03:27,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:03:27,756 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 18:03:27,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:03:27,756 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 18:03:27,756 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-04-13 18:03:27,756 INFO L87 Difference]: Start difference. First operand 6357 states and 18338 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 18:03:28,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:03:28,160 INFO L93 Difference]: Finished difference Result 9080 states and 25528 transitions. [2025-04-13 18:03:28,161 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-13 18:03:28,161 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 18:03:28,161 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:03:28,229 INFO L225 Difference]: With dead ends: 9080 [2025-04-13 18:03:28,229 INFO L226 Difference]: Without dead ends: 8639 [2025-04-13 18:03:28,232 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=159, Invalid=347, Unknown=0, NotChecked=0, Total=506 [2025-04-13 18:03:28,233 INFO L437 NwaCegarLoop]: 119 mSDtfsCounter, 294 mSDsluCounter, 510 mSDsCounter, 0 mSdLazyCounter, 855 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 629 SdHoareTripleChecker+Invalid, 874 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 855 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:03:28,233 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [294 Valid, 629 Invalid, 874 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 855 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:03:28,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8639 states. [2025-04-13 18:03:28,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8639 to 6196. [2025-04-13 18:03:28,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6196 states, 6195 states have (on average 2.8768361581920905) internal successors, (17822), 6195 states have internal predecessors, (17822), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:03:28,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6196 states to 6196 states and 17822 transitions. [2025-04-13 18:03:28,375 INFO L79 Accepts]: Start accepts. Automaton has 6196 states and 17822 transitions. Word has length 69 [2025-04-13 18:03:28,375 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:03:28,375 INFO L485 AbstractCegarLoop]: Abstraction has 6196 states and 17822 transitions. [2025-04-13 18:03:28,375 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 18:03:28,375 INFO L278 IsEmpty]: Start isEmpty. Operand 6196 states and 17822 transitions. [2025-04-13 18:03:28,383 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-04-13 18:03:28,384 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:03:28,384 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 18:03:28,384 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable95 [2025-04-13 18:03:28,384 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 18:03:28,384 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:03:28,384 INFO L85 PathProgramCache]: Analyzing trace with hash 1903023235, now seen corresponding path program 12 times [2025-04-13 18:03:28,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:03:28,384 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251682181] [2025-04-13 18:03:28,384 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:03:28,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:03:28,388 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 69 statements into 1 equivalence classes. [2025-04-13 18:03:28,390 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-04-13 18:03:28,391 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 18:03:28,391 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:03:28,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 18:03:28,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:03:28,478 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251682181] [2025-04-13 18:03:28,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251682181] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:03:28,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:03:28,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 18:03:28,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138587901] [2025-04-13 18:03:28,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:03:28,479 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 18:03:28,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:03:28,479 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 18:03:28,479 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-04-13 18:03:28,479 INFO L87 Difference]: Start difference. First operand 6196 states and 17822 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 18:03:28,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:03:28,834 INFO L93 Difference]: Finished difference Result 7186 states and 20475 transitions. [2025-04-13 18:03:28,834 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-13 18:03:28,834 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 18:03:28,835 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:03:28,893 INFO L225 Difference]: With dead ends: 7186 [2025-04-13 18:03:28,893 INFO L226 Difference]: Without dead ends: 6808 [2025-04-13 18:03:28,896 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 18:03:28,896 INFO L437 NwaCegarLoop]: 88 mSDtfsCounter, 228 mSDsluCounter, 401 mSDsCounter, 0 mSdLazyCounter, 642 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 489 SdHoareTripleChecker+Invalid, 647 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 642 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:03:28,896 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 489 Invalid, 647 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 642 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:03:28,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6808 states. [2025-04-13 18:03:28,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6808 to 6164. [2025-04-13 18:03:28,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6164 states, 6163 states have (on average 2.877494726594191) internal successors, (17734), 6163 states have internal predecessors, (17734), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:03:28,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6164 states to 6164 states and 17734 transitions. [2025-04-13 18:03:29,027 INFO L79 Accepts]: Start accepts. Automaton has 6164 states and 17734 transitions. Word has length 69 [2025-04-13 18:03:29,027 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:03:29,027 INFO L485 AbstractCegarLoop]: Abstraction has 6164 states and 17734 transitions. [2025-04-13 18:03:29,028 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 18:03:29,028 INFO L278 IsEmpty]: Start isEmpty. Operand 6164 states and 17734 transitions. [2025-04-13 18:03:29,035 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-04-13 18:03:29,036 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:03:29,036 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 18:03:29,036 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable96 [2025-04-13 18:03:29,036 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 18:03:29,036 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:03:29,036 INFO L85 PathProgramCache]: Analyzing trace with hash -1045448400, now seen corresponding path program 6 times [2025-04-13 18:03:29,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:03:29,036 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734152743] [2025-04-13 18:03:29,036 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:03:29,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:03:29,043 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 69 statements into 1 equivalence classes. [2025-04-13 18:03:29,045 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-04-13 18:03:29,046 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 18:03:29,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:03:29,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 18:03:29,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:03:29,149 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734152743] [2025-04-13 18:03:29,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1734152743] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:03:29,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:03:29,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 18:03:29,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078246445] [2025-04-13 18:03:29,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:03:29,149 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 18:03:29,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:03:29,149 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 18:03:29,150 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-04-13 18:03:29,150 INFO L87 Difference]: Start difference. First operand 6164 states and 17734 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 18:03:29,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:03:29,735 INFO L93 Difference]: Finished difference Result 9479 states and 26693 transitions. [2025-04-13 18:03:29,735 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-04-13 18:03:29,735 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 18:03:29,735 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:03:29,801 INFO L225 Difference]: With dead ends: 9479 [2025-04-13 18:03:29,801 INFO L226 Difference]: Without dead ends: 8488 [2025-04-13 18:03:29,805 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=244, Invalid=626, Unknown=0, NotChecked=0, Total=870 [2025-04-13 18:03:29,806 INFO L437 NwaCegarLoop]: 113 mSDtfsCounter, 381 mSDsluCounter, 597 mSDsCounter, 0 mSdLazyCounter, 1046 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 381 SdHoareTripleChecker+Valid, 710 SdHoareTripleChecker+Invalid, 1075 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1046 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 18:03:29,806 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [381 Valid, 710 Invalid, 1075 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1046 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 18:03:29,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8488 states. [2025-04-13 18:03:29,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8488 to 6232. [2025-04-13 18:03:29,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6232 states, 6231 states have (on average 2.8732145722997915) internal successors, (17903), 6231 states have internal predecessors, (17903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:03:29,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6232 states to 6232 states and 17903 transitions. [2025-04-13 18:03:29,990 INFO L79 Accepts]: Start accepts. Automaton has 6232 states and 17903 transitions. Word has length 69 [2025-04-13 18:03:29,991 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:03:29,991 INFO L485 AbstractCegarLoop]: Abstraction has 6232 states and 17903 transitions. [2025-04-13 18:03:29,991 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 18:03:29,991 INFO L278 IsEmpty]: Start isEmpty. Operand 6232 states and 17903 transitions. [2025-04-13 18:03:29,999 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-04-13 18:03:29,999 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:03:29,999 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 18:03:29,999 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable97 [2025-04-13 18:03:29,999 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 18:03:30,000 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:03:30,000 INFO L85 PathProgramCache]: Analyzing trace with hash 1391337569, now seen corresponding path program 13 times [2025-04-13 18:03:30,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:03:30,000 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896013037] [2025-04-13 18:03:30,000 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:03:30,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:03:30,003 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-04-13 18:03:30,006 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-04-13 18:03:30,006 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:03:30,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:03:30,117 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 18:03:30,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:03:30,117 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896013037] [2025-04-13 18:03:30,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896013037] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:03:30,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:03:30,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 18:03:30,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752198090] [2025-04-13 18:03:30,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:03:30,117 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 18:03:30,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:03:30,117 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 18:03:30,117 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-04-13 18:03:30,118 INFO L87 Difference]: Start difference. First operand 6232 states and 17903 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 18:03:30,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:03:30,620 INFO L93 Difference]: Finished difference Result 7720 states and 21940 transitions. [2025-04-13 18:03:30,620 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-13 18:03:30,620 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 18:03:30,620 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:03:30,688 INFO L225 Difference]: With dead ends: 7720 [2025-04-13 18:03:30,688 INFO L226 Difference]: Without dead ends: 7422 [2025-04-13 18:03:30,692 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=246, Invalid=566, Unknown=0, NotChecked=0, Total=812 [2025-04-13 18:03:30,692 INFO L437 NwaCegarLoop]: 101 mSDtfsCounter, 298 mSDsluCounter, 458 mSDsCounter, 0 mSdLazyCounter, 754 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 559 SdHoareTripleChecker+Invalid, 772 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 754 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:03:30,692 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [298 Valid, 559 Invalid, 772 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 754 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:03:30,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7422 states. [2025-04-13 18:03:30,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7422 to 6280. [2025-04-13 18:03:30,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6280 states, 6279 states have (on average 2.8735467431119606) internal successors, (18043), 6279 states have internal predecessors, (18043), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:03:30,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6280 states to 6280 states and 18043 transitions. [2025-04-13 18:03:30,854 INFO L79 Accepts]: Start accepts. Automaton has 6280 states and 18043 transitions. Word has length 69 [2025-04-13 18:03:30,854 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:03:30,854 INFO L485 AbstractCegarLoop]: Abstraction has 6280 states and 18043 transitions. [2025-04-13 18:03:30,854 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 18:03:30,854 INFO L278 IsEmpty]: Start isEmpty. Operand 6280 states and 18043 transitions. [2025-04-13 18:03:30,862 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-04-13 18:03:30,862 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:03:30,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 18:03:30,862 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable98 [2025-04-13 18:03:30,863 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 18:03:30,863 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:03:30,863 INFO L85 PathProgramCache]: Analyzing trace with hash 959157072, now seen corresponding path program 7 times [2025-04-13 18:03:30,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:03:30,863 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945441949] [2025-04-13 18:03:30,863 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:03:30,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:03:30,866 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-04-13 18:03:30,869 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-04-13 18:03:30,869 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:03:30,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:03:30,966 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 18:03:30,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:03:30,966 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945441949] [2025-04-13 18:03:30,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [945441949] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:03:30,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:03:30,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 18:03:30,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164652044] [2025-04-13 18:03:30,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:03:30,966 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 18:03:30,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:03:30,967 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 18:03:30,967 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-04-13 18:03:30,967 INFO L87 Difference]: Start difference. First operand 6280 states and 18043 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 18:03:31,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:03:31,410 INFO L93 Difference]: Finished difference Result 8580 states and 24189 transitions. [2025-04-13 18:03:31,411 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-13 18:03:31,411 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 18:03:31,411 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:03:31,472 INFO L225 Difference]: With dead ends: 8580 [2025-04-13 18:03:31,472 INFO L226 Difference]: Without dead ends: 8204 [2025-04-13 18:03:31,475 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=201, Invalid=449, Unknown=0, NotChecked=0, Total=650 [2025-04-13 18:03:31,475 INFO L437 NwaCegarLoop]: 102 mSDtfsCounter, 337 mSDsluCounter, 397 mSDsCounter, 0 mSdLazyCounter, 742 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 337 SdHoareTripleChecker+Valid, 499 SdHoareTripleChecker+Invalid, 759 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 742 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:03:31,475 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [337 Valid, 499 Invalid, 759 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 742 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:03:31,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8204 states. [2025-04-13 18:03:31,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8204 to 6229. [2025-04-13 18:03:31,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6229 states, 6228 states have (on average 2.876043673731535) internal successors, (17912), 6228 states have internal predecessors, (17912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:03:31,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6229 states to 6229 states and 17912 transitions. [2025-04-13 18:03:31,611 INFO L79 Accepts]: Start accepts. Automaton has 6229 states and 17912 transitions. Word has length 69 [2025-04-13 18:03:31,612 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:03:31,612 INFO L485 AbstractCegarLoop]: Abstraction has 6229 states and 17912 transitions. [2025-04-13 18:03:31,612 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 18:03:31,612 INFO L278 IsEmpty]: Start isEmpty. Operand 6229 states and 17912 transitions. [2025-04-13 18:03:31,620 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-04-13 18:03:31,620 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:03:31,620 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 18:03:31,620 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable99 [2025-04-13 18:03:31,620 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 18:03:31,620 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:03:31,620 INFO L85 PathProgramCache]: Analyzing trace with hash 1677093921, now seen corresponding path program 14 times [2025-04-13 18:03:31,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:03:31,621 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219468972] [2025-04-13 18:03:31,621 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:03:31,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:03:31,624 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 69 statements into 1 equivalence classes. [2025-04-13 18:03:31,626 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-04-13 18:03:31,626 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:03:31,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:03:31,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 18:03:31,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:03:31,726 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219468972] [2025-04-13 18:03:31,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219468972] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:03:31,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:03:31,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 18:03:31,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626448726] [2025-04-13 18:03:31,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:03:31,727 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 18:03:31,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:03:31,727 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 18:03:31,727 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-04-13 18:03:31,727 INFO L87 Difference]: Start difference. First operand 6229 states and 17912 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 18:03:32,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:03:32,162 INFO L93 Difference]: Finished difference Result 7571 states and 21523 transitions. [2025-04-13 18:03:32,162 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-13 18:03:32,162 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 18:03:32,162 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:03:32,226 INFO L225 Difference]: With dead ends: 7571 [2025-04-13 18:03:32,226 INFO L226 Difference]: Without dead ends: 6905 [2025-04-13 18:03:32,229 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=202, Invalid=500, Unknown=0, NotChecked=0, Total=702 [2025-04-13 18:03:32,229 INFO L437 NwaCegarLoop]: 96 mSDtfsCounter, 302 mSDsluCounter, 426 mSDsCounter, 0 mSdLazyCounter, 702 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 302 SdHoareTripleChecker+Valid, 522 SdHoareTripleChecker+Invalid, 718 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 702 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:03:32,229 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [302 Valid, 522 Invalid, 718 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 702 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:03:32,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6905 states. [2025-04-13 18:03:32,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6905 to 6165. [2025-04-13 18:03:32,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6165 states, 6164 states have (on average 2.8754055807916936) internal successors, (17724), 6164 states have internal predecessors, (17724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:03:32,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6165 states to 6165 states and 17724 transitions. [2025-04-13 18:03:32,400 INFO L79 Accepts]: Start accepts. Automaton has 6165 states and 17724 transitions. Word has length 69 [2025-04-13 18:03:32,400 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:03:32,400 INFO L485 AbstractCegarLoop]: Abstraction has 6165 states and 17724 transitions. [2025-04-13 18:03:32,400 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 18:03:32,401 INFO L278 IsEmpty]: Start isEmpty. Operand 6165 states and 17724 transitions. [2025-04-13 18:03:32,410 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-04-13 18:03:32,411 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:03:32,411 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 18:03:32,411 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable100 [2025-04-13 18:03:32,411 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 18:03:32,411 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:03:32,411 INFO L85 PathProgramCache]: Analyzing trace with hash -592043444, now seen corresponding path program 8 times [2025-04-13 18:03:32,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:03:32,411 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13866372] [2025-04-13 18:03:32,411 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:03:32,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:03:32,415 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 69 statements into 1 equivalence classes. [2025-04-13 18:03:32,418 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-04-13 18:03:32,418 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:03:32,418 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:03:32,509 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 18:03:32,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:03:32,509 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13866372] [2025-04-13 18:03:32,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13866372] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:03:32,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:03:32,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 18:03:32,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192654817] [2025-04-13 18:03:32,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:03:32,510 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 18:03:32,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:03:32,510 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 18:03:32,510 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-04-13 18:03:32,510 INFO L87 Difference]: Start difference. First operand 6165 states and 17724 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 18:03:32,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:03:32,836 INFO L93 Difference]: Finished difference Result 7666 states and 21721 transitions. [2025-04-13 18:03:32,836 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-13 18:03:32,836 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 18:03:32,836 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:03:32,902 INFO L225 Difference]: With dead ends: 7666 [2025-04-13 18:03:32,903 INFO L226 Difference]: Without dead ends: 6609 [2025-04-13 18:03:32,907 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 18:03:32,907 INFO L437 NwaCegarLoop]: 92 mSDtfsCounter, 184 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 676 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 685 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 676 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:03:32,907 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 448 Invalid, 685 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 676 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:03:32,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6609 states. [2025-04-13 18:03:32,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6609 to 6129. [2025-04-13 18:03:32,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6129 states, 6128 states have (on average 2.869125326370757) internal successors, (17582), 6128 states have internal predecessors, (17582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:03:32,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6129 states to 6129 states and 17582 transitions. [2025-04-13 18:03:33,050 INFO L79 Accepts]: Start accepts. Automaton has 6129 states and 17582 transitions. Word has length 69 [2025-04-13 18:03:33,050 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:03:33,050 INFO L485 AbstractCegarLoop]: Abstraction has 6129 states and 17582 transitions. [2025-04-13 18:03:33,050 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 18:03:33,050 INFO L278 IsEmpty]: Start isEmpty. Operand 6129 states and 17582 transitions. [2025-04-13 18:03:33,058 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-04-13 18:03:33,058 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:03:33,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 18:03:33,058 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable101 [2025-04-13 18:03:33,058 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 18:03:33,059 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:03:33,059 INFO L85 PathProgramCache]: Analyzing trace with hash 1067336651, now seen corresponding path program 15 times [2025-04-13 18:03:33,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:03:33,059 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278778635] [2025-04-13 18:03:33,059 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:03:33,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:03:33,066 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 69 statements into 1 equivalence classes. [2025-04-13 18:03:33,073 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-04-13 18:03:33,073 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 18:03:33,073 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:03:33,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 18:03:33,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:03:33,163 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278778635] [2025-04-13 18:03:33,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [278778635] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:03:33,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:03:33,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 18:03:33,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905439823] [2025-04-13 18:03:33,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:03:33,164 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 18:03:33,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:03:33,164 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 18:03:33,164 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-04-13 18:03:33,164 INFO L87 Difference]: Start difference. First operand 6129 states and 17582 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 18:03:33,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:03:33,459 INFO L93 Difference]: Finished difference Result 7128 states and 20280 transitions. [2025-04-13 18:03:33,459 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-13 18:03:33,459 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 18:03:33,459 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:03:33,525 INFO L225 Difference]: With dead ends: 7128 [2025-04-13 18:03:33,525 INFO L226 Difference]: Without dead ends: 6582 [2025-04-13 18:03:33,528 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 18:03:33,528 INFO L437 NwaCegarLoop]: 85 mSDtfsCounter, 172 mSDsluCounter, 362 mSDsCounter, 0 mSdLazyCounter, 619 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 625 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 619 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:03:33,528 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 447 Invalid, 625 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 619 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:03:33,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6582 states. [2025-04-13 18:03:33,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6582 to 6161. [2025-04-13 18:03:33,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6161 states, 6160 states have (on average 2.8659090909090907) internal successors, (17654), 6160 states have internal predecessors, (17654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:03:33,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6161 states to 6161 states and 17654 transitions. [2025-04-13 18:03:33,671 INFO L79 Accepts]: Start accepts. Automaton has 6161 states and 17654 transitions. Word has length 69 [2025-04-13 18:03:33,671 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:03:33,671 INFO L485 AbstractCegarLoop]: Abstraction has 6161 states and 17654 transitions. [2025-04-13 18:03:33,671 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 18:03:33,672 INFO L278 IsEmpty]: Start isEmpty. Operand 6161 states and 17654 transitions. [2025-04-13 18:03:33,679 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-04-13 18:03:33,680 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:03:33,680 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 18:03:33,680 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable102 [2025-04-13 18:03:33,680 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 18:03:33,681 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:03:33,681 INFO L85 PathProgramCache]: Analyzing trace with hash 1412562028, now seen corresponding path program 9 times [2025-04-13 18:03:33,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:03:33,681 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776015885] [2025-04-13 18:03:33,681 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:03:33,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:03:33,684 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 69 statements into 1 equivalence classes. [2025-04-13 18:03:33,687 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-04-13 18:03:33,687 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 18:03:33,687 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:03:33,779 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 18:03:33,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:03:33,779 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776015885] [2025-04-13 18:03:33,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776015885] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:03:33,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:03:33,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 18:03:33,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421695669] [2025-04-13 18:03:33,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:03:33,780 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 18:03:33,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:03:33,780 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 18:03:33,780 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-04-13 18:03:33,780 INFO L87 Difference]: Start difference. First operand 6161 states and 17654 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 18:03:34,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:03:34,154 INFO L93 Difference]: Finished difference Result 7231 states and 20487 transitions. [2025-04-13 18:03:34,154 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-13 18:03:34,154 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 18:03:34,155 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:03:34,226 INFO L225 Difference]: With dead ends: 7231 [2025-04-13 18:03:34,226 INFO L226 Difference]: Without dead ends: 6607 [2025-04-13 18:03:34,228 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 18:03:34,229 INFO L437 NwaCegarLoop]: 92 mSDtfsCounter, 168 mSDsluCounter, 424 mSDsCounter, 0 mSdLazyCounter, 724 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 516 SdHoareTripleChecker+Invalid, 731 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 724 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:03:34,229 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 516 Invalid, 731 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 724 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:03:34,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6607 states. [2025-04-13 18:03:34,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6607 to 6127. [2025-04-13 18:03:34,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6127 states, 6126 states have (on average 2.863858961802155) internal successors, (17544), 6126 states have internal predecessors, (17544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:03:34,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6127 states to 6127 states and 17544 transitions. [2025-04-13 18:03:34,366 INFO L79 Accepts]: Start accepts. Automaton has 6127 states and 17544 transitions. Word has length 69 [2025-04-13 18:03:34,366 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:03:34,366 INFO L485 AbstractCegarLoop]: Abstraction has 6127 states and 17544 transitions. [2025-04-13 18:03:34,366 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 18:03:34,367 INFO L278 IsEmpty]: Start isEmpty. Operand 6127 states and 17544 transitions. [2025-04-13 18:03:34,374 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-04-13 18:03:34,374 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:03:34,374 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 18:03:34,374 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable103 [2025-04-13 18:03:34,374 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 18:03:34,374 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:03:34,374 INFO L85 PathProgramCache]: Analyzing trace with hash 1353093003, now seen corresponding path program 16 times [2025-04-13 18:03:34,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:03:34,375 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085693530] [2025-04-13 18:03:34,375 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:03:34,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:03:34,378 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 69 statements into 2 equivalence classes. [2025-04-13 18:03:34,385 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 18:03:34,385 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:03:34,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:03:34,520 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 18:03:34,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:03:34,520 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085693530] [2025-04-13 18:03:34,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085693530] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:03:34,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:03:34,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 18:03:34,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329857323] [2025-04-13 18:03:34,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:03:34,521 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 18:03:34,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:03:34,521 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 18:03:34,521 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-04-13 18:03:34,521 INFO L87 Difference]: Start difference. First operand 6127 states and 17544 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 18:03:34,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:03:34,896 INFO L93 Difference]: Finished difference Result 6950 states and 19745 transitions. [2025-04-13 18:03:34,897 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-13 18:03:34,897 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 18:03:34,897 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:03:34,955 INFO L225 Difference]: With dead ends: 6950 [2025-04-13 18:03:34,955 INFO L226 Difference]: Without dead ends: 6078 [2025-04-13 18:03:34,958 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=122, Invalid=298, Unknown=0, NotChecked=0, Total=420 [2025-04-13 18:03:34,958 INFO L437 NwaCegarLoop]: 109 mSDtfsCounter, 209 mSDsluCounter, 511 mSDsCounter, 0 mSdLazyCounter, 755 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 620 SdHoareTripleChecker+Invalid, 773 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 755 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:03:34,959 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 620 Invalid, 773 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 755 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:03:34,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6078 states. [2025-04-13 18:03:35,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6078 to 5809. [2025-04-13 18:03:35,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5809 states, 5808 states have (on average 2.856577134986226) internal successors, (16591), 5808 states have internal predecessors, (16591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:03:35,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5809 states to 5809 states and 16591 transitions. [2025-04-13 18:03:35,097 INFO L79 Accepts]: Start accepts. Automaton has 5809 states and 16591 transitions. Word has length 69 [2025-04-13 18:03:35,097 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:03:35,097 INFO L485 AbstractCegarLoop]: Abstraction has 5809 states and 16591 transitions. [2025-04-13 18:03:35,097 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 18:03:35,097 INFO L278 IsEmpty]: Start isEmpty. Operand 5809 states and 16591 transitions. [2025-04-13 18:03:35,104 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-04-13 18:03:35,104 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:03:35,104 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 18:03:35,104 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable104 [2025-04-13 18:03:35,104 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 18:03:35,105 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:03:35,105 INFO L85 PathProgramCache]: Analyzing trace with hash -1524983248, now seen corresponding path program 10 times [2025-04-13 18:03:35,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:03:35,105 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123700626] [2025-04-13 18:03:35,105 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:03:35,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:03:35,112 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 69 statements into 2 equivalence classes. [2025-04-13 18:03:35,117 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 18:03:35,117 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 18:03:35,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:03:35,143 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 18:03:35,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:03:35,143 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123700626] [2025-04-13 18:03:35,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123700626] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:03:35,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:03:35,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 18:03:35,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681980191] [2025-04-13 18:03:35,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:03:35,143 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 18:03:35,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:03:35,143 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 18:03:35,143 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-04-13 18:03:35,144 INFO L87 Difference]: Start difference. First operand 5809 states and 16591 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 18:03:35,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:03:35,457 INFO L93 Difference]: Finished difference Result 8080 states and 22668 transitions. [2025-04-13 18:03:35,457 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-13 18:03:35,457 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 18:03:35,457 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:03:35,505 INFO L225 Difference]: With dead ends: 8080 [2025-04-13 18:03:35,505 INFO L226 Difference]: Without dead ends: 7619 [2025-04-13 18:03:35,507 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 18:03:35,507 INFO L437 NwaCegarLoop]: 93 mSDtfsCounter, 309 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 609 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 309 SdHoareTripleChecker+Valid, 425 SdHoareTripleChecker+Invalid, 630 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 609 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:03:35,507 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [309 Valid, 425 Invalid, 630 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 609 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:03:35,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7619 states. [2025-04-13 18:03:35,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7619 to 5775. [2025-04-13 18:03:35,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5775 states, 5774 states have (on average 2.856078974714236) internal successors, (16491), 5774 states have internal predecessors, (16491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:03:35,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5775 states to 5775 states and 16491 transitions. [2025-04-13 18:03:35,609 INFO L79 Accepts]: Start accepts. Automaton has 5775 states and 16491 transitions. Word has length 69 [2025-04-13 18:03:35,609 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:03:35,609 INFO L485 AbstractCegarLoop]: Abstraction has 5775 states and 16491 transitions. [2025-04-13 18:03:35,609 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 18:03:35,609 INFO L278 IsEmpty]: Start isEmpty. Operand 5775 states and 16491 transitions. [2025-04-13 18:03:35,620 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-04-13 18:03:35,620 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:03:35,620 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 18:03:35,621 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable105 [2025-04-13 18:03:35,621 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 18:03:35,621 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:03:35,621 INFO L85 PathProgramCache]: Analyzing trace with hash -1359774946, now seen corresponding path program 1 times [2025-04-13 18:03:35,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:03:35,621 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419858325] [2025-04-13 18:03:35,621 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:03:35,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:03:35,625 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-04-13 18:03:35,628 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-04-13 18:03:35,628 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:03:35,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:03:35,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 18:03:35,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:03:35,719 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419858325] [2025-04-13 18:03:35,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419858325] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:03:35,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:03:35,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 18:03:35,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113729909] [2025-04-13 18:03:35,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:03:35,720 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 18:03:35,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:03:35,720 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 18:03:35,720 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-04-13 18:03:35,720 INFO L87 Difference]: Start difference. First operand 5775 states and 16491 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 18:03:36,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:03:36,173 INFO L93 Difference]: Finished difference Result 9396 states and 26094 transitions. [2025-04-13 18:03:36,173 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-04-13 18:03:36,173 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 18:03:36,173 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:03:36,238 INFO L225 Difference]: With dead ends: 9396 [2025-04-13 18:03:36,238 INFO L226 Difference]: Without dead ends: 7916 [2025-04-13 18:03:36,242 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=227, Invalid=643, Unknown=0, NotChecked=0, Total=870 [2025-04-13 18:03:36,243 INFO L437 NwaCegarLoop]: 131 mSDtfsCounter, 439 mSDsluCounter, 524 mSDsCounter, 0 mSdLazyCounter, 764 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 439 SdHoareTripleChecker+Valid, 655 SdHoareTripleChecker+Invalid, 786 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 764 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:03:36,243 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [439 Valid, 655 Invalid, 786 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 764 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:03:36,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7916 states. [2025-04-13 18:03:36,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7916 to 5079. [2025-04-13 18:03:36,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5079 states, 5078 states have (on average 2.8404883812524617) internal successors, (14424), 5078 states have internal predecessors, (14424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:03:36,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5079 states to 5079 states and 14424 transitions. [2025-04-13 18:03:36,361 INFO L79 Accepts]: Start accepts. Automaton has 5079 states and 14424 transitions. Word has length 69 [2025-04-13 18:03:36,362 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:03:36,362 INFO L485 AbstractCegarLoop]: Abstraction has 5079 states and 14424 transitions. [2025-04-13 18:03:36,362 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 18:03:36,362 INFO L278 IsEmpty]: Start isEmpty. Operand 5079 states and 14424 transitions. [2025-04-13 18:03:36,367 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-04-13 18:03:36,367 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:03:36,367 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 18:03:36,367 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable106 [2025-04-13 18:03:36,367 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 18:03:36,368 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:03:36,368 INFO L85 PathProgramCache]: Analyzing trace with hash -1144654996, now seen corresponding path program 11 times [2025-04-13 18:03:36,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:03:36,368 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065784538] [2025-04-13 18:03:36,368 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:03:36,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:03:36,371 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 69 statements into 1 equivalence classes. [2025-04-13 18:03:36,373 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-04-13 18:03:36,373 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:03:36,373 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:03:36,413 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 18:03:36,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:03:36,413 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065784538] [2025-04-13 18:03:36,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065784538] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:03:36,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:03:36,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 18:03:36,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694928660] [2025-04-13 18:03:36,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:03:36,414 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 18:03:36,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:03:36,414 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 18:03:36,414 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-04-13 18:03:36,414 INFO L87 Difference]: Start difference. First operand 5079 states and 14424 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 18:03:36,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:03:36,676 INFO L93 Difference]: Finished difference Result 6550 states and 18259 transitions. [2025-04-13 18:03:36,676 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-13 18:03:36,676 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 18:03:36,677 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:03:36,722 INFO L225 Difference]: With dead ends: 6550 [2025-04-13 18:03:36,722 INFO L226 Difference]: Without dead ends: 5961 [2025-04-13 18:03:36,724 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2025-04-13 18:03:36,724 INFO L437 NwaCegarLoop]: 101 mSDtfsCounter, 240 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 508 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 508 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:03:36,724 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [240 Valid, 390 Invalid, 523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 508 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:03:36,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5961 states. [2025-04-13 18:03:36,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5961 to 4815. [2025-04-13 18:03:36,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4815 states, 4814 states have (on average 2.831117573743249) internal successors, (13629), 4814 states have internal predecessors, (13629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:03:36,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4815 states to 4815 states and 13629 transitions. [2025-04-13 18:03:36,816 INFO L79 Accepts]: Start accepts. Automaton has 4815 states and 13629 transitions. Word has length 69 [2025-04-13 18:03:36,816 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:03:36,816 INFO L485 AbstractCegarLoop]: Abstraction has 4815 states and 13629 transitions. [2025-04-13 18:03:36,816 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 18:03:36,816 INFO L278 IsEmpty]: Start isEmpty. Operand 4815 states and 13629 transitions. [2025-04-13 18:03:36,842 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-04-13 18:03:36,842 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:03:36,842 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 18:03:36,842 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable107 [2025-04-13 18:03:36,842 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 18:03:36,843 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:03:36,843 INFO L85 PathProgramCache]: Analyzing trace with hash -807965922, now seen corresponding path program 2 times [2025-04-13 18:03:36,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:03:36,843 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353409257] [2025-04-13 18:03:36,843 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:03:36,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:03:36,846 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 69 statements into 1 equivalence classes. [2025-04-13 18:03:36,848 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-04-13 18:03:36,848 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:03:36,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:03:36,927 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 18:03:36,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:03:36,927 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353409257] [2025-04-13 18:03:36,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353409257] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:03:36,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:03:36,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 18:03:36,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730820024] [2025-04-13 18:03:36,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:03:36,927 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 18:03:36,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:03:36,928 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 18:03:36,928 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-04-13 18:03:36,928 INFO L87 Difference]: Start difference. First operand 4815 states and 13629 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 18:03:37,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:03:37,340 INFO L93 Difference]: Finished difference Result 8046 states and 22148 transitions. [2025-04-13 18:03:37,340 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-04-13 18:03:37,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 18:03:37,340 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:03:37,401 INFO L225 Difference]: With dead ends: 8046 [2025-04-13 18:03:37,401 INFO L226 Difference]: Without dead ends: 7716 [2025-04-13 18:03:37,404 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=209, Invalid=603, Unknown=0, NotChecked=0, Total=812 [2025-04-13 18:03:37,404 INFO L437 NwaCegarLoop]: 131 mSDtfsCounter, 427 mSDsluCounter, 498 mSDsCounter, 0 mSdLazyCounter, 694 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 427 SdHoareTripleChecker+Valid, 629 SdHoareTripleChecker+Invalid, 711 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 694 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:03:37,404 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [427 Valid, 629 Invalid, 711 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 694 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:03:37,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7716 states. [2025-04-13 18:03:37,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7716 to 4783. [2025-04-13 18:03:37,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4783 states, 4782 states have (on average 2.828314512756169) internal successors, (13525), 4782 states have internal predecessors, (13525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:03:37,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4783 states to 4783 states and 13525 transitions. [2025-04-13 18:03:37,534 INFO L79 Accepts]: Start accepts. Automaton has 4783 states and 13525 transitions. Word has length 69 [2025-04-13 18:03:37,534 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:03:37,534 INFO L485 AbstractCegarLoop]: Abstraction has 4783 states and 13525 transitions. [2025-04-13 18:03:37,534 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 18:03:37,534 INFO L278 IsEmpty]: Start isEmpty. Operand 4783 states and 13525 transitions. [2025-04-13 18:03:37,540 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-04-13 18:03:37,540 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:03:37,540 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 18:03:37,540 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable108 [2025-04-13 18:03:37,540 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 18:03:37,540 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:03:37,540 INFO L85 PathProgramCache]: Analyzing trace with hash 1233688638, now seen corresponding path program 3 times [2025-04-13 18:03:37,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:03:37,540 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028945308] [2025-04-13 18:03:37,540 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:03:37,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:03:37,543 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 69 statements into 1 equivalence classes. [2025-04-13 18:03:37,546 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-04-13 18:03:37,546 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 18:03:37,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:03:37,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 18:03:37,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:03:37,628 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028945308] [2025-04-13 18:03:37,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028945308] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:03:37,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:03:37,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 18:03:37,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880869307] [2025-04-13 18:03:37,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:03:37,628 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 18:03:37,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:03:37,629 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 18:03:37,629 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-04-13 18:03:37,629 INFO L87 Difference]: Start difference. First operand 4783 states and 13525 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 18:03:38,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:03:38,052 INFO L93 Difference]: Finished difference Result 7328 states and 20247 transitions. [2025-04-13 18:03:38,052 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-13 18:03:38,052 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 18:03:38,052 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:03:38,120 INFO L225 Difference]: With dead ends: 7328 [2025-04-13 18:03:38,120 INFO L226 Difference]: Without dead ends: 7030 [2025-04-13 18:03:38,123 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 18:03:38,123 INFO L437 NwaCegarLoop]: 126 mSDtfsCounter, 368 mSDsluCounter, 495 mSDsCounter, 0 mSdLazyCounter, 719 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 368 SdHoareTripleChecker+Valid, 621 SdHoareTripleChecker+Invalid, 733 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 719 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:03:38,123 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [368 Valid, 621 Invalid, 733 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 719 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:03:38,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7030 states. [2025-04-13 18:03:38,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7030 to 4687. [2025-04-13 18:03:38,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4687 states, 4686 states have (on average 2.8162612035851473) internal successors, (13197), 4686 states have internal predecessors, (13197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:03:38,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4687 states to 4687 states and 13197 transitions. [2025-04-13 18:03:38,228 INFO L79 Accepts]: Start accepts. Automaton has 4687 states and 13197 transitions. Word has length 69 [2025-04-13 18:03:38,228 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:03:38,228 INFO L485 AbstractCegarLoop]: Abstraction has 4687 states and 13197 transitions. [2025-04-13 18:03:38,228 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 18:03:38,229 INFO L278 IsEmpty]: Start isEmpty. Operand 4687 states and 13197 transitions. [2025-04-13 18:03:38,233 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-04-13 18:03:38,233 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:03:38,233 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 18:03:38,233 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable109 [2025-04-13 18:03:38,233 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 18:03:38,234 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:03:38,234 INFO L85 PathProgramCache]: Analyzing trace with hash 442633761, now seen corresponding path program 1 times [2025-04-13 18:03:38,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:03:38,234 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003833297] [2025-04-13 18:03:38,234 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:03:38,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:03:38,237 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-04-13 18:03:38,239 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-04-13 18:03:38,239 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:03:38,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:03:38,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 18:03:38,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:03:38,287 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003833297] [2025-04-13 18:03:38,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003833297] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:03:38,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:03:38,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 18:03:38,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996425786] [2025-04-13 18:03:38,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:03:38,287 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 18:03:38,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:03:38,288 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 18:03:38,288 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-04-13 18:03:38,288 INFO L87 Difference]: Start difference. First operand 4687 states and 13197 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 18:03:38,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:03:38,478 INFO L93 Difference]: Finished difference Result 5466 states and 15175 transitions. [2025-04-13 18:03:38,478 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 18:03:38,478 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 18:03:38,478 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:03:38,530 INFO L225 Difference]: With dead ends: 5466 [2025-04-13 18:03:38,530 INFO L226 Difference]: Without dead ends: 5068 [2025-04-13 18:03:38,531 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2025-04-13 18:03:38,531 INFO L437 NwaCegarLoop]: 62 mSDtfsCounter, 168 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 366 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 366 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:03:38,531 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 229 Invalid, 381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 366 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:03:38,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5068 states. [2025-04-13 18:03:38,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5068 to 4607. [2025-04-13 18:03:38,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4607 states, 4606 states have (on average 2.814372557533652) internal successors, (12963), 4606 states have internal predecessors, (12963), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:03:38,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4607 states to 4607 states and 12963 transitions. [2025-04-13 18:03:38,622 INFO L79 Accepts]: Start accepts. Automaton has 4607 states and 12963 transitions. Word has length 69 [2025-04-13 18:03:38,622 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:03:38,622 INFO L485 AbstractCegarLoop]: Abstraction has 4607 states and 12963 transitions. [2025-04-13 18:03:38,623 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 18:03:38,623 INFO L278 IsEmpty]: Start isEmpty. Operand 4607 states and 12963 transitions. [2025-04-13 18:03:38,628 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-04-13 18:03:38,628 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:03:38,628 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 18:03:38,628 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable110 [2025-04-13 18:03:38,628 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 18:03:38,628 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:03:38,628 INFO L85 PathProgramCache]: Analyzing trace with hash 1368178973, now seen corresponding path program 1 times [2025-04-13 18:03:38,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:03:38,628 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020912958] [2025-04-13 18:03:38,628 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:03:38,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:03:38,631 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-04-13 18:03:38,633 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-04-13 18:03:38,633 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:03:38,633 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:03:38,680 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 18:03:38,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:03:38,680 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020912958] [2025-04-13 18:03:38,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020912958] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:03:38,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:03:38,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 18:03:38,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811343360] [2025-04-13 18:03:38,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:03:38,681 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 18:03:38,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:03:38,681 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 18:03:38,681 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-04-13 18:03:38,681 INFO L87 Difference]: Start difference. First operand 4607 states and 12963 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 18:03:38,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:03:38,894 INFO L93 Difference]: Finished difference Result 5689 states and 15766 transitions. [2025-04-13 18:03:38,894 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 18:03:38,894 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 18:03:38,894 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:03:38,961 INFO L225 Difference]: With dead ends: 5689 [2025-04-13 18:03:38,961 INFO L226 Difference]: Without dead ends: 5369 [2025-04-13 18:03:38,964 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2025-04-13 18:03:38,964 INFO L437 NwaCegarLoop]: 64 mSDtfsCounter, 196 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 402 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 420 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:03:38,964 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 235 Invalid, 420 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 402 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:03:38,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5369 states. [2025-04-13 18:03:39,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5369 to 4583. [2025-04-13 18:03:39,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4583 states, 4582 states have (on average 2.8112178088171103) internal successors, (12881), 4582 states have internal predecessors, (12881), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:03:39,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4583 states to 4583 states and 12881 transitions. [2025-04-13 18:03:39,084 INFO L79 Accepts]: Start accepts. Automaton has 4583 states and 12881 transitions. Word has length 69 [2025-04-13 18:03:39,084 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:03:39,084 INFO L485 AbstractCegarLoop]: Abstraction has 4583 states and 12881 transitions. [2025-04-13 18:03:39,084 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 18:03:39,084 INFO L278 IsEmpty]: Start isEmpty. Operand 4583 states and 12881 transitions. [2025-04-13 18:03:39,089 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-04-13 18:03:39,090 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:03:39,090 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 18:03:39,090 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable111 [2025-04-13 18:03:39,090 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 18:03:39,090 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:03:39,090 INFO L85 PathProgramCache]: Analyzing trace with hash -934466243, now seen corresponding path program 1 times [2025-04-13 18:03:39,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:03:39,090 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244641340] [2025-04-13 18:03:39,090 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:03:39,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:03:39,093 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-04-13 18:03:39,096 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-04-13 18:03:39,096 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:03:39,096 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:03:39,173 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 18:03:39,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:03:39,173 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244641340] [2025-04-13 18:03:39,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244641340] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:03:39,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:03:39,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 18:03:39,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245169380] [2025-04-13 18:03:39,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:03:39,173 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 18:03:39,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:03:39,173 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 18:03:39,173 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-04-13 18:03:39,174 INFO L87 Difference]: Start difference. First operand 4583 states and 12881 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 18:03:39,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:03:39,377 INFO L93 Difference]: Finished difference Result 5196 states and 14432 transitions. [2025-04-13 18:03:39,378 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 18:03:39,378 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 18:03:39,378 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:03:39,434 INFO L225 Difference]: With dead ends: 5196 [2025-04-13 18:03:39,434 INFO L226 Difference]: Without dead ends: 4840 [2025-04-13 18:03:39,436 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2025-04-13 18:03:39,436 INFO L437 NwaCegarLoop]: 58 mSDtfsCounter, 186 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 378 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:03:39,436 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 228 Invalid, 395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 378 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:03:39,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4840 states. [2025-04-13 18:03:39,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4840 to 4523. [2025-04-13 18:03:39,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4523 states, 4522 states have (on average 2.807828394515701) internal successors, (12697), 4522 states have internal predecessors, (12697), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:03:39,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4523 states to 4523 states and 12697 transitions. [2025-04-13 18:03:39,548 INFO L79 Accepts]: Start accepts. Automaton has 4523 states and 12697 transitions. Word has length 69 [2025-04-13 18:03:39,549 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:03:39,549 INFO L485 AbstractCegarLoop]: Abstraction has 4523 states and 12697 transitions. [2025-04-13 18:03:39,549 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 18:03:39,549 INFO L278 IsEmpty]: Start isEmpty. Operand 4523 states and 12697 transitions. [2025-04-13 18:03:39,554 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-04-13 18:03:39,554 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:03:39,554 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 18:03:39,554 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable112 [2025-04-13 18:03:39,554 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 18:03:39,554 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:03:39,554 INFO L85 PathProgramCache]: Analyzing trace with hash 1172140008, now seen corresponding path program 1 times [2025-04-13 18:03:39,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:03:39,554 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125883104] [2025-04-13 18:03:39,555 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:03:39,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:03:39,558 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-04-13 18:03:39,560 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-04-13 18:03:39,560 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:03:39,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:03:39,650 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 18:03:39,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:03:39,651 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125883104] [2025-04-13 18:03:39,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125883104] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:03:39,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:03:39,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-04-13 18:03:39,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736620121] [2025-04-13 18:03:39,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:03:39,651 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:03:39,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:03:39,651 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:03:39,651 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2025-04-13 18:03:39,651 INFO L87 Difference]: Start difference. First operand 4523 states and 12697 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 18:03:40,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:03:40,240 INFO L93 Difference]: Finished difference Result 6268 states and 17179 transitions. [2025-04-13 18:03:40,240 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2025-04-13 18:03:40,240 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 18:03:40,240 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:03:40,302 INFO L225 Difference]: With dead ends: 6268 [2025-04-13 18:03:40,302 INFO L226 Difference]: Without dead ends: 5571 [2025-04-13 18:03:40,305 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 487 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=558, Invalid=1334, Unknown=0, NotChecked=0, Total=1892 [2025-04-13 18:03:40,305 INFO L437 NwaCegarLoop]: 156 mSDtfsCounter, 500 mSDsluCounter, 655 mSDsCounter, 0 mSdLazyCounter, 917 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 500 SdHoareTripleChecker+Valid, 811 SdHoareTripleChecker+Invalid, 940 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 917 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:03:40,305 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [500 Valid, 811 Invalid, 940 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 917 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:03:40,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5571 states. [2025-04-13 18:03:40,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5571 to 4142. [2025-04-13 18:03:40,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4142 states, 4141 states have (on average 2.8063269741608305) internal successors, (11621), 4141 states have internal predecessors, (11621), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:03:40,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4142 states to 4142 states and 11621 transitions. [2025-04-13 18:03:40,414 INFO L79 Accepts]: Start accepts. Automaton has 4142 states and 11621 transitions. Word has length 70 [2025-04-13 18:03:40,415 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:03:40,415 INFO L485 AbstractCegarLoop]: Abstraction has 4142 states and 11621 transitions. [2025-04-13 18:03:40,415 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 18:03:40,415 INFO L278 IsEmpty]: Start isEmpty. Operand 4142 states and 11621 transitions. [2025-04-13 18:03:40,419 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-04-13 18:03:40,419 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:03:40,419 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 18:03:40,420 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable113 [2025-04-13 18:03:40,420 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 18:03:40,420 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:03:40,420 INFO L85 PathProgramCache]: Analyzing trace with hash 889946132, now seen corresponding path program 1 times [2025-04-13 18:03:40,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:03:40,420 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980853804] [2025-04-13 18:03:40,420 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:03:40,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:03:40,423 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-04-13 18:03:40,425 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-04-13 18:03:40,425 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:03:40,425 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:03:40,452 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 18:03:40,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:03:40,452 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980853804] [2025-04-13 18:03:40,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980853804] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:03:40,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:03:40,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 18:03:40,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279095123] [2025-04-13 18:03:40,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:03:40,452 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 18:03:40,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:03:40,452 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 18:03:40,453 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-13 18:03:40,453 INFO L87 Difference]: Start difference. First operand 4142 states and 11621 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 18:03:40,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:03:40,689 INFO L93 Difference]: Finished difference Result 5105 states and 14097 transitions. [2025-04-13 18:03:40,689 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-13 18:03:40,689 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 18:03:40,689 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:03:40,748 INFO L225 Difference]: With dead ends: 5105 [2025-04-13 18:03:40,748 INFO L226 Difference]: Without dead ends: 4633 [2025-04-13 18:03:40,750 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2025-04-13 18:03:40,750 INFO L437 NwaCegarLoop]: 73 mSDtfsCounter, 334 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 401 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 334 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:03:40,750 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [334 Valid, 298 Invalid, 418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 401 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:03:40,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4633 states. [2025-04-13 18:03:40,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4633 to 3834. [2025-04-13 18:03:40,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3834 states, 3833 states have (on average 2.7907644142968953) internal successors, (10697), 3833 states have internal predecessors, (10697), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:03:40,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3834 states to 3834 states and 10697 transitions. [2025-04-13 18:03:40,855 INFO L79 Accepts]: Start accepts. Automaton has 3834 states and 10697 transitions. Word has length 70 [2025-04-13 18:03:40,855 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:03:40,855 INFO L485 AbstractCegarLoop]: Abstraction has 3834 states and 10697 transitions. [2025-04-13 18:03:40,855 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 18:03:40,856 INFO L278 IsEmpty]: Start isEmpty. Operand 3834 states and 10697 transitions. [2025-04-13 18:03:40,860 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-04-13 18:03:40,860 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:03:40,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 18:03:40,860 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable114 [2025-04-13 18:03:40,860 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 18:03:40,860 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:03:40,860 INFO L85 PathProgramCache]: Analyzing trace with hash 1692999622, now seen corresponding path program 1 times [2025-04-13 18:03:40,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:03:40,861 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440281342] [2025-04-13 18:03:40,861 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:03:40,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:03:40,864 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-04-13 18:03:40,866 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-04-13 18:03:40,866 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:03:40,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:03:40,936 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 18:03:40,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:03:40,936 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440281342] [2025-04-13 18:03:40,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440281342] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:03:40,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:03:40,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 18:03:40,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389294825] [2025-04-13 18:03:40,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:03:40,936 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 18:03:40,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:03:40,937 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 18:03:40,937 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-04-13 18:03:40,937 INFO L87 Difference]: Start difference. First operand 3834 states and 10697 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 18:03:41,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:03:41,097 INFO L93 Difference]: Finished difference Result 4078 states and 11319 transitions. [2025-04-13 18:03:41,097 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 18:03:41,097 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 18:03:41,097 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:03:41,163 INFO L225 Difference]: With dead ends: 4078 [2025-04-13 18:03:41,163 INFO L226 Difference]: Without dead ends: 3600 [2025-04-13 18:03:41,164 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 18:03:41,165 INFO L437 NwaCegarLoop]: 68 mSDtfsCounter, 149 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:03:41,165 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 229 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 296 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:03:41,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3600 states. [2025-04-13 18:03:41,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3600 to 3600. [2025-04-13 18:03:41,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3600 states, 3599 states have (on average 2.7596554598499585) internal successors, (9932), 3599 states have internal predecessors, (9932), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:03:41,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3600 states to 3600 states and 9932 transitions. [2025-04-13 18:03:41,268 INFO L79 Accepts]: Start accepts. Automaton has 3600 states and 9932 transitions. Word has length 70 [2025-04-13 18:03:41,268 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:03:41,268 INFO L485 AbstractCegarLoop]: Abstraction has 3600 states and 9932 transitions. [2025-04-13 18:03:41,268 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 18:03:41,268 INFO L278 IsEmpty]: Start isEmpty. Operand 3600 states and 9932 transitions. [2025-04-13 18:03:41,272 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-04-13 18:03:41,272 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:03:41,272 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 18:03:41,272 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable115 [2025-04-13 18:03:41,273 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 18:03:41,273 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:03:41,273 INFO L85 PathProgramCache]: Analyzing trace with hash -119681291, now seen corresponding path program 1 times [2025-04-13 18:03:41,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:03:41,273 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114038658] [2025-04-13 18:03:41,273 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:03:41,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:03:41,276 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-04-13 18:03:41,278 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-04-13 18:03:41,279 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:03:41,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:03:41,306 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 18:03:41,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:03:41,306 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114038658] [2025-04-13 18:03:41,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114038658] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:03:41,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:03:41,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 18:03:41,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481558286] [2025-04-13 18:03:41,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:03:41,306 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 18:03:41,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:03:41,307 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 18:03:41,307 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-13 18:03:41,307 INFO L87 Difference]: Start difference. First operand 3600 states and 9932 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 18:03:41,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:03:41,544 INFO L93 Difference]: Finished difference Result 4375 states and 11881 transitions. [2025-04-13 18:03:41,544 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-13 18:03:41,544 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 18:03:41,544 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:03:41,603 INFO L225 Difference]: With dead ends: 4375 [2025-04-13 18:03:41,603 INFO L226 Difference]: Without dead ends: 3907 [2025-04-13 18:03:41,604 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 11 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 18:03:41,604 INFO L437 NwaCegarLoop]: 67 mSDtfsCounter, 346 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 391 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 346 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:03:41,605 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [346 Valid, 253 Invalid, 413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 391 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:03:41,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3907 states. [2025-04-13 18:03:41,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3907 to 3298. [2025-04-13 18:03:41,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3298 states, 3297 states have (on average 2.734303912647862) internal successors, (9015), 3297 states have internal predecessors, (9015), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:03:41,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3298 states to 3298 states and 9015 transitions. [2025-04-13 18:03:41,697 INFO L79 Accepts]: Start accepts. Automaton has 3298 states and 9015 transitions. Word has length 70 [2025-04-13 18:03:41,697 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:03:41,697 INFO L485 AbstractCegarLoop]: Abstraction has 3298 states and 9015 transitions. [2025-04-13 18:03:41,697 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 18:03:41,697 INFO L278 IsEmpty]: Start isEmpty. Operand 3298 states and 9015 transitions. [2025-04-13 18:03:41,701 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-04-13 18:03:41,701 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:03:41,701 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 18:03:41,701 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable116 [2025-04-13 18:03:41,701 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 18:03:41,702 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:03:41,702 INFO L85 PathProgramCache]: Analyzing trace with hash 1566964696, now seen corresponding path program 2 times [2025-04-13 18:03:41,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:03:41,702 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802379407] [2025-04-13 18:03:41,702 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:03:41,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:03:41,705 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 70 statements into 1 equivalence classes. [2025-04-13 18:03:41,707 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-04-13 18:03:41,707 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:03:41,708 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:03:41,822 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 18:03:41,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:03:41,822 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802379407] [2025-04-13 18:03:41,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802379407] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:03:41,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:03:41,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-04-13 18:03:41,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441364794] [2025-04-13 18:03:41,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:03:41,823 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:03:41,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:03:41,823 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:03:41,823 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2025-04-13 18:03:41,823 INFO L87 Difference]: Start difference. First operand 3298 states and 9015 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 18:03:42,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:03:42,176 INFO L93 Difference]: Finished difference Result 3934 states and 10586 transitions. [2025-04-13 18:03:42,176 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-13 18:03:42,176 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 18:03:42,176 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:03:42,227 INFO L225 Difference]: With dead ends: 3934 [2025-04-13 18:03:42,227 INFO L226 Difference]: Without dead ends: 2712 [2025-04-13 18:03:42,229 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=284, Invalid=586, Unknown=0, NotChecked=0, Total=870 [2025-04-13 18:03:42,229 INFO L437 NwaCegarLoop]: 103 mSDtfsCounter, 310 mSDsluCounter, 413 mSDsCounter, 0 mSdLazyCounter, 641 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 310 SdHoareTripleChecker+Valid, 516 SdHoareTripleChecker+Invalid, 653 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 641 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:03:42,229 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [310 Valid, 516 Invalid, 653 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 641 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:03:42,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2712 states. [2025-04-13 18:03:42,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2712 to 2142. [2025-04-13 18:03:42,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2142 states, 2141 states have (on average 2.768332554880897) internal successors, (5927), 2141 states have internal predecessors, (5927), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:03:42,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2142 states to 2142 states and 5927 transitions. [2025-04-13 18:03:42,284 INFO L79 Accepts]: Start accepts. Automaton has 2142 states and 5927 transitions. Word has length 70 [2025-04-13 18:03:42,284 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:03:42,284 INFO L485 AbstractCegarLoop]: Abstraction has 2142 states and 5927 transitions. [2025-04-13 18:03:42,284 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 18:03:42,284 INFO L278 IsEmpty]: Start isEmpty. Operand 2142 states and 5927 transitions. [2025-04-13 18:03:42,286 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-04-13 18:03:42,286 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:03:42,286 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 18:03:42,286 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable117 [2025-04-13 18:03:42,286 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 18:03:42,286 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:03:42,287 INFO L85 PathProgramCache]: Analyzing trace with hash -254927451, now seen corresponding path program 2 times [2025-04-13 18:03:42,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:03:42,287 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342222257] [2025-04-13 18:03:42,287 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:03:42,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:03:42,290 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 70 statements into 1 equivalence classes. [2025-04-13 18:03:42,292 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-04-13 18:03:42,292 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:03:42,292 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:03:42,354 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 18:03:42,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:03:42,354 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342222257] [2025-04-13 18:03:42,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342222257] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:03:42,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:03:42,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 18:03:42,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345201350] [2025-04-13 18:03:42,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:03:42,355 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 18:03:42,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:03:42,355 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 18:03:42,355 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-04-13 18:03:42,355 INFO L87 Difference]: Start difference. First operand 2142 states and 5927 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 18:03:42,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:03:42,727 INFO L93 Difference]: Finished difference Result 3174 states and 8541 transitions. [2025-04-13 18:03:42,727 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-04-13 18:03:42,728 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 18:03:42,728 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:03:42,781 INFO L225 Difference]: With dead ends: 3174 [2025-04-13 18:03:42,781 INFO L226 Difference]: Without dead ends: 2978 [2025-04-13 18:03:42,782 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 263 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=282, Invalid=774, Unknown=0, NotChecked=0, Total=1056 [2025-04-13 18:03:42,782 INFO L437 NwaCegarLoop]: 97 mSDtfsCounter, 433 mSDsluCounter, 448 mSDsCounter, 0 mSdLazyCounter, 668 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 433 SdHoareTripleChecker+Valid, 545 SdHoareTripleChecker+Invalid, 684 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 668 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:03:42,782 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [433 Valid, 545 Invalid, 684 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 668 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:03:42,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2978 states. [2025-04-13 18:03:42,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2978 to 2160. [2025-04-13 18:03:42,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2160 states, 2159 states have (on average 2.7633163501621123) internal successors, (5966), 2159 states have internal predecessors, (5966), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:03:42,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2160 states to 2160 states and 5966 transitions. [2025-04-13 18:03:42,861 INFO L79 Accepts]: Start accepts. Automaton has 2160 states and 5966 transitions. Word has length 70 [2025-04-13 18:03:42,861 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:03:42,861 INFO L485 AbstractCegarLoop]: Abstraction has 2160 states and 5966 transitions. [2025-04-13 18:03:42,861 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 18:03:42,861 INFO L278 IsEmpty]: Start isEmpty. Operand 2160 states and 5966 transitions. [2025-04-13 18:03:42,863 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-04-13 18:03:42,863 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:03:42,863 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 18:03:42,864 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable118 [2025-04-13 18:03:42,864 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 18:03:42,864 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:03:42,864 INFO L85 PathProgramCache]: Analyzing trace with hash 327272877, now seen corresponding path program 3 times [2025-04-13 18:03:42,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:03:42,864 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667750283] [2025-04-13 18:03:42,864 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:03:42,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:03:42,867 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 70 statements into 1 equivalence classes. [2025-04-13 18:03:42,870 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-04-13 18:03:42,870 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 18:03:42,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:03:42,951 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 18:03:42,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:03:42,951 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667750283] [2025-04-13 18:03:42,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667750283] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:03:42,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:03:42,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 18:03:42,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380285449] [2025-04-13 18:03:42,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:03:42,952 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 18:03:42,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:03:42,952 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 18:03:42,952 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-04-13 18:03:42,952 INFO L87 Difference]: Start difference. First operand 2160 states and 5966 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 18:03:43,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:03:43,235 INFO L93 Difference]: Finished difference Result 2972 states and 8046 transitions. [2025-04-13 18:03:43,235 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-13 18:03:43,235 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 18:03:43,235 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:03:43,282 INFO L225 Difference]: With dead ends: 2972 [2025-04-13 18:03:43,282 INFO L226 Difference]: Without dead ends: 2764 [2025-04-13 18:03:43,283 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=164, Invalid=388, Unknown=0, NotChecked=0, Total=552 [2025-04-13 18:03:43,284 INFO L437 NwaCegarLoop]: 84 mSDtfsCounter, 319 mSDsluCounter, 378 mSDsCounter, 0 mSdLazyCounter, 576 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 319 SdHoareTripleChecker+Valid, 462 SdHoareTripleChecker+Invalid, 585 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 576 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:03:43,284 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [319 Valid, 462 Invalid, 585 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 576 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:03:43,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2764 states. [2025-04-13 18:03:43,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2764 to 2142. [2025-04-13 18:03:43,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2142 states, 2141 states have (on average 2.7599252685660907) internal successors, (5909), 2141 states have internal predecessors, (5909), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:03:43,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2142 states to 2142 states and 5909 transitions. [2025-04-13 18:03:43,350 INFO L79 Accepts]: Start accepts. Automaton has 2142 states and 5909 transitions. Word has length 70 [2025-04-13 18:03:43,350 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:03:43,350 INFO L485 AbstractCegarLoop]: Abstraction has 2142 states and 5909 transitions. [2025-04-13 18:03:43,350 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 18:03:43,350 INFO L278 IsEmpty]: Start isEmpty. Operand 2142 states and 5909 transitions. [2025-04-13 18:03:43,352 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-04-13 18:03:43,352 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:03:43,352 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 18:03:43,352 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable119 [2025-04-13 18:03:43,352 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 18:03:43,353 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:03:43,353 INFO L85 PathProgramCache]: Analyzing trace with hash 1302140197, now seen corresponding path program 4 times [2025-04-13 18:03:43,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:03:43,353 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276631691] [2025-04-13 18:03:43,353 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:03:43,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:03:43,356 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 70 statements into 2 equivalence classes. [2025-04-13 18:03:43,359 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 18:03:43,359 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:03:43,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:03:43,434 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 18:03:43,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:03:43,434 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276631691] [2025-04-13 18:03:43,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276631691] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:03:43,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:03:43,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 18:03:43,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794734612] [2025-04-13 18:03:43,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:03:43,434 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 18:03:43,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:03:43,435 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 18:03:43,435 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-04-13 18:03:43,435 INFO L87 Difference]: Start difference. First operand 2142 states and 5909 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 18:03:43,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:03:43,790 INFO L93 Difference]: Finished difference Result 3134 states and 8455 transitions. [2025-04-13 18:03:43,790 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-13 18:03:43,790 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 18:03:43,790 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:03:43,839 INFO L225 Difference]: With dead ends: 3134 [2025-04-13 18:03:43,839 INFO L226 Difference]: Without dead ends: 2600 [2025-04-13 18:03:43,841 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=166, Invalid=434, Unknown=0, NotChecked=0, Total=600 [2025-04-13 18:03:43,841 INFO L437 NwaCegarLoop]: 83 mSDtfsCounter, 335 mSDsluCounter, 451 mSDsCounter, 0 mSdLazyCounter, 761 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 335 SdHoareTripleChecker+Valid, 534 SdHoareTripleChecker+Invalid, 770 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 761 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:03:43,841 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [335 Valid, 534 Invalid, 770 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 761 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:03:43,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2600 states. [2025-04-13 18:03:43,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2600 to 1926. [2025-04-13 18:03:43,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1926 states, 1925 states have (on average 2.743896103896104) internal successors, (5282), 1925 states have internal predecessors, (5282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:03:43,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1926 states to 1926 states and 5282 transitions. [2025-04-13 18:03:43,917 INFO L79 Accepts]: Start accepts. Automaton has 1926 states and 5282 transitions. Word has length 70 [2025-04-13 18:03:43,917 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:03:43,917 INFO L485 AbstractCegarLoop]: Abstraction has 1926 states and 5282 transitions. [2025-04-13 18:03:43,917 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 18:03:43,917 INFO L278 IsEmpty]: Start isEmpty. Operand 1926 states and 5282 transitions. [2025-04-13 18:03:43,919 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-04-13 18:03:43,919 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:03:43,919 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 18:03:43,919 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable120 [2025-04-13 18:03:43,920 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 18:03:43,920 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:03:43,920 INFO L85 PathProgramCache]: Analyzing trace with hash -2120200036, now seen corresponding path program 2 times [2025-04-13 18:03:43,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:03:43,920 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446900797] [2025-04-13 18:03:43,920 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:03:43,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:03:43,923 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 70 statements into 1 equivalence classes. [2025-04-13 18:03:43,925 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-04-13 18:03:43,925 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:03:43,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:03:44,008 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 18:03:44,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:03:44,009 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446900797] [2025-04-13 18:03:44,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446900797] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:03:44,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:03:44,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 18:03:44,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129094825] [2025-04-13 18:03:44,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:03:44,009 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 18:03:44,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:03:44,009 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 18:03:44,009 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-04-13 18:03:44,010 INFO L87 Difference]: Start difference. First operand 1926 states and 5282 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 18:03:44,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:03:44,333 INFO L93 Difference]: Finished difference Result 2590 states and 6938 transitions. [2025-04-13 18:03:44,334 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-04-13 18:03:44,334 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 18:03:44,334 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:03:44,383 INFO L225 Difference]: With dead ends: 2590 [2025-04-13 18:03:44,383 INFO L226 Difference]: Without dead ends: 2396 [2025-04-13 18:03:44,384 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=230, Invalid=582, Unknown=0, NotChecked=0, Total=812 [2025-04-13 18:03:44,384 INFO L437 NwaCegarLoop]: 86 mSDtfsCounter, 358 mSDsluCounter, 401 mSDsCounter, 0 mSdLazyCounter, 641 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 358 SdHoareTripleChecker+Valid, 487 SdHoareTripleChecker+Invalid, 651 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 641 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:03:44,384 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [358 Valid, 487 Invalid, 651 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 641 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:03:44,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2396 states. [2025-04-13 18:03:44,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2396 to 1944. [2025-04-13 18:03:44,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1944 states, 1943 states have (on average 2.7385486361296962) internal successors, (5321), 1943 states have internal predecessors, (5321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:03:44,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1944 states to 1944 states and 5321 transitions. [2025-04-13 18:03:44,454 INFO L79 Accepts]: Start accepts. Automaton has 1944 states and 5321 transitions. Word has length 70 [2025-04-13 18:03:44,455 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:03:44,455 INFO L485 AbstractCegarLoop]: Abstraction has 1944 states and 5321 transitions. [2025-04-13 18:03:44,455 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 18:03:44,455 INFO L278 IsEmpty]: Start isEmpty. Operand 1944 states and 5321 transitions. [2025-04-13 18:03:44,457 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-04-13 18:03:44,457 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:03:44,457 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 18:03:44,457 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable121 [2025-04-13 18:03:44,457 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 18:03:44,457 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:03:44,457 INFO L85 PathProgramCache]: Analyzing trace with hash -476716530, now seen corresponding path program 1 times [2025-04-13 18:03:44,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:03:44,458 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369541313] [2025-04-13 18:03:44,458 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:03:44,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:03:44,460 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-04-13 18:03:44,463 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-04-13 18:03:44,463 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:03:44,463 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:03:44,542 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 18:03:44,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:03:44,543 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369541313] [2025-04-13 18:03:44,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369541313] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:03:44,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:03:44,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 18:03:44,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185137606] [2025-04-13 18:03:44,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:03:44,543 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 18:03:44,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:03:44,543 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 18:03:44,543 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-04-13 18:03:44,543 INFO L87 Difference]: Start difference. First operand 1944 states and 5321 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 18:03:44,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:03:44,892 INFO L93 Difference]: Finished difference Result 2996 states and 7966 transitions. [2025-04-13 18:03:44,893 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-04-13 18:03:44,893 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 18:03:44,893 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:03:44,942 INFO L225 Difference]: With dead ends: 2996 [2025-04-13 18:03:44,942 INFO L226 Difference]: Without dead ends: 2802 [2025-04-13 18:03:44,943 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=248, Invalid=622, Unknown=0, NotChecked=0, Total=870 [2025-04-13 18:03:44,943 INFO L437 NwaCegarLoop]: 93 mSDtfsCounter, 392 mSDsluCounter, 404 mSDsCounter, 0 mSdLazyCounter, 635 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 392 SdHoareTripleChecker+Valid, 497 SdHoareTripleChecker+Invalid, 656 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 635 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:03:44,944 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [392 Valid, 497 Invalid, 656 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 635 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:03:44,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2802 states. [2025-04-13 18:03:44,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2802 to 1962. [2025-04-13 18:03:44,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1962 states, 1961 states have (on average 2.733299337072922) internal successors, (5360), 1961 states have internal predecessors, (5360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:03:44,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1962 states to 1962 states and 5360 transitions. [2025-04-13 18:03:45,049 INFO L79 Accepts]: Start accepts. Automaton has 1962 states and 5360 transitions. Word has length 70 [2025-04-13 18:03:45,049 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:03:45,049 INFO L485 AbstractCegarLoop]: Abstraction has 1962 states and 5360 transitions. [2025-04-13 18:03:45,049 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 18:03:45,049 INFO L278 IsEmpty]: Start isEmpty. Operand 1962 states and 5360 transitions. [2025-04-13 18:03:45,051 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-04-13 18:03:45,051 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:03:45,051 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 18:03:45,052 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable122 [2025-04-13 18:03:45,052 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 18:03:45,052 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:03:45,052 INFO L85 PathProgramCache]: Analyzing trace with hash -687871264, now seen corresponding path program 3 times [2025-04-13 18:03:45,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:03:45,052 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065233700] [2025-04-13 18:03:45,052 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:03:45,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:03:45,055 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 70 statements into 1 equivalence classes. [2025-04-13 18:03:45,059 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-04-13 18:03:45,059 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 18:03:45,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:03:45,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 18:03:45,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:03:45,142 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065233700] [2025-04-13 18:03:45,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065233700] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:03:45,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:03:45,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 18:03:45,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075784006] [2025-04-13 18:03:45,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:03:45,143 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 18:03:45,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:03:45,143 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 18:03:45,143 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-04-13 18:03:45,143 INFO L87 Difference]: Start difference. First operand 1962 states and 5360 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 18:03:45,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:03:45,393 INFO L93 Difference]: Finished difference Result 2410 states and 6490 transitions. [2025-04-13 18:03:45,394 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-13 18:03:45,394 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 18:03:45,394 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:03:45,441 INFO L225 Difference]: With dead ends: 2410 [2025-04-13 18:03:45,441 INFO L226 Difference]: Without dead ends: 2204 [2025-04-13 18:03:45,442 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=150, Invalid=356, Unknown=0, NotChecked=0, Total=506 [2025-04-13 18:03:45,442 INFO L437 NwaCegarLoop]: 80 mSDtfsCounter, 259 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 549 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 420 SdHoareTripleChecker+Invalid, 556 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 549 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:03:45,442 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 420 Invalid, 556 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 549 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:03:45,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2204 states. [2025-04-13 18:03:45,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2204 to 1944. [2025-04-13 18:03:45,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1944 states, 1943 states have (on average 2.7292846114256304) internal successors, (5303), 1943 states have internal predecessors, (5303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:03:45,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1944 states to 1944 states and 5303 transitions. [2025-04-13 18:03:45,513 INFO L79 Accepts]: Start accepts. Automaton has 1944 states and 5303 transitions. Word has length 70 [2025-04-13 18:03:45,513 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:03:45,513 INFO L485 AbstractCegarLoop]: Abstraction has 1944 states and 5303 transitions. [2025-04-13 18:03:45,513 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 18:03:45,513 INFO L278 IsEmpty]: Start isEmpty. Operand 1944 states and 5303 transitions. [2025-04-13 18:03:45,515 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-04-13 18:03:45,515 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:03:45,515 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 18:03:45,516 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable123 [2025-04-13 18:03:45,516 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 18:03:45,516 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:03:45,516 INFO L85 PathProgramCache]: Analyzing trace with hash -218500014, now seen corresponding path program 2 times [2025-04-13 18:03:45,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:03:45,516 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013575700] [2025-04-13 18:03:45,516 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:03:45,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:03:45,519 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 70 statements into 1 equivalence classes. [2025-04-13 18:03:45,522 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-04-13 18:03:45,522 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:03:45,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:03:45,583 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 18:03:45,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:03:45,583 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013575700] [2025-04-13 18:03:45,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013575700] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:03:45,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:03:45,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 18:03:45,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458005785] [2025-04-13 18:03:45,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:03:45,584 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 18:03:45,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:03:45,584 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 18:03:45,584 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-04-13 18:03:45,584 INFO L87 Difference]: Start difference. First operand 1944 states and 5303 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 18:03:45,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:03:45,866 INFO L93 Difference]: Finished difference Result 2780 states and 7422 transitions. [2025-04-13 18:03:45,866 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-13 18:03:45,866 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 18:03:45,866 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:03:45,921 INFO L225 Difference]: With dead ends: 2780 [2025-04-13 18:03:45,922 INFO L226 Difference]: Without dead ends: 2574 [2025-04-13 18:03:45,923 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=164, Invalid=388, Unknown=0, NotChecked=0, Total=552 [2025-04-13 18:03:45,923 INFO L437 NwaCegarLoop]: 90 mSDtfsCounter, 321 mSDsluCounter, 388 mSDsCounter, 0 mSdLazyCounter, 638 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 321 SdHoareTripleChecker+Valid, 478 SdHoareTripleChecker+Invalid, 657 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 638 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:03:45,923 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [321 Valid, 478 Invalid, 657 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 638 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:03:45,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2574 states. [2025-04-13 18:03:45,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2574 to 1926. [2025-04-13 18:03:45,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1926 states, 1925 states have (on average 2.725194805194805) internal successors, (5246), 1925 states have internal predecessors, (5246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:03:45,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1926 states to 1926 states and 5246 transitions. [2025-04-13 18:03:46,005 INFO L79 Accepts]: Start accepts. Automaton has 1926 states and 5246 transitions. Word has length 70 [2025-04-13 18:03:46,005 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:03:46,005 INFO L485 AbstractCegarLoop]: Abstraction has 1926 states and 5246 transitions. [2025-04-13 18:03:46,005 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 18:03:46,005 INFO L278 IsEmpty]: Start isEmpty. Operand 1926 states and 5246 transitions. [2025-04-13 18:03:46,007 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-04-13 18:03:46,008 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:03:46,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, 1] [2025-04-13 18:03:46,008 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable124 [2025-04-13 18:03:46,008 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 18:03:46,008 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:03:46,008 INFO L85 PathProgramCache]: Analyzing trace with hash 482494492, now seen corresponding path program 4 times [2025-04-13 18:03:46,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:03:46,008 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971608167] [2025-04-13 18:03:46,008 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:03:46,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:03:46,012 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 70 statements into 2 equivalence classes. [2025-04-13 18:03:46,016 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 18:03:46,016 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:03:46,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:03:46,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 18:03:46,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:03:46,078 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971608167] [2025-04-13 18:03:46,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971608167] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:03:46,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:03:46,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 18:03:46,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61636242] [2025-04-13 18:03:46,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:03:46,078 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 18:03:46,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:03:46,078 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 18:03:46,078 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-04-13 18:03:46,078 INFO L87 Difference]: Start difference. First operand 1926 states and 5246 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 18:03:46,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:03:46,312 INFO L93 Difference]: Finished difference Result 2538 states and 6806 transitions. [2025-04-13 18:03:46,312 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 18:03:46,312 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 18:03:46,312 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:03:46,349 INFO L225 Difference]: With dead ends: 2538 [2025-04-13 18:03:46,349 INFO L226 Difference]: Without dead ends: 2080 [2025-04-13 18:03:46,350 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=110, Invalid=232, Unknown=0, NotChecked=0, Total=342 [2025-04-13 18:03:46,350 INFO L437 NwaCegarLoop]: 81 mSDtfsCounter, 212 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 583 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 589 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 583 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:03:46,350 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 424 Invalid, 589 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 583 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:03:46,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2080 states. [2025-04-13 18:03:46,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2080 to 1764. [2025-04-13 18:03:46,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1764 states, 1763 states have (on average 2.7039137833238795) internal successors, (4767), 1763 states have internal predecessors, (4767), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:03:46,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1764 states to 1764 states and 4767 transitions. [2025-04-13 18:03:46,405 INFO L79 Accepts]: Start accepts. Automaton has 1764 states and 4767 transitions. Word has length 70 [2025-04-13 18:03:46,405 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:03:46,405 INFO L485 AbstractCegarLoop]: Abstraction has 1764 states and 4767 transitions. [2025-04-13 18:03:46,405 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 18:03:46,405 INFO L278 IsEmpty]: Start isEmpty. Operand 1764 states and 4767 transitions. [2025-04-13 18:03:46,407 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-04-13 18:03:46,407 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:03:46,407 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 18:03:46,407 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable125 [2025-04-13 18:03:46,407 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 18:03:46,407 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:03:46,408 INFO L85 PathProgramCache]: Analyzing trace with hash -1085875826, now seen corresponding path program 3 times [2025-04-13 18:03:46,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:03:46,408 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256502858] [2025-04-13 18:03:46,408 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:03:46,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:03:46,411 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 70 statements into 1 equivalence classes. [2025-04-13 18:03:46,413 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-04-13 18:03:46,413 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 18:03:46,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:03:46,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 18:03:46,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:03:46,479 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256502858] [2025-04-13 18:03:46,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256502858] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:03:46,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:03:46,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 18:03:46,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285876715] [2025-04-13 18:03:46,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:03:46,479 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 18:03:46,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:03:46,480 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 18:03:46,480 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-04-13 18:03:46,480 INFO L87 Difference]: Start difference. First operand 1764 states and 4767 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 18:03:46,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:03:46,756 INFO L93 Difference]: Finished difference Result 2760 states and 7306 transitions. [2025-04-13 18:03:46,756 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-13 18:03:46,756 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 18:03:46,756 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:03:46,796 INFO L225 Difference]: With dead ends: 2760 [2025-04-13 18:03:46,796 INFO L226 Difference]: Without dead ends: 2274 [2025-04-13 18:03:46,798 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 18:03:46,798 INFO L437 NwaCegarLoop]: 91 mSDtfsCounter, 337 mSDsluCounter, 391 mSDsCounter, 0 mSdLazyCounter, 669 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 337 SdHoareTripleChecker+Valid, 482 SdHoareTripleChecker+Invalid, 685 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 669 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:03:46,798 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [337 Valid, 482 Invalid, 685 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 669 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:03:46,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2274 states. [2025-04-13 18:03:46,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2274 to 1574. [2025-04-13 18:03:46,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1574 states, 1573 states have (on average 2.6827717736808645) internal successors, (4220), 1573 states have internal predecessors, (4220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:03:46,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1574 states to 1574 states and 4220 transitions. [2025-04-13 18:03:46,850 INFO L79 Accepts]: Start accepts. Automaton has 1574 states and 4220 transitions. Word has length 70 [2025-04-13 18:03:46,850 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:03:46,850 INFO L485 AbstractCegarLoop]: Abstraction has 1574 states and 4220 transitions. [2025-04-13 18:03:46,850 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 18:03:46,850 INFO L278 IsEmpty]: Start isEmpty. Operand 1574 states and 4220 transitions. [2025-04-13 18:03:46,852 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-04-13 18:03:46,852 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:03:46,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, 1, 1] [2025-04-13 18:03:46,852 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable126 [2025-04-13 18:03:46,852 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 18:03:46,852 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:03:46,852 INFO L85 PathProgramCache]: Analyzing trace with hash -1303358057, now seen corresponding path program 5 times [2025-04-13 18:03:46,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:03:46,852 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997130796] [2025-04-13 18:03:46,852 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:03:46,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:03:46,856 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 70 statements into 1 equivalence classes. [2025-04-13 18:03:46,859 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-04-13 18:03:46,860 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:03:46,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:03:46,916 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 18:03:46,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:03:46,916 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997130796] [2025-04-13 18:03:46,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997130796] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:03:46,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:03:46,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 18:03:46,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849938847] [2025-04-13 18:03:46,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:03:46,916 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 18:03:46,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:03:46,917 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 18:03:46,917 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-04-13 18:03:46,917 INFO L87 Difference]: Start difference. First operand 1574 states and 4220 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 18:03:47,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:03:47,292 INFO L93 Difference]: Finished difference Result 2572 states and 6764 transitions. [2025-04-13 18:03:47,292 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-04-13 18:03:47,292 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 18:03:47,292 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:03:47,345 INFO L225 Difference]: With dead ends: 2572 [2025-04-13 18:03:47,345 INFO L226 Difference]: Without dead ends: 2310 [2025-04-13 18:03:47,348 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 282 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=281, Invalid=841, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 18:03:47,348 INFO L437 NwaCegarLoop]: 92 mSDtfsCounter, 549 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 623 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 549 SdHoareTripleChecker+Valid, 465 SdHoareTripleChecker+Invalid, 643 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 623 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:03:47,349 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [549 Valid, 465 Invalid, 643 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 623 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:03:47,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2310 states. [2025-04-13 18:03:47,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2310 to 1554. [2025-04-13 18:03:47,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1554 states, 1553 states have (on average 2.668383773341919) internal successors, (4144), 1553 states have internal predecessors, (4144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:03:47,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1554 states to 1554 states and 4144 transitions. [2025-04-13 18:03:47,421 INFO L79 Accepts]: Start accepts. Automaton has 1554 states and 4144 transitions. Word has length 70 [2025-04-13 18:03:47,421 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:03:47,421 INFO L485 AbstractCegarLoop]: Abstraction has 1554 states and 4144 transitions. [2025-04-13 18:03:47,421 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 18:03:47,422 INFO L278 IsEmpty]: Start isEmpty. Operand 1554 states and 4144 transitions. [2025-04-13 18:03:47,423 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-04-13 18:03:47,423 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:03:47,423 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 18:03:47,423 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable127 [2025-04-13 18:03:47,423 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 18:03:47,424 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:03:47,424 INFO L85 PathProgramCache]: Analyzing trace with hash 1478752829, now seen corresponding path program 1 times [2025-04-13 18:03:47,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:03:47,424 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166470809] [2025-04-13 18:03:47,424 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:03:47,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:03:47,427 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-04-13 18:03:47,429 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-04-13 18:03:47,429 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:03:47,429 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:03:47,528 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 18:03:47,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:03:47,528 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166470809] [2025-04-13 18:03:47,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [166470809] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:03:47,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:03:47,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-04-13 18:03:47,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809413935] [2025-04-13 18:03:47,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:03:47,528 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:03:47,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:03:47,529 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:03:47,529 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2025-04-13 18:03:47,529 INFO L87 Difference]: Start difference. First operand 1554 states and 4144 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 18:03:47,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:03:47,987 INFO L93 Difference]: Finished difference Result 2268 states and 5939 transitions. [2025-04-13 18:03:47,988 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-04-13 18:03:47,988 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 18:03:47,988 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:03:48,042 INFO L225 Difference]: With dead ends: 2268 [2025-04-13 18:03:48,042 INFO L226 Difference]: Without dead ends: 2000 [2025-04-13 18:03:48,043 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 370 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=458, Invalid=1024, Unknown=0, NotChecked=0, Total=1482 [2025-04-13 18:03:48,043 INFO L437 NwaCegarLoop]: 102 mSDtfsCounter, 411 mSDsluCounter, 467 mSDsCounter, 0 mSdLazyCounter, 766 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 411 SdHoareTripleChecker+Valid, 569 SdHoareTripleChecker+Invalid, 787 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 766 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:03:48,044 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [411 Valid, 569 Invalid, 787 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 766 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:03:48,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2000 states. [2025-04-13 18:03:48,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2000 to 1580. [2025-04-13 18:03:48,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1580 states, 1579 states have (on average 2.6580113996200128) internal successors, (4197), 1579 states have internal predecessors, (4197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:03:48,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1580 states to 1580 states and 4197 transitions. [2025-04-13 18:03:48,118 INFO L79 Accepts]: Start accepts. Automaton has 1580 states and 4197 transitions. Word has length 70 [2025-04-13 18:03:48,118 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:03:48,118 INFO L485 AbstractCegarLoop]: Abstraction has 1580 states and 4197 transitions. [2025-04-13 18:03:48,118 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 18:03:48,118 INFO L278 IsEmpty]: Start isEmpty. Operand 1580 states and 4197 transitions. [2025-04-13 18:03:48,120 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-04-13 18:03:48,120 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:03:48,120 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 18:03:48,120 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable128 [2025-04-13 18:03:48,120 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 18:03:48,120 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:03:48,120 INFO L85 PathProgramCache]: Analyzing trace with hash -1911374079, now seen corresponding path program 6 times [2025-04-13 18:03:48,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:03:48,120 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478407014] [2025-04-13 18:03:48,120 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:03:48,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:03:48,123 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 70 statements into 1 equivalence classes. [2025-04-13 18:03:48,126 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-04-13 18:03:48,126 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 18:03:48,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:03:48,186 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 18:03:48,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:03:48,186 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478407014] [2025-04-13 18:03:48,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478407014] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:03:48,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:03:48,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 18:03:48,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775303631] [2025-04-13 18:03:48,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:03:48,186 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 18:03:48,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:03:48,187 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 18:03:48,187 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-04-13 18:03:48,187 INFO L87 Difference]: Start difference. First operand 1580 states and 4197 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 18:03:48,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:03:48,416 INFO L93 Difference]: Finished difference Result 2172 states and 5713 transitions. [2025-04-13 18:03:48,417 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-13 18:03:48,417 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 18:03:48,417 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:03:48,472 INFO L225 Difference]: With dead ends: 2172 [2025-04-13 18:03:48,472 INFO L226 Difference]: Without dead ends: 1828 [2025-04-13 18:03:48,473 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=127, Invalid=293, Unknown=0, NotChecked=0, Total=420 [2025-04-13 18:03:48,474 INFO L437 NwaCegarLoop]: 62 mSDtfsCounter, 264 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 537 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 547 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 537 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:03:48,474 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 363 Invalid, 547 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 537 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:03:48,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1828 states. [2025-04-13 18:03:48,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1828 to 1550. [2025-04-13 18:03:48,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1550 states, 1549 states have (on average 2.657198192382182) internal successors, (4116), 1549 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:03:48,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1550 states to 1550 states and 4116 transitions. [2025-04-13 18:03:48,547 INFO L79 Accepts]: Start accepts. Automaton has 1550 states and 4116 transitions. Word has length 70 [2025-04-13 18:03:48,547 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:03:48,547 INFO L485 AbstractCegarLoop]: Abstraction has 1550 states and 4116 transitions. [2025-04-13 18:03:48,547 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 18:03:48,547 INFO L278 IsEmpty]: Start isEmpty. Operand 1550 states and 4116 transitions. [2025-04-13 18:03:48,549 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-04-13 18:03:48,549 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:03:48,549 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 18:03:48,549 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable129 [2025-04-13 18:03:48,550 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 18:03:48,550 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:03:48,550 INFO L85 PathProgramCache]: Analyzing trace with hash 1618409897, now seen corresponding path program 7 times [2025-04-13 18:03:48,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:03:48,550 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643571974] [2025-04-13 18:03:48,550 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:03:48,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:03:48,553 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-04-13 18:03:48,556 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-04-13 18:03:48,556 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:03:48,556 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:03:48,614 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 18:03:48,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:03:48,614 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643571974] [2025-04-13 18:03:48,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1643571974] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:03:48,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:03:48,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 18:03:48,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822000626] [2025-04-13 18:03:48,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:03:48,614 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 18:03:48,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:03:48,615 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 18:03:48,615 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-04-13 18:03:48,615 INFO L87 Difference]: Start difference. First operand 1550 states and 4116 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 18:03:48,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:03:48,838 INFO L93 Difference]: Finished difference Result 2256 states and 5955 transitions. [2025-04-13 18:03:48,838 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 18:03:48,838 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 18:03:48,838 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:03:48,894 INFO L225 Difference]: With dead ends: 2256 [2025-04-13 18:03:48,894 INFO L226 Difference]: Without dead ends: 1734 [2025-04-13 18:03:48,896 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=104, Invalid=238, Unknown=0, NotChecked=0, Total=342 [2025-04-13 18:03:48,896 INFO L437 NwaCegarLoop]: 59 mSDtfsCounter, 221 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 562 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 571 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 562 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:03:48,896 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 356 Invalid, 571 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 562 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:03:48,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1734 states. [2025-04-13 18:03:48,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1734 to 1502. [2025-04-13 18:03:48,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1502 states, 1501 states have (on average 2.642238507661559) internal successors, (3966), 1501 states have internal predecessors, (3966), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:03:48,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1502 states to 1502 states and 3966 transitions. [2025-04-13 18:03:48,968 INFO L79 Accepts]: Start accepts. Automaton has 1502 states and 3966 transitions. Word has length 70 [2025-04-13 18:03:48,969 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:03:48,969 INFO L485 AbstractCegarLoop]: Abstraction has 1502 states and 3966 transitions. [2025-04-13 18:03:48,969 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 18:03:48,969 INFO L278 IsEmpty]: Start isEmpty. Operand 1502 states and 3966 transitions. [2025-04-13 18:03:48,970 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-04-13 18:03:48,970 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:03:48,971 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 18:03:48,971 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable130 [2025-04-13 18:03:48,971 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 18:03:48,971 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:03:48,971 INFO L85 PathProgramCache]: Analyzing trace with hash -541704387, now seen corresponding path program 8 times [2025-04-13 18:03:48,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:03:48,971 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077878198] [2025-04-13 18:03:48,971 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:03:48,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:03:48,974 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 70 statements into 1 equivalence classes. [2025-04-13 18:03:48,976 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-04-13 18:03:48,977 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:03:48,977 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:03:49,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 18:03:49,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:03:49,037 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077878198] [2025-04-13 18:03:49,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077878198] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:03:49,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:03:49,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 18:03:49,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428283461] [2025-04-13 18:03:49,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:03:49,037 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 18:03:49,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:03:49,037 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 18:03:49,037 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-04-13 18:03:49,037 INFO L87 Difference]: Start difference. First operand 1502 states and 3966 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 18:03:49,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:03:49,196 INFO L93 Difference]: Finished difference Result 1542 states and 4051 transitions. [2025-04-13 18:03:49,197 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 18:03:49,197 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 18:03:49,197 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:03:49,252 INFO L225 Difference]: With dead ends: 1542 [2025-04-13 18:03:49,252 INFO L226 Difference]: Without dead ends: 884 [2025-04-13 18:03:49,253 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 18:03:49,254 INFO L437 NwaCegarLoop]: 45 mSDtfsCounter, 126 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 401 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 220 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.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:03:49,254 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 220 Invalid, 404 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 401 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:03:49,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 884 states. [2025-04-13 18:03:49,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 884 to 884. [2025-04-13 18:03:49,260 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 18:03:49,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 884 states to 884 states and 2332 transitions. [2025-04-13 18:03:49,319 INFO L79 Accepts]: Start accepts. Automaton has 884 states and 2332 transitions. Word has length 70 [2025-04-13 18:03:49,319 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:03:49,319 INFO L485 AbstractCegarLoop]: Abstraction has 884 states and 2332 transitions. [2025-04-13 18:03:49,320 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 18:03:49,320 INFO L278 IsEmpty]: Start isEmpty. Operand 884 states and 2332 transitions. [2025-04-13 18:03:49,321 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-04-13 18:03:49,321 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:03:49,321 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 18:03:49,321 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable131 [2025-04-13 18:03:49,321 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 18:03:49,321 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:03:49,321 INFO L85 PathProgramCache]: Analyzing trace with hash 355515282, now seen corresponding path program 5 times [2025-04-13 18:03:49,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:03:49,321 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147294087] [2025-04-13 18:03:49,321 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:03:49,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:03:49,324 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 70 statements into 1 equivalence classes. [2025-04-13 18:03:49,327 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-04-13 18:03:49,327 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:03:49,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:03:49,392 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 18:03:49,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:03:49,392 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147294087] [2025-04-13 18:03:49,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147294087] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:03:49,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:03:49,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 18:03:49,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5156697] [2025-04-13 18:03:49,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:03:49,393 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 18:03:49,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:03:49,393 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 18:03:49,393 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-04-13 18:03:49,393 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 18:03:49,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:03:49,590 INFO L93 Difference]: Finished difference Result 1348 states and 3489 transitions. [2025-04-13 18:03:49,590 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-13 18:03:49,590 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 18:03:49,590 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:03:49,641 INFO L225 Difference]: With dead ends: 1348 [2025-04-13 18:03:49,641 INFO L226 Difference]: Without dead ends: 1124 [2025-04-13 18:03:49,642 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=175, Invalid=425, Unknown=0, NotChecked=0, Total=600 [2025-04-13 18:03:49,642 INFO L437 NwaCegarLoop]: 60 mSDtfsCounter, 280 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 367 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:03:49,642 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [280 Valid, 261 Invalid, 376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 367 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:03:49,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1124 states. [2025-04-13 18:03:49,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1124 to 860. [2025-04-13 18:03:49,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 860 states, 859 states have (on average 2.6239813736903375) internal successors, (2254), 859 states have internal predecessors, (2254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:03:49,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 860 states to 860 states and 2254 transitions. [2025-04-13 18:03:49,700 INFO L79 Accepts]: Start accepts. Automaton has 860 states and 2254 transitions. Word has length 70 [2025-04-13 18:03:49,700 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:03:49,700 INFO L485 AbstractCegarLoop]: Abstraction has 860 states and 2254 transitions. [2025-04-13 18:03:49,700 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 18:03:49,700 INFO L278 IsEmpty]: Start isEmpty. Operand 860 states and 2254 transitions. [2025-04-13 18:03:49,701 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-04-13 18:03:49,701 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:03:49,701 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 18:03:49,702 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable132 [2025-04-13 18:03:49,702 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 18:03:49,702 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:03:49,702 INFO L85 PathProgramCache]: Analyzing trace with hash 452499298, now seen corresponding path program 4 times [2025-04-13 18:03:49,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:03:49,702 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424255400] [2025-04-13 18:03:49,702 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:03:49,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:03:49,705 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 70 statements into 2 equivalence classes. [2025-04-13 18:03:49,709 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 18:03:49,709 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:03:49,709 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:03:49,757 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 18:03:49,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:03:49,758 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424255400] [2025-04-13 18:03:49,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424255400] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:03:49,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:03:49,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 18:03:49,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351189321] [2025-04-13 18:03:49,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:03:49,758 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 18:03:49,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:03:49,758 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 18:03:49,758 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-04-13 18:03:49,758 INFO L87 Difference]: Start difference. First operand 860 states and 2254 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 18:03:49,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:03:49,977 INFO L93 Difference]: Finished difference Result 1324 states and 3411 transitions. [2025-04-13 18:03:49,977 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-13 18:03:49,977 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 18:03:49,978 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:03:50,023 INFO L225 Difference]: With dead ends: 1324 [2025-04-13 18:03:50,023 INFO L226 Difference]: Without dead ends: 1100 [2025-04-13 18:03:50,024 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=173, Invalid=427, Unknown=0, NotChecked=0, Total=600 [2025-04-13 18:03:50,024 INFO L437 NwaCegarLoop]: 59 mSDtfsCounter, 275 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 426 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 426 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:03:50,024 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [275 Valid, 298 Invalid, 436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 426 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:03:50,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1100 states. [2025-04-13 18:03:50,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1100 to 836. [2025-04-13 18:03:50,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 836 states, 835 states have (on average 2.605988023952096) internal successors, (2176), 835 states have internal predecessors, (2176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:03:50,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 836 states to 836 states and 2176 transitions. [2025-04-13 18:03:50,068 INFO L79 Accepts]: Start accepts. Automaton has 836 states and 2176 transitions. Word has length 70 [2025-04-13 18:03:50,068 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:03:50,068 INFO L485 AbstractCegarLoop]: Abstraction has 836 states and 2176 transitions. [2025-04-13 18:03:50,068 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 18:03:50,068 INFO L278 IsEmpty]: Start isEmpty. Operand 836 states and 2176 transitions. [2025-04-13 18:03:50,069 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-04-13 18:03:50,069 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:03:50,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, 1] [2025-04-13 18:03:50,069 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable133 [2025-04-13 18:03:50,069 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 18:03:50,069 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:03:50,069 INFO L85 PathProgramCache]: Analyzing trace with hash -1026753056, now seen corresponding path program 6 times [2025-04-13 18:03:50,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:03:50,070 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016452834] [2025-04-13 18:03:50,070 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:03:50,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:03:50,072 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 70 statements into 1 equivalence classes. [2025-04-13 18:03:50,075 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-04-13 18:03:50,075 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 18:03:50,075 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:03:50,130 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 18:03:50,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:03:50,131 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016452834] [2025-04-13 18:03:50,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016452834] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:03:50,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:03:50,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 18:03:50,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400430593] [2025-04-13 18:03:50,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:03:50,131 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 18:03:50,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:03:50,131 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 18:03:50,131 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-04-13 18:03:50,131 INFO L87 Difference]: Start difference. First operand 836 states and 2176 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 18:03:50,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:03:50,332 INFO L93 Difference]: Finished difference Result 1220 states and 3146 transitions. [2025-04-13 18:03:50,332 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 18:03:50,332 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 18:03:50,332 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:03:50,368 INFO L225 Difference]: With dead ends: 1220 [2025-04-13 18:03:50,368 INFO L226 Difference]: Without dead ends: 980 [2025-04-13 18:03:50,369 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=116, Invalid=264, Unknown=0, NotChecked=0, Total=380 [2025-04-13 18:03:50,369 INFO L437 NwaCegarLoop]: 54 mSDtfsCounter, 194 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 430 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:03:50,369 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 294 Invalid, 436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 430 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:03:50,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 980 states. [2025-04-13 18:03:50,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 980 to 812. [2025-04-13 18:03:50,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 812 states, 811 states have (on average 2.6091245376078915) internal successors, (2116), 811 states have internal predecessors, (2116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:03:50,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 812 states to 812 states and 2116 transitions. [2025-04-13 18:03:50,411 INFO L79 Accepts]: Start accepts. Automaton has 812 states and 2116 transitions. Word has length 70 [2025-04-13 18:03:50,412 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:03:50,412 INFO L485 AbstractCegarLoop]: Abstraction has 812 states and 2116 transitions. [2025-04-13 18:03:50,412 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 18:03:50,412 INFO L278 IsEmpty]: Start isEmpty. Operand 812 states and 2116 transitions. [2025-04-13 18:03:50,413 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-04-13 18:03:50,413 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:03:50,413 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 18:03:50,413 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable134 [2025-04-13 18:03:50,413 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 18:03:50,413 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:03:50,413 INFO L85 PathProgramCache]: Analyzing trace with hash -660007568, now seen corresponding path program 5 times [2025-04-13 18:03:50,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:03:50,413 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471080852] [2025-04-13 18:03:50,413 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:03:50,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:03:50,416 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 70 statements into 1 equivalence classes. [2025-04-13 18:03:50,419 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-04-13 18:03:50,419 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:03:50,419 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:03:50,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 18:03:50,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:03:50,479 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471080852] [2025-04-13 18:03:50,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471080852] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:03:50,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:03:50,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 18:03:50,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280005923] [2025-04-13 18:03:50,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:03:50,480 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 18:03:50,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:03:50,480 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 18:03:50,480 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-04-13 18:03:50,480 INFO L87 Difference]: Start difference. First operand 812 states and 2116 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 18:03:50,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:03:50,658 INFO L93 Difference]: Finished difference Result 1196 states and 3086 transitions. [2025-04-13 18:03:50,658 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 18:03:50,658 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 18:03:50,658 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:03:50,703 INFO L225 Difference]: With dead ends: 1196 [2025-04-13 18:03:50,704 INFO L226 Difference]: Without dead ends: 956 [2025-04-13 18:03:50,704 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=116, Invalid=264, Unknown=0, NotChecked=0, Total=380 [2025-04-13 18:03:50,704 INFO L437 NwaCegarLoop]: 53 mSDtfsCounter, 202 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 368 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 368 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:03:50,704 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 255 Invalid, 375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 368 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:03:50,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 956 states. [2025-04-13 18:03:50,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 956 to 788. [2025-04-13 18:03:50,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 788 states, 787 states have (on average 2.6124523506988564) internal successors, (2056), 787 states have internal predecessors, (2056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:03:50,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 2056 transitions. [2025-04-13 18:03:50,750 INFO L79 Accepts]: Start accepts. Automaton has 788 states and 2056 transitions. Word has length 70 [2025-04-13 18:03:50,750 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:03:50,750 INFO L485 AbstractCegarLoop]: Abstraction has 788 states and 2056 transitions. [2025-04-13 18:03:50,750 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 18:03:50,751 INFO L278 IsEmpty]: Start isEmpty. Operand 788 states and 2056 transitions. [2025-04-13 18:03:50,751 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-04-13 18:03:50,751 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:03:50,751 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 18:03:50,751 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable135 [2025-04-13 18:03:50,752 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 18:03:50,752 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:03:50,752 INFO L85 PathProgramCache]: Analyzing trace with hash 526148410, now seen corresponding path program 7 times [2025-04-13 18:03:50,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:03:50,752 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408660879] [2025-04-13 18:03:50,752 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:03:50,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:03:50,755 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-04-13 18:03:50,757 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-04-13 18:03:50,757 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:03:50,757 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:03:50,834 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 18:03:50,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:03:50,835 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408660879] [2025-04-13 18:03:50,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408660879] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:03:50,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:03:50,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 18:03:50,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865674600] [2025-04-13 18:03:50,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:03:50,835 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 18:03:50,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:03:50,835 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 18:03:50,835 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-04-13 18:03:50,835 INFO L87 Difference]: Start difference. First operand 788 states and 2056 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 18:03:51,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:03:51,000 INFO L93 Difference]: Finished difference Result 1252 states and 3261 transitions. [2025-04-13 18:03:51,001 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 18:03:51,001 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 18:03:51,001 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:03:51,049 INFO L225 Difference]: With dead ends: 1252 [2025-04-13 18:03:51,049 INFO L226 Difference]: Without dead ends: 898 [2025-04-13 18:03:51,050 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=104, Invalid=238, Unknown=0, NotChecked=0, Total=342 [2025-04-13 18:03:51,050 INFO L437 NwaCegarLoop]: 53 mSDtfsCounter, 181 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 369 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:03:51,050 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 258 Invalid, 374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 369 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:03:51,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 898 states. [2025-04-13 18:03:51,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 898 to 770. [2025-04-13 18:03:51,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 770 states, 769 states have (on average 2.599479843953186) internal successors, (1999), 769 states have internal predecessors, (1999), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:03:51,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 770 states to 770 states and 1999 transitions. [2025-04-13 18:03:51,095 INFO L79 Accepts]: Start accepts. Automaton has 770 states and 1999 transitions. Word has length 70 [2025-04-13 18:03:51,095 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:03:51,095 INFO L485 AbstractCegarLoop]: Abstraction has 770 states and 1999 transitions. [2025-04-13 18:03:51,095 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 18:03:51,095 INFO L278 IsEmpty]: Start isEmpty. Operand 770 states and 1999 transitions. [2025-04-13 18:03:51,096 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-04-13 18:03:51,096 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:03:51,096 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 18:03:51,096 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable136 [2025-04-13 18:03:51,096 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 18:03:51,096 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:03:51,097 INFO L85 PathProgramCache]: Analyzing trace with hash 1846330058, now seen corresponding path program 6 times [2025-04-13 18:03:51,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:03:51,097 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146645243] [2025-04-13 18:03:51,097 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:03:51,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:03:51,099 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 70 statements into 1 equivalence classes. [2025-04-13 18:03:51,102 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-04-13 18:03:51,102 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 18:03:51,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:03:51,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 18:03:51,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:03:51,164 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146645243] [2025-04-13 18:03:51,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146645243] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:03:51,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:03:51,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 18:03:51,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563238255] [2025-04-13 18:03:51,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:03:51,164 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 18:03:51,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:03:51,164 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 18:03:51,164 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-04-13 18:03:51,164 INFO L87 Difference]: Start difference. First operand 770 states and 1999 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 18:03:51,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:03:51,334 INFO L93 Difference]: Finished difference Result 1230 states and 3194 transitions. [2025-04-13 18:03:51,334 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 18:03:51,335 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 18:03:51,335 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:03:51,372 INFO L225 Difference]: With dead ends: 1230 [2025-04-13 18:03:51,372 INFO L226 Difference]: Without dead ends: 876 [2025-04-13 18:03:51,372 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=104, Invalid=238, Unknown=0, NotChecked=0, Total=342 [2025-04-13 18:03:51,373 INFO L437 NwaCegarLoop]: 52 mSDtfsCounter, 165 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 409 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 414 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 409 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:03:51,373 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 281 Invalid, 414 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 409 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:03:51,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 876 states. [2025-04-13 18:03:51,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 876 to 752. [2025-04-13 18:03:51,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 752 states, 751 states have (on average 2.585885486018642) internal successors, (1942), 751 states have internal predecessors, (1942), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:03:51,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 752 states to 752 states and 1942 transitions. [2025-04-13 18:03:51,409 INFO L79 Accepts]: Start accepts. Automaton has 752 states and 1942 transitions. Word has length 70 [2025-04-13 18:03:51,410 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:03:51,410 INFO L485 AbstractCegarLoop]: Abstraction has 752 states and 1942 transitions. [2025-04-13 18:03:51,410 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 18:03:51,410 INFO L278 IsEmpty]: Start isEmpty. Operand 752 states and 1942 transitions. [2025-04-13 18:03:51,411 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-04-13 18:03:51,411 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:03:51,411 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 18:03:51,411 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable137 [2025-04-13 18:03:51,411 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 18:03:51,411 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:03:51,411 INFO L85 PathProgramCache]: Analyzing trace with hash 1247696118, now seen corresponding path program 8 times [2025-04-13 18:03:51,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:03:51,411 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044440508] [2025-04-13 18:03:51,411 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:03:51,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:03:51,414 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 70 statements into 1 equivalence classes. [2025-04-13 18:03:51,417 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-04-13 18:03:51,417 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:03:51,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:03:51,481 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 18:03:51,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:03:51,481 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044440508] [2025-04-13 18:03:51,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044440508] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:03:51,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:03:51,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 18:03:51,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462863706] [2025-04-13 18:03:51,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:03:51,481 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 18:03:51,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:03:51,482 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 18:03:51,482 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-04-13 18:03:51,482 INFO L87 Difference]: Start difference. First operand 752 states and 1942 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 18:03:51,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:03:51,676 INFO L93 Difference]: Finished difference Result 920 states and 2361 transitions. [2025-04-13 18:03:51,677 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 18:03:51,677 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 18:03:51,677 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:03:51,707 INFO L225 Difference]: With dead ends: 920 [2025-04-13 18:03:51,707 INFO L226 Difference]: Without dead ends: 536 [2025-04-13 18:03:51,707 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2025-04-13 18:03:51,708 INFO L437 NwaCegarLoop]: 42 mSDtfsCounter, 99 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 380 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 380 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:03:51,708 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 223 Invalid, 383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 380 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:03:51,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2025-04-13 18:03:51,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 536. [2025-04-13 18:03:51,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 536 states, 535 states have (on average 2.5233644859813085) internal successors, (1350), 535 states have internal predecessors, (1350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:03:51,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 1350 transitions. [2025-04-13 18:03:51,740 INFO L79 Accepts]: Start accepts. Automaton has 536 states and 1350 transitions. Word has length 70 [2025-04-13 18:03:51,740 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:03:51,740 INFO L485 AbstractCegarLoop]: Abstraction has 536 states and 1350 transitions. [2025-04-13 18:03:51,740 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 18:03:51,740 INFO L278 IsEmpty]: Start isEmpty. Operand 536 states and 1350 transitions. [2025-04-13 18:03:51,741 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-04-13 18:03:51,741 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:03:51,741 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 18:03:51,741 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable138 [2025-04-13 18:03:51,741 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 18:03:51,741 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:03:51,741 INFO L85 PathProgramCache]: Analyzing trace with hash -351785850, now seen corresponding path program 7 times [2025-04-13 18:03:51,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:03:51,741 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263029684] [2025-04-13 18:03:51,741 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:03:51,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:03:51,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-04-13 18:03:51,746 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-04-13 18:03:51,746 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:03:51,746 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:03:51,804 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 18:03:51,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:03:51,804 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263029684] [2025-04-13 18:03:51,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263029684] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:03:51,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:03:51,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 18:03:51,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103365455] [2025-04-13 18:03:51,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:03:51,805 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 18:03:51,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:03:51,805 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 18:03:51,805 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-04-13 18:03:51,805 INFO L87 Difference]: Start difference. First operand 536 states and 1350 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 18:03:51,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:03:51,929 INFO L93 Difference]: Finished difference Result 536 states and 1350 transitions. [2025-04-13 18:03:51,930 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 18:03:51,930 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 18:03:51,930 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:03:51,980 INFO L225 Difference]: With dead ends: 536 [2025-04-13 18:03:51,980 INFO L226 Difference]: Without dead ends: 0 [2025-04-13 18:03:51,981 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2025-04-13 18:03:51,981 INFO L437 NwaCegarLoop]: 32 mSDtfsCounter, 65 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 285 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:03:51,982 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 158 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 285 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:03:51,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-04-13 18:03:51,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-04-13 18:03:51,982 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 18:03:51,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-04-13 18:03:52,024 INFO L79 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 70 [2025-04-13 18:03:52,024 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:03:52,024 INFO L485 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-13 18:03:52,024 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 18:03:52,024 INFO L278 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-04-13 18:03:52,024 INFO L284 IsEmpty]: Finished isEmpty. No accepting run. [2025-04-13 18:03:52,027 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2025-04-13 18:03:52,027 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2025-04-13 18:03:52,027 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2025-04-13 18:03:52,027 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2025-04-13 18:03:52,027 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable139 [2025-04-13 18:03:52,029 INFO L422 BasicCegarLoop]: Path program histogram: [20, 16, 16, 11, 8, 8, 7, 6, 6, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1] [2025-04-13 18:03:52,031 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-13 18:03:52,031 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-13 18:03:52,032 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 06:03:52 BasicIcfg [2025-04-13 18:03:52,032 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-13 18:03:52,033 INFO L158 Benchmark]: Toolchain (without parser) took 91853.78ms. Allocated memory was 142.6MB in the beginning and 1.1GB in the end (delta: 1.0GB). Free memory was 100.4MB in the beginning and 573.4MB in the end (delta: -472.9MB). Peak memory consumption was 527.9MB. Max. memory is 8.0GB. [2025-04-13 18:03:52,033 INFO L158 Benchmark]: CDTParser took 0.25ms. 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 18:03:52,033 INFO L158 Benchmark]: CACSL2BoogieTranslator took 263.60ms. Allocated memory is still 142.6MB. Free memory was 100.4MB in the beginning and 84.8MB in the end (delta: 15.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-13 18:03:52,033 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.45ms. Allocated memory is still 142.6MB. Free memory was 84.8MB in the beginning and 82.7MB in the end (delta: 2.1MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 18:03:52,033 INFO L158 Benchmark]: Boogie Preprocessor took 39.33ms. Allocated memory is still 142.6MB. Free memory was 82.7MB in the beginning and 80.3MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 18:03:52,033 INFO L158 Benchmark]: RCFGBuilder took 533.45ms. Allocated memory is still 142.6MB. Free memory was 80.3MB in the beginning and 27.7MB in the end (delta: 52.6MB). Peak memory consumption was 54.5MB. Max. memory is 8.0GB. [2025-04-13 18:03:52,033 INFO L158 Benchmark]: TraceAbstraction took 90973.64ms. Allocated memory was 142.6MB in the beginning and 1.1GB in the end (delta: 1.0GB). Free memory was 26.8MB in the beginning and 573.4MB in the end (delta: -546.6MB). Peak memory consumption was 456.6MB. Max. memory is 8.0GB. [2025-04-13 18:03:52,033 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.25ms. Allocated memory is still 159.4MB. Free memory is still 88.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 263.60ms. Allocated memory is still 142.6MB. Free memory was 100.4MB in the beginning and 84.8MB in the end (delta: 15.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 39.45ms. Allocated memory is still 142.6MB. Free memory was 84.8MB in the beginning and 82.7MB in the end (delta: 2.1MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 39.33ms. Allocated memory is still 142.6MB. Free memory was 82.7MB in the beginning and 80.3MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 533.45ms. Allocated memory is still 142.6MB. Free memory was 80.3MB in the beginning and 27.7MB in the end (delta: 52.6MB). Peak memory consumption was 54.5MB. Max. memory is 8.0GB. * TraceAbstraction took 90973.64ms. Allocated memory was 142.6MB in the beginning and 1.1GB in the end (delta: 1.0GB). Free memory was 26.8MB in the beginning and 573.4MB in the end (delta: -546.6MB). Peak memory consumption was 456.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: 90.9s, OverallIterations: 140, TraceHistogramMax: 1, PathProgramHistogramMax: 20, EmptinessCheckTime: 1.4s, AutomataDifference: 53.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 32344 SdHoareTripleChecker+Valid, 29.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 32344 mSDsluCounter, 57792 SdHoareTripleChecker+Invalid, 24.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 45701 mSDsCounter, 1557 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 80746 IncrementalHoareTripleChecker+Invalid, 82303 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1557 mSolverCounterUnsat, 12091 mSDtfsCounter, 80746 mSolverCounterSat, 0.3s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2772 GetRequests, 355 SyntacticMatches, 0 SemanticMatches, 2417 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10364 ImplicationChecksByTransitivity, 12.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=13103occurred in iteration=8, InterpolantAutomatonStates: 2225, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 15.9s AutomataMinimizationTime, 140 MinimizatonAttempts, 155229 StatesRemovedByMinimization, 134 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 12.0s InterpolantComputationTime, 9628 NumberOfCodeBlocks, 9616 NumberOfCodeBlocksAsserted, 160 NumberOfCheckSat, 9488 ConstructedInterpolants, 0 QuantifiedInterpolants, 27244 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 140 InterpolantComputations, 140 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 18:03:52,046 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...